From aac6731f2c1e30321fcfc58ac95d8203c041ee04 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ingy=20d=C3=B6t=20Net?= Date: Thu, 12 Sep 2019 10:33:56 -0700 Subject: [PATCH] September Morn Update --- Lang/360-Assembly/Align-columns | 1 + .../Bitmap-Bresenhams-line-algorithm | 1 + Lang/360-Assembly/Caesar-cipher | 1 + Lang/360-Assembly/Fractran | 1 + Lang/360-Assembly/Gaussian-elimination | 1 + Lang/360-Assembly/Harshad-or-Niven-series | 1 + Lang/360-Assembly/Least-common-multiple | 1 + .../Parsing-RPN-calculator-algorithm | 1 + Lang/360-Assembly/Roman-numerals-Decode | 1 + Lang/360-Assembly/Rot-13 | 1 + Lang/360-Assembly/Stern-Brocot-sequence | 1 + Lang/68000-Assembly/Leap-year | 1 + Lang/ABAP/Array-concatenation | 1 + Lang/ABAP/Bitwise-operations | 1 + Lang/ABAP/Catalan-numbers | 1 + Lang/ABAP/Catamorphism | 1 + Lang/ABAP/Dutch-national-flag-problem | 1 + Lang/ABAP/Empty-program | 1 + Lang/ABAP/HTTP | 1 + Lang/ABAP/Integer-comparison | 1 + Lang/ABAP/Mutual-recursion | 1 + Lang/ABAP/Power-set | 1 + Lang/ABAP/Repeat-a-string | 1 + Lang/ABAP/Sorting-algorithms-Quicksort | 1 + Lang/ABAP/Stack | 1 + Lang/ACL2/00DESCRIPTION | 4 +- Lang/ALGOL-68/Sort-using-a-custom-comparator | 1 + Lang/ALGOL-68/Start-from-a-main-routine | 1 + Lang/ALGOL-M/99-Bottles-of-Beer | 1 + Lang/ALGOL-M/Day-of-the-week | 1 + Lang/ALGOL-M/Factors-of-an-integer | 1 + Lang/ALGOL-M/Sieve-of-Eratosthenes | 1 + Lang/ALGOL-W/Arithmetic-Complex | 1 + Lang/ALGOL-W/Calendar | 1 + Lang/ALGOL-W/Forward-difference | 1 + .../Generate-lower-case-ASCII-alphabet | 1 + Lang/ALGOL-W/Hailstone-sequence | 1 + Lang/ALGOL-W/Happy-numbers | 1 + Lang/ALGOL-W/History-variables | 1 + Lang/ALGOL-W/Long-multiplication | 1 + Lang/ALGOL-W/Mandelbrot-set | 1 + Lang/ALGOL-W/Multiple-distinct-objects | 1 + Lang/ALGOL-W/Nth-root | 1 + Lang/ALGOL-W/Perfect-numbers | 1 + Lang/ALGOL-W/Sequence-of-non-squares | 1 + Lang/ALGOL-W/Sort-an-integer-array | 1 + .../Strip-a-set-of-characters-from-a-string | 1 + Lang/ALGOL-W/Strip-block-comments | 1 + Lang/APL/Dynamic-variable-names | 1 + Lang/APL/Hofstadter-Q-sequence | 1 + Lang/APL/Ordered-words | 1 + Lang/APL/Palindrome-detection | 1 + Lang/APL/Simple-windowed-application | 1 + Lang/APL/Solve-the-no-connection-puzzle | 1 + Lang/ARM-Assembly/100-doors | 1 + Lang/ARM-Assembly/Almost-prime | 1 + Lang/ARM-Assembly/Array-concatenation | 1 + Lang/ARM-Assembly/Arrays | 1 + Lang/ARM-Assembly/Binary-search | 1 + Lang/ARM-Assembly/Boolean-values | 1 + Lang/ARM-Assembly/Caesar-cipher | 1 + .../Call-a-foreign-language-function | 1 + Lang/ARM-Assembly/Character-codes | 1 + Lang/ARM-Assembly/Check-that-file-exists | 1 + Lang/ARM-Assembly/Command-line-arguments | 1 + Lang/ARM-Assembly/Compound-data-type | 1 + Lang/ARM-Assembly/Conditional-structures | 1 + Lang/ARM-Assembly/Copy-a-string | 1 + Lang/ARM-Assembly/Count-in-octal | 1 + Lang/ARM-Assembly/Create-a-file | 1 + Lang/ARM-Assembly/DNS-query | 1 + .../Determine-if-a-string-is-numeric | 1 + .../Doubly-linked-list-Definition | 1 + .../Doubly-linked-list-Element-definition | 1 + .../ARM-Assembly/Doubly-linked-list-Traversal | 1 + Lang/ARM-Assembly/Empty-string | 1 + Lang/ARM-Assembly/Factorial | 1 + Lang/ARM-Assembly/File-input-output | 1 + Lang/ARM-Assembly/Formatted-numeric-output | 1 + Lang/ARM-Assembly/Greatest-element-of-a-list | 1 + Lang/ARM-Assembly/Here-document | 1 + Lang/ARM-Assembly/Include-a-file | 1 + .../ARM-Assembly/Increment-a-numerical-string | 1 + Lang/ARM-Assembly/Jensens-Device | 1 + .../Keyboard-input-Keypress-check | 1 + Lang/ARM-Assembly/Knuth-shuffle | 1 + Lang/ARM-Assembly/Literals-Integer | 1 + Lang/ARM-Assembly/Literals-String | 1 + Lang/ARM-Assembly/Logical-operations | 1 + Lang/ARM-Assembly/Loops-Break | 1 + Lang/ARM-Assembly/Loops-Do-while | 1 + Lang/ARM-Assembly/Loops-Downward-for | 1 + .../Loops-For-with-a-specified-step | 1 + Lang/ARM-Assembly/Loops-N-plus-one-half | 1 + Lang/ARM-Assembly/Loops-Nested | 1 + Lang/ARM-Assembly/Loops-While | 1 + Lang/ARM-Assembly/Lucas-Lehmer-test | 1 + Lang/ARM-Assembly/Multiplication-tables | 1 + Lang/ARM-Assembly/Nth-root | 1 + Lang/ARM-Assembly/Null-object | 1 + Lang/ARM-Assembly/Order-two-numerical-lists | 1 + Lang/ARM-Assembly/Priority-queue | 1 + Lang/ARM-Assembly/Program-termination | 1 + Lang/ARM-Assembly/Queue-Definition | 1 + .../Random-number-generator--device- | 1 + Lang/ARM-Assembly/Read-a-file-line-by-line | 1 + .../ARM-Assembly/Real-constants-and-functions | 1 + .../Singly-linked-list-Element-definition | 1 + .../Singly-linked-list-Element-insertion | 1 + .../ARM-Assembly/Singly-linked-list-Traversal | 1 + Lang/ARM-Assembly/Sleep | 1 + .../Solve-the-no-connection-puzzle | 1 + Lang/ARM-Assembly/Sorting-algorithms-Bogosort | 1 + Lang/ARM-Assembly/Sorting-algorithms-Heapsort | 1 + .../Sorting-algorithms-Insertion-sort | 1 + .../ARM-Assembly/Sorting-algorithms-Quicksort | 1 + .../Sorting-algorithms-Selection-sort | 1 + .../Sorting-algorithms-Shell-sort | 1 + Lang/ARM-Assembly/String-append | 1 + Lang/ARM-Assembly/String-concatenation | 1 + Lang/ARM-Assembly/String-matching | 1 + Lang/ARM-Assembly/Substring | 1 + .../Terminal-control-Clear-the-screen | 1 + .../Terminal-control-Coloured-text | 1 + .../Terminal-control-Cursor-movement | 1 + .../Terminal-control-Cursor-positioning | 1 + Lang/ARM-Assembly/Time-a-function | 1 + Lang/ARM-Assembly/Tokenize-a-string | 1 + Lang/ARM-Assembly/Tree-traversal | 1 + Lang/ARM-Assembly/Variables | 1 + Lang/ARM-Assembly/Window-creation-X11 | 1 + Lang/ARM-Assembly/XML-DOM-serialization | 1 + Lang/ARM-Assembly/XML-Input | 1 + Lang/ARM-Assembly/XML-Output | 1 + Lang/ARM-Assembly/XML-XPath | 1 + Lang/ARM-Assembly/Xiaolin-Wus-line-algorithm | 1 + Lang/ARM-Assembly/Y-combinator | 1 + Lang/AWK/Bulls-and-cows | 1 + Lang/AWK/Catalan-numbers-Pascals-triangle | 1 + Lang/AWK/Chinese-remainder-theorem | 1 + Lang/AWK/Draw-a-cuboid | 1 + Lang/AWK/Draw-a-sphere | 1 + Lang/AWK/Fibonacci-n-step-number-sequences | 1 + Lang/AWK/Iterated-digits-squaring | 1 + Lang/AWK/Matrix-multiplication | 1 + Lang/AWK/Metronome | 1 + Lang/AWK/Multifactorial | 1 + Lang/AWK/SHA-256 | 1 + Lang/AWK/Semiprime | 1 + .../AWK/Sort-an-array-of-composite-structures | 1 + Lang/AWK/Truncatable-primes | 1 + Lang/AWK/Write-to-Windows-event-log | 1 + Lang/AWK/Yin-and-yang | 1 + ...ficient-and-perfect-number-classifications | 1 + Lang/Ada/Bernoulli-numbers | 1 + Lang/Ada/Heronian-triangles | 1 + Lang/Ada/Metronome | 1 + Lang/Ada/RSA-code | 1 + Lang/Agda/Even-or-odd | 1 + Lang/Agda/Factorial | 1 + Lang/Agda/Function-composition | 1 + Lang/Agda/Sieve-of-Eratosthenes | 1 + Lang/Aime/Accumulator-factory | 1 + Lang/Aime/Bitmap-Write-a-PPM-file | 1 + Lang/Aime/Catamorphism | 1 + Lang/Aime/Currying | 1 + Lang/Aime/Delete-a-file | 1 + Lang/Aime/File-size | 1 + Lang/Aime/Formatted-numeric-output | 1 + Lang/Aime/Function-composition | 1 + Lang/Aime/Greatest-subsequential-sum | 1 + Lang/Aime/One-of-n-lines-in-a-file | 1 + Lang/Aime/Permutations | 1 + Lang/Aime/Range-expansion | 1 + Lang/Aime/Sockets | 1 + Lang/Aime/Strip-comments-from-a-string | 1 + Lang/Aime/Unix-ls | 1 + Lang/AntLang/00DESCRIPTION | 56 -- Lang/AppleScript/Bitwise-operations | 1 + Lang/AppleScript/Boolean-values | 1 + .../AppleScript/Combinations-with-repetitions | 1 + .../Convert-decimal-number-to-rational | 1 + Lang/AppleScript/Date-format | 1 + Lang/AppleScript/Digital-root | 1 + .../Fibonacci-n-step-number-sequences | 1 + Lang/AppleScript/Find-limit-of-recursion | 1 + Lang/AppleScript/Generator-Exponential | 1 + Lang/AppleScript/Greatest-subsequential-sum | 1 + Lang/AppleScript/Increment-a-numerical-string | 1 + Lang/AppleScript/Map-range | 1 + Lang/AppleScript/Mouse-position | 1 + Lang/AppleScript/Pick-random-element | 1 + Lang/AppleScript/Sieve-of-Eratosthenes | 1 + Lang/AppleScript/Stern-Brocot-sequence | 1 + Lang/AppleScript/String-matching | 1 + Lang/AppleScript/Visualize-a-tree | 1 + Lang/Applesoft-BASIC/Address-of-a-variable | 1 + Lang/Applesoft-BASIC/Brownian-tree | 1 + Lang/Arc/Caesar-cipher | 1 + Lang/Arc/Day-of-the-week | 1 + Lang/Arc/Factors-of-an-integer | 1 + Lang/Arc/Hello-world-Text | 1 + Lang/Arc/Leap-year | 1 + Lang/AutoHotkey/Nautical-bell | 1 + Lang/B/100-doors | 1 + Lang/B/Hello-world-Newline-omission | 1 + Lang/B/Hello-world-Text | 1 + Lang/B/Mandelbrot-set | 1 + Lang/B/Primality-by-trial-division | 1 + Lang/BASIC/Four-bit-adder | 1 + Lang/BASIC/Yin-and-yang | 1 + Lang/BASIC256/Caesar-cipher | 1 + Lang/BASIC256/Closest-pair-problem | 1 + Lang/BASIC256/Execute-HQ9+ | 1 + Lang/BASIC256/Hofstadter-Q-sequence | 1 + Lang/BASIC256/Mad-Libs | 1 + Lang/BASIC256/Number-reversal-game | 1 + Lang/BASIC256/Pig-the-dice-game | 1 + Lang/BASIC256/Rot-13 | 1 + Lang/BASIC256/Run-length-encoding | 1 + Lang/BaCon/00DESCRIPTION | 4 +- Lang/BaCon/Walk-a-directory-Non-recursively | 1 + Lang/BaCon/Walk-a-directory-Recursively | 1 + Lang/Batch-File/Boolean-values | 1 + .../Batch-File/Evaluate-binomial-coefficients | 1 + Lang/Batch-File/Fork | 1 + Lang/Batch-File/One-of-n-lines-in-a-file | 1 + Lang/Bc/Hello-world-Newline-omission | 1 + Lang/Befunge/Loops-Break | 1 + Lang/Befunge/Loops-Continue | 1 + Lang/Bracmat/Bernoulli-numbers | 1 + Lang/Bracmat/Parsing-RPN-calculator-algorithm | 1 + Lang/Brainf---/Caesar-cipher | 1 + Lang/Brainf---/Execute-Brain---- | 1 + Lang/Burlesque/Factors-of-an-integer | 1 + .../Generate-lower-case-ASCII-alphabet | 1 + Lang/Burlesque/Matrix-exponentiation-operator | 1 + Lang/C++/AKS-test-for-primes | 1 + .../Append-a-record-to-the-end-of-a-text-file | 1 + Lang/C++/Averages-Mean-angle | 1 + Lang/C++/Chinese-remainder-theorem | 1 + Lang/C++/Create-a-file-on-magnetic-tape | 1 + Lang/C++/Handle-a-signal | 1 + Lang/C++/Multiplicative-order | 1 + Lang/C++/Old-lady-swallowed-a-fly | 1 + Lang/C++/Parsing-Shunting-yard-algorithm | 1 + Lang/C++/Polynomial-regression | 1 + Lang/C++/Ranking-methods | 1 + Lang/C++/Resistor-mesh | 1 + Lang/C++/Safe-addition | 1 + Lang/C++/Set-of-real-numbers | 1 + Lang/C++/Sutherland-Hodgman-polygon-clipping | 1 + Lang/C++/The-ISAAC-Cipher | 1 + Lang/C++/Write-to-Windows-event-log | 1 + Lang/C-sharp/Compile-time-calculation | 1 + Lang/C-sharp/Discordian-date | 1 + Lang/C-sharp/Flow-control-structures | 1 + Lang/C-sharp/GUI-Maximum-window-dimensions | 1 + .../GUI-enabling-disabling-of-controls | 1 + Lang/C-sharp/Matrix-exponentiation-operator | 1 + Lang/C-sharp/Modular-exponentiation | 1 + Lang/C-sharp/Non-continuous-subsequences | 1 + Lang/C-sharp/Ordered-Partitions | 1 + Lang/C-sharp/Penneys-game | 1 + Lang/C-sharp/Reverse-a-string | 1 + Lang/C-sharp/Solve-a-Hidato-puzzle | 1 + Lang/C-sharp/Solve-a-Holy-Knights-tour | 1 + Lang/C-sharp/Solve-a-Hopido-puzzle | 1 + Lang/C-sharp/Solve-a-Numbrix-puzzle | 1 + Lang/C/Calendar---for-REAL-programmers | 1 + Lang/C/Set-of-real-numbers | 1 + Lang/C/Window-management | 1 + Lang/COBOL/00DESCRIPTION | 2 +- Lang/COBOL/Align-columns | 1 + Lang/COBOL/Compound-data-type | 1 + Lang/COBOL/File-size | 1 + Lang/COBOL/Machine-code | 1 + Lang/COBOL/Program-name | 1 + Lang/COBOL/Substring-Top-and-tail | 1 + .../Guess-the-number-With-feedback | 1 + Lang/Cache-ObjectScript/Loops-While | 1 + Lang/Cache-ObjectScript/Sleep | 1 + .../Cache-ObjectScript/Zero-to-the-zero-power | 1 + Lang/Ceylon/24-game-Solve | 1 + Lang/Ceylon/Matrix-multiplication | 1 + Lang/Ceylon/Reverse-a-string | 1 + Lang/Ceylon/Vector-products | 1 + Lang/Ceylon/Vigen-re-cipher | 1 + Lang/Ceylon/Zig-zag-matrix | 1 + Lang/Clojure/Infinity | 1 + Lang/Clojure/Permutations-Derangements | 1 + Lang/Clojure/Stem-and-leaf-plot | 1 + Lang/CoffeeScript/Morse-code | 1 + Lang/Comal/Numerical-integration | 1 + Lang/Commodore-BASIC/Hello-world-Text | 1 + Lang/Commodore-BASIC/Maze-generation | 1 + Lang/Common-Lisp/Brownian-tree | 1 + .../Catalan-numbers-Pascals-triangle | 1 + Lang/Common-Lisp/Here-document | 1 + Lang/Common-Lisp/Image-convolution | 1 + Lang/Common-Lisp/Mouse-position | 1 + Lang/Common-Lisp/Ulam-spiral--for-primes- | 1 + Lang/Common-Lisp/World-Cup-group-stage | 1 + Lang/Coq/Extend-your-language | 1 + .../9-billion-names-of-God-the-integer | 1 + Lang/Crystal/AKS-test-for-primes | 1 + Lang/Crystal/Abstract-type | 1 + Lang/Crystal/Ackermann-function | 1 + Lang/Crystal/Averages-Root-mean-square | 1 + Lang/Crystal/Binary-digits | 1 + Lang/Crystal/Binary-search | 1 + Lang/Crystal/Bulls-and-cows | 1 + Lang/Crystal/Bulls-and-cows-Player | 1 + Lang/Crystal/Call-a-foreign-language-function | 1 + Lang/Crystal/Combinations-and-permutations | 1 + Lang/Crystal/Combinations-with-repetitions | 1 + Lang/Crystal/Constrained-genericity | 1 + .../Dinesmans-multiple-dwelling-problem | 1 + Lang/Crystal/Gamma-function | 1 + Lang/Crystal/HTTP | 1 + Lang/Crystal/Harshad-or-Niven-series | 1 + Lang/Crystal/Haversine-formula | 1 + .../Hickerson-series-of-almost-integers | 1 + Lang/Crystal/Josephus-problem | 1 + Lang/Crystal/Knapsack-problem-0-1 | 1 + Lang/Crystal/Knapsack-problem-Bounded | 1 + Lang/Crystal/Nth | 1 + Lang/Crystal/Permutations | 1 + Lang/Crystal/Pythagorean-triples | 1 + Lang/Crystal/Quickselect-algorithm | 1 + Lang/Crystal/Rock-paper-scissors | 1 + Lang/Crystal/Roots-of-unity | 1 + Lang/Crystal/Runge-Kutta-method | 1 + Lang/Crystal/Sierpinski-carpet | 1 + Lang/Crystal/Sum-of-a-series | 1 + Lang/Crystal/The-Twelve-Days-of-Christmas | 1 + Lang/Crystal/Tree-traversal | 1 + Lang/Crystal/Zebra-puzzle | 1 + Lang/Crystal/Zig-zag-matrix | 1 + Lang/Curry/Permutations | 1 + Lang/D/Arithmetic-geometric-mean-Calculate-Pi | 1 + Lang/D/Multiplicative-order | 1 + Lang/Dart/Extensible-prime-generator | 1 + Lang/Dart/Forward-difference | 1 + Lang/Dart/Hamming-numbers | 1 + Lang/Dart/Haversine-formula | 1 + Lang/Dart/Roots-of-a-function | 1 + Lang/Dart/Sum-of-a-series | 1 + Lang/Dc/Ackermann-function | 1 + Lang/Dc/Fibonacci-sequence | 1 + Lang/Dc/Generate-lower-case-ASCII-alphabet | 1 + Lang/Dc/Hello-world-Newline-omission | 1 + Lang/Dc/Logical-operations | 1 + Lang/Dc/Mandelbrot-set | 1 + Lang/Dc/Return-multiple-values | 1 + Lang/Dc/Reverse-a-string | 1 + Lang/Dc/Sum-digits-of-an-integer | 1 + Lang/Dc/Terminal-control-Clear-the-screen | 1 + ...inal-control-Display-an-extended-character | 1 + Lang/Delphi/Address-of-a-variable | 1 + .../Delphi/Random-number-generator--included- | 1 + Lang/ECL/00DESCRIPTION | 2 +- Lang/Eiffel/Classes | 1 + Lang/Elena/00DESCRIPTION | 600 +--------------- Lang/Elena/Walk-a-directory-Non-recursively | 1 + Lang/Elixir/Dining-philosophers | 1 + Lang/Elixir/Extensible-prime-generator | 1 + Lang/Emacs-Lisp/Ackermann-function | 1 + Lang/Emacs-Lisp/Binary-search | 1 + Lang/Emacs-Lisp/Generator-Exponential | 1 + Lang/Emacs-Lisp/Leap-year | 1 + .../Luhn-test-of-credit-card-numbers | 1 + Lang/Emacs-Lisp/Matrix-transposition | 1 + Lang/Emacs-Lisp/Pattern-matching | 1 + Lang/Emacs-Lisp/Pick-random-element | 1 + Lang/Emacs-Lisp/Run-length-encoding | 1 + .../Terminal-control-Preserve-screen | 1 + .../Arithmetic-geometric-mean-Calculate-Pi | 1 + Lang/Erlang/Matrix-transposition | 1 + Lang/Erlang/Monte-Carlo-methods | 1 + Lang/Excel/Factorial | 1 + Lang/FALSE/Generate-lower-case-ASCII-alphabet | 1 + Lang/Factor/00DESCRIPTION | 23 +- Lang/Factor/ABC-Problem | 1 + Lang/Factor/AKS-test-for-primes | 1 + Lang/Factor/Averages-Mean-angle | 1 + Lang/Factor/Averages-Mean-time-of-day | 1 + Lang/Factor/Averages-Simple-moving-average | 1 + Lang/Factor/Brownian-tree | 1 + Lang/Factor/Calendar | 1 + Lang/Factor/Call-an-object-method | 1 + Lang/Factor/Check-Machin-like-formulas | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/Factor/Collections | 1 + ...-Arithmetic-Construct-from-rational-number | 1 + Lang/Factor/DNS-query | 1 + Lang/Factor/Date-manipulation | 1 + Lang/Factor/Deal-cards-for-FreeCell | 1 + Lang/Factor/Draw-a-cuboid | 1 + Lang/Factor/Element-wise-operations | 1 + Lang/Factor/Euler-method | 1 + ...Catch-an-exception-thrown-in-a-nested-call | 1 + Lang/Factor/Execute-HQ9+ | 1 + Lang/Factor/Factors-of-a-Mersenne-number | 1 + Lang/Factor/Fibonacci-n-step-number-sequences | 1 + Lang/Factor/Fibonacci-word-fractal | 1 + Lang/Factor/Find-limit-of-recursion | 1 + Lang/Factor/Floyds-triangle | 1 + Lang/Factor/Forest-fire | 1 + Lang/Factor/Fractran | 1 + Lang/Factor/Function-frequency | 1 + Lang/Factor/Galton-box-animation | 1 + Lang/Factor/Gamma-function | 1 + Lang/Factor/Generator-Exponential | 1 + Lang/Factor/Heronian-triangles | 1 + .../Hickerson-series-of-almost-integers | 1 + Lang/Factor/History-variables | 1 + Lang/Factor/Horizontal-sundial-calculations | 1 + Lang/Factor/IBAN | 1 + Lang/Factor/Inheritance-Multiple | 1 + Lang/Factor/Jensens-Device | 1 + Lang/Factor/List-comprehensions | 1 + Lang/Factor/Literals-Floating-point | 1 + Lang/Factor/Literals-String | 1 + Lang/Factor/Longest-common-subsequence | 1 + Lang/Factor/Lucas-Lehmer-test | 1 + Lang/Factor/Ludic-numbers | 1 + Lang/Factor/Mad-Libs | 1 + Lang/Factor/Magic-squares-of-odd-order | 1 + Lang/Factor/Make-directory-path | 1 + Lang/Factor/Maximum-triangle-path-sum | 1 + Lang/Factor/Morse-code | 1 + Lang/Factor/Move-to-front-algorithm | 1 + Lang/Factor/Nth-root | 1 + Lang/Factor/Order-disjoint-list-items | 1 + Lang/Factor/Pascals-triangle-Puzzle | 1 + Lang/Factor/Percolation-Mean-cluster-density | 1 + Lang/Factor/Percolation-Mean-run-density | 1 + Lang/Factor/Percolation-Site-percolation | 1 + Lang/Factor/Permutations-Derangements | 1 + Lang/Factor/Pi | 1 + Lang/Factor/Polynomial-long-division | 1 + Lang/Factor/Quickselect-algorithm | 1 + Lang/Factor/RIPEMD-160 | 1 + Lang/Factor/Random-number-generator--device- | 1 + Lang/Factor/Range-expansion | 1 + Lang/Factor/Read-a-specific-line-from-a-file | 1 + Lang/Factor/Reduced-row-echelon-form | 1 + Lang/Factor/Rock-paper-scissors | 1 + Lang/Factor/Roman-numerals-Decode | 1 + .../Runtime-evaluation-In-an-environment | 1 + Lang/Factor/S-Expressions | 1 + Lang/Factor/SEDOLs | 1 + Lang/Factor/Semordnilap | 1 + Lang/Factor/Send-an-unknown-method-call | 1 + Lang/Factor/Sierpinski-triangle-Graphical | 1 + Lang/Factor/Sieve-of-Eratosthenes | 1 + Lang/Factor/Solve-the-no-connection-puzzle | 1 + Lang/Factor/Sort-disjoint-sublist | 1 + Lang/Factor/Sorting-algorithms-Stooge-sort | 1 + Lang/Factor/Soundex | 1 + Lang/Factor/Spiral-matrix | 1 + Lang/Factor/Stack-traces | 1 + Lang/Factor/Stair-climbing-puzzle | 1 + Lang/Factor/Stem-and-leaf-plot | 1 + Lang/Factor/String-matching | 1 + Lang/Factor/Trigonometric-functions | 1 + Lang/Factor/URL-encoding | 1 + Lang/Factor/Ulam-spiral--for-primes- | 1 + Lang/Factor/Unbias-a-random-generator | 1 + Lang/Factor/Unicode-variable-names | 1 + Lang/Factor/Van-der-Corput-sequence | 1 + Lang/Factor/Visualize-a-tree | 1 + Lang/Factor/Zeckendorf-number-representation | 1 + Lang/Factor/Zig-zag-matrix | 1 + Lang/Fish/100-doors | 1 + Lang/Fish/Function-definition | 1 + Lang/Fish/Generic-swap | 1 + Lang/Fish/Loops-Infinite | 1 + Lang/Fish/Sum-of-a-series | 1 + Lang/Forth/Colour-bars-Display | 1 + Lang/Forth/Draw-a-clock | 1 + Lang/Forth/Langtons-ant | 1 + Lang/Forth/Man-or-boy-test | 1 + Lang/Forth/Menu | 1 + Lang/Forth/Narcissistic-decimal-number | 1 + Lang/Forth/Ulam-spiral--for-primes- | 1 + Lang/Forth/Variable-size-Get | 1 + Lang/Fortran/00DESCRIPTION | 2 +- Lang/Fortran/Stern-Brocot-sequence | 1 + Lang/Free-Pascal/100-doors | 1 + Lang/Free-Pascal/Array-concatenation | 1 + Lang/Free-Pascal/Associative-array-Creation | 1 + Lang/Free-Pascal/Associative-array-Iteration | 1 + Lang/Free-Pascal/Binary-digits | 1 + Lang/Free-Pascal/Bitwise-operations | 1 + Lang/Free-Pascal/Casting-out-nines | 1 + Lang/Free-Pascal/Define-a-primitive-data-type | 1 + Lang/Free-Pascal/Delete-a-file | 1 + .../Determine-if-a-string-is-numeric | 1 + Lang/Free-Pascal/Empty-string | 1 + Lang/Free-Pascal/Extend-your-language | 1 + Lang/Free-Pascal/Fibonacci-sequence | 1 + .../Generate-lower-case-ASCII-alphabet | 1 + Lang/Free-Pascal/Generic-swap | 1 + Lang/Free-Pascal/Haversine-formula | 1 + Lang/Free-Pascal/Hello-world-Web-server | 1 + .../Memory-layout-of-a-data-structure | 1 + Lang/Free-Pascal/Queue-Definition | 1 + .../Random-number-generator--included- | 1 + Lang/Free-Pascal/Repeat-a-string | 1 + Lang/Free-Pascal/SHA-256 | 1 + Lang/Free-Pascal/Shell-one-liner | 1 + Lang/Free-Pascal/Sieve-of-Eratosthenes | 1 + Lang/Free-Pascal/Stack | 1 + Lang/Free-Pascal/Substring | 1 + Lang/Free-Pascal/Ternary-logic | 1 + Lang/Free-Pascal/URL-decoding | 1 + Lang/Free-Pascal/URL-encoding | 1 + Lang/Free-Pascal/Variable-size-Set | 1 + Lang/Free-Pascal/Variadic-function | 1 + Lang/FreeBASIC/24-game | 1 + Lang/FreeBASIC/ABC-Problem | 1 + Lang/FreeBASIC/Closest-pair-problem | 1 + Lang/FreeBASIC/Dutch-national-flag-problem | 1 + Lang/FreeBASIC/Execute-Brain---- | 1 + Lang/FreeBASIC/Execute-HQ9+ | 1 + Lang/FreeBASIC/Find-common-directory-path | 1 + .../Generate-Chess960-starting-position | 1 + Lang/FreeBASIC/Go-Fish | 1 + Lang/FreeBASIC/Hofstadter-Q-sequence | 1 + .../Horners-rule-for-polynomial-evaluation | 1 + Lang/FreeBASIC/Josephus-problem | 1 + Lang/FreeBASIC/Knights-tour | 1 + Lang/FreeBASIC/LZW-compression | 1 + Lang/FreeBASIC/Literals-String | 1 + Lang/FreeBASIC/Look-and-say-sequence | 1 + Lang/FreeBASIC/Mad-Libs | 1 + Lang/FreeBASIC/Modular-exponentiation | 1 + Lang/FreeBASIC/Monty-Hall-problem | 1 + Lang/FreeBASIC/Nth-root | 1 + Lang/FreeBASIC/Pig-the-dice-game | 1 + Lang/FreeBASIC/Quaternion-type | 1 + Lang/FreeBASIC/Quine | 1 + Lang/FreeBASIC/Run-length-encoding | 1 + Lang/FreeBASIC/Stern-Brocot-sequence | 1 + Lang/Frink/Amicable-pairs | 1 + Lang/Futhark/Associative-array-Creation | 1 + Lang/Futhark/QR-decomposition | 1 + Lang/GAP/Quine | 1 + Lang/GAP/Zebra-puzzle | 1 + Lang/GLSL/Classes | 1 + Lang/GLSL/Dot-product | 1 + Lang/GLSL/Vector-products | 1 + Lang/GW-BASIC/Loops-For | 1 + Lang/Gambas/Factorial | 1 + Lang/Go/00DESCRIPTION | 5 +- Lang/Go/Active-Directory-Connect | 1 + Lang/Go/Active-Directory-Search-for-a-user | 1 + ...-a-variable-to-a-class-instance-at-runtime | 1 + Lang/Go/Calendar---for-REAL-programmers | 1 + Lang/Go/Canny-edge-detector | 1 + Lang/Go/Color-of-a-screen-pixel | 1 + Lang/Go/Colour-bars-Display | 1 + Lang/Go/Colour-pinstripe-Display | 1 + Lang/Go/Colour-pinstripe-Printer | 1 + Lang/Go/Deconvolution-2D+ | 1 + Lang/Go/Dynamic-variable-names | 1 + Lang/Go/Fibonacci-word-fractal | 1 + Lang/Go/GUI-Maximum-window-dimensions | 1 + Lang/Go/GUI-component-interaction | 1 + Lang/Go/GUI-enabling-disabling-of-controls | 1 + Lang/Go/Greyscale-bars-Display | 1 + Lang/Go/Honeycombs | 1 + Lang/Go/Joystick-position | 1 + Lang/Go/Keyboard-macros | 1 + Lang/Go/List-comprehensions | 1 + Lang/Go/Machine-code | 1 + Lang/Go/Matrix-exponentiation-operator | 1 + Lang/Go/Metaprogramming | 1 + Lang/Go/Minesweeper-game | 1 + Lang/Go/Mouse-position | 1 + Lang/Go/Nautical-bell | 1 + Lang/Go/OLE-Automation | 1 + Lang/Go/Pattern-matching | 1 + Lang/Go/Pinstripe-Display | 1 + Lang/Go/Pinstripe-Printer | 1 + Lang/Go/Play-recorded-sounds | 1 + Lang/Go/Record-sound | 1 + Lang/Go/SOAP | 1 + Lang/Go/Simulate-input-Keyboard | 1 + Lang/Go/Simulate-input-Mouse | 1 + Lang/Go/Start-from-a-main-routine | 1 + Lang/Go/Terminal-control-Positional-read | 1 + Lang/Go/User-input-Graphical | 1 + Lang/Go/Window-management | 1 + Lang/Go/World-Cup-group-stage | 1 + Lang/Go/Write-to-Windows-event-log | 1 + Lang/Go/Zeckendorf-arithmetic | 1 + Lang/Golo/99-Bottles-of-Beer | 1 + Lang/Golo/A+B | 1 + Lang/Golo/Bulls-and-cows | 1 + Lang/Golo/Polymorphism | 1 + Lang/Golo/Roman-numerals-Decode | 1 + Lang/Golo/Roman-numerals-Encode | 1 + Lang/Golo/Rot-13 | 1 + Lang/Golo/Terminal-control-Coloured-text | 1 + Lang/Golo/Variadic-function | 1 + Lang/Groovy/Active-object | 1 + Lang/Groovy/Benfords-law | 1 + Lang/Groovy/Call-a-function | 1 + Lang/Groovy/Chat-server | 1 + .../Groovy/Convert-decimal-number-to-rational | 1 + Lang/Groovy/Element-wise-operations | 1 + Lang/Groovy/Integer-overflow | 1 + Lang/Groovy/MD5-Implementation | 1 + Lang/Groovy/Parsing-RPN-to-infix-conversion | 1 + Lang/Groovy/User-input-Graphical | 1 + Lang/Groovy/Video-display-modes | 1 + Lang/Harbour/Align-columns | 1 + .../Loop-over-multiple-arrays-simultaneously | 1 + Lang/Haskell/Function-prototype | 1 + .../Keyboard-input-Flush-the-keyboard-buffer | 1 + Lang/Haskell/Knuths-algorithm-S | 1 + Lang/Haskell/LU-decomposition | 1 + Lang/Haskell/QR-decomposition | 1 + Lang/Haskell/Set-of-real-numbers | 1 + Lang/Haskell/Xiaolin-Wus-line-algorithm | 1 + Lang/Haxe/00DESCRIPTION | 14 +- Lang/HolyC/00DESCRIPTION | 2 +- Lang/HolyC/99-Bottles-of-Beer | 1 + Lang/Hy/Playing-cards | 1 + Lang/J/00DESCRIPTION | 2 +- Lang/J/Dining-philosophers | 1 + Lang/Java/00DESCRIPTION | 2 - Lang/Java/Create-a-file-on-magnetic-tape | 1 + Lang/Java/Extend-your-language | 1 + Lang/Java/FizzBuzz | 1 + Lang/Java/Narcissist | 1 + Lang/Java/Write-to-Windows-event-log | 1 + Lang/JavaScript/CRC-32 | 1 + .../Convert-decimal-number-to-rational | 1 + Lang/JavaScript/Execute-a-Markov-algorithm | 1 + Lang/JavaScript/Find-common-directory-path | 1 + Lang/JavaScript/Galton-box-animation | 1 + Lang/JavaScript/Hello-world-Newbie | 1 + Lang/JavaScript/Last-letter-first-letter | 1 + Lang/JavaScript/MD4 | 1 + Lang/JavaScript/Rock-paper-scissors | 1 + Lang/JavaScript/Set-consolidation | 1 + Lang/JavaScript/Stern-Brocot-sequence | 1 + Lang/Julia/00DESCRIPTION | 2 +- Lang/Julia/9-billion-names-of-God-the-integer | 1 + Lang/Julia/Binary-strings | 1 + Lang/Julia/Bitwise-IO | 1 + Lang/Julia/Calendar | 1 + Lang/Julia/Calendar---for-REAL-programmers | 1 + Lang/Julia/Check-Machin-like-formulas | 1 + Lang/Julia/Checkpoint-synchronization | 1 + Lang/Julia/Color-of-a-screen-pixel | 1 + Lang/Julia/Color-quantization | 1 + Lang/Julia/Colour-pinstripe-Display | 1 + .../Compare-sorting-algorithms-performance | 1 + ...ithmetic-G-matrix-NG,-Contined-Fraction-N- | 1 + Lang/Julia/Create-a-file-on-magnetic-tape | 1 + Lang/Julia/Cut-a-rectangle | 1 + Lang/Julia/DNS-query | 1 + Lang/Julia/Deal-cards-for-FreeCell | 1 + Lang/Julia/Death-Star | 1 + Lang/Julia/Deconvolution-2D+ | 1 + .../Determine-if-only-one-instance-is-running | 1 + Lang/Julia/Distributed-programming | 1 + Lang/Julia/Documentation | 1 + Lang/Julia/Doubly-linked-list-Definition | 1 + .../Doubly-linked-list-Element-insertion | 1 + Lang/Julia/Doubly-linked-list-Traversal | 1 + Lang/Julia/Draw-a-clock | 1 + Lang/Julia/Echo-server | 1 + Lang/Julia/Execute-SNUSP | 1 + Lang/Julia/Extend-your-language | 1 + Lang/Julia/First-class-environments | 1 + Lang/Julia/Fork | 1 + Lang/Julia/Fractal-tree | 1 + Lang/Julia/Function-prototype | 1 + Lang/Julia/GUI-Maximum-window-dimensions | 1 + Lang/Julia/Galton-box-animation | 1 + Lang/Julia/Greyscale-bars-Display | 1 + Lang/Julia/HTTPS-Authenticated | 1 + Lang/Julia/HTTPS-Client-authenticated | 1 + Lang/Julia/Hello-world-Line-printer | 1 + Lang/Julia/History-variables | 1 + Lang/Julia/Honeycombs | 1 + Lang/Julia/Hough-transform | 1 + Lang/Julia/Huffman-coding | 1 + Lang/Julia/Image-noise | 1 + Lang/Julia/Inheritance-Multiple | 1 + Lang/Julia/Inverted-index | 1 + Lang/Julia/Joystick-position | 1 + Lang/Julia/K-d-tree | 1 + Lang/Julia/K-means++-clustering | 1 + Lang/Julia/Keyboard-input-Keypress-check | 1 + Lang/Julia/Keyboard-macros | 1 + Lang/Julia/Knights-tour | 1 + Lang/Julia/Langtons-ant | 1 + Lang/Julia/Literals-String | 1 + Lang/Julia/MD5-Implementation | 1 + Lang/Julia/Machine-code | 1 + Lang/Julia/Metaprogramming | 1 + Lang/Julia/Metered-concurrency | 1 + Lang/Julia/Morse-code | 1 + Lang/Julia/Mouse-position | 1 + Lang/Julia/Multisplit | 1 + Lang/Julia/Munching-squares | 1 + Lang/Julia/Natural-sorting | 1 + Lang/Julia/Nautical-bell | 1 + Lang/Julia/OpenGL | 1 + Lang/Julia/Paraffins | 1 + Lang/Julia/Pattern-matching | 1 + Lang/Julia/Pig-the-dice-game-Player | 1 + Lang/Julia/Pointers-and-references | 1 + Lang/Julia/Polymorphic-copy | 1 + Lang/Julia/Pragmatic-directives | 1 + Lang/Julia/Rate-counter | 1 + Lang/Julia/Rendezvous | 1 + Lang/Julia/Scope-modifiers | 1 + Lang/Julia/Self-referential-sequence | 1 + Lang/Julia/Set-puzzle | 1 + Lang/Julia/Simple-database | 1 + Lang/Julia/Sokoban | 1 + Lang/Julia/Solve-a-Hidato-puzzle | 1 + Lang/Julia/Solve-a-Holy-Knights-tour | 1 + Lang/Julia/Solve-a-Hopido-puzzle | 1 + Lang/Julia/Solve-a-Numbrix-puzzle | 1 + Lang/Julia/Solve-the-no-connection-puzzle | 1 + Lang/Julia/Sorting-algorithms-Heapsort | 1 + Lang/Julia/Sorting-algorithms-Radix-sort | 1 + Lang/Julia/Sorting-algorithms-Strand-sort | 1 + Lang/Julia/Speech-synthesis | 1 + Lang/Julia/Subtractive-generator | 1 + .../Julia/Sutherland-Hodgman-polygon-clipping | 1 + Lang/Julia/Take-notes-on-the-command-line | 1 + Lang/Julia/Terminal-control-Cursor-movement | 1 + .../Julia/Terminal-control-Cursor-positioning | 1 + Lang/Julia/Terminal-control-Dimensions | 1 + ...inal-control-Display-an-extended-character | 1 + Lang/Julia/Terminal-control-Hiding-the-cursor | 1 + Lang/Julia/Terminal-control-Inverse-video | 1 + Lang/Julia/Terminal-control-Positional-read | 1 + Lang/Julia/Terminal-control-Preserve-screen | 1 + Lang/Julia/Thieles-interpolation-formula | 1 + Lang/Julia/Tic-tac-toe | 1 + Lang/Julia/Undefined-values | 1 + Lang/Julia/Universal-Turing-machine | 1 + Lang/Julia/Update-a-configuration-file | 1 + Lang/Julia/User-input-Graphical | 1 + Lang/Julia/Variable-size-Set | 1 + Lang/Julia/Video-display-modes | 1 + Lang/Julia/Visualize-a-tree | 1 + Lang/Julia/Window-management | 1 + Lang/Julia/Wireworld | 1 + Lang/Julia/World-Cup-group-stage | 1 + Lang/Julia/Write-language-name-in-3D-ASCII | 1 + Lang/Julia/Write-to-Windows-event-log | 1 + Lang/Julia/XML-DOM-serialization | 1 + Lang/Julia/XML-Output | 1 + Lang/Julia/XML-XPath | 1 + Lang/Julia/Zeckendorf-arithmetic | 1 + ...ficient-and-perfect-number-classifications | 1 + Lang/K/Find-the-last-Sunday-of-each-month | 1 + Lang/K/Last-Friday-of-each-month | 1 + Lang/K/Matrix-exponentiation-operator | 1 + Lang/K/Middle-three-digits | 1 + Lang/K/Phrase-reversals | 1 + Lang/K/Zero-to-the-zero-power | 1 + Lang/Kotlin/Chat-server | 1 + Lang/LLVM/Arithmetic-geometric-mean | 1 + Lang/LLVM/Binary-digits | 1 + Lang/LLVM/Box-the-compass | 1 + Lang/LLVM/Dot-product | 1 + Lang/LLVM/Even-or-odd | 1 + Lang/LLVM/Factorial | 1 + Lang/LLVM/Fibonacci-sequence | 1 + Lang/LLVM/FizzBuzz | 1 + Lang/LLVM/Hello-world-Newline-omission | 1 + Lang/LLVM/Hello-world-Standard-error | 1 + Lang/LLVM/Integer-sequence | 1 + Lang/LLVM/Leap-year | 1 + Lang/LLVM/Logical-operations | 1 + Lang/LLVM/Reverse-a-string | 1 + Lang/Lambdatalk/00DESCRIPTION | 12 +- Lang/Lambdatalk/Create-an-HTML-table | 1 + .../Lambdatalk/Guess-the-number-With-feedback | 1 + Lang/Liberty-BASIC/AKS-test-for-primes | 1 + Lang/Liberty-BASIC/Almost-prime | 1 + Lang/Liberty-BASIC/Nth | 1 + Lang/Lua/00DESCRIPTION | 31 +- .../Append-a-record-to-the-end-of-a-text-file | 1 + Lang/Lua/CRC-32 | 1 + Lang/Lua/Chinese-remainder-theorem | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/Lua/Create-a-file-on-magnetic-tape | 1 + Lang/Lua/Execute-Brain---- | 1 + Lang/Lua/Hofstadter-Conway-$10,000-sequence | 1 + Lang/Lua/K-means++-clustering | 1 + Lang/Lua/Old-lady-swallowed-a-fly | 1 + Lang/Lua/Polynomial-regression | 1 + Lang/Lua/Set-of-real-numbers | 1 + Lang/Lua/Tree-traversal | 1 + Lang/Lua/Walk-a-directory-Recursively | 1 + Lang/Lua/Write-language-name-in-3D-ASCII | 1 + Lang/M4/Count-in-factors | 1 + Lang/M4/Count-in-octal | 1 + .../Percentage-difference-between-images | 1 + Lang/MAXScript/Binary-digits | 1 + Lang/MAXScript/Even-or-odd | 1 + Lang/MAXScript/Reverse-words-in-a-string | 1 + Lang/MUMPS/Generate-lower-case-ASCII-alphabet | 1 + .../Keyboard-input-Obtain-a-Y-or-N-response | 1 + Lang/MUMPS/Loops-Do-while | 1 + Lang/MUMPS/Phrase-reversals | 1 + Lang/MUMPS/Sorting-algorithms-Quicksort | 1 + ...Terminal-control-Ringing-the-terminal-bell | 1 + Lang/Maple/00DESCRIPTION | 5 +- Lang/Maple/9-billion-names-of-God-the-integer | 1 + ...ficient-and-perfect-number-classifications | 1 + Lang/Maple/Death-Star | 1 + Lang/Maple/Draw-a-cuboid | 1 + Lang/Maple/Hello-world-Line-printer | 1 + Lang/Maple/Kaprekar-numbers | 1 + Lang/Maple/Number-names | 1 + Lang/Maple/One-of-n-lines-in-a-file | 1 + Lang/Maple/Perfect-numbers | 1 + Lang/Maple/Pernicious-numbers | 1 + Lang/Maple/Polynomial-regression | 1 + Lang/Maple/Sieve-of-Eratosthenes | 1 + Lang/Maple/Yin-and-yang | 1 + Lang/Mathematica/Color-of-a-screen-pixel | 1 + Lang/Mathematica/Hello-world-Web-server | 1 + .../Keyboard-input-Obtain-a-Y-or-N-response | 1 + Lang/Mercury/ABC-Problem | 1 + Lang/Mercury/Abstract-type | 1 + Lang/Mercury/Accumulator-factory | 1 + Lang/Mercury/Arrays | 1 + Lang/Mercury/Balanced-brackets | 1 + Lang/Mercury/Empty-string | 1 + Lang/Mercury/Old-lady-swallowed-a-fly | 1 + Lang/Mercury/Permutations | 1 + Lang/Mercury/Pythagorean-triples | 1 + Lang/Mercury/Range-extraction | 1 + Lang/Mercury/Rock-paper-scissors | 1 + Lang/Mercury/Sieve-of-Eratosthenes | 1 + Lang/Mercury/Topological-sort | 1 + .../Use-another-language-to-call-a-function | 1 + Lang/Mercury/Variables | 1 + Lang/Modula-2/Arithmetic-geometric-mean | 1 + Lang/Modula-2/Chinese-remainder-theorem | 1 + Lang/Modula-2/Quine | 1 + Lang/Modula-2/Ranking-methods | 1 + Lang/Modula-3/Caesar-cipher | 1 + Lang/Modula-3/Dining-philosophers | 1 + Lang/Modula-3/Gaussian-elimination | 1 + Lang/Modula-3/Permutations | 1 + Lang/Neko/00DESCRIPTION | 19 +- Lang/Neko/99-Bottles-of-Beer | 1 + Lang/Neko/A+B | 1 + Lang/Neko/Array-concatenation | 1 + Lang/Neko/Bitwise-operations | 1 + Lang/Neko/Boolean-values | 1 + Lang/Neko/CRC-32 | 1 + Lang/Neko/Character-codes | 1 + Lang/Neko/Check-that-file-exists | 1 + Lang/Neko/Command-line-arguments | 1 + Lang/Neko/Concurrent-computing | 1 + Lang/Neko/DNS-query | 1 + Lang/Neko/Date-format | 1 + Lang/Neko/Documentation | 1 + Lang/Neko/Find-limit-of-recursion | 1 + Lang/Neko/Generate-lower-case-ASCII-alphabet | 1 + Lang/Neko/Greatest-element-of-a-list | 1 + Lang/Neko/Hash-from-two-arrays | 1 + Lang/Neko/Hello-world-Graphical | 1 + Lang/Neko/Hello-world-Newline-omission | 1 + Lang/Neko/Hello-world-Standard-error | 1 + Lang/Neko/Host-introspection | 1 + Lang/Neko/Jump-anywhere | 1 + Lang/Neko/Leap-year | 1 + Lang/Neko/Literals-Integer | 1 + Lang/Neko/Logical-operations | 1 + Lang/Neko/Loops-Break | 1 + Lang/Neko/Loops-Continue | 1 + Lang/Neko/Loops-Do-while | 1 + Lang/Neko/Loops-Nested | 1 + Lang/Neko/MD5 | 1 + Lang/Neko/Multiplication-tables | 1 + Lang/Neko/Null-object | 1 + Lang/Neko/Object-serialization | 1 + Lang/Neko/Program-termination | 1 + Lang/Neko/Read-a-file-line-by-line | 1 + Lang/Neko/Read-entire-file | 1 + Lang/Neko/Real-constants-and-functions | 1 + Lang/Neko/Remove-duplicate-elements | 1 + Lang/Neko/Repeat-a-string | 1 + Lang/Neko/Reverse-a-string | 1 + Lang/Neko/Rot-13 | 1 + Lang/Neko/Sockets | 1 + Lang/Neko/Sort-an-integer-array | 1 + Lang/Neko/String-append | 1 + Lang/Neko/String-concatenation | 1 + Lang/Neko/String-interpolation--included- | 1 + Lang/Neko/String-prepend | 1 + Lang/Neko/Substring-Top-and-tail | 1 + Lang/Neko/System-time | 1 + Lang/Neko/User-input-Text | 1 + Lang/Neko/XML-Input | 1 + Lang/Neko/Zero-to-the-zero-power | 1 + Lang/NewLISP/Arithmetic-geometric-mean | 1 + Lang/NewLISP/Regular-expressions | 1 + Lang/Nial/Arithmetic-Integer | 1 + Lang/Nial/Array-concatenation | 1 + Lang/Nickle/00DESCRIPTION | 64 +- Lang/Nickle/Factorial | 1 + Lang/Nickle/Hello-world-Text | 1 + Lang/Nim/00DESCRIPTION | 6 +- Lang/Nim/24-game-Solve | 1 + Lang/Nim/Arithmetic-evaluation | 1 + Lang/Nim/Best-shuffle | 1 + Lang/Nim/Bitcoin-address-validation | 1 + Lang/Nim/Bitcoin-public-point-to-address | 1 + Lang/Nim/Create-an-object-at-a-given-address | 1 + Lang/Nim/DNS-query | 1 + Lang/Nim/Extensible-prime-generator | 1 + Lang/Nim/Image-noise | 1 + Lang/Nim/Inverted-syntax | 1 + Lang/Nim/Parsing-Shunting-yard-algorithm | 1 + Lang/Nim/RIPEMD-160 | 1 + Lang/Nim/S-Expressions | 1 + Lang/Nim/Stem-and-leaf-plot | 1 + Lang/Nim/Sudoku | 1 + Lang/Nim/Terminal-control-Dimensions | 1 + Lang/Nim/Terminal-control-Hiding-the-cursor | 1 + Lang/Nim/Voronoi-diagram | 1 + Lang/OCaml/Calendar | 1 + Lang/OCaml/Function-prototype | 1 + Lang/OCaml/Here-document | 1 + Lang/OPL/Loops-Infinite | 1 + Lang/Objeck/00DESCRIPTION | 6 +- Lang/Objeck/Assertions | 1 + Lang/Objeck/CRC-32 | 1 + Lang/Objeck/CSV-data-manipulation | 1 + Lang/Objeck/CSV-to-HTML-translation | 1 + Lang/Objeck/Closures-Value-capture | 1 + Lang/Objeck/Comma-quibbling | 1 + Lang/Objeck/Constrained-genericity | 1 + Lang/Objeck/Delegates | 1 + Lang/Objeck/Documentation | 1 + Lang/Objeck/First-class-functions | 1 + ...st-class-functions-Use-numbers-analogously | 1 + Lang/Objeck/Iterated-digits-squaring | 1 + Lang/Objeck/Loops-Continue | 1 + Lang/Objeck/Ludic-numbers | 1 + Lang/Objeck/Price-fraction | 1 + Lang/Objeck/Sierpinski-triangle-Graphical | 1 + Lang/Objeck/Soundex | 1 + ...inal-control-Display-an-extended-character | 1 + Lang/Objeck/Tic-tac-toe | 1 + Lang/Objeck/Walk-a-directory-Recursively | 1 + Lang/Octave/Langtons-ant | 1 + Lang/Ol/00DESCRIPTION | 6 +- Lang/Ol/100-doors | 1 + Lang/Ol/Anonymous-recursion | 1 + Lang/Ol/Arrays | 1 + Lang/Ol/Comma-quibbling | 1 + Lang/Ol/Conditional-structures | 1 + Lang/Ol/Conways-Game-of-Life | 1 + Lang/Ol/Detect-division-by-zero | 1 + Lang/Ol/Dot-product | 1 + Lang/Ol/Fibonacci-n-step-number-sequences | 1 + Lang/Ol/First-class-functions | 1 + Lang/Ol/Forest-fire | 1 + Lang/Ol/Function-definition | 1 + Lang/Ol/Greatest-common-divisor | 1 + Lang/Ol/Hello-world-Graphical | 1 + Lang/Ol/Hello-world-Standard-error | 1 + Lang/Ol/Higher-order-functions | 1 + Lang/Ol/Infinity | 1 + Lang/Ol/Integer-comparison | 1 + Lang/Ol/Integer-sequence | 1 + Lang/Ol/Jump-anywhere | 1 + Lang/Ol/Knuth-shuffle | 1 + Lang/Ol/LZW-compression | 1 + Lang/Ol/Long-multiplication | 1 + Lang/Ol/Loops-Break | 1 + Lang/Ol/Loops-Infinite | 1 + Lang/Ol/Man-or-boy-test | 1 + Lang/Ol/Mandelbrot-set | 1 + Lang/Ol/Maze-generation | 1 + Lang/Ol/Mutual-recursion | 1 + Lang/Ol/Object-serialization | 1 + Lang/Ol/Odd-word-problem | 1 + Lang/Ol/OpenGL | 1 + Lang/Ol/Order-two-numerical-lists | 1 + Lang/Ol/Palindrome-detection | 1 + Lang/Ol/Pi | 1 + Lang/Ol/Pick-random-element | 1 + Lang/Ol/Plot-coordinate-pairs | 1 + Lang/Ol/Program-name | 1 + Lang/Ol/Program-termination | 1 + Lang/Ol/Pythagorean-triples | 1 + Lang/Ol/Read-entire-file | 1 + Lang/Ol/Regular-expressions | 1 + Lang/Ol/Reverse-a-string | 1 + Lang/Ol/Sequence-of-non-squares | 1 + Lang/Ol/Set | 1 + Lang/Ol/Sieve-of-Eratosthenes | 1 + Lang/Ol/Sum-and-product-of-an-array | 1 + Lang/Ol/Sum-digits-of-an-integer | 1 + Lang/Ol/Sum-multiples-of-3-and-5 | 1 + Lang/Ol/Sum-of-squares | 1 + Lang/Ol/Zero-to-the-zero-power | 1 + Lang/OpenEdge-Progress/Combinations | 1 + Lang/OpenEdge-Progress/Permutations | 1 + Lang/Oz/00DESCRIPTION | 4 +- Lang/PARI-GP/00DESCRIPTION | 57 +- Lang/PARI-GP/Yin-and-yang | 1 + Lang/PDP-11-Assembly/N-queens-problem | 1 + Lang/PHP/Deal-cards-for-FreeCell | 1 + Lang/PHP/Maze-generation | 1 + Lang/PHP/Word-wrap | 1 + Lang/Pascal/Dining-philosophers | 1 + Lang/Pascal/Enumerations | 1 + Lang/Pascal/Formatted-numeric-output | 1 + Lang/Pascal/Penneys-game | 1 + Lang/Pascal/Scope-modifiers | 1 + Lang/Pascal/Terminal-control-Coloured-text | 1 + Lang/Pascal/Yin-and-yang | 1 + Lang/Perl-6/00DESCRIPTION | 21 +- Lang/Perl-6/Active-Directory-Connect | 1 + .../Perl-6/Active-Directory-Search-for-a-user | 1 + Lang/Perl-6/Active-object | 1 + Lang/Perl-6/Animate-a-pendulum | 1 + Lang/Perl-6/Animation | 1 + .../Bitmap-PPM-conversion-through-a-pipe | 1 + Lang/Perl-6/Checkpoint-synchronization | 1 + Lang/Perl-6/Color-quantization | 1 + .../Create-an-object-at-a-given-address | 1 + Lang/Perl-6/GUI-Maximum-window-dimensions | 1 + Lang/Perl-6/HTTPS-Client-authenticated | 1 + Lang/Perl-6/Hough-transform | 1 + Lang/Perl-6/Image-convolution | 1 + .../Keyboard-input-Flush-the-keyboard-buffer | 1 + Lang/Perl-6/Keyboard-input-Keypress-check | 1 + Lang/Perl-6/Median-filter | 1 + Lang/Perl-6/Object-serialization | 1 + .../Percentage-difference-between-images | 1 + Lang/Perl-6/QR-decomposition | 1 + Lang/Perl-6/SOAP | 1 + Lang/Perl-6/SQL-based-authentication | 1 + Lang/Perl-6/Safe-addition | 1 + Lang/Perl-6/Send-email | 1 + Lang/Perl-6/Simulate-input-Keyboard | 1 + Lang/Perl-6/Simulate-input-Mouse | 1 + Lang/Perl-6/Terminal-control-Positional-read | 1 + Lang/Perl-6/The-ISAAC-Cipher | 1 + Lang/Perl-6/Vogels-approximation-method | 1 + Lang/Perl-6/Window-management | 1 + Lang/Perl-6/Zebra-puzzle | 1 + Lang/Perl/Average-loop-length | 1 + Lang/Perl/Deconvolution-1D | 1 + Lang/Perl/Deconvolution-2D+ | 1 + Lang/Perl/Galton-box-animation | 1 + Lang/Perl/Greyscale-bars-Display | 1 + Lang/Perl/Horizontal-sundial-calculations | 1 + Lang/Perl/Hough-transform | 1 + Lang/Perl/Image-noise | 1 + Lang/Perl/Keyboard-macros | 1 + Lang/Perl/LU-decomposition | 1 + Lang/Perl/Main-step-of-GOST-28147-89 | 1 + Lang/Perl/Metronome | 1 + Lang/Perl/Nautical-bell | 1 + Lang/Perl/Numerical-integration | 1 + ...ical-integration-Gauss-Legendre-Quadrature | 1 + .../Perl/Percentage-difference-between-images | 1 + Lang/Perl/Percolation-Bond-percolation | 1 + Lang/Perl/Percolation-Mean-cluster-density | 1 + Lang/Perl/Percolation-Site-percolation | 1 + Lang/Perl/Pig-the-dice-game-Player | 1 + Lang/Perl/Pinstripe-Display | 1 + Lang/Perl/Problem-of-Apollonius | 1 + Lang/Perl/RSA-code | 1 + Lang/Perl/Ranking-methods | 1 + Lang/Perl/Safe-addition | 1 + Lang/Perl/Scope-Function-names-and-labels | 1 + Lang/Perl/Solve-a-Hopido-puzzle | 1 + Lang/Perl/Terminal-control-Coloured-text | 1 + Lang/Perl/Terminal-control-Cursor-movement | 1 + ...inal-control-Display-an-extended-character | 1 + Lang/Perl/Terminal-control-Hiding-the-cursor | 1 + Lang/Perl/Terminal-control-Inverse-video | 1 + Lang/Perl/Terminal-control-Unicode-output | 1 + Lang/Perl/Total-circles-area | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + .../Perl/Verify-distribution-uniformity-Naive | 1 + Lang/Perl/Video-display-modes | 1 + Lang/Perl/Voronoi-diagram | 1 + Lang/Perl/World-Cup-group-stage | 1 + Lang/Perl/Zhang-Suen-thinning-algorithm | 1 + Lang/Phix/00DESCRIPTION | 11 +- Lang/Phix/Accumulator-factory | 1 + Lang/Phix/Active-object | 1 + Lang/Phix/Bitwise-IO | 1 + Lang/Phix/Carmichael-3-strong-pseudoprimes | 1 + Lang/Phix/Check-Machin-like-formulas | 1 + Lang/Phix/Checkpoint-synchronization | 1 + Lang/Phix/Chinese-remainder-theorem | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/Phix/Color-quantization | 1 + ...-Arithmetic-Construct-from-rational-number | 1 + Lang/Phix/Create-a-file-on-magnetic-tape | 1 + Lang/Phix/Cut-a-rectangle | 1 + Lang/Phix/DNS-query | 1 + Lang/Phix/Deconvolution-2D+ | 1 + Lang/Phix/Events | 1 + Lang/Phix/File-modification-time | 1 + ...est-left-truncatable-prime-in-a-given-base | 1 + Lang/Phix/Flipping-bits-game | 1 + Lang/Phix/Formal-power-series | 1 + Lang/Phix/Fractran | 1 + Lang/Phix/Function-frequency | 1 + Lang/Phix/Gaussian-elimination | 1 + Lang/Phix/Handle-a-signal | 1 + Lang/Phix/Hickerson-series-of-almost-integers | 1 + Lang/Phix/Hofstadter-Conway-$10,000-sequence | 1 + Lang/Phix/Hofstadter-Figure-Figure-sequences | 1 + Lang/Phix/Hofstadter-Q-sequence | 1 + Lang/Phix/Hostname | 1 + Lang/Phix/Hough-transform | 1 + Lang/Phix/Image-convolution | 1 + Lang/Phix/Image-noise | 1 + Lang/Phix/Introspection | 1 + Lang/Phix/Inverted-syntax | 1 + Lang/Phix/K-d-tree | 1 + Lang/Phix/K-means++-clustering | 1 + Lang/Phix/Mad-Libs | 1 + Lang/Phix/Magic-squares-of-odd-order | 1 + Lang/Phix/Median-filter | 1 + Lang/Phix/Metaprogramming | 1 + Lang/Phix/Modular-exponentiation | 1 + Lang/Phix/Modular-inverse | 1 + Lang/Phix/Multiple-regression | 1 + Lang/Phix/Multiplicative-order | 1 + Lang/Phix/Munching-squares | 1 + Lang/Phix/Narcissist | 1 + Lang/Phix/Numeric-error-propagation | 1 + ...ical-integration-Gauss-Legendre-Quadrature | 1 + Lang/Phix/Object-serialization | 1 + Lang/Phix/Paraffins | 1 + Lang/Phix/Parallel-calculations | 1 + Lang/Phix/Parse-an-IP-Address | 1 + Lang/Phix/Pattern-matching | 1 + Lang/Phix/Penneys-game | 1 + .../Phix/Percentage-difference-between-images | 1 + Lang/Phix/Percolation-Bond-percolation | 1 + Lang/Phix/Percolation-Mean-cluster-density | 1 + Lang/Phix/Percolation-Mean-run-density | 1 + Lang/Phix/Percolation-Site-percolation | 1 + Lang/Phix/Permutations-Rank-of-a-permutation | 1 + Lang/Phix/Pig-the-dice-game | 1 + Lang/Phix/Pig-the-dice-game-Player | 1 + Lang/Phix/Play-recorded-sounds | 1 + Lang/Phix/Polynomial-long-division | 1 + Lang/Phix/Problem-of-Apollonius | 1 + Lang/Phix/QR-decomposition | 1 + Lang/Phix/RSA-code | 1 + Lang/Phix/Ranking-methods | 1 + Lang/Phix/Rate-counter | 1 + Lang/Phix/Rendezvous | 1 + Lang/Phix/Resistor-mesh | 1 + Lang/Phix/Secure-temporary-file | 1 + Lang/Phix/Set-consolidation | 1 + Lang/Phix/Set-of-real-numbers | 1 + .../Seven-sided-dice-from-five-sided-dice | 1 + Lang/Phix/Sokoban | 1 + Lang/Phix/Soundex | 1 + Lang/Phix/Sparkline-in-unicode | 1 + Lang/Phix/Subtractive-generator | 1 + Lang/Phix/Text-processing-2 | 1 + Lang/Phix/The-ISAAC-Cipher | 1 + Lang/Phix/Thieles-interpolation-formula | 1 + Lang/Phix/Topic-variable | 1 + Lang/Phix/Topological-sort | 1 + Lang/Phix/Total-circles-area | 1 + Lang/Phix/Truncate-a-file | 1 + Lang/Phix/Ulam-spiral--for-primes- | 1 + Lang/Phix/Vampire-number | 1 + Lang/Phix/Variable-size-Set | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + .../Phix/Verify-distribution-uniformity-Naive | 1 + Lang/Phix/Vogels-approximation-method | 1 + Lang/Phix/Web-scraping | 1 + Lang/Phix/World-Cup-group-stage | 1 + Lang/Phix/Write-to-Windows-event-log | 1 + Lang/Phix/XML-DOM-serialization | 1 + Lang/Phix/Y-combinator | 1 + Lang/Phix/Zeckendorf-arithmetic | 1 + Lang/Picat/00DESCRIPTION | 13 +- Lang/Picat/100-doors | 1 + Lang/Picat/24-game-Solve | 1 + Lang/Picat/99-Bottles-of-Beer | 1 + Lang/Picat/Caesar-cipher | 1 + Lang/Picat/N-queens-problem | 1 + Lang/Picat/Solve-the-no-connection-puzzle | 1 + Lang/PicoLisp/Continued-fraction | 1 + Lang/Pony/100-doors | 1 + Lang/Pony/A+B | 1 + Lang/Pony/Accumulator-factory | 1 + Lang/Pony/Array-concatenation | 1 + Lang/Pony/Sieve-of-Eratosthenes | 1 + Lang/PowerBASIC/CRC-32 | 1 + Lang/PowerBASIC/Find-common-directory-path | 1 + Lang/PowerBASIC/Hello-world-Text | 1 + .../Luhn-test-of-credit-card-numbers | 1 + Lang/PowerBASIC/Matrix-transposition | 1 + Lang/PowerBASIC/Reverse-a-string | 1 + Lang/PowerShell/Unix-ls | 1 + Lang/Processing/Anagrams | 1 + Lang/Processing/Animation | 1 + Lang/Processing/Binary-digits | 1 + Lang/Processing/Bulls-and-cows | 1 + Lang/Processing/Color-of-a-screen-pixel | 1 + Lang/Processing/Fibonacci-sequence | 1 + Lang/Processing/Image-noise | 1 + Lang/Processing/Include-a-file | 1 + Lang/Processing/Josephus-problem | 1 + Lang/Processing/Levenshtein-distance | 1 + Lang/Processing/Rename-a-file | 1 + Lang/Processing/Repeat-a-string | 1 + Lang/Prolog/Binary-strings | 1 + Lang/Prolog/Calendar | 1 + Lang/Prolog/Chat-server | 1 + Lang/Prolog/Collections | 1 + Lang/Prolog/Compound-data-type | 1 + Lang/Prolog/Copy-a-string | 1 + Lang/Prolog/Create-an-HTML-table | 1 + Lang/Prolog/Day-of-the-week | 1 + Lang/Prolog/Exceptions | 1 + Lang/Prolog/Five-weekends | 1 + Lang/Prolog/Four-bit-adder | 1 + Lang/Prolog/Inverted-syntax | 1 + Lang/Prolog/Loops-Downward-for | 1 + Lang/Prolog/Loops-For | 1 + Lang/Prolog/Loops-For-with-a-specified-step | 1 + Lang/Prolog/Loops-N-plus-one-half | 1 + Lang/Prolog/Metaprogramming | 1 + Lang/Prolog/Minesweeper-game | 1 + Lang/Prolog/Named-parameters | 1 + Lang/Prolog/Penneys-game | 1 + Lang/Prolog/Program-name | 1 + Lang/Prolog/Rock-paper-scissors | 1 + Lang/Pure-Data/100-doors | 1 + Lang/PureBasic/Function-prototype | 1 + Lang/PureBasic/Hofstadter-Q-sequence | 1 + Lang/PureBasic/Quickselect-algorithm | 1 + .../Bitmap-PPM-conversion-through-a-pipe | 1 + .../Bitmap-Read-an-image-through-a-pipe | 1 + Lang/Python/Catmull-Clark-subdivision-surface | 1 + Lang/Python/Checkpoint-synchronization | 1 + Lang/Python/Colour-pinstripe-Printer | 1 + Lang/Python/Deconvolution-2D+ | 1 + Lang/Python/Video-display-modes | 1 + Lang/Python/Zeckendorf-arithmetic | 1 + Lang/Q/99-Bottles-of-Beer | 1 + Lang/Q/Array-concatenation | 1 + Lang/Q/Averages-Arithmetic-mean | 1 + Lang/Q/Averages-Mode | 1 + Lang/Q/CSV-data-manipulation | 1 + Lang/Q/Detect-division-by-zero | 1 + Lang/Q/Filter | 1 + Lang/Q/Flatten-a-list | 1 + Lang/Q/Integer-sequence | 1 + Lang/Q/Leap-year | 1 + Lang/Q/Luhn-test-of-credit-card-numbers | 1 + Lang/Q/Operator-precedence | 1 + Lang/Q/SEDOLs | 1 + Lang/Q/Sum-multiples-of-3-and-5 | 1 + Lang/Q/Sum-of-a-series | 1 + Lang/Q/Sum-of-squares | 1 + Lang/R/Average-loop-length | 1 + Lang/R/Binary-digits | 1 + Lang/R/CRC-32 | 1 + Lang/R/Check-Machin-like-formulas | 1 + Lang/R/Convert-decimal-number-to-rational | 1 + Lang/R/Generate-Chess960-starting-position | 1 + Lang/R/Hello-world-Newline-omission | 1 + Lang/R/Pi | 1 + Lang/R/Remove-duplicate-elements | 1 + Lang/R/SHA-1 | 1 + Lang/R/SHA-256 | 1 + Lang/R/Topswops | 1 + Lang/REALbasic/00DESCRIPTION | 2 +- Lang/REXX/00DESCRIPTION | 9 + Lang/REXX/Animation | 1 + Lang/REXX/Galton-box-animation | 1 + Lang/REXX/Longest-increasing-subsequence | 1 + Lang/REXX/Polymorphic-copy | 1 + Lang/REXX/User-input-Graphical | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + Lang/REXX/World-Cup-group-stage | 1 + Lang/RPG/99-Bottles-of-Beer | 1 + Lang/RPG/Leap-year | 1 + Lang/RPL/Dot-product | 1 + Lang/Red/24-game | 1 + Lang/Red/Bulls-and-cows | 1 + Lang/Red/Copy-a-string | 1 + Lang/Red/Create-an-HTML-table | 1 + Lang/Red/Guess-the-number | 1 + Lang/Red/Sorting-algorithms-Quicksort | 1 + Lang/Retro/00DESCRIPTION | 6 +- Lang/Ring/Sokoban | 1 + Lang/Robotic/00DESCRIPTION | 2 +- Lang/Robotic/A+B | 1 + Lang/Robotic/Arithmetic-Integer | 1 + Lang/Robotic/Arrays | 1 + Lang/Robotic/Bitwise-operations | 1 + Lang/Robotic/Comments | 1 + Lang/Robotic/Empty-program | 1 + Lang/Robotic/FizzBuzz | 1 + Lang/Robotic/Reverse-a-string | 1 + Lang/Robotic/String-length | 1 + Lang/Robotic/User-input-Text | 1 + Lang/Ruby/HTTPS-Authenticated | 1 + Lang/Ruby/HTTPS-Client-authenticated | 1 + Lang/Ruby/SQL-based-authentication | 1 + Lang/Rust/Active-Directory-Connect | 1 + Lang/Rust/Active-object | 1 + Lang/Rust/Anagrams-Deranged-anagrams | 1 + Lang/Rust/Anonymous-recursion | 1 + .../Append-a-record-to-the-end-of-a-text-file | 1 + Lang/Rust/Arithmetic-evaluation | 1 + .../Arithmetic-geometric-mean-Calculate-Pi | 1 + Lang/Rust/Bitmap | 1 + Lang/Rust/Bitmap-Bresenhams-line-algorithm | 1 + Lang/Rust/Bitmap-Flood-fill | 1 + Lang/Rust/Box-the-compass | 1 + Lang/Rust/CSV-data-manipulation | 1 + Lang/Rust/CSV-to-HTML-translation | 1 + Lang/Rust/Calendar | 1 + Lang/Rust/Conways-Game-of-Life | 1 + Lang/Rust/Count-in-factors | 1 + Lang/Rust/Create-a-file-on-magnetic-tape | 1 + Lang/Rust/Define-a-primitive-data-type | 1 + Lang/Rust/Delegates | 1 + Lang/Rust/Documentation | 1 + Lang/Rust/Environment-variables | 1 + Lang/Rust/Euler-method | 1 + Lang/Rust/Events | 1 + ...Catch-an-exception-thrown-in-a-nested-call | 1 + Lang/Rust/Find-common-directory-path | 1 + Lang/Rust/Floyds-triangle | 1 + Lang/Rust/Fork | 1 + Lang/Rust/Four-bit-adder | 1 + Lang/Rust/Gaussian-elimination | 1 + Lang/Rust/Generator-Exponential | 1 + Lang/Rust/History-variables | 1 + Lang/Rust/Host-introspection | 1 + Lang/Rust/Hostname | 1 + Lang/Rust/I-before-E-except-after-C | 1 + Lang/Rust/Inheritance-Multiple | 1 + Lang/Rust/Inheritance-Single | 1 + Lang/Rust/Josephus-problem | 1 + Lang/Rust/Knapsack-problem-Continuous | 1 + Lang/Rust/LU-decomposition | 1 + Lang/Rust/Largest-int-from-concatenated-ints | 1 + Lang/Rust/Longest-string-challenge | 1 + Lang/Rust/MD5-Implementation | 1 + Lang/Rust/Machine-code | 1 + Lang/Rust/Mad-Libs | 1 + Lang/Rust/Main-step-of-GOST-28147-89 | 1 + Lang/Rust/Maze-generation | 1 + Lang/Rust/Maze-solving | 1 + Lang/Rust/Memory-allocation | 1 + Lang/Rust/Modular-exponentiation | 1 + Lang/Rust/Morse-code | 1 + Lang/Rust/Move-to-front-algorithm | 1 + Lang/Rust/Multiple-distinct-objects | 1 + Lang/Rust/Number-names | 1 + Lang/Rust/Object-serialization | 1 + Lang/Rust/One-dimensional-cellular-automata | 1 + Lang/Rust/Order-two-numerical-lists | 1 + .../Rust/Percentage-difference-between-images | 1 + Lang/Rust/Pi | 1 + Lang/Rust/Regular-expressions | 1 + Lang/Rust/Roots-of-unity | 1 + Lang/Rust/Sierpinski-carpet | 1 + .../Sort-an-array-of-composite-structures | 1 + Lang/Rust/Strip-comments-from-a-string | 1 + Lang/Rust/Sudoku | 1 + Lang/Rust/Terminal-control-Clear-the-screen | 1 + Lang/Rust/Ternary-logic | 1 + Lang/Rust/Trabb-Pardo-Knuth-algorithm | 1 + Lang/Rust/URL-decoding | 1 + Lang/Rust/URL-encoding | 1 + Lang/Rust/Variable-size-Get | 1 + Lang/Rust/Write-language-name-in-3D-ASCII | 1 + Lang/Rust/XML-Output | 1 + Lang/SQL/Arithmetic-geometric-mean | 1 + Lang/SQL/Averages-Mode | 1 + Lang/SQL/Averages-Pythagorean-means | 1 + Lang/SQL/Day-of-the-week | 1 + Lang/SQL/Hamming-numbers | 1 + .../SQL/Sort-an-array-of-composite-structures | 1 + Lang/SQL/Sudoku | 1 + Lang/Scala/00DESCRIPTION | 6 + Lang/Scala/Flipping-bits-game | 1 + .../Guess-the-number-With-feedback--player- | 1 + Lang/Scala/Honeycombs | 1 + Lang/Scala/Ludic-numbers | 1 + Lang/Scala/Morse-code | 1 + ...ical-integration-Gauss-Legendre-Quadrature | 1 + Lang/Scala/Pig-the-dice-game | 1 + Lang/Scala/Polynomial-regression | 1 + Lang/Scala/Self-referential-sequence | 1 + Lang/Scala/Solve-the-no-connection-puzzle | 1 + Lang/Scala/Truncatable-primes | 1 + Lang/Scala/Universal-Turing-machine | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + Lang/Scala/Voronoi-diagram | 1 + Lang/Scheme/AKS-test-for-primes | 1 + Lang/Scheme/Deepcopy | 1 + Lang/Scheme/Pi | 1 + Lang/Scheme/Zeckendorf-number-representation | 1 + Lang/Seed7/00DESCRIPTION | 3 +- ...ficient-and-perfect-number-classifications | 1 + Lang/Seed7/Almost-prime | 1 + Lang/Seed7/Bernoulli-numbers | 1 + Lang/Seed7/Bitcoin-address-validation | 1 + Lang/Seed7/Bitcoin-public-point-to-address | 1 + Lang/Seed7/Bitwise-IO | 1 + Lang/Seed7/Pernicious-numbers | 1 + Lang/Seed7/Phrase-reversals | 1 + Lang/Seed7/RIPEMD-160 | 1 + Lang/Seed7/Start-from-a-main-routine | 1 + Lang/Seed7/Terminal-control-Unicode-output | 1 + Lang/Seed7/Unix-ls | 1 + Lang/Sidef/00DESCRIPTION | 5 +- Lang/Sidef/Flow-control-structures | 1 + .../Sidef/Generate-Chess960-starting-position | 1 + Lang/Sidef/Iterated-digits-squaring | 1 + Lang/Sidef/Metronome | 1 + Lang/Sidef/Percolation-Site-percolation | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + Lang/Simula/Anagrams-Deranged-anagrams | 1 + Lang/Simula/Average-loop-length | 1 + Lang/Simula/Balanced-brackets | 1 + Lang/Simula/Binary-digits | 1 + Lang/Simula/Binary-search | 1 + Lang/Simula/Bitwise-operations | 1 + Lang/Simula/Calendar | 1 + Lang/Simula/Dining-philosophers | 1 + Lang/Simula/Perfect-numbers | 1 + Lang/Simula/Pi | 1 + Lang/Simula/Prime-decomposition | 1 + Lang/Simula/Reverse-a-string | 1 + Lang/Simula/Zeckendorf-number-representation | 1 + Lang/Smalltalk/Calendar | 1 + Lang/Smalltalk/Delegates | 1 + Lang/Smalltalk/Identity-matrix | 1 + Lang/Smalltalk/Loops-Continue | 1 + Lang/Smalltalk/Run-length-encoding | 1 + Lang/SmileBASIC/00DESCRIPTION | 2 +- Lang/SmileBASIC/99-Bottles-of-Beer | 1 + Lang/SmileBASIC/Ackermann-function | 1 + Lang/SmileBASIC/Character-codes | 1 + Lang/SmileBASIC/Color-of-a-screen-pixel | 1 + Lang/SmileBASIC/Colour-bars-Display | 1 + Lang/SmileBASIC/Colour-pinstripe-Display | 1 + Lang/SmileBASIC/Digital-root | 1 + Lang/SmileBASIC/Hello-world-Graphical | 1 + Lang/SmileBASIC/Quine | 1 + .../Terminal-control-Clear-the-screen | 1 + Lang/Spin/00DESCRIPTION | 10 +- Lang/Spin/100-doors | 1 + Lang/Spin/Factorial | 1 + Lang/Spin/Fibonacci-sequence | 1 + Lang/Spin/Loops-Break | 1 + Lang/Spin/Loops-Continue | 1 + Lang/Spin/Loops-Do-while | 1 + Lang/Spin/Loops-Downward-for | 1 + Lang/Spin/Loops-For | 1 + Lang/Spin/Loops-For-with-a-specified-step | 1 + Lang/Spin/Loops-Infinite | 1 + Lang/Spin/Loops-N-plus-one-half | 1 + Lang/Spin/Loops-While | 1 + Lang/Spin/Mandelbrot-set | 1 + Lang/Standard-ML/Element-wise-operations | 1 + Lang/Standard-ML/Matrix-multiplication | 1 + Lang/Standard-ML/QR-decomposition | 1 + Lang/Stata/00DESCRIPTION | 4 +- Lang/Stata/First-class-functions | 1 + Lang/Stata/Logical-operations | 1 + Lang/Stata/Monty-Hall-problem | 1 + Lang/Stata/Sorting-algorithms-Bubble-sort | 1 + Lang/Stata/Sorting-algorithms-Heapsort | 1 + Lang/SuperCollider/Call-an-object-method | 1 + Lang/Swift/00DESCRIPTION | 2 +- Lang/Swift/Atomic-updates | 1 + Lang/Swift/Break-OO-privacy | 1 + Lang/Swift/Bulls-and-cows | 1 + Lang/Swift/Cholesky-decomposition | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/Swift/Closest-pair-problem | 1 + Lang/Swift/Combinations-and-permutations | 1 + Lang/Swift/Count-the-coins | 1 + Lang/Swift/Deal-cards-for-FreeCell | 1 + Lang/Swift/Enforced-immutability | 1 + Lang/Swift/Evolutionary-algorithm | 1 + Lang/Swift/Exponentiation-operator | 1 + Lang/Swift/Extensible-prime-generator | 1 + ...est-left-truncatable-prime-in-a-given-base | 1 + Lang/Swift/Forward-difference | 1 + Lang/Swift/Harshad-or-Niven-series | 1 + Lang/Swift/Identity-matrix | 1 + Lang/Swift/Iterated-digits-squaring | 1 + Lang/Swift/Knapsack-problem-0-1 | 1 + Lang/Swift/Letter-frequency | 1 + Lang/Swift/Longest-increasing-subsequence | 1 + Lang/Swift/Look-and-say-sequence | 1 + Lang/Swift/Lucas-Lehmer-test | 1 + Lang/Swift/Machine-code | 1 + Lang/Swift/Magic-squares-of-odd-order | 1 + Lang/Swift/Map-range | 1 + Lang/Swift/Monty-Hall-problem | 1 + Lang/Swift/Multifactorial | 1 + Lang/Swift/N-queens-problem | 1 + Lang/Swift/Number-names | 1 + Lang/Swift/Numerical-integration | 1 + Lang/Swift/Order-disjoint-list-items | 1 + Lang/Swift/Percolation-Bond-percolation | 1 + Lang/Swift/Prime-decomposition | 1 + Lang/Swift/Quaternion-type | 1 + Lang/Swift/Rep-string | 1 + Lang/Swift/Rock-paper-scissors | 1 + Lang/Swift/Sorting-algorithms-Cocktail-sort | 1 + Lang/Swift/Stern-Brocot-sequence | 1 + Lang/Swift/Top-rank-per-group | 1 + Lang/Swift/Vampire-number | 1 + Lang/Swift/Van-der-Corput-sequence | 1 + Lang/Symsyn/00DESCRIPTION | 2 +- Lang/TI-83-BASIC/00DESCRIPTION | 51 +- Lang/TI-83-BASIC/Digital-root | 1 + Lang/TI-83-BASIC/Fractran | 1 + Lang/TI-83-BASIC/Reduced-row-echelon-form | 1 + Lang/Tcl/00DESCRIPTION | 11 +- Lang/Transact-SQL/Haversine-formula | 1 + Lang/TypeScript/99-Bottles-of-Beer | 1 + Lang/TypeScript/Function-composition | 1 + Lang/TypeScript/Haversine-formula | 1 + Lang/TypeScript/Palindrome-detection | 1 + Lang/TypeScript/Pi | 1 + Lang/UNIX-Shell/N-queens-problem | 1 + Lang/VBA/9-billion-names-of-God-the-integer | 1 + Lang/VBA/AKS-test-for-primes | 1 + Lang/VBA/Ackermann-function | 1 + Lang/VBA/Almost-prime | 1 + Lang/VBA/Arithmetic-geometric-mean | 1 + Lang/VBA/Arrays | 1 + Lang/VBA/Assertions | 1 + Lang/VBA/Average-loop-length | 1 + Lang/VBA/Averages-Arithmetic-mean | 1 + Lang/VBA/Averages-Mean-angle | 1 + Lang/VBA/Averages-Mean-time-of-day | 1 + Lang/VBA/Averages-Median | 1 + Lang/VBA/Averages-Mode | 1 + Lang/VBA/Averages-Pythagorean-means | 1 + Lang/VBA/Averages-Simple-moving-average | 1 + Lang/VBA/Boolean-values | 1 + Lang/VBA/Box-the-compass | 1 + Lang/VBA/CSV-to-HTML-translation | 1 + Lang/VBA/Call-a-function | 1 + Lang/VBA/Case-sensitivity-of-identifiers | 1 + Lang/VBA/Catamorphism | 1 + Lang/VBA/Chinese-remainder-theorem | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/VBA/Compound-data-type | 1 + Lang/VBA/Concurrent-computing | 1 + Lang/VBA/Continued-fraction | 1 + Lang/VBA/Copy-a-string | 1 + Lang/VBA/Count-the-coins | 1 + Lang/VBA/Create-a-file | 1 + Lang/VBA/Digital-root | 1 + Lang/VBA/Dining-philosophers | 1 + Lang/VBA/Dot-product | 1 + Lang/VBA/Euler-method | 1 + Lang/VBA/Exponentiation-operator | 1 + Lang/VBA/Fractran | 1 + Lang/VBA/Gaussian-elimination | 1 + Lang/VBA/Generator-Exponential | 1 + Lang/VBA/Hailstone-sequence | 1 + Lang/VBA/Hamming-numbers | 1 + Lang/VBA/Haversine-formula | 1 + Lang/VBA/Hello-world-Graphical | 1 + Lang/VBA/Hello-world-Standard-error | 1 + Lang/VBA/Heronian-triangles | 1 + Lang/VBA/Hofstadter-Conway-$10,000-sequence | 1 + Lang/VBA/Hofstadter-Figure-Figure-sequences | 1 + Lang/VBA/Hofstadter-Q-sequence | 1 + Lang/VBA/Holidays-related-to-Easter | 1 + Lang/VBA/IBAN | 1 + Lang/VBA/Identity-matrix | 1 + Lang/VBA/Input-loop | 1 + Lang/VBA/Integer-comparison | 1 + Lang/VBA/Jensens-Device | 1 + Lang/VBA/Jump-anywhere | 1 + Lang/VBA/Knuth-shuffle | 1 + Lang/VBA/LU-decomposition | 1 + Lang/VBA/Leap-year | 1 + Lang/VBA/Least-common-multiple | 1 + Lang/VBA/Levenshtein-distance | 1 + Lang/VBA/Linear-congruential-generator | 1 + Lang/VBA/Loops-Break | 1 + Lang/VBA/Loops-Continue | 1 + Lang/VBA/Loops-Do-while | 1 + Lang/VBA/Loops-Downward-for | 1 + Lang/VBA/Loops-N-plus-one-half | 1 + Lang/VBA/Loops-Nested | 1 + Lang/VBA/Loops-While | 1 + Lang/VBA/Matrix-exponentiation-operator | 1 + Lang/VBA/Matrix-multiplication | 1 + Lang/VBA/Matrix-transposition | 1 + Lang/VBA/Modular-inverse | 1 + Lang/VBA/Mutual-recursion | 1 + Lang/VBA/Named-parameters | 1 + Lang/VBA/Narcissist | 1 + Lang/VBA/Narcissistic-decimal-number | 1 + Lang/VBA/Non-decimal-radices-Convert | 1 + Lang/VBA/Nth | 1 + Lang/VBA/Nth-root | 1 + Lang/VBA/Null-object | 1 + Lang/VBA/Number-names | 1 + Lang/VBA/Number-reversal-game | 1 + Lang/VBA/Optional-parameters | 1 + Lang/VBA/Order-two-numerical-lists | 1 + Lang/VBA/Pascals-triangle | 1 + Lang/VBA/Perfect-numbers | 1 + Lang/VBA/Pernicious-numbers | 1 + Lang/VBA/Plot-coordinate-pairs | 1 + Lang/VBA/Pointers-and-references | 1 + Lang/VBA/Polynomial-long-division | 1 + Lang/VBA/Polynomial-regression | 1 + Lang/VBA/Power-set | 1 + Lang/VBA/Priority-queue | 1 + Lang/VBA/Program-termination | 1 + Lang/VBA/Pythagorean-triples | 1 + Lang/VBA/QR-decomposition | 1 + Lang/VBA/Quaternion-type | 1 + Lang/VBA/Queue-Definition | 1 + Lang/VBA/Queue-Usage | 1 + Lang/VBA/Quickselect-algorithm | 1 + Lang/VBA/Quine | 1 + Lang/VBA/Reduced-row-echelon-form | 1 + Lang/VBA/Roman-numerals-Encode | 1 + Lang/VBA/Roots-of-unity | 1 + Lang/VBA/Search-a-list | 1 + Lang/VBA/Set | 1 + Lang/VBA/Set-consolidation | 1 + .../VBA/Seven-sided-dice-from-five-sided-dice | 1 + Lang/VBA/Short-circuit-evaluation | 1 + Lang/VBA/Sierpinski-carpet | 1 + Lang/VBA/Sierpinski-triangle | 1 + Lang/VBA/Sieve-of-Eratosthenes | 1 + Lang/VBA/Sorting-algorithms-Bead-sort | 1 + Lang/VBA/Sorting-algorithms-Bogosort | 1 + Lang/VBA/Sorting-algorithms-Bubble-sort | 1 + Lang/VBA/Sorting-algorithms-Cocktail-sort | 1 + Lang/VBA/Sorting-algorithms-Comb-sort | 1 + Lang/VBA/Sorting-algorithms-Counting-sort | 1 + Lang/VBA/Sorting-algorithms-Gnome-sort | 1 + Lang/VBA/Sorting-algorithms-Insertion-sort | 1 + Lang/VBA/Statistics-Basic | 1 + Lang/VBA/String-matching | 1 + Lang/VBA/Strip-block-comments | 1 + ...trip-whitespace-from-a-string-Top-and-tail | 1 + Lang/VBA/Substring | 1 + Lang/VBA/Sum-and-product-of-an-array | 1 + Lang/VBA/Sum-of-a-series | 1 + Lang/VBA/Sum-of-squares | 1 + Lang/VBA/Time-a-function | 1 + Lang/VBA/Top-rank-per-group | 1 + Lang/VBA/Total-circles-area | 1 + Lang/VBA/Tree-traversal | 1 + Lang/VBA/Trigonometric-functions | 1 + Lang/VBA/Twelve-statements | 1 + Lang/VBA/Universal-Turing-machine | 1 + Lang/VBA/User-input-Text | 1 + Lang/VBA/Van-der-Corput-sequence | 1 + Lang/VBA/Vector-products | 1 + ...y-distribution-uniformity-Chi-squared-test | 1 + Lang/VBA/Write-float-arrays-to-a-text-file | 1 + Lang/VBA/Y-combinator | 1 + Lang/VBA/Zebra-puzzle | 1 + Lang/VBA/Zeckendorf-number-representation | 1 + Lang/VBA/Zero-to-the-zero-power | 1 + Lang/VBA/Zhang-Suen-thinning-algorithm | 1 + Lang/VBScript/Align-columns | 1 + .../VBScript/Bitmap-Bresenhams-line-algorithm | 1 + Lang/VBScript/Boolean-values | 1 + Lang/VBScript/Gaussian-elimination | 1 + Lang/VBScript/Last-letter-first-letter | 1 + Lang/VBScript/Queue-Definition | 1 + Lang/VBScript/Roman-numerals-Decode | 1 + Lang/VHDL/Arrays | 1 + Lang/Vala/00DESCRIPTION | 4 +- Lang/Vala/Hello-world-Graphical | 1 + Lang/Verilog/Greatest-common-divisor | 1 + Lang/Visual-Basic-.NET/00DESCRIPTION | 2 +- ...ficient-and-perfect-number-classifications | 1 + Lang/Visual-Basic-.NET/Almost-prime | 1 + .../Apply-a-callback-to-an-array | 1 + .../Arbitrary-precision-integers--included- | 1 + .../Arithmetic-geometric-mean | 1 + .../Arithmetic-geometric-mean-Calculate-Pi | 1 + Lang/Visual-Basic-.NET/Averages-Mean-angle | 1 + .../Averages-Pythagorean-means | 1 + Lang/Visual-Basic-.NET/Break-OO-privacy | 1 + .../Visual-Basic-.NET/CSV-to-HTML-translation | 1 + Lang/Visual-Basic-.NET/Caesar-cipher | 1 + Lang/Visual-Basic-.NET/Calendar | 1 + .../Calendar---for-REAL-programmers | 1 + Lang/Visual-Basic-.NET/Catalan-numbers | 1 + Lang/Visual-Basic-.NET/Chat-server | 1 + .../Check-Machin-like-formulas | 1 + .../Chinese-remainder-theorem | 1 + ...Circles-of-given-radius-through-two-points | 1 + Lang/Visual-Basic-.NET/Comma-quibbling | 1 + .../Compile-time-calculation | 1 + Lang/Visual-Basic-.NET/Continued-fraction | 1 + .../Count-occurrences-of-a-substring | 1 + .../Create-a-two-dimensional-array-at-runtime | 1 + Lang/Visual-Basic-.NET/Create-an-HTML-table | 1 + Lang/Visual-Basic-.NET/Currying | 1 + Lang/Visual-Basic-.NET/Digital-root | 1 + Lang/Visual-Basic-.NET/Dot-product | 1 + Lang/Visual-Basic-.NET/Empty-string | 1 + Lang/Visual-Basic-.NET/Even-or-odd | 1 + ...Catch-an-exception-thrown-in-a-nested-call | 1 + Lang/Visual-Basic-.NET/Factorial | 1 + Lang/Visual-Basic-.NET/Floyds-triangle | 1 + .../GUI-Maximum-window-dimensions | 1 + Lang/Visual-Basic-.NET/Generator-Exponential | 1 + Lang/Visual-Basic-.NET/Guess-the-number | 1 + Lang/Visual-Basic-.NET/Haversine-formula | 1 + .../Hello-world-Newline-omission | 1 + .../Hello-world-Standard-error | 1 + Lang/Visual-Basic-.NET/Higher-order-functions | 1 + .../Horners-rule-for-polynomial-evaluation | 1 + .../I-before-E-except-after-C | 1 + Lang/Visual-Basic-.NET/Josephus-problem | 1 + Lang/Visual-Basic-.NET/Kaprekar-numbers | 1 + Lang/Visual-Basic-.NET/Leap-year | 1 + .../Loop-over-multiple-arrays-simultaneously | 1 + Lang/Visual-Basic-.NET/Loops-Break | 1 + Lang/Visual-Basic-.NET/Loops-Nested | 1 + Lang/Visual-Basic-.NET/Mad-Libs | 1 + Lang/Visual-Basic-.NET/Make-directory-path | 1 + Lang/Visual-Basic-.NET/Modular-exponentiation | 1 + Lang/Visual-Basic-.NET/Palindrome-detection | 1 + .../Parsing-RPN-to-infix-conversion | 1 + .../Parsing-Shunting-yard-algorithm | 1 + .../Partial-function-application | 1 + Lang/Visual-Basic-.NET/Pascals-triangle | 1 + Lang/Visual-Basic-.NET/Pernicious-numbers | 1 + Lang/Visual-Basic-.NET/Pi | 1 + Lang/Visual-Basic-.NET/Pick-random-element | 1 + Lang/Visual-Basic-.NET/Quaternion-type | 1 + Lang/Visual-Basic-.NET/Quine | 1 + Lang/Visual-Basic-.NET/RSA-code | 1 + .../Short-circuit-evaluation | 1 + Lang/Visual-Basic-.NET/Sleep | 1 + .../Start-from-a-main-routine | 1 + Lang/Visual-Basic-.NET/Stern-Brocot-sequence | 1 + Lang/Visual-Basic-.NET/String-length | 1 + .../Sum-and-product-of-an-array | 1 + .../Terminal-control-Clear-the-screen | 1 + .../The-Twelve-Days-of-Christmas | 1 + .../Visual-Basic-.NET/Trigonometric-functions | 1 + Lang/Visual-Basic-.NET/Unicode-strings | 1 + .../Visual-Basic-.NET/Van-der-Corput-sequence | 1 + .../Write-language-name-in-3D-ASCII | 1 + Lang/Visual-Basic-.NET/Zero-to-the-zero-power | 1 + Lang/Visual-Basic/CRC-32 | 1 + Lang/Visual-Basic/Count-the-coins | 1 + Lang/Visual-Basic/Dot-product | 1 + Lang/Visual-Basic/Environment-variables | 1 + Lang/Visual-Basic/Factorial | 1 + Lang/Visual-Basic/File-size | 1 + Lang/Visual-Basic/Find-common-directory-path | 1 + Lang/Visual-Basic/Greatest-common-divisor | 1 + Lang/Visual-Basic/HTTP | 1 + Lang/Visual-Basic/HTTPS | 1 + Lang/Visual-Basic/HTTPS-Authenticated | 1 + Lang/Visual-Basic/Hello-world-Text | 1 + Lang/Visual-Basic/Hostname | 1 + Lang/Visual-Basic/Identity-matrix | 1 + Lang/Visual-Basic/Levenshtein-distance | 1 + Lang/Visual-Basic/Literals-Floating-point | 1 + Lang/Visual-Basic/Literals-Integer | 1 + Lang/Visual-Basic/Literals-String | 1 + .../Luhn-test-of-credit-card-numbers | 1 + Lang/Visual-Basic/Matrix-transposition | 1 + Lang/Visual-Basic/Pi | 1 + Lang/Visual-Basic/Pythagorean-triples | 1 + Lang/Visual-Basic/Read-entire-file | 1 + Lang/Visual-Basic/Repeat-a-string | 1 + Lang/Visual-Basic/Reverse-a-string | 1 + Lang/Visual-Basic/String-case | 1 + Lang/Visual-Objects/Comments | 1 + Lang/Visual-Objects/Create-a-file | 1 + Lang/Visual-Objects/Day-of-the-week | 1 + Lang/X86-Assembly/Caesar-cipher | 1 + Lang/X86-Assembly/FizzBuzz | 1 + Lang/XPath-2.0/Tokenize-a-string | 1 + Lang/Xojo/00DESCRIPTION | 8 +- Lang/Xojo/100-doors | 1 + Lang/Xojo/Bitmap | 1 + Lang/Xojo/Comments | 1 + Lang/Xojo/Even-or-odd | 1 + Lang/Xojo/Fibonacci-sequence | 1 + Lang/Xojo/FizzBuzz | 1 + Lang/Xojo/Function-definition | 1 + Lang/Xojo/LZW-compression | 1 + Lang/Xojo/Literals-String | 1 + Lang/Xojo/Sieve-of-Eratosthenes | 1 + Lang/Xojo/Sorting-algorithms-Bubble-sort | 1 + Lang/Xojo/String-prepend | 1 + .../Create-a-two-dimensional-array-at-runtime | 1 + Lang/ZX-Spectrum-Basic/Draw-a-clock | 1 + Lang/ZX-Spectrum-Basic/Extend-your-language | 1 + Lang/ZX-Spectrum-Basic/Function-composition | 1 + Lang/ZX-Spectrum-Basic/Hello-world-Text | 1 + Lang/ZX-Spectrum-Basic/Jensens-Device | 1 + Lang/ZX-Spectrum-Basic/Josephus-problem | 1 + .../Sorting-algorithms-Bubble-sort | 1 + .../Sorting-algorithms-Cocktail-sort | 1 + Task/100-doors/00META.yaml | 1 + Task/100-doors/ARM-Assembly/100-doors-1.arm | 154 +++++ Task/100-doors/ARM-Assembly/100-doors-2.arm | 136 ++++ Task/100-doors/B/100-doors.b | 29 + Task/100-doors/BASIC/100-doors-10.basic | 9 + Task/100-doors/BASIC/100-doors-4.basic | 35 +- Task/100-doors/BASIC/100-doors-5.basic | 22 +- Task/100-doors/BASIC/100-doors-6.basic | 34 +- Task/100-doors/BASIC/100-doors-7.basic | 26 +- Task/100-doors/BASIC/100-doors-8.basic | 21 +- Task/100-doors/BASIC/100-doors-9.basic | 10 + Task/100-doors/Common-Lisp/100-doors-4.lisp | 2 +- .../Component-Pascal/100-doors.component | 2 +- Task/100-doors/Dart/100-doors-3.dart | 26 + Task/100-doors/Elena/100-doors.elena | 37 +- Task/100-doors/Elm/100-doors.elm | 3 +- Task/100-doors/Fish/100-doors.fish | 10 + Task/100-doors/Free-Pascal/100-doors.free | 34 + Task/100-doors/Futhark/100-doors.futhark | 12 +- Task/100-doors/Go/100-doors-1.go | 2 +- Task/100-doors/Mercury/100-doors.mercury | 52 +- Task/100-doors/Ol/100-doors.ol | 13 + Task/100-doors/PARI-GP/100-doors-3.pari | 4 + Task/100-doors/Picat/100-doors-1.picat | 16 + Task/100-doors/Picat/100-doors-2.picat | 6 + Task/100-doors/Picat/100-doors-3.picat | 2 + Task/100-doors/Pony/100-doors.pony | 114 ++++ Task/100-doors/Pure-Data/100-doors.pure | 78 +++ Task/100-doors/Spin/100-doors.spin | 34 + Task/100-doors/Stata/100-doors.stata | 2 +- Task/100-doors/Xojo/100-doors.xojo | 7 + Task/24-game-Solve/00META.yaml | 1 + .../24-game-Solve/Ceylon/24-game-solve.ceylon | 133 ++++ Task/24-game-Solve/Nim/24-game-solve.nim | 56 ++ ...{24-game-solve.pl6 => 24-game-solve-1.pl6} | 2 +- Task/24-game-Solve/Perl-6/24-game-solve-2.pl6 | 90 +++ .../24-game-Solve/Picat/24-game-solve-1.picat | 44 ++ .../24-game-Solve/Picat/24-game-solve-2.picat | 47 ++ Task/24-game-Solve/REXX/24-game-solve.rexx | 342 +++++++--- Task/24-game/00META.yaml | 4 + Task/24-game/Ceylon/24-game.ceylon | 250 +++---- Task/24-game/Elena/24-game.elena | 298 ++++---- Task/24-game/FreeBASIC/24-game.freebasic | 108 +++ Task/24-game/Modula-2/24-game.mod2 | 2 +- Task/24-game/REXX/24-game-1.rexx | 339 ++++++--- Task/24-game/Red/24-game.red | 34 + .../00META.yaml | 1 + ...9-billion-names-of-god-the-integer.crystal | 8 + .../Go/9-billion-names-of-god-the-integer.go | 48 +- .../9-billion-names-of-god-the-integer.julia | 38 ++ .../9-billion-names-of-god-the-integer.maple | 7 + .../9-billion-names-of-god-the-integer-1.phix | 32 + .../9-billion-names-of-god-the-integer-2.phix | 30 + .../9-billion-names-of-god-the-integer-3.phix | 30 + .../9-billion-names-of-god-the-integer.phix | 52 -- .../9-billion-names-of-god-the-integer.vba | 16 + Task/99-Bottles-of-Beer/00META.yaml | 1 + .../ALGOL-M/99-bottles-of-beer.algol-m | 32 + .../Astro/99-bottles-of-beer.astro | 16 +- .../Bc/99-bottles-of-beer.bc | 2 +- .../Clojure/99-bottles-of-beer-1.clj | 23 +- .../Elena/99-bottles-of-beer.elena | 46 +- .../Go/99-bottles-of-beer-1.go | 19 +- .../Golo/99-bottles-of-beer.golo | 19 + .../Haskell/99-bottles-of-beer-4.hs | 38 +- .../HolyC/99-bottles-of-beer.holyc | 29 + .../Neko/99-bottles-of-beer.neko | 31 + .../PHP/99-bottles-of-beer-6.php | 15 + .../Picat/99-bottles-of-beer.picat | 25 + .../Python/99-bottles-of-beer-3.py | 111 +++ .../Python/99-bottles-of-beer-4.py | 93 +++ .../99-Bottles-of-Beer/Q/99-bottles-of-beer.q | 2 + .../RPG/99-bottles-of-beer.rpg | 90 +++ .../Retro/99-bottles-of-beer.retro | 40 +- .../Rust/99-bottles-of-beer-1.rust | 18 + ...of-beer.rust => 99-bottles-of-beer-2.rust} | 0 .../SmileBASIC/99-bottles-of-beer.smilebasic | 49 ++ .../Swift/99-bottles-of-beer.swift | 8 +- .../TypeScript/99-bottles-of-beer.type | 18 + .../99-Bottles-of-Beer/V/99-bottles-of-beer.v | 2 +- ...of-beer.xslt => 99-bottles-of-beer-1.xslt} | 0 .../XSLT/99-bottles-of-beer-2.xslt | 20 + Task/A+B/00DESCRIPTION | 2 +- Task/A+B/BASIC/a+b-10.basic | 11 +- Task/A+B/BASIC/a+b-11.basic | 8 +- Task/A+B/BASIC/a+b-12.basic | 6 + Task/A+B/BASIC/a+b-4.basic | 2 +- Task/A+B/Elena/a+b-1.elena | 14 +- Task/A+B/Elena/a+b-2.elena | 18 +- Task/A+B/Golo/a+b.golo | 27 + Task/A+B/Julia/a+b-1.julia | 8 +- Task/A+B/Julia/a+b-2.julia | 2 +- Task/A+B/Neko/a+b.neko | 65 ++ Task/A+B/Pascal/a+b-3.pascal | 18 + Task/A+B/Phix/a+b.phix | 74 +- Task/A+B/Pony/a+b.pony | 24 + Task/A+B/REXX/a+b-4.rexx | 9 +- Task/A+B/REXX/a+b-5.rexx | 8 + Task/A+B/Retro/a+b-1.retro | 2 +- Task/A+B/Retro/a+b-2.retro | 4 +- Task/A+B/Robotic/a+b.robotic | 6 + Task/A+B/Ruby/a+b.rb | 2 +- .../ZX-Spectrum-Basic/{a+b.zx => a+b-1.zx} | 0 Task/A+B/ZX-Spectrum-Basic/a+b-2.zx | 9 + Task/ABC-Problem/00META.yaml | 4 + Task/ABC-Problem/Astro/abc-problem.astro | 13 +- Task/ABC-Problem/Elena/abc-problem.elena | 58 +- Task/ABC-Problem/Factor/abc-problem.factor | 45 ++ .../FreeBASIC/abc-problem.freebasic | 43 ++ Task/ABC-Problem/Haskell/abc-problem-2.hs | 13 +- Task/ABC-Problem/Mercury/abc-problem.mercury | 34 + .../C++/aks-test-for-primes.cpp | 88 +++ .../Crystal/aks-test-for-primes.crystal | 20 + .../Elena/aks-test-for-primes.elena | 112 ++- .../Factor/aks-test-for-primes.factor | 39 ++ .../Liberty-BASIC/aks-test-for-primes.liberty | 79 +++ .../Pascal/aks-test-for-primes.pascal | 133 ++-- .../Python/aks-test-for-primes-1.py | 4 +- .../Python/aks-test-for-primes-2.py | 27 +- .../Python/aks-test-for-primes-3.py | 33 +- .../Python/aks-test-for-primes-4.py | 15 + .../REXX/aks-test-for-primes-2.rexx | 25 +- .../Ruby/aks-test-for-primes-2.rb | 15 +- .../Scheme/aks-test-for-primes.ss | 56 ++ .../VBA/aks-test-for-primes.vba | 75 ++ Task/Abstract-type/C/abstract-type-2.c | 1 + Task/Abstract-type/C/abstract-type-3.c | 1 - .../Crystal/abstract-type.crystal | 40 ++ .../Mercury/abstract-type.mercury | 26 + .../00META.yaml | 1 + ...ent-and-perfect-number-classifications.ada | 38 ++ ...t-and-perfect-number-classifications.elena | 80 ++- ...ient-and-perfect-number-classifications.go | 55 +- ...cient-and-perfect-number-classifications.k | 11 + ...t-and-perfect-number-classifications.maple | 15 + ...ent-and-perfect-number-classifications.pl6 | 11 +- ...nt-and-perfect-number-classifications-1.pl | 6 +- ...nt-and-perfect-number-classifications-2.pl | 12 +- ...cient-and-perfect-number-classifications.l | 12 +- ...-and-perfect-number-classifications-1.rexx | 25 +- ...-and-perfect-number-classifications-2.rexx | 29 +- ...-and-perfect-number-classifications-3.rexx | 1 + ...t-and-perfect-number-classifications.seed7 | 39 ++ ...t-and-perfect-number-classifications.sidef | 10 +- ...-and-perfect-number-classifications.visual | 33 + .../Aime/accumulator-factory-1.aime | 17 + .../Aime/accumulator-factory-2.aime | 11 + .../Astro/accumulator-factory.astro | 10 +- .../Elena/accumulator-factory.elena | 18 +- .../Golo/accumulator-factory.golo | 23 +- .../Mercury/accumulator-factory-1.mercury | 30 + .../Mercury/accumulator-factory-2.mercury | 25 + .../Mercury/accumulator-factory-3.mercury | 29 + .../Mercury/accumulator-factory-4.mercury | 28 + .../Phix/accumulator-factory.phix | 33 + .../Pony/accumulator-factory.pony | 34 + ...tory.retro => accumulator-factory-1.retro} | 0 .../Retro/accumulator-factory-2.retro | 2 + .../360-Assembly/ackermann-function.360 | 22 + .../BASIC/ackermann-function-1.basic | 24 + .../BASIC/ackermann-function-2.basic | 33 + .../BASIC/ackermann-function-3.basic | 19 + .../BASIC/ackermann-function-4.basic | 7 + ...ction.basic => ackermann-function-5.basic} | 0 .../Crystal/ackermann-function.crystal | 14 + .../Dc/ackermann-function.dc | 23 + .../Elena/ackermann-function.elena | 46 +- .../Emacs-Lisp/ackermann-function.l | 5 + .../Gambas/ackermann-function.gambas | 31 +- .../Java/ackermann-function-5.java | 389 +++++++++++ .../Phix/ackermann-function-1.phix | 34 + .../Phix/ackermann-function-2.phix | 82 +++ .../Phix/ackermann-function.phix | 37 - .../Prolog/ackermann-function.pro | 2 + .../Python/ackermann-function-2.py | 3 + .../Scala/ackermann-function-2.scala | 6 +- ...nn-function.ss => ackermann-function-1.ss} | 0 .../Scheme/ackermann-function-2.ss | 29 + .../SmileBASIC/ackermann-function.smilebasic | 9 + .../VBA/ackermann-function.vba | 29 + .../Go/active-directory-connect.go | 26 + .../Perl-6/active-directory-connect.pl6 | 3 + .../Rust/active-directory-connect.rust | 2 + .../Go/active-directory-search-for-a-user.go | 25 + .../active-directory-search-for-a-user.pl6 | 32 + .../Active-object/Groovy/active-object.groovy | 70 ++ Task/Active-object/Perl-6/active-object.pl6 | 45 ++ Task/Active-object/Phix/active-object.phix | 63 ++ Task/Active-object/Rust/active-object.rust | 172 +++++ .../00DESCRIPTION | 1 - ...iable-to-a-class-instance-at-runtime.elena | 30 +- ...variable-to-a-class-instance-at-runtime.go | 49 ++ .../address-of-a-variable-1.applesoft | 1 + .../address-of-a-variable-2.applesoft | 3 + .../address-of-a-variable-3.applesoft | 2 + .../address-of-a-variable-4.applesoft | 4 + .../address-of-a-variable-5.applesoft | 10 + .../Delphi/address-of-a-variable-1.delphi | 7 + .../Delphi/address-of-a-variable-2.delphi | 4 + .../Retro/address-of-a-variable-1.retro | 2 +- .../Retro/address-of-a-variable-2.retro | 4 +- .../Retro/address-of-a-variable-3.retro | 4 +- .../Retro/address-of-a-variable-4.retro | 2 +- .../360-Assembly/align-columns.360 | 180 +++++ .../AutoHotkey/align-columns.ahk | 84 ++- .../Align-columns/COBOL/align-columns-1.cobol | 83 +++ .../Align-columns/COBOL/align-columns-2.cobol | 21 + .../Harbour/align-columns-1.harbour | 40 ++ .../Harbour/align-columns-2.harbour | 23 + Task/Align-columns/Python/align-columns-2.py | 29 +- Task/Align-columns/Python/align-columns-3.py | 29 +- Task/Align-columns/Python/align-columns-4.py | 75 ++ Task/Align-columns/VBScript/align-columns.vb | 62 ++ .../00META.yaml | 1 + .../aliquot-sequence-classifications.pl6 | 11 +- .../ARM-Assembly/almost-prime.arm | 221 ++++++ .../Almost-prime/Futhark/almost-prime.futhark | 26 +- ...lmost-prime.julia => almost-prime-1.julia} | 0 Task/Almost-prime/Julia/almost-prime-2.julia | 17 + .../Liberty-BASIC/almost-prime.liberty | 26 + .../{almost-prime.py => almost-prime-1.py} | 0 Task/Almost-prime/Python/almost-prime-2.py | 37 + Task/Almost-prime/Ruby/almost-prime-1.rb | 6 +- Task/Almost-prime/Seed7/almost-prime.seed7 | 37 + Task/Almost-prime/VBA/almost-prime.vba | 32 + .../Visual-Basic-.NET/almost-prime.visual | 44 ++ Task/Amb/00META.yaml | 1 + Task/Amb/Elena/amb.elena | 108 +-- Task/Amb/Haskell/{amb.hs => amb-1.hs} | 0 Task/Amb/Haskell/amb-2.hs | 53 ++ Task/Amb/Haskell/amb-3.hs | 22 + Task/Amb/Haskell/amb-4.hs | 16 + Task/Amb/JavaScript/{amb.js => amb-1.js} | 0 Task/Amb/JavaScript/amb-2.js | 55 ++ Task/Amb/Python/{amb.py => amb-1.py} | 0 Task/Amb/Python/amb-2.py | 15 + Task/Amb/Python/amb-3.py | 37 + Task/Amb/Python/amb-4.py | 79 +++ Task/Amb/Python/amb-5.py | 42 ++ Task/Amb/REXX/amb-1.rexx | 34 +- Task/Amicable-pairs/00META.yaml | 1 + Task/Amicable-pairs/Ada/amicable-pairs.ada | 30 +- .../Elena/amicable-pairs-1.elena | 53 +- .../Elena/amicable-pairs-2.elena | 52 +- .../Amicable-pairs/Frink/amicable-pairs.frink | 16 + Task/Amicable-pairs/Perl-6/amicable-pairs.pl6 | 10 +- Task/Amicable-pairs/PicoLisp/amicable-pairs.l | 12 +- .../Amicable-pairs/Sidef/amicable-pairs.sidef | 12 +- Task/Anagrams-Deranged-anagrams/00DESCRIPTION | 2 +- Task/Anagrams-Deranged-anagrams/00META.yaml | 1 + .../Python/anagrams-deranged-anagrams-2.py | 100 ++- .../REXX/anagrams-deranged-anagrams.rexx | 59 +- .../Rust/anagrams-deranged-anagrams.rust | 75 ++ .../Simula/anagrams-deranged-anagrams.simula | 132 ++++ Task/Anagrams/00DESCRIPTION | 2 +- Task/Anagrams/Elena/anagrams.elena | 57 +- Task/Anagrams/Perl/anagrams-1.pl | 15 +- Task/Anagrams/Perl/anagrams-2.pl | 8 +- .../{anagrams.psh => anagrams-1.psh} | 2 +- Task/Anagrams/PowerShell/anagrams-2.psh | 43 ++ Task/Anagrams/Processing/anagrams | 26 + Task/Anagrams/Python/anagrams-4.py | 111 +++ .../BASIC/animate-a-pendulum-4.basic | 55 ++ .../Julia/animate-a-pendulum.julia | 8 +- .../Perl-6/animate-a-pendulum.pl6 | 90 +++ .../Phix/animate-a-pendulum.phix | 3 - .../Scala/animate-a-pendulum.scala | 43 +- Task/Animation/Perl-6/animation.pl6 | 19 + Task/Animation/Perl/animation.pl | 34 +- Task/Animation/Processing/animation | 26 + Task/Animation/REXX/animation.rexx | 22 + .../Elena/anonymous-recursion.elena | 53 +- .../Lambdatalk/anonymous-recursion.lambdatalk | 13 + .../Ol/anonymous-recursion.ol | 10 + .../Rust/anonymous-recursion.rust | 43 ++ .../Sidef/anonymous-recursion-1.sidef | 11 +- .../Sidef/anonymous-recursion-2.sidef | 13 +- ...end-a-record-to-the-end-of-a-text-file.cpp | 81 +++ ...end-a-record-to-the-end-of-a-text-file.lua | 52 ++ ...nd-a-record-to-the-end-of-a-text-file.rust | 171 +++++ ...apply-a-callback-to-an-array-2.applescript | 72 +- .../Elena/apply-a-callback-to-an-array.elena | 12 +- .../Retro/apply-a-callback-to-an-array.retro | 1 + .../apply-a-callback-to-an-array.visual | 25 + ...bitrary-precision-integers--included-.acl2 | 2 +- ...rbitrary-precision-integers--included-.erl | 2 +- ...bitrary-precision-integers--included-.phix | 19 +- ...trary-precision-integers--included-.visual | 47 ++ .../ALGOL-W/arithmetic-complex.alg | 25 + .../Ol/arithmetic-complex.ol | 4 +- .../BASIC/arithmetic-integer-1.basic | 19 +- .../BASIC/arithmetic-integer-2.basic | 20 +- .../BASIC/arithmetic-integer-3.basic | 23 +- .../BASIC/arithmetic-integer-4.basic | 22 +- .../Elena/arithmetic-integer.elena | 24 +- .../Nial/arithmetic-integer-1.nial | 1 + .../Nial/arithmetic-integer-2.nial | 2 + .../Nial/arithmetic-integer-3.nial | 1 + .../Robotic/arithmetic-integer.robotic | 11 + .../Haskell/arithmetic-rational.hs | 26 +- .../Perl-6/arithmetic-rational-1.pl6 | 2 +- ...tional.phix => arithmetic-rational-1.phix} | 0 .../Phix/arithmetic-rational-2.phix | 28 + .../Elena/arithmetic-evaluation.elena | 449 ++++++------ .../Nim/arithmetic-evaluation.nim | 151 ++++ .../Racket/arithmetic-evaluation.rkt | 5 +- .../Rust/arithmetic-evaluation.rust | 172 +++++ .../00META.yaml | 1 + .../arithmetic-geometric-mean-calculate-pi.d | 74 ++ ...arithmetic-geometric-mean-calculate-pi.erl | 21 + ...arithmetic-geometric-mean-calculate-pi.pl6 | 7 +- ...rithmetic-geometric-mean-calculate-pi.phix | 59 +- ...thmetic-geometric-mean-calculate-pi-1.rust | 21 + ...thmetic-geometric-mean-calculate-pi-2.rust | 3 + ...thmetic-geometric-mean-calculate-pi.visual | 54 ++ Task/Arithmetic-geometric-mean/00META.yaml | 1 + ...asic => arithmetic-geometric-mean-1.basic} | 0 .../BASIC/arithmetic-geometric-mean-2.basic | 13 + .../BASIC/arithmetic-geometric-mean-3.basic | 8 + ...mean.cs => arithmetic-geometric-mean-1.cs} | 0 .../C-sharp/arithmetic-geometric-mean-2.cs | 47 ++ .../LLVM/arithmetic-geometric-mean.llvm | 103 +++ .../Modula-2/arithmetic-geometric-mean.mod2 | 70 ++ .../NewLISP/arithmetic-geometric-mean.newlisp | 21 + .../REXX/arithmetic-geometric-mean.rexx | 26 +- .../SQL/arithmetic-geometric-mean.sql | 13 + .../VBA/arithmetic-geometric-mean.vba | 12 + .../arithmetic-geometric-mean.visual | 39 ++ .../ABAP/array-concatenation.abap | 10 + .../ARM-Assembly/array-concatenation.arm | 170 +++++ .../Aime/array-concatenation.aime | 6 +- .../Elena/array-concatenation.elena | 16 +- .../Fortran/array-concatenation.f | 10 +- .../Free-Pascal/array-concatenation.free | 1 + .../Neko/array-concatenation.neko | 10 + .../Nial/array-concatenation-1.nial | 8 + .../Nial/array-concatenation-2.nial | 7 + .../Nial/array-concatenation-3.nial | 4 + .../Nial/array-concatenation-4.nial | 6 + .../Nial/array-concatenation-5.nial | 6 + .../Pony/array-concatenation.pony | 14 + .../Q/array-concatenation.q | 3 + .../Rust/array-concatenation-1.rust | 15 + .../Rust/array-concatenation-2.rust | 3 + .../Rust/array-concatenation.rust | 17 - Task/Arrays/ARM-Assembly/arrays.arm | 186 +++++ Task/Arrays/BASIC/arrays-8.basic | 14 +- Task/Arrays/BASIC/arrays-9.basic | 13 +- Task/Arrays/Elena/arrays-1.elena | 2 +- Task/Arrays/Elena/arrays-2.elena | 8 +- Task/Arrays/Elena/arrays-3.elena | 8 +- Task/Arrays/Elena/arrays-4.elena | 10 +- Task/Arrays/Elena/arrays-5.elena | 6 +- Task/Arrays/Mercury/arrays.mercury | 56 ++ Task/Arrays/Ol/arrays.ol | 15 + Task/Arrays/PL-I/arrays.pli | 2 + Task/Arrays/Robotic/arrays-1.robotic | 9 + Task/Arrays/Robotic/arrays-2.robotic | 13 + Task/Arrays/VBA/arrays.vba | 29 + Task/Arrays/VHDL/arrays.vhdl | 57 ++ Task/Assertions/C-sharp/assertions-1.cs | 21 + Task/Assertions/C-sharp/assertions-2.cs | 21 + Task/Assertions/C-sharp/assertions-3.cs | 1 + Task/Assertions/C-sharp/assertions.cs | 3 - Task/Assertions/Objeck/assertions.objeck | 8 + Task/Assertions/VBA/assertions.vba | 5 + .../Elena/associative-array-creation-1.elena | 20 +- .../Elena/associative-array-creation-2.elena | 20 +- .../associative-array-creation-1.free | 17 + .../associative-array-creation-2.free | 17 + .../associative-array-creation.futhark | 1 + .../Ol/associative-array-creation.ol | 20 +- .../associative-array-creation-2.psh | 2 +- .../associative-array-creation-4.psh | 22 +- .../associative-array-creation-5.psh | 8 +- .../associative-array-creation-6.psh | 4 + .../Elena/associative-array-iteration-1.elena | 28 +- .../Elena/associative-array-iteration-2.elena | 28 +- .../associative-array-iteration.free | 30 + .../REXX/associative-array-iteration.rexx | 29 +- .../Atomic-updates/Swift/atomic-updates.swift | 87 +++ Task/Average-loop-length/00META.yaml | 1 + .../Perl/average-loop-length.pl | 21 + .../R/average-loop-length.r | 34 + .../Simula/average-loop-length.simula | 65 ++ .../VBA/average-loop-length.vba | 37 + .../Ada/averages-arithmetic-mean.ada | 15 +- ...basic => averages-arithmetic-mean-1.basic} | 0 .../BASIC/averages-arithmetic-mean-2.basic | 28 + .../BASIC/averages-arithmetic-mean-3.basic | 10 + .../Elena/averages-arithmetic-mean.elena | 39 +- .../Q/averages-arithmetic-mean.q | 1 + ...ean.sql => averages-arithmetic-mean-1.sql} | 0 .../SQL/averages-arithmetic-mean-2.sql | 1 + .../VBA/averages-arithmetic-mean.vba | 28 + Task/Averages-Mean-angle/00META.yaml | 1 + .../C++/averages-mean-angle.cpp | 37 + .../Factor/averages-mean-angle.factor | 11 + .../REXX/averages-mean-angle.rexx | 81 +-- .../VBA/averages-mean-angle.vba | 19 + .../averages-mean-angle.visual | 18 + .../C/averages-mean-time-of-day.c | 3 - .../Factor/averages-mean-time-of-day.factor | 26 + .../Perl/averages-mean-time-of-day.pl | 54 +- .../VBA/averages-mean-time-of-day.vba | 8 + .../Elena/averages-median.elena | 56 +- Task/Averages-Median/VBA/averages-median.vba | 18 + .../Averages-Mode/Clojure/averages-mode-2.clj | 15 +- .../Averages-Mode/Clojure/averages-mode-3.clj | 28 +- .../Averages-Mode/Clojure/averages-mode-4.clj | 15 + Task/Averages-Mode/Elena/averages-mode.elena | 54 +- Task/Averages-Mode/Perl-6/averages-mode-1.pl6 | 2 +- Task/Averages-Mode/Perl-6/averages-mode-2.pl6 | 10 +- Task/Averages-Mode/Q/averages-mode.q | 1 + Task/Averages-Mode/SQL/averages-mode.sql | 34 + Task/Averages-Mode/VBA/averages-mode.vba | 7 + Task/Averages-Pythagorean-means/00META.yaml | 1 + .../Haskell/averages-pythagorean-means-2.hs | 15 +- .../Python/averages-pythagorean-means.py | 14 +- .../SQL/averages-pythagorean-means.sql | 18 + .../VBA/averages-pythagorean-means.vba | 16 + .../averages-pythagorean-means.visual | 28 + Task/Averages-Root-mean-square/00META.yaml | 1 + .../BASIC/averages-root-mean-square-3.basic | 16 +- .../BASIC/averages-root-mean-square-4.basic | 8 + .../BASIC/averages-root-mean-square-5.basic | 7 + .../Crystal/averages-root-mean-square.crystal | 5 + .../Elena/averages-root-mean-square.elena | 22 +- ...uare.py => averages-root-mean-square-1.py} | 0 .../Python/averages-root-mean-square-2.py | 12 + .../VBA/averages-root-mean-square-1.vba | 11 + ...re.vba => averages-root-mean-square-2.vba} | 0 .../averages-simple-moving-average.elena | 82 ++- .../averages-simple-moving-average.factor | 20 + .../REXX/averages-simple-moving-average.rexx | 30 +- .../VBA/averages-simple-moving-average.vba | 32 + Task/Balanced-brackets/00META.yaml | 1 + .../Aime/balanced-brackets.aime | 43 +- ...d-brackets.clj => balanced-brackets-1.clj} | 0 .../Clojure/balanced-brackets-2.clj | 11 + .../Clojure/balanced-brackets-3.clj | 5 + .../Common-Lisp/balanced-brackets.lisp | 22 +- .../Elena/balanced-brackets.elena | 61 +- .../Mercury/balanced-brackets.mercury | 40 ++ .../Simula/balanced-brackets.simula | 46 ++ Task/Balanced-ternary/00META.yaml | 1 + .../Scala/balanced-ternary-1.scala | 18 - .../Scala/balanced-ternary-2.scala | 21 +- .../Scala/balanced-ternary-3.scala | 15 + Task/Benfords-law/00META.yaml | 1 + .../Benfords-law/Groovy/benfords-law-1.groovy | 8 + .../Benfords-law/Groovy/benfords-law-2.groovy | 5 + Task/Benfords-law/REXX/benfords-law.rexx | 46 +- Task/Bernoulli-numbers/00DESCRIPTION | 8 +- .../ALGOL-68/bernoulli-numbers.alg | 18 +- .../Ada/bernoulli-numbers.ada | 32 + .../Bracmat/bernoulli-numbers.bracmat | 60 ++ ...rs.crystal => bernoulli-numbers-1.crystal} | 0 .../Crystal/bernoulli-numbers-2.crystal | 14 + .../Crystal/bernoulli-numbers-3.crystal | 15 + .../GAP/bernoulli-numbers.gap | 3 +- .../Haskell/bernoulli-numbers-2.hs | 46 +- .../Bernoulli-numbers/J/bernoulli-numbers-1.j | 4 +- .../Bernoulli-numbers/J/bernoulli-numbers-2.j | 5 +- .../Perl-6/bernoulli-numbers-1.pl6 | 2 +- .../Perl-6/bernoulli-numbers-2.pl6 | 2 +- .../Perl-6/bernoulli-numbers-3.pl6 | 2 +- .../Phix/bernoulli-numbers.phix | 30 + .../REXX/bernoulli-numbers.rexx | 80 ++- .../Ruby/bernoulli-numbers.rb | 5 +- .../Seed7/bernoulli-numbers.seed7 | 34 + Task/Best-shuffle/00META.yaml | 1 + .../Common-Lisp/best-shuffle-4.lisp | 41 ++ Task/Best-shuffle/Elena/best-shuffle.elena | 73 +- Task/Best-shuffle/Nim/best-shuffle.nim | 34 + Task/Binary-digits/Ada/binary-digits.ada | 16 +- .../Binary-digits/BASIC/binary-digits-2.basic | 24 +- .../Binary-digits/BASIC/binary-digits-3.basic | 26 +- .../Binary-digits/BASIC/binary-digits-4.basic | 26 +- .../Binary-digits/BASIC/binary-digits-5.basic | 14 + .../Binary-digits/BASIC/binary-digits-6.basic | 8 + .../Crystal/binary-digits-1.crystal | 3 + .../Crystal/binary-digits-2.crystal | 1 + Task/Binary-digits/Elena/binary-digits.elena | 18 +- .../Free-Pascal/binary-digits.free | 23 + Task/Binary-digits/Julia/binary-digits.julia | 6 +- Task/Binary-digits/LLVM/binary-digits.llvm | 180 +++++ .../Binary-digits/MAXScript/binary-digits.max | 22 + Task/Binary-digits/Processing/binary-digits-1 | 3 + Task/Binary-digits/Processing/binary-digits-2 | 3 + Task/Binary-digits/Python/binary-digits-2.py | 34 +- Task/Binary-digits/Python/binary-digits-4.py | 90 +++ Task/Binary-digits/Python/binary-digits-5.py | 121 ++++ Task/Binary-digits/R/binary-digits.r | 10 + Task/Binary-digits/REXX/binary-digits-4.rexx | 2 +- .../Binary-digits/Simula/binary-digits.simula | 15 + .../Visual-Basic-.NET/binary-digits.visual | 12 +- .../Visual-Basic/binary-digits.vb | 6 +- .../ARM-Assembly/binary-search.arm | 274 ++++++++ .../Binary-search/BASIC/binary-search-4.basic | 23 + .../Binary-search/BASIC/binary-search-5.basic | 27 + Task/Binary-search/C/binary-search.c | 4 +- .../Crystal/binary-search-1.crystal | 25 + .../Crystal/binary-search-2.crystal | 29 + Task/Binary-search/Emacs-Lisp/binary-search.l | 14 + .../{binary-search.hs => binary-search-1.hs} | 0 Task/Binary-search/Haskell/binary-search-2.hs | 46 ++ Task/Binary-search/Haskell/binary-search-3.hs | 50 ++ Task/Binary-search/Java/binary-search-1.java | 2 +- .../JavaScript/binary-search-3.js | 157 +++++ Task/Binary-search/Lua/binary-search-1.lua | 8 +- Task/Binary-search/Python/binary-search-2.py | 100 ++- Task/Binary-search/Python/binary-search-3.py | 18 +- Task/Binary-search/Python/binary-search-4.py | 72 +- Task/Binary-search/Python/binary-search-5.py | 20 +- Task/Binary-search/Python/binary-search-6.py | 6 + Task/Binary-search/Python/binary-search-7.py | 12 + Task/Binary-search/REXX/binary-search-1.rexx | 54 +- Task/Binary-search/REXX/binary-search-2.rexx | 32 +- Task/Binary-search/Ruby/binary-search-2.rb | 2 +- Task/Binary-search/Rust/binary-search-2.rust | 12 + Task/Binary-search/Rust/binary-search-3.rust | 17 + .../Binary-search/Simula/binary-search.simula | 88 +++ .../Binary-strings/Julia/binary-strings.julia | 45 ++ Task/Binary-strings/Prolog/binary-strings.pro | 49 ++ .../Nim/bitcoin-address-validation.nim | 75 ++ .../Phix/bitcoin-address-validation.phix | 94 ++- .../Scala/bitcoin-address-validation.scala | 4 +- .../Seed7/bitcoin-address-validation.seed7 | 50 ++ .../00META.yaml | 1 + .../Nim/bitcoin-public-point-to-address.nim | 27 + .../bitcoin-public-point-to-address.seed7 | 20 + .../bitmap-bresenhams-line-algorithm.360 | 188 +++++ .../bitmap-bresenhams-line-algorithm.rust | 65 ++ .../bitmap-bresenhams-line-algorithm.vb | 53 ++ .../Rust/bitmap-flood-fill.rust | 88 +++ .../bitmap-ppm-conversion-through-a-pipe.pl6 | 39 ++ .../bitmap-ppm-conversion-through-a-pipe.py | 10 + .../bitmap-read-an-image-through-a-pipe.py | 12 + .../Aime/bitmap-write-a-ppm-file.aime | 17 + .../Lua/bitmap-write-a-ppm-file.lua | 2 +- .../Perl/bitmap-write-a-ppm-file.pl | 8 + Task/Bitmap/Rust/bitmap.rust | 82 +++ Task/Bitmap/Xojo/bitmap.xojo | 16 + Task/Bitwise-IO/00DESCRIPTION | 2 +- Task/Bitwise-IO/Julia/bitwise-io.julia | 48 ++ Task/Bitwise-IO/Phix/bitwise-io.phix | 103 +++ Task/Bitwise-IO/Seed7/bitwise-io.seed7 | 60 ++ .../ABAP/bitwise-operations.abap | 265 ++++++++ .../bitwise-operations-1.applescript | 355 ++++++++++ .../bitwise-operations-2.applescript | 488 +++++++++++++ .../BASIC/bitwise-operations-3.basic | 15 +- .../BASIC/bitwise-operations-4.basic | 33 +- .../BASIC/bitwise-operations-5.basic | 9 + .../BASIC/bitwise-operations-6.basic | 25 + .../Elena/bitwise-operations.elena | 28 +- .../Free-Pascal/bitwise-operations.free | 19 + .../Neko/bitwise-operations.neko | 57 ++ .../Robotic/bitwise-operations.robotic | 15 + .../Simula/bitwise-operations.simula | 102 +++ .../ARM-Assembly/boolean-values.arm | 64 ++ .../AppleScript/boolean-values-1.applescript | 7 + .../AppleScript/boolean-values-2.applescript | 2 + .../AppleScript/boolean-values-3.applescript | 1 + .../AppleScript/boolean-values-4.applescript | 1 + .../AppleScript/boolean-values-5.applescript | 1 + .../Batch-File/boolean-values.bat | 19 + Task/Boolean-values/Neko/boolean-values.neko | 27 + Task/Boolean-values/VBA/boolean-values.vba | 9 + .../Boolean-values/VBScript/boolean-values.vb | 6 + Task/Box-the-compass/00DESCRIPTION | 2 +- Task/Box-the-compass/00META.yaml | 1 + .../Box-the-compass/LLVM/box-the-compass.llvm | 69 ++ ...he-compass.phix => box-the-compass-1.phix} | 0 .../Phix/box-the-compass-2.phix | 15 + .../Box-the-compass/REXX/box-the-compass.rexx | 22 +- Task/Box-the-compass/Ruby/box-the-compass.rb | 24 + .../Box-the-compass/Rust/box-the-compass.rust | 40 ++ Task/Box-the-compass/VBA/box-the-compass.vba | 34 + Task/Break-OO-privacy/00DESCRIPTION | 1 + .../Break-OO-privacy/Go/break-oo-privacy-1.go | 16 +- ...o-privacy.java => break-oo-privacy-1.java} | 0 .../Java/break-oo-privacy-2.java | 10 + .../Swift/break-oo-privacy.swift | 11 + .../Visual-Basic-.NET/break-oo-privacy.visual | 15 + Task/Brownian-tree/00DESCRIPTION | 2 +- .../Applesoft-BASIC/brownian-tree.applesoft | 16 + .../Common-Lisp/brownian-tree.lisp | 85 +++ .../Brownian-tree/Factor/brownian-tree.factor | 48 ++ .../Crystal/bulls-and-cows-player.crystal | 29 + .../Perl-6/bulls-and-cows-player.pl6 | 8 +- Task/Bulls-and-cows/AWK/bulls-and-cows.awk | 54 ++ .../Crystal/bulls-and-cows.crystal | 35 + .../Bulls-and-cows/Elena/bulls-and-cows.elena | 126 ++-- Task/Bulls-and-cows/Golo/bulls-and-cows.golo | 99 +++ Task/Bulls-and-cows/Processing/bulls-and-cows | 62 ++ Task/Bulls-and-cows/Red/bulls-and-cows.red | 16 + .../Bulls-and-cows/Swift/bulls-and-cows.swift | 59 ++ Task/CRC-32/Haskell/crc-32-1.hs | 29 +- Task/CRC-32/Haskell/crc-32-2.hs | 14 +- Task/CRC-32/JavaScript/crc-32.js | 87 +++ Task/CRC-32/Julia/crc-32-1.julia | 2 + .../Julia/{crc-32.julia => crc-32-2.julia} | 0 Task/CRC-32/Lua/crc-32.lua | 3 + Task/CRC-32/Neko/crc-32.neko | 12 + Task/CRC-32/Objeck/crc-32.objeck | 5 + Task/CRC-32/PowerBASIC/crc-32.powerbasic | 48 ++ Task/CRC-32/Python/crc-32-3.py | 62 ++ Task/CRC-32/R/crc-32.r | 1 + Task/CRC-32/Racket/crc-32.rkt | 15 + Task/CRC-32/Visual-Basic/crc-32.vb | 15 + Task/CSV-data-manipulation/00META.yaml | 1 + .../Haskell/csv-data-manipulation-1.hs | 43 +- .../Objeck/csv-data-manipulation.objeck | 32 + ...pulation.py => csv-data-manipulation-1.py} | 0 .../Python/csv-data-manipulation-2.py | 22 + .../Python/csv-data-manipulation-3.py | 8 + .../Q/csv-data-manipulation.q | 3 + ...tion.rexx => csv-data-manipulation-1.rexx} | 0 .../REXX/csv-data-manipulation-2.rexx | 19 + .../Rust/csv-data-manipulation.rust | 28 + .../Stata/csv-data-manipulation.stata | 1 + Task/CSV-to-HTML-translation/00META.yaml | 1 + .../Bracmat/csv-to-html-translation-1.bracmat | 2 +- .../Bracmat/csv-to-html-translation-2.bracmat | 2 +- .../Bracmat/csv-to-html-translation-3.bracmat | 23 + .../Bracmat/csv-to-html-translation-4.bracmat | 39 ++ .../Bracmat/csv-to-html-translation-5.bracmat | 8 + .../Objeck/csv-to-html-translation.objeck | 71 ++ .../Python/csv-to-html-translation-5.py | 37 + .../Python/csv-to-html-translation-6.py | 1 + .../Rust/csv-to-html-translation-1.rust | 22 + .../Rust/csv-to-html-translation-2.rust | 8 + .../VBA/csv-to-html-translation-1.vba | 28 + .../VBA/csv-to-html-translation-2.vba | 9 + .../csv-to-html-translation-1.visual | 43 ++ .../csv-to-html-translation-2.visual | 34 + .../360-Assembly/caesar-cipher.360 | 30 + .../ARM-Assembly/caesar-cipher.arm | 172 +++++ Task/Caesar-cipher/Arc/caesar-cipher-1.arc | 20 + Task/Caesar-cipher/Arc/caesar-cipher-2.arc | 2 + Task/Caesar-cipher/Astro/caesar-cipher.astro | 13 +- .../BASIC256/caesar-cipher.basic256 | 30 + .../Brainf---/caesar-cipher-1.bf | 217 ++++++ .../Brainf---/caesar-cipher-2.bf | 1 + .../Brainf---/caesar-cipher-3.bf | 1 + Task/Caesar-cipher/C/caesar-cipher.c | 8 +- ...aesar-cipher.lisp => caesar-cipher-1.lisp} | 0 .../Common-Lisp/caesar-cipher-2.lisp | 9 + Task/Caesar-cipher/Elena/caesar-cipher.elena | 104 +-- Task/Caesar-cipher/Haskell/caesar-cipher-2.hs | 13 +- .../Caesar-cipher/Modula-3/caesar-cipher.mod3 | 86 +++ .../Caesar-cipher/OCaml/caesar-cipher-1.ocaml | 28 +- Task/Caesar-cipher/Picat/caesar-cipher.picat | 23 + Task/Caesar-cipher/Swift/caesar-cipher.swift | 143 ++-- .../Visual-Basic-.NET/caesar-cipher.visual | 31 + .../X86-Assembly/caesar-cipher-1.x86 | 102 +++ .../X86-Assembly/caesar-cipher-2.x86 | 5 + .../C/calendar---for-real-programmers.c | 166 +++++ .../calendar---for-real-programmers.elena | 239 +++---- .../Go/calendar---for-real-programmers-1.go | 71 ++ .../Go/calendar---for-real-programmers-2.go | 40 ++ .../calendar---for-real-programmers.julia | 57 ++ .../calendar---for-real-programmers.visual | 331 +++++++++ Task/Calendar/00DESCRIPTION | 6 +- Task/Calendar/ALGOL-W/calendar.alg | 142 ++++ Task/Calendar/Factor/calendar.factor | 12 + Task/Calendar/Julia/calendar.julia | 64 ++ Task/Calendar/OCaml/calendar.ocaml | 196 ++++++ Task/Calendar/Prolog/calendar.pro | 94 +++ Task/Calendar/Rust/calendar.rust | 98 +++ Task/Calendar/Simula/calendar.simula | 144 ++++ Task/Calendar/Smalltalk/calendar-1.st | 1 + Task/Calendar/Smalltalk/calendar-2.st | 136 ++++ .../Visual-Basic-.NET/calendar-1.visual | 9 + .../Visual-Basic-.NET/calendar-2.visual | 38 ++ .../Visual-Basic-.NET/calendar-3.visual | 284 ++++++++ .../call-a-foreign-language-function.arm | 52 ++ .../call-a-foreign-language-function.crystal | 12 + .../call-a-function-in-a-shared-library.pl6 | 8 +- .../Batch-File/call-a-function.bat | 91 ++- .../Elena/call-a-function-1.elena | 4 +- .../Elena/call-a-function-2.elena | 2 +- .../Elena/call-a-function-3.elena | 2 +- .../Elena/call-a-function-4.elena | 6 +- .../Groovy/call-a-function-1.groovy | 1 + .../Groovy/call-a-function-10.groovy | 1 + .../Groovy/call-a-function-2.groovy | 1 + .../Groovy/call-a-function-3.groovy | 4 + .../Groovy/call-a-function-4.groovy | 4 + .../Groovy/call-a-function-5.groovy | 1 + .../Groovy/call-a-function-6.groovy | 3 + .../Groovy/call-a-function-7.groovy | 1 + .../Groovy/call-a-function-8.groovy | 2 + .../Groovy/call-a-function-9.groovy | 6 + Task/Call-a-function/Ol/call-a-function.ol | 49 +- Task/Call-a-function/VBA/call-a-function.vba | 129 ++++ .../Elena/call-an-object-method.elena | 2 +- .../Factor/call-an-object-method.factor | 23 + .../call-an-object-method.supercollider | 16 + .../Go/canny-edge-detector.go | 24 + .../00DESCRIPTION | 3 + .../00META.yaml | 2 + .../carmichael-3-strong-pseudoprimes.phix | 24 + .../carmichael-3-strong-pseudoprimes.rexx | 53 +- .../case-sensitivity-of-identifiers.elena | 16 +- .../VBA/case-sensitivity-of-identifiers.vba | 10 + Task/Casting-out-nines/00DESCRIPTION | 6 +- .../Free-Pascal/casting-out-nines.free | 42 ++ .../00META.yaml | 1 + .../AWK/catalan-numbers-pascals-triangle.awk | 16 + .../C/catalan-numbers-pascals-triangle.c | 2 +- .../catalan-numbers-pascals-triangle.lisp | 10 + .../catalan-numbers-pascals-triangle-3.phix | 26 +- .../catalan-numbers-pascals-triangle-3.py | 134 ++++ .../Catalan-numbers/ABAP/catalan-numbers.abap | 32 + .../Haskell/catalan-numbers.hs | 10 +- ...alan-numbers.php => catalan-numbers-1.php} | 0 .../Catalan-numbers/PHP/catalan-numbers-2.php | 13 + .../Phix/catalan-numbers-1.phix | 37 + .../Phix/catalan-numbers-2.phix | 29 + .../Catalan-numbers/Phix/catalan-numbers.phix | 53 -- .../Catalan-numbers/Python/catalan-numbers.py | 27 +- .../Visual-Basic-.NET/catalan-numbers.visual | 74 ++ Task/Catamorphism/00META.yaml | 1 + Task/Catamorphism/ABAP/catamorphism.abap | 44 ++ Task/Catamorphism/Aime/catamorphism.aime | 5 + Task/Catamorphism/Elena/catamorphism.elena | 24 +- Task/Catamorphism/Julia/catamorphism.julia | 4 +- Task/Catamorphism/Perl-6/catamorphism-1.pl6 | 4 +- Task/Catamorphism/REXX/catamorphism.rexx | 35 +- Task/Catamorphism/VBA/catamorphism.vba | 5 + .../catmull-clark-subdivision-surface.py | 556 +++++++++++++++ .../ARM-Assembly/character-codes.arm | 124 ++++ .../BASIC/character-codes-7.basic | 2 + .../Elena/character-codes.elena | 14 +- .../Neko/character-codes-1.neko | 9 + .../Neko/character-codes-2.neko | 22 + .../SmileBASIC/character-codes.smilebasic | 2 + Task/Chat-server/Groovy/chat-server.groovy | 156 +++++ Task/Chat-server/Kotlin/chat-server.kotlin | 153 +++++ Task/Chat-server/Prolog/chat-server.pro | 81 +++ .../Visual-Basic-.NET/chat-server.visual | 134 ++++ Task/Check-Machin-like-formulas/00META.yaml | 1 + .../Factor/check-machin-like-formulas.factor | 39 ++ .../Julia/check-machin-like-formulas.julia | 37 + .../Phix/check-machin-like-formulas-1.phix | 24 + .../Phix/check-machin-like-formulas-2.phix | 84 +++ .../R/check-machin-like-formulas-1.r | 6 + .../R/check-machin-like-formulas-2.r | 34 + .../REXX/check-machin-like-formulas.rexx | 27 +- .../Sidef/check-machin-like-formulas.sidef | 36 +- .../check-machin-like-formulas.visual | 128 ++++ .../ARM-Assembly/check-that-file-exists.arm | 123 ++++ .../BASIC/check-that-file-exists-5.basic | 20 + .../Elena/check-that-file-exists.elena | 22 +- .../Neko/check-that-file-exists.neko | 25 + .../REXX/check-that-file-exists-1.rexx | 36 +- .../Julia/checkpoint-synchronization.julia | 20 + .../Perl-6/checkpoint-synchronization.pl6 | 41 ++ .../Phix/checkpoint-synchronization.phix | 50 ++ .../Python/checkpoint-synchronization.py | 33 + Task/Chinese-remainder-theorem/00META.yaml | 1 + .../AWK/chinese-remainder-theorem.awk | 37 + .../C++/chinese-remainder-theorem.cpp | 54 ++ .../Haskell/chinese-remainder-theorem.hs | 35 +- .../Lua/chinese-remainder-theorem.lua | 46 ++ .../Modula-2/chinese-remainder-theorem.mod2 | 69 ++ .../Phix/chinese-remainder-theorem.phix | 16 + ...orem.py => chinese-remainder-theorem-1.py} | 0 .../Python/chinese-remainder-theorem-2.py | 29 + .../Python/chinese-remainder-theorem-3.py | 205 ++++++ .../VBA/chinese-remainder-theorem.vba | 24 + .../chinese-remainder-theorem.visual | 38 ++ .../PowerShell/cholesky-decomposition.psh | 9 +- .../Swift/cholesky-decomposition.swift | 50 ++ .../00META.yaml | 1 + ...rcles-of-given-radius-through-two-points.c | 18 +- ...-of-given-radius-through-two-points.factor | 95 +++ ...les-of-given-radius-through-two-points.lua | 50 ++ ...cles-of-given-radius-through-two-points.pl | 43 +- ...es-of-given-radius-through-two-points.phix | 27 + ...s-of-given-radius-through-two-points.swift | 77 +++ ...les-of-given-radius-through-two-points.vba | 35 + ...-of-given-radius-through-two-points.visual | 66 ++ .../Component-Pascal/classes-1.component | 41 ++ .../Component-Pascal/classes-2.component | 17 + .../Component-Pascal/classes.component | 46 -- Task/Classes/Eiffel/classes-1.e | 2 + Task/Classes/Eiffel/classes-2.e | 14 + Task/Classes/Eiffel/classes-3.e | 43 ++ Task/Classes/Eiffel/classes-4.e | 48 ++ Task/Classes/Elena/classes.elena | 30 +- Task/Classes/GLSL/classes.glsl | 19 + .../BASIC256/closest-pair-problem.basic256 | 14 + .../FreeBASIC/closest-pair-problem.freebasic | 32 + .../REXX/closest-pair-problem.rexx | 18 +- .../Swift/closest-pair-problem.swift | 100 +++ Task/Closures-Value-capture/00META.yaml | 1 + .../Elena/closures-value-capture.elena | 13 +- .../Objeck/closures-value-capture.objeck | 16 + Task/Collections/Elena/collections-1.elena | 15 +- Task/Collections/Elena/collections-2.elena | 4 +- Task/Collections/Elena/collections-3.elena | 6 +- Task/Collections/Factor/collections.factor | 69 ++ Task/Collections/Prolog/collections-1.pro | 11 + Task/Collections/Prolog/collections-2.pro | 14 + Task/Collections/REXX/collections-1.rexx | 58 +- Task/Collections/REXX/collections-2.rexx | 2 +- Task/Collections/REXX/collections-3.rexx | 9 +- Task/Collections/REXX/collections-4.rexx | 17 +- Task/Collections/REXX/collections-5.rexx | 80 ++- .../Go/color-of-a-screen-pixel.go | 15 + .../Julia/color-of-a-screen-pixel.julia | 11 + .../Mathematica/color-of-a-screen-pixel.math | 1 + .../Processing/color-of-a-screen-pixel-1 | 4 + .../Processing/color-of-a-screen-pixel-2 | 5 + .../color-of-a-screen-pixel.smilebasic | 4 + .../Julia/color-quantization.julia | 2 + .../Perl-6/color-quantization.pl6 | 7 + .../Phix/color-quantization.phix | 97 +++ Task/Colour-bars-Display/00META.yaml | 1 + .../BASIC/colour-bars-display-10.basic | 8 + .../BASIC/colour-bars-display-3.basic | 41 +- .../BASIC/colour-bars-display-4.basic | 27 +- .../BASIC/colour-bars-display-5.basic | 38 +- .../BASIC/colour-bars-display-6.basic | 43 +- .../BASIC/colour-bars-display-7.basic | 30 +- .../BASIC/colour-bars-display-8.basic | 14 +- .../BASIC/colour-bars-display-9.basic | 43 ++ .../Forth/colour-bars-display.fth | 64 ++ .../Go/colour-bars-display.go | 30 + .../Perl-6/colour-bars-display.pl6 | 33 +- .../SmileBASIC/colour-bars-display.smilebasic | 14 + .../Go/colour-pinstripe-display.go | 33 + .../Julia/colour-pinstripe-display.julia | 41 ++ .../Perl-6/colour-pinstripe-display.pl6 | 37 +- .../colour-pinstripe-display.smilebasic | 22 + Task/Colour-pinstripe-Printer/00META.yaml | 1 + .../Go/colour-pinstripe-printer.go | 48 ++ .../Python/colour-pinstripe-printer.py | 79 +++ .../combinations-and-permutations.crystal | 38 ++ .../Swift/combinations-and-permutations.swift | 55 ++ .../combinations-with-repetitions.applescript | 197 ++++++ .../C++/combinations-with-repetitions.cpp | 16 +- .../combinations-with-repetitions.crystal | 8 + ....py => combinations-with-repetitions-1.py} | 0 .../Python/combinations-with-repetitions-2.py | 64 ++ .../combinations-with-repetitions-1.sidef | 7 + .../combinations-with-repetitions-2.sidef | 3 + .../combinations-with-repetitions-3.sidef | 2 + .../Sidef/combinations-with-repetitions.sidef | 9 - Task/Combinations/Elena/combinations.elena | 36 +- .../{combinations.nim => combinations-1.nim} | 0 Task/Combinations/Nim/combinations-2.nim | 16 + Task/Combinations/OCaml/combinations.ocaml | 15 + .../OpenEdge-Progress/combinations.openedge | 19 + ...{combinations.rust => combinations-1.rust} | 0 Task/Combinations/Rust/combinations-2.rust | 62 ++ .../{combinations.vba => combinations-1.vba} | 0 Task/Combinations/VBA/combinations-2.vba | 24 + Task/Comma-quibbling/00META.yaml | 1 + .../Astro/comma-quibbling.astro | 2 +- .../Factor/comma-quibbling.factor | 30 +- .../Objeck/comma-quibbling.objeck | 32 + Task/Comma-quibbling/Ol/comma-quibbling.ol | 19 + .../Visual-Basic-.NET/comma-quibbling.visual | 41 ++ Task/Command-line-arguments/00META.yaml | 1 + .../ARM-Assembly/command-line-arguments.arm | 61 ++ .../COBOL/command-line-arguments-3.cobol | 57 ++ .../Elena/command-line-arguments.elena | 14 +- .../Neko/command-line-arguments.neko | 8 + Task/Comments/ARM-Assembly/comments.arm | 1 - Task/Comments/BASIC/comments-3.basic | 2 + Task/Comments/Neko/comments.neko | 6 + Task/Comments/Robotic/comments-1.robotic | 6 + Task/Comments/Robotic/comments-2.robotic | 1 + Task/Comments/Visual-Objects/comments.vobj | 5 + Task/Comments/Xojo/comments.xojo | 3 + ...mpare-sorting-algorithms-performance.julia | 36 + Task/Compile-time-calculation/00META.yaml | 1 + .../C-sharp/compile-time-calculation-1.cs | 10 + .../C-sharp/compile-time-calculation-2.cs | 21 + .../C-sharp/compile-time-calculation-3.cs | 9 + .../C-sharp/compile-time-calculation-4.cs | 11 + .../C-sharp/compile-time-calculation-5.cs | 18 + .../compile-time-calculation-1.visual | 7 + .../compile-time-calculation-2.visual | 27 + .../compile-time-calculation-3.visual | 5 + .../compile-time-calculation-4.visual | 7 + .../compile-time-calculation-5.visual | 24 + .../ARM-Assembly/compound-data-type.arm | 140 ++++ .../COBOL/compound-data-type.cobol | 3 + .../Elena/compound-data-type.elena | 14 +- .../Prolog/compound-data-type-1.pro | 1 + .../Prolog/compound-data-type-2.pro | 3 + .../Prolog/compound-data-type-3.pro | 1 + .../VBA/compound-data-type.vba | 4 + .../compound-data-type-1.visual | 2 +- .../compound-data-type-2.visual | 25 +- .../Astro/concurrent-computing.astro | 3 +- .../Neko/concurrent-computing.neko | 34 + .../Perl-6/concurrent-computing.pl6 | 2 + .../Python/concurrent-computing-1.py | 25 +- .../Python/concurrent-computing-2.py | 19 +- .../Python/concurrent-computing-3.py | 5 +- .../Python/concurrent-computing-4.py | 16 +- .../Python/concurrent-computing-5.py | 19 +- .../Python/concurrent-computing-6.py | 16 +- .../Python/concurrent-computing-7.py | 10 +- .../Python/concurrent-computing-8.py | 7 + .../VBA/concurrent-computing.vba | 15 + ...g.visual => concurrent-computing-1.visual} | 0 .../concurrent-computing-2.visual | 9 + .../ARM-Assembly/conditional-structures.arm | 148 ++++ .../Astro/conditional-structures.astro | 8 +- .../AutoHotkey/conditional-structures-2.ahk | 5 - .../AutoHotkey/conditional-structures-3.ahk | 3 + .../Forth/conditional-structures-6.fth | 15 + .../Ol/conditional-structures-1.ol | 3 + .../Ol/conditional-structures-2.ol | 4 + .../Ol/conditional-structures-3.ol | 7 + .../Ol/conditional-structures-4.ol | 10 + .../Ol/conditional-structures-5.ol | 8 + .../Ol/conditional-structures-6.ol | 8 + .../Ol/conditional-structures-7.ol | 10 + .../Phix/conditional-structures-3.phix | 21 +- .../Phix/conditional-structures-4.phix | 34 +- .../Phix/conditional-structures-5.phix | 22 + .../Retro/conditional-structures-1.retro | 6 +- .../Retro/conditional-structures-2.retro | 8 +- .../Crystal/constrained-genericity.crystal | 23 + .../Objeck/constrained-genericity.objeck | 21 + ...onstrained-random-points-on-a-circle-1.pl6 | 2 +- ...onstrained-random-points-on-a-circle-1.pl} | 0 ...constrained-random-points-on-a-circle-2.pl | 13 + .../00META.yaml | 1 + ...etic-construct-from-rational-number.factor | 33 + ...hmetic-construct-from-rational-number.phix | 33 + .../00META.yaml | 1 + ...ic-g-matrix-ng,-contined-fraction-n-.julia | 71 ++ Task/Continued-fraction/00META.yaml | 1 + .../PicoLisp/continued-fraction.l | 34 + .../Sidef/continued-fraction.sidef | 38 +- .../VBA/continued-fraction.vba | 40 ++ .../continued-fraction.visual | 23 + .../00META.yaml | 1 + ...ert-decimal-number-to-rational.applescript | 91 +++ .../convert-decimal-number-to-rational.groovy | 7 + .../convert-decimal-number-to-rational.js | 49 ++ ...convert-decimal-number-to-rational-1.julia | 3 + ...convert-decimal-number-to-rational-2.julia | 20 + .../convert-decimal-number-to-rational.julia | 3 - ...> convert-decimal-number-to-rational-1.py} | 0 .../convert-decimal-number-to-rational-2.py | 119 ++++ .../R/convert-decimal-number-to-rational.r | 9 + .../Ada/conways-game-of-life.ada | 134 ++-- .../C++/conways-game-of-life-3.cpp | 84 +++ .../Elena/conways-game-of-life.elena | 199 +++--- .../Ol/conways-game-of-life.ol | 71 ++ .../REXX/conways-game-of-life-1.rexx | 23 +- .../Rust/conways-game-of-life.rust | 73 ++ .../ARM-Assembly/copy-a-string.arm | 76 +++ Task/Copy-a-string/Elena/copy-a-string.elena | 6 +- Task/Copy-a-string/Prolog/copy-a-string.pro | 2 + Task/Copy-a-string/Red/copy-a-string.red | 5 + Task/Copy-a-string/VBA/copy-a-string.vba | 7 + Task/Count-in-factors/M4/count-in-factors.m4 | 17 + .../Perl-6/count-in-factors-3.pl6 | 3 + .../REXX/count-in-factors-1.rexx | 59 +- .../REXX/count-in-factors-2.rexx | 86 +-- .../Rust/count-in-factors.rust | 41 ++ .../ARM-Assembly/count-in-octal.arm | 111 +++ ...{count-in-octal.dc => count-in-octal-1.dc} | 0 Task/Count-in-octal/Dc/count-in-octal-2.dc | 1 + Task/Count-in-octal/Dc/count-in-octal-3.dc | 1 + Task/Count-in-octal/M4/count-in-octal.m4 | 5 + .../count-occurrences-of-a-substring-3.basic | 28 +- .../count-occurrences-of-a-substring-4.basic | 17 + .../count-occurrences-of-a-substring.visual | 20 + Task/Count-the-coins/00META.yaml | 1 + .../Perl-6/count-the-coins.pl6 | 22 +- .../Swift/count-the-coins.swift | 44 ++ Task/Count-the-coins/VBA/count-the-coins.vba | 22 + .../Visual-Basic/count-the-coins.vb | 29 + .../C++/create-a-file-on-magnetic-tape.cpp | 17 + .../Java/create-a-file-on-magnetic-tape.java | 18 + .../create-a-file-on-magnetic-tape.julia | 3 + .../Lua/create-a-file-on-magnetic-tape.lua | 11 + .../Phix/create-a-file-on-magnetic-tape.phix | 3 + .../Rust/create-a-file-on-magnetic-tape.rust | 6 + .../ARM-Assembly/create-a-file.arm | 126 ++++ Task/Create-a-file/Elena/create-a-file.elena | 16 +- Task/Create-a-file/VBA/create-a-file.vba | 10 + .../Visual-Objects/create-a-file.vobj | 2 + ...a-two-dimensional-array-at-runtime-1.elena | 22 +- ...a-two-dimensional-array-at-runtime-2.elena | 28 +- ...-a-two-dimensional-array-at-runtime.visual | 14 + ...eate-a-two-dimensional-array-at-runtime.zx | 6 + .../JavaScript/create-an-html-table-2.js | 253 +++++-- .../create-an-html-table.lambdatalk | 11 + .../Phix/create-an-html-table-1.phix | 2 +- .../Phix/create-an-html-table-2.phix | 2 +- .../Prolog/create-an-html-table-1.pro | 16 + .../Prolog/create-an-html-table-2.pro | 7 + .../Python/create-an-html-table-3.py | 117 ++++ .../Python/create-an-html-table-4.py | 27 + .../Red/create-an-html-table.red | 45 ++ .../create-an-html-table-1.visual | 29 + .../create-an-html-table-2.visual | 49 ++ .../create-an-html-table-3.visual | 36 + .../00DESCRIPTION | 14 +- .../create-an-object-at-a-given-address.nim | 12 + .../create-an-object-at-a-given-address.pl6 | 57 ++ Task/Currying/00META.yaml | 1 + Task/Currying/Aime/currying.aime | 13 + Task/Currying/Python/currying-5.py | 54 ++ Task/Currying/REXX/currying-1.rexx | 14 +- Task/Currying/REXX/currying-2.rexx | 24 +- .../Visual-Basic-.NET/currying-1.visual | 21 + .../Visual-Basic-.NET/currying-2.visual | 29 + .../Visual-Basic-.NET/currying-3.visual | 51 ++ .../Visual-Basic-.NET/currying-4.visual | 27 + Task/Cut-a-rectangle/00META.yaml | 1 + .../Julia/cut-a-rectangle.julia | 68 ++ .../Cut-a-rectangle/Phix/cut-a-rectangle.phix | 114 ++++ .../REXX/cut-a-rectangle-2.rexx | 57 +- Task/DNS-query/ARM-Assembly/dns-query.arm | 163 +++++ Task/DNS-query/Common-Lisp/dns-query-7.lisp | 3 + Task/DNS-query/Factor/dns-query.factor | 4 + Task/DNS-query/J/dns-query-3.j | 8 + Task/DNS-query/Julia/dns-query.julia | 7 + Task/DNS-query/Lua/dns-query.lua | 6 + Task/DNS-query/Neko/dns-query-1.neko | 9 + Task/DNS-query/Neko/dns-query-2.neko | 13 + Task/DNS-query/Neko/dns-query-3.neko | 11 + Task/DNS-query/Nim/dns-query.nim | 16 + Task/DNS-query/Phix/dns-query.phix | 142 ++++ Task/DNS-query/Scala/dns-query.scala | 9 +- .../AppleScript/date-format.applescript | 8 + Task/Date-format/Neko/date-format.neko | 14 + Task/Date-format/Rust/date-format.rust | 10 +- .../{date-format.st => date-format-1.st} | 0 Task/Date-format/Smalltalk/date-format-2.st | 2 + .../Factor/date-manipulation.factor | 22 + .../Haskell/date-manipulation.hs | 19 +- .../ALGOL-M/day-of-the-week.algol-m | 40 ++ .../AppleScript/day-of-the-week-2.applescript | 36 +- .../Day-of-the-week/Arc/day-of-the-week-1.arc | 8 + .../Day-of-the-week/Arc/day-of-the-week-2.arc | 21 + .../BASIC/day-of-the-week-5.basic | 23 +- .../BASIC/day-of-the-week-6.basic | 13 + .../JavaScript/day-of-the-week-3.js | 31 +- .../Prolog/day-of-the-week.pro | 12 + ...ay-of-the-week.py => day-of-the-week-1.py} | 0 .../Python/day-of-the-week-2.py | 78 +++ Task/Day-of-the-week/SQL/day-of-the-week.sql | 10 + ...the-week.stata => day-of-the-week-1.stata} | 6 +- .../Stata/day-of-the-week-2.stata | 2 + .../Visual-Objects/day-of-the-week.vobj | 7 + .../Factor/deal-cards-for-freecell.factor | 32 + .../Julia/deal-cards-for-freecell.julia | 23 + .../PHP/deal-cards-for-freecell.php | 60 ++ .../Swift/deal-cards-for-freecell.swift | 57 ++ Task/Death-Star/Julia/death-star.julia | 17 + Task/Death-Star/Maple/death-star.maple | 6 + Task/Death-Star/Perl-6/death-star.pl6 | 39 +- Task/Death-Star/REXX/death-star.rexx | 63 +- Task/Death-Star/Sidef/death-star.sidef | 67 +- .../Deconvolution-1D/Perl/deconvolution-1d.pl | 66 ++ ...onvolution-1d.py => deconvolution-1d-1.py} | 0 .../Python/deconvolution-1d-2.py | 38 ++ .../Deconvolution-2D+/Go/deconvolution-2d+.go | 192 ++++++ .../Julia/deconvolution-2d+.julia | 91 +++ .../Perl-6/deconvolution-2d+.pl6 | 7 +- .../Perl/deconvolution-2d+.pl | 151 ++++ .../Phix/deconvolution-2d+.phix | 224 ++++++ .../Python/deconvolution-2d+.py | 130 ++++ Task/Deepcopy/00META.yaml | 1 + Task/Deepcopy/Scheme/deepcopy.ss | 49 ++ .../Elena/define-a-primitive-data-type.elena | 89 ++- .../define-a-primitive-data-type.free | 9 + .../define-a-primitive-data-type-1.ocaml | 2 +- .../define-a-primitive-data-type.pascal | 18 +- .../Rust/define-a-primitive-data-type.rust | 40 ++ Task/Delegates/Elena/delegates-1.elena | 66 +- Task/Delegates/Elena/delegates-2.elena | 68 +- Task/Delegates/Objeck/delegates.objeck | 54 ++ Task/Delegates/Rust/delegates-1.rust | 27 + Task/Delegates/Rust/delegates-2.rust | 41 ++ Task/Delegates/Smalltalk/delegates-1.st | 6 + Task/Delegates/Smalltalk/delegates-2.st | 10 + Task/Delegates/Smalltalk/delegates-3.st | 8 + Task/Delete-a-file/Aime/delete-a-file.aime | 4 + .../Delete-a-file/BASIC/delete-a-file-5.basic | 4 + .../Delete-a-file/BASIC/delete-a-file-6.basic | 2 + .../Delete-a-file/BASIC/delete-a-file-7.basic | 11 + Task/Delete-a-file/Elena/delete-a-file.elena | 16 +- .../Free-Pascal/delete-a-file.free | 18 + .../BASIC/detect-division-by-zero-3.basic | 21 +- .../BASIC/detect-division-by-zero-4.basic | 18 +- .../BASIC/detect-division-by-zero-5.basic | 19 +- .../BASIC/detect-division-by-zero-6.basic | 15 +- .../BASIC/detect-division-by-zero-7.basic | 9 +- .../BASIC/detect-division-by-zero-8.basic | 7 + .../Ol/detect-division-by-zero.ol | 17 + .../Perl-6/detect-division-by-zero-1.pl6 | 12 +- .../Perl-6/detect-division-by-zero-2.pl6 | 10 +- .../Q/detect-division-by-zero.q | 2 + .../Scala/detect-division-by-zero.scala | 6 + .../determine-if-a-string-is-numeric.arm | 199 ++++++ .../determine-if-a-string-is-numeric-2.lisp | 5 +- .../determine-if-a-string-is-numeric.free | 18 + .../determine-if-a-string-is-numeric-1.scala | 4 +- .../determine-if-a-string-is-numeric-2.scala | 4 +- .../determine-if-a-string-is-numeric-3.scala | 8 +- .../determine-if-a-string-is-numeric-4.scala | 7 + ...mine-if-only-one-instance-is-running.julia | 17 + ...ermine-if-only-one-instance-is-running.pl6 | 2 +- .../00DESCRIPTION | 1 + Task/Digital-root/00META.yaml | 1 + .../AppleScript/digital-root.applescript | 22 + Task/Digital-root/Elena/digital-root.elena | 43 +- .../{digital-root.py => digital-root-1.py} | 0 Task/Digital-root/Python/digital-root-2.py | 64 ++ .../SmileBASIC/digital-root.smilebasic | 13 + .../TI-83-BASIC/digital-root.ti-83 | 21 + Task/Digital-root/VBA/digital-root.vba | 25 + .../Visual-Basic-.NET/digital-root.visual | 20 + .../00DESCRIPTION | 2 +- ...inesmans-multiple-dwelling-problem.crystal | 18 + .../dinesmans-multiple-dwelling-problem-2.hs | 22 +- ...ans-multiple-dwelling-problem-1.purebasic} | 0 ...mans-multiple-dwelling-problem-2.purebasic | 101 +++ .../dinesmans-multiple-dwelling-problem-4.py | 2 +- .../dinesmans-multiple-dwelling-problem-5.py | 22 + .../dinesmans-multiple-dwelling-problem-6.py | 61 ++ .../Elixir/dining-philosophers.elixir | 121 ++++ .../J/dining-philosophers-1.j | 27 + .../J/dining-philosophers-2.j | 17 + .../J/dining-philosophers-3.j | 30 + .../J/dining-philosophers-4.j | 116 ++++ .../Modula-3/dining-philosophers.mod3 | 101 +++ .../Pascal/dining-philosophers-1.pascal | 101 +++ .../Pascal/dining-philosophers-2.pascal | 115 ++++ .../Pascal/dining-philosophers-3.pascal | 101 +++ .../Pascal/dining-philosophers-4.pascal | 114 ++++ .../Simula/dining-philosophers.simula | 162 +++++ .../VBA/dining-philosophers.vba | 96 +++ .../C-sharp/discordian-date.cs | 55 ++ .../Discordian-date/REXX/discordian-date.rexx | 20 +- .../Julia/distributed-programming-1.julia | 9 + .../Julia/distributed-programming-2.julia | 7 + .../Documentation/Julia/documentation-1.julia | 2 + .../Documentation/Julia/documentation-2.julia | 15 + Task/Documentation/Neko/documentation-1.neko | 1 + Task/Documentation/Neko/documentation-2.neko | 1 + Task/Documentation/Neko/documentation-3.neko | 5 + .../Documentation/Objeck/documentation.objeck | 9 + Task/Documentation/Rust/documentation.rust | 57 ++ Task/Dot-product/00META.yaml | 1 + Task/Dot-product/Elena/dot-product.elena | 18 +- Task/Dot-product/GLSL/dot-product.glsl | 1 + Task/Dot-product/LLVM/dot-product.llvm | 85 +++ Task/Dot-product/Ol/dot-product.ol | 5 + .../{dot-product.py => dot-product-1.py} | 0 Task/Dot-product/Python/dot-product-2.py | 91 +++ Task/Dot-product/RPL/dot-product.rpl | 5 + Task/Dot-product/VBA/dot-product.vba | 7 + .../Visual-Basic-.NET/dot-product.visual | 12 + Task/Dot-product/Visual-Basic/dot-product.vb | 43 ++ .../doubly-linked-list-definition.arm | 237 +++++++ .../C-sharp/doubly-linked-list-definition.cs | 54 +- .../doubly-linked-list-definition-1.julia | 1 + .../doubly-linked-list-definition-2.julia | 72 ++ .../doubly-linked-list-element-definition.arm | 11 + ...doubly-linked-list-element-insertion-2.ada | 2 +- ...doubly-linked-list-element-insertion.julia | 35 + .../00DESCRIPTION | 2 + .../doubly-linked-list-traversal.arm | 281 ++++++++ .../Java/doubly-linked-list-traversal.java | 25 +- .../Julia/doubly-linked-list-traversal.julia | 47 ++ .../PL-I/doubly-linked-list-traversal.pli | 2 +- ...ragon-curve.basic => dragon-curve-1.basic} | 0 Task/Dragon-curve/BASIC/dragon-curve-2.basic | 18 + Task/Dragon-curve/Perl/dragon-curve.pl | 57 +- ...raw-a-clock.basic => draw-a-clock-1.basic} | 0 Task/Draw-a-clock/BASIC/draw-a-clock-2.basic | 21 + Task/Draw-a-clock/Forth/draw-a-clock.fth | 64 ++ Task/Draw-a-clock/Julia/draw-a-clock.julia | 83 +++ Task/Draw-a-clock/Scala/draw-a-clock-1.scala | 12 +- .../ZX-Spectrum-Basic/draw-a-clock.zx | 14 + Task/Draw-a-cuboid/00DESCRIPTION | 7 +- Task/Draw-a-cuboid/AWK/draw-a-cuboid.awk | 59 ++ .../Draw-a-cuboid/Factor/draw-a-cuboid.factor | 22 + Task/Draw-a-cuboid/Maple/draw-a-cuboid.maple | 1 + ...raw-a-cuboid.phix => draw-a-cuboid-1.phix} | 0 Task/Draw-a-cuboid/Phix/draw-a-cuboid-2.phix | 26 + Task/Draw-a-cuboid/Phix/draw-a-cuboid-3.phix | 27 + Task/Draw-a-cuboid/Prolog/draw-a-cuboid.pro | 8 +- Task/Draw-a-sphere/AWK/draw-a-sphere.awk | 59 ++ .../BASIC/draw-a-sphere-10.basic | 23 +- .../BASIC/draw-a-sphere-11.basic | 14 +- .../BASIC/draw-a-sphere-12.basic | 9 + .../Draw-a-sphere/BASIC/draw-a-sphere-7.basic | 287 +------- .../Draw-a-sphere/BASIC/draw-a-sphere-8.basic | 264 ++++++- .../Draw-a-sphere/BASIC/draw-a-sphere-9.basic | 37 +- Task/Draw-a-sphere/Perl-6/draw-a-sphere-1.pl6 | 38 ++ Task/Draw-a-sphere/Perl-6/draw-a-sphere-2.pl6 | 31 + Task/Draw-a-sphere/Perl-6/draw-a-sphere.pl6 | 35 - Task/Draw-a-sphere/REXX/draw-a-sphere.rexx | 51 +- .../Dutch-national-flag-problem/00DESCRIPTION | 11 +- Task/Dutch-national-flag-problem/00META.yaml | 1 + .../ABAP/dutch-national-flag-problem.abap | 158 +++++ .../dutch-national-flag-problem.freebasic | 23 + Task/Dynamic-variable-names/00DESCRIPTION | 23 + .../APL/dynamic-variable-names.apl | 5 + .../Elena/dynamic-variable-names.elena | 30 +- .../Go/dynamic-variable-names.go | 71 ++ Task/Echo-server/Ada/echo-server-1.ada | 1 + Task/Echo-server/Ada/echo-server-2.ada | 1 + Task/Echo-server/Julia/echo-server.julia | 23 + .../{echo-server.py => echo-server-1.py} | 0 Task/Echo-server/Python/echo-server-2.py | 34 + Task/Echo-server/Python/echo-server-3.py | 64 ++ .../Factor/element-wise-operations.factor | 15 + .../Groovy/element-wise-operations-1.groovy | 67 ++ .../Groovy/element-wise-operations-2.groovy | 16 + .../Groovy/element-wise-operations-3.groovy | 33 + .../Standard-ML/element-wise-operations-1.ml | 31 + .../Standard-ML/element-wise-operations-2.ml | 3 + Task/Empty-directory/00META.yaml | 1 + Task/Empty-program/ABAP/empty-program.abap | 1 + Task/Empty-program/Elena/empty-program.elena | 6 +- Task/Empty-program/Retro/empty-program.retro | 0 .../Robotic/empty-program.robotic | 0 Task/Empty-string/00META.yaml | 1 + .../ARM-Assembly/empty-string.arm | 83 +++ Task/Empty-string/BASIC/empty-string-4.basic | 3 + .../{empty-string.cs => empty-string-1.cs} | 0 Task/Empty-string/C-sharp/empty-string-2.cs | 113 +++ Task/Empty-string/Elena/empty-string.elena | 17 +- .../Free-Pascal/empty-string-1.free | 1 + .../Free-Pascal/empty-string-2.free | 2 + .../Free-Pascal/empty-string-3.free | 3 + Task/Empty-string/Lua/empty-string.lua | 16 +- .../Empty-string/Mercury/empty-string.mercury | 5 + .../Visual-Basic-.NET/empty-string-1.visual | 14 + .../Visual-Basic-.NET/empty-string-2.visual | 130 ++++ .../Swift/enforced-immutability-1.swift | 4 + .../Swift/enforced-immutability-2.swift | 22 + .../Swift/enforced-immutability-3.swift | 9 + Task/Entropy/Elena/entropy.elena | 65 +- Task/Entropy/JavaScript/entropy.js | 42 +- Task/Entropy/Julia/entropy.julia | 2 +- Task/Entropy/Rust/entropy.rust | 24 +- Task/Enumerations/Delphi/enumerations.delphi | 5 +- Task/Enumerations/Pascal/enumerations.pascal | 2 + .../BASIC/environment-variables-3.basic | 31 +- .../BASIC/environment-variables-4.basic | 1 + .../BASIC/environment-variables-5.basic | 3 + .../Rust/environment-variables.rust | 9 + .../Scala/environment-variables.scala | 9 +- .../Visual-Basic/environment-variables.vb | 1 + Task/Equilibrium-index/00META.yaml | 1 + .../Elena/equilibrium-index.elena | 94 +-- .../Python/equilibrium-index-6.py | 56 ++ .../BASIC/ethiopian-multiplication-11.basic | 40 ++ .../BASIC/ethiopian-multiplication-5.basic | 2 +- .../Haskell/ethiopian-multiplication-2.hs | 59 +- .../Haskell/ethiopian-multiplication-3.hs | 25 +- .../Modula-2/ethiopian-multiplication.mod2 | 4 +- .../Python/ethiopian-multiplication-4.py | 123 ++++ .../Sidef/ethiopian-multiplication.sidef | 21 +- Task/Euler-method/Factor/euler-method.factor | 17 + .../Euler-method/Futhark/euler-method.futhark | 14 +- Task/Euler-method/REXX/euler-method-2.rexx | 41 +- Task/Euler-method/Rust/euler-method.rust | 34 + Task/Euler-method/VBA/euler-method.vba | 36 + ...luate-binomial-coefficients-1.applescript} | 0 ...aluate-binomial-coefficients-2.applescript | 78 +++ .../evaluate-binomial-coefficients.bat | 17 + .../evaluate-binomial-coefficients.factor | 2 +- .../evaluate-binomial-coefficients.js | 13 +- .../evaluate-binomial-coefficients-2.phix | 20 +- .../evaluate-binomial-coefficients-2.py | 14 +- .../evaluate-binomial-coefficients-3.py | 60 ++ .../evaluate-binomial-coefficients-4.py | 25 + ... => evaluate-binomial-coefficients-1.rust} | 0 .../evaluate-binomial-coefficients-2.rust | 4 + Task/Even-or-odd/00META.yaml | 1 + Task/Even-or-odd/Agda/even-or-odd.agda | 8 + ...{even-or-odd.basic => even-or-odd-1.basic} | 0 Task/Even-or-odd/BASIC/even-or-odd-2.basic | 7 + Task/Even-or-odd/LLVM/even-or-odd.llvm | 53 ++ Task/Even-or-odd/MAXScript/even-or-odd.max | 6 + .../Visual-Basic-.NET/even-or-odd.visual | 24 + Task/Even-or-odd/Xojo/even-or-odd.xojo | 7 + Task/Events/Phix/events-1.phix | 30 + Task/Events/Phix/events-2.phix | 17 + Task/Events/Rust/events.rust | 17 + Task/Evolutionary-algorithm/00META.yaml | 1 + .../Elena/evolutionary-algorithm.elena | 94 +-- .../Perl-6/evolutionary-algorithm.pl6 | 2 +- .../Swift/evolutionary-algorithm.swift | 55 ++ ...an-exception-thrown-in-a-nested-call.elena | 67 +- ...n-exception-thrown-in-a-nested-call.factor | 21 + ...-an-exception-thrown-in-a-nested-call.rust | 32 + ...exception-thrown-in-a-nested-call-1.visual | 37 + ...exception-thrown-in-a-nested-call-2.visual | 9 + Task/Exceptions/Elena/exceptions-1.elena | 6 +- Task/Exceptions/Elena/exceptions-2.elena | 8 +- Task/Exceptions/Elena/exceptions-3.elena | 15 +- Task/Exceptions/Elena/exceptions-4.elena | 8 +- Task/Exceptions/Prolog/exceptions.pro | 19 + Task/Executable-library/00META.yaml | 1 + .../Perl-6/executable-library-3.pl6 | 3 +- .../Brainf---/execute-brain-----1.bf | 92 +++ .../Brainf---/execute-brain-----2.bf | 19 + .../Brainf---/execute-brain-----3.bf | 9 + .../FreeBASIC/execute-brain----.freebasic | 86 +++ .../Lua/execute-brain----.lua | 24 + Task/Execute-HQ9+/00META.yaml | 1 + .../BASIC256/execute-hq9+.basic256 | 45 ++ Task/Execute-HQ9+/Factor/execute-hq9+.factor | 33 + .../FreeBASIC/execute-hq9+.freebasic | 50 ++ Task/Execute-HQ9+/Golo/execute-hq9+.golo | 8 +- Task/Execute-SNUSP/Julia/execute-snusp.julia | 55 ++ .../JavaScript/execute-a-markov-algorithm.js | 160 +++++ .../Perl-6/execute-a-system-command.pl6 | 2 +- .../Perl/execute-a-system-command.pl | 16 +- .../Phix/execute-a-system-command.phix | 2 +- ....basic => exponentiation-operator-1.basic} | 0 .../BASIC/exponentiation-operator-2.basic | 23 + .../BASIC/exponentiation-operator-3.basic | 6 + .../Swift/exponentiation-operator.swift | 18 + .../VBA/exponentiation-operator.vba | 48 ++ Task/Extend-your-language/00META.yaml | 1 + .../Coq/extend-your-language.coq | 1 + .../Free-Pascal/extend-your-language.free | 24 + .../Java/extend-your-language-1.java | 13 + .../Java/extend-your-language-2.java | 15 + .../Java/extend-your-language-3.java | 41 ++ .../Java/extend-your-language-4.java | 14 + .../Julia/extend-your-language.julia | 91 +++ .../ZX-Spectrum-Basic/extend-your-language.zx | 10 + Task/Extensible-prime-generator/00DESCRIPTION | 8 +- Task/Extensible-prime-generator/00META.yaml | 2 + ...r.clj => extensible-prime-generator-1.clj} | 0 .../Clojure/extensible-prime-generator-2.clj | 98 +++ .../Dart/extensible-prime-generator.dart | 50 ++ .../Elixir/extensible-prime-generator.elixir | 63 ++ ...lia => extensible-prime-generator-1.julia} | 0 .../Julia/extensible-prime-generator-2.julia | 19 + .../Julia/extensible-prime-generator-3.julia | 6 + .../Julia/extensible-prime-generator-4.julia | 16 + .../Julia/extensible-prime-generator-5.julia | 6 + ...in => extensible-prime-generator-1.kotlin} | 8 +- .../extensible-prime-generator-2.kotlin | 33 + .../extensible-prime-generator-3.kotlin | 1 + .../Nim/extensible-prime-generator-1.nim | 60 ++ .../Nim/extensible-prime-generator-2.nim | 1 + .../Nim/extensible-prime-generator-3.nim | 1 + .../extensible-prime-generator-1.pascal | 380 +++++++++++ .../extensible-prime-generator-2.pascal | 45 ++ ...al => extensible-prime-generator-3.pascal} | 0 .../Phix/extensible-prime-generator.phix | 3 +- .../Python/extensible-prime-generator-4.py | 25 + .../Rust/extensible-prime-generator.rust | 3 +- .../Seed7/extensible-prime-generator.seed7 | 2 +- .../Sidef/extensible-prime-generator.sidef | 10 +- .../Swift/extensible-prime-generator.swift | 55 ++ Task/Factorial/ARM-Assembly/factorial.arm | 176 +++++ Task/Factorial/Agda/factorial.agda | 3 + Task/Factorial/BASIC/factorial-4.basic | 13 +- Task/Factorial/BASIC/factorial-5.basic | 12 +- Task/Factorial/BASIC/factorial-6.basic | 10 + Task/Factorial/C++/factorial-2.cpp | 22 +- Task/Factorial/C++/factorial-4.cpp | 122 ++++ Task/Factorial/Common-Lisp/factorial-1.lisp | 6 +- Task/Factorial/Common-Lisp/factorial-2.lisp | 7 +- Task/Factorial/Common-Lisp/factorial-3.lisp | 5 +- Task/Factorial/Common-Lisp/factorial-4.lisp | 7 +- Task/Factorial/Common-Lisp/factorial-5.lisp | 7 + Task/Factorial/Dylan/factorial-1.dylan | 7 + Task/Factorial/Dylan/factorial-2.dylan | 11 + Task/Factorial/Dylan/factorial-3.dylan | 13 + Task/Factorial/Dylan/factorial-4.dylan | 16 + Task/Factorial/Dylan/factorial.dylan | 3 - Task/Factorial/Excel/factorial.excel | 1 + Task/Factorial/Gambas/factorial.gambas | 40 ++ Task/Factorial/Java/factorial-1.java | 58 +- Task/Factorial/Java/factorial-2.java | 59 +- Task/Factorial/LLVM/factorial.llvm | 80 +++ Task/Factorial/MUMPS/factorial-2.mumps | 2 +- Task/Factorial/Nickle/factorial.nickle | 1 + .../Phix/{factorial.phix => factorial-1.phix} | 0 Task/Factorial/Phix/factorial-2.phix | 24 + Task/Factorial/Python/factorial-4.py | 11 +- Task/Factorial/Python/factorial-5.py | 32 +- Task/Factorial/Python/factorial-6.py | 5 + Task/Factorial/Python/factorial-7.py | 27 + Task/Factorial/Racket/factorial-3.rkt | 2 + Task/Factorial/Racket/factorial-4.rkt | 2 + Task/Factorial/Scala/factorial-1.scala | 2 +- Task/Factorial/Scala/factorial-2.scala | 4 +- Task/Factorial/Scala/factorial-3.scala | 7 +- Task/Factorial/Scala/factorial-4.scala | 6 +- Task/Factorial/Scala/factorial-5.scala | 12 +- Task/Factorial/Scala/factorial-6.scala | 3 + Task/Factorial/Smalltalk/factorial-1.st | 11 +- Task/Factorial/Smalltalk/factorial-5.st | 3 + Task/Factorial/Spin/factorial.spin | 23 + .../Visual-Basic-.NET/factorial.visual | 51 ++ Task/Factorial/Visual-Basic/factorial.vb | 26 + .../factors-of-a-mersenne-number.factor | 32 + .../Julia/factors-of-a-mersenne-number.julia | 19 +- Task/Factors-of-an-integer/00DESCRIPTION | 1 + .../ALGOL-M/factors-of-an-integer.algol-m | 57 ++ .../Arc/factors-of-an-integer-1.arc | 12 + .../Arc/factors-of-an-integer-2.arc | 6 + .../BASIC/factors-of-an-integer-2.basic | 10 +- .../BASIC/factors-of-an-integer-3.basic | 4 + .../Burlesque/factors-of-an-integer.blq | 2 + .../Haskell/factors-of-an-integer-4.hs | 15 +- .../Haskell/factors-of-an-integer-5.hs | 5 +- .../Haskell/factors-of-an-integer-6.hs | 2 +- .../Haskell/factors-of-an-integer-7.hs | 14 +- .../Haskell/factors-of-an-integer-8.hs | 20 +- .../Haskell/factors-of-an-integer-9.hs | 4 +- .../Julia/factors-of-an-integer.julia | 10 +- ...eger.rust => factors-of-an-integer-1.rust} | 0 .../Rust/factors-of-an-integer-2.rust | 3 + Task/Fast-Fourier-transform/00META.yaml | 1 + .../Common-Lisp/fast-fourier-transform-1.lisp | 15 + .../Common-Lisp/fast-fourier-transform-2.lisp | 18 + .../Common-Lisp/fast-fourier-transform.lisp | 14 - .../Crystal/fast-fourier-transform.crystal | 10 +- .../Julia/fast-fourier-transform-3.julia | 2 + .../Julia/fast-fourier-transform-4.julia | 15 + .../Nim/fast-fourier-transform.nim | 24 +- .../00DESCRIPTION | 3 +- .../00META.yaml | 1 + .../AWK/fibonacci-n-step-number-sequences.awk | 30 + ...onacci-n-step-number-sequences.applescript | 244 +++++++ .../fibonacci-n-step-number-sequences.factor | 10 + ...=> fibonacci-n-step-number-sequences-1.hs} | 0 .../fibonacci-n-step-number-sequences-2.hs | 24 + ...=> fibonacci-n-step-number-sequences-1.js} | 0 .../fibonacci-n-step-number-sequences-2.js | 114 ++++ .../Ol/fibonacci-n-step-number-sequences-1.ol | 4 + .../Ol/fibonacci-n-step-number-sequences-2.ol | 12 + .../fibonacci-n-step-number-sequences-4.py | 113 +++ .../Ada/fibonacci-sequence-4.ada | 49 ++ .../BASIC/fibonacci-sequence-1.basic | 38 +- .../BASIC/fibonacci-sequence-10.basic | 9 + .../BASIC/fibonacci-sequence-11.basic | 13 + .../BASIC/fibonacci-sequence-2.basic | 46 +- .../BASIC/fibonacci-sequence-3.basic | 17 +- .../BASIC/fibonacci-sequence-4.basic | 33 +- .../BASIC/fibonacci-sequence-5.basic | 22 +- .../BASIC/fibonacci-sequence-6.basic | 48 +- .../BASIC/fibonacci-sequence-7.basic | 9 +- .../BASIC/fibonacci-sequence-8.basic | 30 +- .../BASIC/fibonacci-sequence-9.basic | 13 +- .../Clojure/fibonacci-sequence-10.clj | 16 + .../Clojure/fibonacci-sequence-7.clj | 15 +- .../Clojure/fibonacci-sequence-8.clj | 14 +- .../Clojure/fibonacci-sequence-9.clj | 24 +- .../Common-Lisp/fibonacci-sequence-8.lisp | 8 + .../Dc/fibonacci-sequence.dc | 17 + .../Elena/fibonacci-sequence.elena | 49 +- .../Erlang/fibonacci-sequence-1.erl | 2 +- .../Free-Pascal/fibonacci-sequence.free | 40 ++ .../Go/fibonacci-sequence-4.go | 2 +- .../LLVM/fibonacci-sequence.llvm | 70 ++ .../Lua/fibonacci-sequence-1.lua | 4 + .../Lua/fibonacci-sequence-2.lua | 8 + .../Lua/fibonacci-sequence-3.lua | 2 + .../Lua/fibonacci-sequence-4.lua | 1 + .../Lua/fibonacci-sequence-5.lua | 9 + .../Lua/fibonacci-sequence-6.lua | 5 + .../Lua/fibonacci-sequence.lua | 37 - ...equence.mod3 => fibonacci-sequence-1.mod3} | 0 .../Modula-3/fibonacci-sequence-2.mod3 | 36 + .../Phix/fibonacci-sequence-2.phix | 47 +- .../Processing/fibonacci-sequence | 14 + .../Python/fibonacci-sequence-14.py | 31 + .../Python/fibonacci-sequence-15.py | 21 + .../REXX/fibonacci-sequence.rexx | 18 +- .../Rust/fibonacci-sequence-3.rust | 17 +- .../Rust/fibonacci-sequence-4.rust | 33 +- .../Rust/fibonacci-sequence-5.rust | 29 + .../Spin/fibonacci-sequence.spin | 22 + .../VBA/fibonacci-sequence-1.vba | 6 +- .../fibonacci-sequence-4.visual | 56 ++ .../Xojo/fibonacci-sequence.xojo | 14 + Task/Fibonacci-word-fractal/00META.yaml | 1 + .../Factor/fibonacci-word-fractal.factor | 69 ++ .../Go/fibonacci-word-fractal.go | 57 ++ Task/Fibonacci-word/00META.yaml | 1 + .../ARM-Assembly/file-input-output.arm | 225 ++++++ .../BASIC/file-input-output-4.basic | 14 + .../Elena/file-input-output.elena | 12 +- .../Perl-6/file-modification-time.pl6 | 2 +- .../Phix/file-modification-time.phix | 7 + Task/File-size/Aime/file-size.aime | 2 + Task/File-size/COBOL/file-size.cobol | 42 ++ Task/File-size/Elena/file-size.elena | 14 +- Task/File-size/REXX/file-size-1.rexx | 15 +- Task/File-size/REXX/file-size-3.rexx | 15 +- Task/File-size/Visual-Basic/file-size.vb | 25 + Task/Filter/Elena/filter-1.elena | 13 + Task/Filter/Elena/filter-2.elena | 13 + Task/Filter/Elena/filter.elena | 13 - Task/Filter/Factor/filter-1.factor | 2 +- Task/Filter/Factor/filter-2.factor | 2 +- Task/Filter/Factor/filter-3.factor | 2 +- Task/Filter/Factor/filter-4.factor | 2 +- Task/Filter/Python/filter-4.py | 95 +++ Task/Filter/Q/filter.q | 1 + .../Aime/find-common-directory-path.aime | 51 +- .../find-common-directory-path.freebasic | 65 ++ ...ath.hs => find-common-directory-path-1.hs} | 0 .../Haskell/find-common-directory-path-2.hs | 24 + .../JavaScript/find-common-directory-path.js | 45 ++ .../Perl/find-common-directory-path-1.pl | 2 +- .../Perl/find-common-directory-path-2.pl | 4 +- .../find-common-directory-path.powerbasic | 68 ++ .../REXX/find-common-directory-path.rexx | 27 +- .../Rust/find-common-directory-path.rust | 50 ++ .../find-common-directory-path.vb | 60 ++ .../00META.yaml | 2 + ...left-truncatable-prime-in-a-given-base.pl6 | 9 +- ...eft-truncatable-prime-in-a-given-base.phix | 31 + ...truncatable-prime-in-a-given-base-1.sidef} | 13 +- ...-truncatable-prime-in-a-given-base-2.sidef | 31 + ...ft-truncatable-prime-in-a-given-base.swift | 28 + Task/Find-limit-of-recursion/00META.yaml | 1 + .../find-limit-of-recursion-1.applescript | 20 + .../find-limit-of-recursion-2.applescript | 94 +++ .../Factor/find-limit-of-recursion-1.factor | 3 + .../Factor/find-limit-of-recursion-2.factor | 6 + .../Neko/find-limit-of-recursion.neko | 28 + .../find-the-last-sunday-of-each-month.hs | 21 +- .../find-the-last-sunday-of-each-month-1.js | 21 +- .../K/find-the-last-sunday-of-each-month.k | 12 + Task/Find-the-missing-permutation/00META.yaml | 1 + .../Julia/first-class-environments.julia | 55 ++ .../00META.yaml | 1 + ...ss-functions-use-numbers-analogously.elena | 30 +- ...s-functions-use-numbers-analogously.objeck | 29 + .../Elena/first-class-functions.elena | 31 +- .../Objeck/first-class-functions.objeck | 26 + .../Ol/first-class-functions.ol | 13 + ...unctions.py => first-class-functions-1.py} | 0 .../Python/first-class-functions-2.py | 59 ++ .../Racket/first-class-functions.rkt | 10 + .../Stata/first-class-functions.stata | 34 + Task/Five-weekends/Prolog/five-weekends.pro | 72 ++ Task/FizzBuzz/C/fizzbuzz-1.c | 5 +- Task/FizzBuzz/C/fizzbuzz-10.c | 13 +- Task/FizzBuzz/C/fizzbuzz-2.c | 3 +- Task/FizzBuzz/C/fizzbuzz-3.c | 6 +- Task/FizzBuzz/C/fizzbuzz-4.c | 6 +- Task/FizzBuzz/C/fizzbuzz-5.c | 11 +- Task/FizzBuzz/C/fizzbuzz-6.c | 21 +- Task/FizzBuzz/C/fizzbuzz-7.c | 32 +- Task/FizzBuzz/C/fizzbuzz-8.c | 17 +- Task/FizzBuzz/C/fizzbuzz-9.c | 12 +- Task/FizzBuzz/D/{fizzbuzz.d => fizzbuzz-1.d} | 0 Task/FizzBuzz/D/fizzbuzz-2.d | 17 + Task/FizzBuzz/Elm/fizzbuzz-1.elm | 6 +- Task/FizzBuzz/Elm/fizzbuzz-2.elm | 6 +- Task/FizzBuzz/Factor/fizzbuzz-2.factor | 7 +- .../Go/{fizzbuzz.go => fizzbuzz-1.go} | 0 Task/FizzBuzz/Go/fizzbuzz-2.go | 11 + Task/FizzBuzz/Haskell/fizzbuzz-10.hs | 7 + Task/FizzBuzz/Haskell/fizzbuzz-5.hs | 23 +- Task/FizzBuzz/Haskell/fizzbuzz-6.hs | 20 +- Task/FizzBuzz/Haskell/fizzbuzz-7.hs | 20 +- Task/FizzBuzz/Haskell/fizzbuzz-8.hs | 10 + Task/FizzBuzz/Haskell/fizzbuzz-9.hs | 12 + Task/FizzBuzz/Java/fizzbuzz.java | 17 + Task/FizzBuzz/JavaScript/fizzbuzz-7.js | 6 + Task/FizzBuzz/JavaScript/fizzbuzz-8.js | 185 +++++ Task/FizzBuzz/Kotlin/fizzbuzz-4.kotlin | 3 + Task/FizzBuzz/LLVM/fizzbuzz.llvm | 101 +++ Task/FizzBuzz/Lua/fizzbuzz-4.lua | 13 + Task/FizzBuzz/Mercury/fizzbuzz.mercury | 15 +- Task/FizzBuzz/Oberon-2/fizzbuzz.oberon-2 | 15 +- Task/FizzBuzz/PHP/fizzbuzz-4.php | 1 + Task/FizzBuzz/PHP/fizzbuzz-5.php | 1 + Task/FizzBuzz/Perl/fizzbuzz-7.pl | 6 + Task/FizzBuzz/PowerShell/fizzbuzz-4.psh | 15 +- Task/FizzBuzz/PowerShell/fizzbuzz-5.psh | 14 + Task/FizzBuzz/Processing/fizzbuzz-4 | 11 + Task/FizzBuzz/Pyret/fizzbuzz.pyret | 4 +- Task/FizzBuzz/Python/fizzbuzz-10.py | 1 + Task/FizzBuzz/Python/fizzbuzz-2.py | 10 +- Task/FizzBuzz/Python/fizzbuzz-3.py | 2 +- Task/FizzBuzz/Python/fizzbuzz-4.py | 4 +- Task/FizzBuzz/Python/fizzbuzz-5.py | 4 +- Task/FizzBuzz/Python/fizzbuzz-6.py | 14 +- Task/FizzBuzz/Python/fizzbuzz-7.py | 1 + Task/FizzBuzz/Python/fizzbuzz-8.py | 13 + Task/FizzBuzz/Python/fizzbuzz-9.py | 52 ++ Task/FizzBuzz/Racket/fizzbuzz.rkt | 2 + Task/FizzBuzz/Robotic/fizzbuzz.robotic | 26 + .../Shen/{fizzbuzz.shen => fizzbuzz-1.shen} | 0 Task/FizzBuzz/Shen/fizzbuzz-2.shen | 29 + Task/FizzBuzz/UNIX-Shell/fizzbuzz-2.sh | 10 +- .../VBA/{fizzbuzz.vba => fizzbuzz-1.vba} | 4 +- Task/FizzBuzz/VBA/fizzbuzz-2.vba | 10 + Task/FizzBuzz/X86-Assembly/fizzbuzz.x86 | 104 +++ Task/FizzBuzz/Xojo/fizzbuzz-1.xojo | 11 + Task/FizzBuzz/Xojo/fizzbuzz-2.xojo | 12 + Task/Flatten-a-list/00DESCRIPTION | 4 +- Task/Flatten-a-list/00META.yaml | 1 + .../Haskell/flatten-a-list-2.hs | 5 +- .../JavaScript/flatten-a-list-5.js | 4 +- .../JavaScript/flatten-a-list-6.js | 17 +- .../JavaScript/flatten-a-list-7.js | 12 + .../JavaScript/flatten-a-list-8.js | 8 + ...-a-list.kotlin => flatten-a-list-1.kotlin} | 0 .../Kotlin/flatten-a-list-2.kotlin | 9 + .../Flatten-a-list/Python/flatten-a-list-2.py | 83 ++- .../Flatten-a-list/Python/flatten-a-list-3.py | 20 +- .../Flatten-a-list/Python/flatten-a-list-4.py | 77 +++ .../Flatten-a-list/Python/flatten-a-list-5.py | 12 + Task/Flatten-a-list/Q/flatten-a-list.q | 1 + Task/Flatten-a-list/REXX/flatten-a-list.rexx | 13 + .../Phix/flipping-bits-game.phix | 155 +++++ .../Scala/flipping-bits-game.scala | 108 +++ .../C-sharp/flow-control-structures-1.cs | 3 + .../C-sharp/flow-control-structures-2.cs | 10 + .../C-sharp/flow-control-structures-3.cs | 13 + .../C-sharp/flow-control-structures-4.cs | 5 + .../C-sharp/flow-control-structures-5.cs | 7 + .../Sidef/flow-control-structures.sidef | 5 + Task/Floyds-triangle/00META.yaml | 1 + ...lescript => floyds-triangle-1.applescript} | 0 .../AppleScript/floyds-triangle-2.applescript | 208 ++++++ .../BASIC/floyds-triangle-3.basic | 9 + .../BASIC/floyds-triangle-4.basic | 20 + .../Factor/floyds-triangle.factor | 14 + .../Haskell/floyds-triangle-3.hs | 4 +- .../Haskell/floyds-triangle-4.hs | 12 + .../Perl-6/floyds-triangle.pl6 | 15 + .../Python/floyds-triangle-2.py | 4 +- .../Python/floyds-triangle-3.py | 72 ++ .../Python/floyds-triangle-4.py | 94 +++ .../REXX/floyds-triangle-2.rexx | 16 +- .../Floyds-triangle/Rust/floyds-triangle.rust | 33 + .../Visual-Basic-.NET/floyds-triangle.visual | 40 ++ Task/Forest-fire/Factor/forest-fire.factor | 85 +++ Task/Forest-fire/Ol/forest-fire.ol | 52 ++ .../{forest-fire.pl6 => forest-fire-1.pl6} | 0 Task/Forest-fire/Perl-6/forest-fire-2.pl6 | 127 ++++ Task/Fork/Batch-File/fork.bat | 49 ++ Task/Fork/Julia/fork.julia | 6 + Task/Fork/Rust/fork-1.rust | 16 + Task/Fork/Rust/fork-2.rust | 2 + .../Phix/formal-power-series.phix | 100 +++ .../ARM-Assembly/formatted-numeric-output.arm | 44 ++ .../Aime/formatted-numeric-output.aime | 3 + .../Pascal/formatted-numeric-output.pascal | 36 + .../ALGOL-W/forward-difference.alg | 31 + .../Dart/forward-difference.dart | 17 + .../Swift/forward-difference.swift | 20 + Task/Four-bit-adder/00DESCRIPTION | 4 +- .../BASIC/four-bit-adder-1.basic | 60 ++ .../BASIC/four-bit-adder-2.basic | 45 ++ Task/Four-bit-adder/Prolog/four-bit-adder.pro | 42 ++ Task/Four-bit-adder/Rust/four-bit-adder.rust | 63 ++ Task/Fractal-tree/BASIC/fractal-tree-5.basic | 14 + Task/Fractal-tree/JavaScript/fractal-tree.js | 2 +- Task/Fractal-tree/Julia/fractal-tree.julia | 27 + Task/Fractal-tree/Swift/fractal-tree.swift | 5 - Task/Fractran/00DESCRIPTION | 2 +- Task/Fractran/00META.yaml | 1 + Task/Fractran/360-Assembly/fractran.360 | 48 ++ Task/Fractran/Factor/fractran.factor | 35 + Task/Fractran/Haskell/fractran-3.hs | 2 +- Task/Fractran/Haskell/fractran-4.hs | 1 + Task/Fractran/Haskell/fractran-5.hs | 22 +- Task/Fractran/J/fractran-3.j | 1 + Task/Fractran/J/fractran-4.j | 2 + Task/Fractran/J/fractran-5.j | 4 + Task/Fractran/J/fractran-6.j | 2 + Task/Fractran/J/fractran-7.j | 2 + Task/Fractran/J/fractran-8.j | 1 + Task/Fractran/J/fractran-9.j | 2 + Task/Fractran/JavaScript/fractran-1.js | 45 ++ Task/Fractran/JavaScript/fractran-2.js | 242 +++++++ Task/Fractran/JavaScript/fractran.js | 39 -- Task/Fractran/Phix/fractran.phix | 96 +++ Task/Fractran/REXX/fractran-1.rexx | 16 +- Task/Fractran/REXX/fractran-2.rexx | 46 +- Task/Fractran/TI-83-BASIC/fractran.ti-83 | 19 + Task/Fractran/VBA/fractran.vba | 116 ++++ .../Agda/function-composition.agda | 5 + .../Aime/function-composition.aime | 26 + .../Common-Lisp/function-composition-2.lisp | 2 +- .../Common-Lisp/function-composition-3.lisp | 2 +- .../Elena/function-composition.elena | 18 +- .../Haskell/function-composition-3.hs | 6 + .../JavaScript/function-composition-4.js | 15 +- .../Python/function-composition-3.py | 36 + .../Python/function-composition-4.py | 43 ++ .../Scheme/function-composition-1.ss | 9 + .../TypeScript/function-composition.type | 14 + .../function-composition-1.zx | 4 + .../function-composition-2.zx | 5 + ...nition.6502 => function-definition-1.6502} | 0 .../6502-Assembly/function-definition-2.6502 | 22 + .../BASIC/function-definition-3.basic | 1 + .../Elena/function-definition-1.elena | 4 +- .../Elena/function-definition-2.elena | 2 +- .../Elena/function-definition-3.elena | 1 + .../Fish/function-definition.fish | 1 + .../Ol/function-definition-1.ol | 2 + .../Ol/function-definition-2.ol | 3 + .../Ol/function-definition-3.ol | 12 + .../Racket/function-definition-1.rkt | 3 +- .../Racket/function-definition-3.rkt | 1 + .../Racket/function-definition-4.rkt | 1 + ...definition.vb => function-definition-1.vb} | 0 .../Visual-Basic/function-definition-2.vb | 1 + .../Xojo/function-definition-1.xojo | 3 + .../Xojo/function-definition-2.xojo | 1 + .../Factor/function-frequency.factor | 7 + .../Phix/function-frequency.phix | 30 + Task/Function-prototype/00META.yaml | 1 + .../Common-Lisp/function-prototype.lisp | 30 + .../Haskell/function-prototype-1.hs | 2 + .../Haskell/function-prototype-2.hs | 1 + .../Haskell/function-prototype-3.hs | 1 + .../Haskell/function-prototype-4.hs | 2 + .../Haskell/function-prototype-5.hs | 2 + .../Haskell/function-prototype-6.hs | 2 + .../Julia/function-prototype-1.julia | 4 + .../Julia/function-prototype-2.julia | 1 + .../OCaml/function-prototype.ocaml | 24 + .../PureBasic/function-prototype.purebasic | 77 +++ .../gui-maximum-window-dimensions-1.cs | 15 + .../gui-maximum-window-dimensions-2.cs | 15 + .../Go/gui-maximum-window-dimensions.go | 19 + .../Julia/gui-maximum-window-dimensions.julia | 5 + .../Perl-6/gui-maximum-window-dimensions.pl6 | 7 + .../gui-maximum-window-dimensions-1.visual | 12 + .../gui-maximum-window-dimensions-2.visual | 15 + .../Elena/gui-component-interaction.elena | 101 ++- .../Go/gui-component-interaction.go | 99 +++ .../gui-enabling-disabling-of-controls.cs | 82 +++ .../gui-enabling-disabling-of-controls.gambas | 79 +++ .../gui-enabling-disabling-of-controls-1.go | 122 ++++ .../gui-enabling-disabling-of-controls-2.go | 87 +++ .../Factor/galton-box-animation.factor | 109 +++ .../JavaScript/galton-box-animation.js | 126 ++++ .../Julia/galton-box-animation.julia | 27 + .../Perl/galton-box-animation.pl | 138 ++++ .../REXX/galton-box-animation.rexx | 70 ++ .../Crystal/gamma-function.crystal | 42 ++ .../Factor/gamma-function.factor | 5 + .../Haskell/gamma-function-2.hs | 27 +- .../Haskell/gamma-function-3.hs | 7 + .../Julia/gamma-function-3.julia | 16 +- Task/Gamma-function/Nim/gamma-function.nim | 2 +- ...ma-function.phix => gamma-function-1.phix} | 0 .../Gamma-function/Phix/gamma-function-2.phix | 95 +++ ...{gamma-function.py => gamma-function-1.py} | 0 .../Gamma-function/Python/gamma-function-2.py | 82 +++ ...ma-function.rexx => gamma-function-1.rexx} | 0 .../Gamma-function/REXX/gamma-function-2.rexx | 69 ++ Task/Gaussian-elimination/00DESCRIPTION | 4 + .../360-Assembly/gaussian-elimination.360 | 140 ++++ .../Modula-3/gaussian-elimination-1.mod3 | 41 ++ .../Modula-3/gaussian-elimination-2.mod3 | 158 +++++ .../Modula-3/gaussian-elimination-3.mod3 | 32 + .../Modula-3/gaussian-elimination-4.mod3 | 67 ++ .../Phix/gaussian-elimination.phix | 45 ++ .../PowerShell/gaussian-elimination-2.psh | 2 +- ...imination.py => gaussian-elimination-1.py} | 0 .../Python/gaussian-elimination-2.py | 13 + .../Rust/gaussian-elimination.rust | 82 +++ .../VBA/gaussian-elimination.vba | 57 ++ .../VBScript/gaussian-elimination.vb | 46 ++ .../00META.yaml | 1 + ...erate-chess960-starting-position.freebasic | 17 + .../R/generate-chess960-starting-position.r | 25 + .../generate-chess960-starting-position.sidef | 15 + .../generate-lower-case-ascii-alphabet.alg | 3 + ...generate-lower-case-ascii-alphabet-2.basic | 14 +- ...generate-lower-case-ascii-alphabet-3.basic | 19 +- ...generate-lower-case-ascii-alphabet-4.basic | 16 +- ...generate-lower-case-ascii-alphabet-5.basic | 9 +- ...generate-lower-case-ascii-alphabet-6.basic | 5 +- ...generate-lower-case-ascii-alphabet-7.basic | 8 +- ...generate-lower-case-ascii-alphabet-8.basic | 1 + ...generate-lower-case-ascii-alphabet-9.basic | 5 + .../generate-lower-case-ascii-alphabet.blq | 2 + .../Dc/generate-lower-case-ascii-alphabet.dc | 1 + .../generate-lower-case-ascii-alphabet.elena | 56 +- .../generate-lower-case-ascii-alphabet.false | 1 + .../generate-lower-case-ascii-alphabet.free | 5 + .../generate-lower-case-ascii-alphabet.mumps | 5 + .../generate-lower-case-ascii-alphabet.neko | 15 + .../generate-lower-case-ascii-alphabet.pascal | 15 +- .../generate-lower-case-ascii-alphabet-3.psh | 1 + .../generate-lower-case-ascii-alphabet-4.psh | 1 + ...> generate-lower-case-ascii-alphabet-1.py} | 0 .../generate-lower-case-ascii-alphabet-2.py | 101 +++ .../generate-lower-case-ascii-alphabet.rust | 5 +- .../generate-lower-case-ascii-alphabet.scala | 20 +- ...-lower-case-ascii-alphabet-1.supercollider | 19 +- Task/Generator-Exponential/00META.yaml | 1 + .../generator-exponential.applescript | 228 +++++++ .../Emacs-Lisp/generator-exponential.l | 28 + .../Factor/generator-exponential.factor | 15 + .../Haskell/generator-exponential.hs | 8 +- .../JavaScript/generator-exponential-4.js | 155 +++++ ...onential.py => generator-exponential-1.py} | 0 .../Python/generator-exponential-2.py | 82 +++ .../Rust/generator-exponential.rust | 39 ++ .../VBA/generator-exponential.vba | 44 ++ .../generator-exponential-1.visual | 35 + .../generator-exponential-2.visual | 3 + Task/Generic-swap/Elena/generic-swap.elena | 30 +- Task/Generic-swap/Fish/generic-swap.fish | 1 + .../Free-Pascal/generic-swap.free | 19 + .../{generic-swap.m => generic-swap-1.m} | 0 Task/Generic-swap/MATLAB/generic-swap-2.m | 9 + Task/Generic-swap/Maxima/generic-swap.maxima | 6 +- ...eric-swap.pascal => generic-swap-1.pascal} | 0 .../Generic-swap/Pascal/generic-swap-2.pascal | 23 + .../00META.yaml | 1 + ...obally-replace-text-in-several-files.julia | 4 +- Task/Go-Fish/FreeBASIC/go-fish.freebasic | 200 ++++++ Task/Gray-code/00META.yaml | 1 + .../Perl-6/grayscale-image.pl6 | 4 +- .../BASIC/greatest-common-divisor-3.basic | 17 +- .../BASIC/greatest-common-divisor-4.basic | 8 + .../C++/greatest-common-divisor-1.cpp | 6 + .../C++/greatest-common-divisor-2.cpp | 6 + .../C++/greatest-common-divisor.cpp | 9 - .../Elena/greatest-common-divisor.elena | 60 +- ...isor.lua => greatest-common-divisor-1.lua} | 0 .../Lua/greatest-common-divisor-2.lua | 6 + .../Ol/greatest-common-divisor.ol | 2 + .../Python/greatest-common-divisor-2.py | 5 +- .../Python/greatest-common-divisor-3.py | 6 +- .../Python/greatest-common-divisor-4.py | 25 +- .../Python/greatest-common-divisor-5.py | 23 + ...isor.sql => greatest-common-divisor-1.sql} | 0 .../SQL/greatest-common-divisor-2.sql | 43 ++ .../SQL/greatest-common-divisor-3.sql | 11 + .../VBA/greatest-common-divisor-1.vba | 9 + ...isor.vba => greatest-common-divisor-2.vba} | 0 .../Verilog/greatest-common-divisor.v | 45 ++ .../Visual-Basic/greatest-common-divisor.vb | 34 + .../greatest-element-of-a-list.arm | 210 ++++++ .../C++/greatest-element-of-a-list.cpp | 23 +- .../D/greatest-element-of-a-list.d | 7 + .../Elena/greatest-element-of-a-list.elena | 30 + .../Neko/greatest-element-of-a-list.neko | 24 + .../Ol/greatest-element-of-a-list.ol | 15 + .../Perl-6/greatest-element-of-a-list.pl6 | 4 + .../Aime/greatest-subsequential-sum.aime | 33 + .../greatest-subsequential-sum.applescript | 89 +++ .../Haskell/greatest-subsequential-sum-2.hs | 12 +- ...sum.js => greatest-subsequential-sum-1.js} | 0 .../greatest-subsequential-sum-2.js | 59 ++ .../Python/greatest-subsequential-sum-6.py | 21 + .../Go/greyscale-bars-display.go | 40 ++ .../Julia/greyscale-bars-display.julia | 55 ++ .../Perl-6/greyscale-bars-display.pl6 | 6 +- .../Perl/greyscale-bars-display.pl | 37 + ...s-the-number-with-feedback--player--1.rexx | 48 +- ...s-the-number-with-feedback--player--2.rexx | 50 +- ...ss-the-number-with-feedback--player-.scala | 13 + ...guess-the-number-with-feedback--player-.ss | 3 +- ...=> guess-the-number-with-feedback-1.basic} | 0 .../guess-the-number-with-feedback-2.basic | 14 + .../guess-the-number-with-feedback-3.basic | 17 + .../guess-the-number-with-feedback.cos | 29 + .../guess-the-number-with-feedback.elena | 45 +- .../guess-the-number-with-feedback.lambdatalk | 21 + .../BASIC/guess-the-number-2.basic | 44 +- .../BASIC/guess-the-number-3.basic | 40 +- .../BASIC/guess-the-number-4.basic | 5 + .../Elena/guess-the-number.elena | 37 +- .../Guess-the-number/Red/guess-the-number.red | 9 + .../Visual-Basic-.NET/guess-the-number.visual | 24 + Task/HTTP/ABAP/http.abap | 35 + Task/HTTP/Crystal/http.crystal | 3 + Task/HTTP/Python/http-5.py | 2 + Task/HTTP/Visual-Basic/http.vb | 15 + .../Julia/https-authenticated.julia | 13 + ...henticated.py => https-authenticated-1.py} | 0 .../Python/https-authenticated-2.py | 9 + .../Ruby/https-authenticated.rb | 9 + .../Visual-Basic/https-authenticated.vb | 16 + .../Julia/https-client-authenticated.julia | 6 + .../Perl-6/https-client-authenticated.pl6 | 27 + .../Ruby/https-client-authenticated.rb | 12 + Task/HTTPS/BaCon/https.bacon | 74 +- Task/HTTPS/JavaScript/https-1.js | 10 + Task/HTTPS/JavaScript/https-2.js | 18 + Task/HTTPS/JavaScript/https.js | 6 - Task/HTTPS/Python/https-3.py | 2 + Task/HTTPS/Visual-Basic/https.vb | 15 + Task/Hailstone-sequence/00DESCRIPTION | 4 +- Task/Hailstone-sequence/00META.yaml | 1 + .../ALGOL-W/hailstone-sequence.alg | 75 ++ ...-sequence.cpp => hailstone-sequence-1.cpp} | 0 .../C++/hailstone-sequence-2.cpp | 38 ++ .../Elena/hailstone-sequence.elena | 74 +- .../JavaScript/hailstone-sequence-4.js | 32 +- .../Julia/hailstone-sequence-1.julia | 16 +- .../Julia/hailstone-sequence-2.julia | 41 +- .../Perl-6/hailstone-sequence.pl6 | 2 +- ...ne-sequence.py => hailstone-sequence-1.py} | 0 .../Python/hailstone-sequence-2.py | 112 +++ .../VBA/hailstone-sequence.vba | 54 ++ Task/Hamming-numbers/00DESCRIPTION | 9 +- Task/Hamming-numbers/00META.yaml | 1 + .../Dart/hamming-numbers-1.dart | 81 +++ .../Dart/hamming-numbers-2.dart | 88 +++ .../Dart/hamming-numbers-3.dart | 83 +++ .../Haskell/hamming-numbers-5.hs | 47 +- .../Haskell/hamming-numbers-6.hs | 66 +- .../Haskell/hamming-numbers-7.hs | 40 ++ .../Haskell/hamming-numbers-8.hs | 48 ++ .../Julia/hamming-numbers-1.julia | 25 + .../Julia/hamming-numbers-2.julia | 16 + .../Julia/hamming-numbers-3.julia | 61 ++ .../Julia/hamming-numbers-4.julia | 41 ++ .../Julia/hamming-numbers-5.julia | 45 ++ .../Julia/hamming-numbers.julia | 19 - .../Hamming-numbers/Nim/hamming-numbers-7.nim | 67 ++ ...ming-numbers.pl6 => hamming-numbers-1.pl6} | 0 .../Perl-6/hamming-numbers-2.pl6 | 16 + Task/Hamming-numbers/Perl/hamming-numbers.pl | 28 +- .../Phix/hamming-numbers-1.phix | 31 +- .../Phix/hamming-numbers-2.phix | 18 +- .../Python/hamming-numbers-1.py | 7 +- .../REXX/hamming-numbers-1.rexx | 23 +- .../REXX/hamming-numbers-2.rexx | 35 +- .../Rust/hamming-numbers-5.rust | 6 +- Task/Hamming-numbers/SQL/hamming-numbers.sql | 37 + Task/Hamming-numbers/VBA/hamming-numbers.vba | 144 ++++ Task/Handle-a-signal/C++/handle-a-signal.cpp | 33 + ...andle-a-signal.pl => handle-a-signal-1.pl} | 42 -- .../Handle-a-signal/Perl/handle-a-signal-2.pl | 9 + .../Handle-a-signal/Phix/handle-a-signal.phix | 11 + Task/Happy-numbers/ALGOL-W/happy-numbers.alg | 54 ++ Task/Happy-numbers/Elena/happy-numbers.elena | 66 +- Task/Happy-numbers/Haskell/happy-numbers-1.hs | 3 +- Task/Happy-numbers/Haskell/happy-numbers-2.hs | 11 +- ...appy-numbers.java => happy-numbers-1.java} | 0 Task/Happy-numbers/Java/happy-numbers-2.java | 26 + .../K/{happy-numbers.k => happy-numbers-1.k} | 0 Task/Happy-numbers/K/happy-numbers-2.k | 8 + Task/Happy-numbers/Oz/happy-numbers.oz | 8 +- .../{happy-numbers.py => happy-numbers-1.py} | 0 Task/Happy-numbers/Python/happy-numbers-2.py | 79 +++ ...-numbers.visual => happy-numbers-1.visual} | 0 .../Visual-Basic-.NET/happy-numbers-2.visual | 40 ++ Task/Harshad-or-Niven-series/00META.yaml | 1 + .../360-Assembly/harshad-or-niven-series.360 | 57 ++ .../Crystal/harshad-or-niven-series.crystal | 4 + .../Factor/harshad-or-niven-series.factor | 2 + .../PicoLisp/harshad-or-niven-series.l | 16 +- .../Python/harshad-or-niven-series-3.py | 110 +++ .../Ruby/harshad-or-niven-series.rb | 4 +- .../Swift/harshad-or-niven-series.swift | 16 + .../Neko/hash-from-two-arrays.neko | 20 + .../OCaml/hash-from-two-arrays-2.ocaml | 4 +- .../REXX/hash-from-two-arrays.rexx | 42 +- Task/Hash-join/00META.yaml | 1 + Task/Hash-join/SQL/hash-join-1.sql | 30 +- Task/Hash-join/SQL/hash-join-2.sql | 2 +- Task/Haversine-formula/00META.yaml | 1 + .../Crystal/haversine-formula.crystal | 17 + .../Dart/haversine-formula.dart | 23 + .../Elena/haversine-formula.elena | 35 +- .../Free-Pascal/haversine-formula.free | 17 + .../Python/haversine-formula.py | 18 +- .../REXX/haversine-formula.rexx | 43 +- ...sine-formula.rb => haversine-formula-1.rb} | 0 .../Ruby/haversine-formula-2.rb | 17 + .../Transact-SQL/haversine-formula.sql | 23 + .../TypeScript/haversine-formula.type | 24 + .../VBA/haversine-formula.vba | 16 + .../haversine-formula.visual | 52 ++ .../C/hello-world-graphical-2.c | 2 +- .../C/hello-world-graphical-3.c | 3 + .../Elena/hello-world-graphical.elena | 44 +- .../Neko/hello-world-graphical-1.neko | 117 ++++ .../Neko/hello-world-graphical-2.neko | 34 + .../Ol/hello-world-graphical.ol | 2 + .../hello-world-graphical.smilebasic | 1 + .../VBA/hello-world-graphical.vba | 3 + .../Vala/hello-world-graphical.vala | 20 + .../BASIC/hello-world-line-printer-3.basic | 1 + .../Haskell/hello-world-line-printer.hs | 7 +- .../Julia/hello-world-line-printer.julia | 3 + .../Maple/hello-world-line-printer.maple | 1 + Task/Hello-world-Newbie/00META.yaml | 1 + .../JavaScript/hello-world-newbie-1.js | 1 + .../JavaScript/hello-world-newbie-2.js | 1 + .../JavaScript/hello-world-newbie-3.js | 1 + .../B/hello-world-newline-omission.b | 5 + .../hello-world-newline-omission-5.basic | 3 + .../hello-world-newline-omission-6.basic | 1 + .../Bc/hello-world-newline-omission.bc | 1 + .../Dc/hello-world-newline-omission-1.dc | 1 + .../Dc/hello-world-newline-omission-2.dc | 1 + .../Elena/hello-world-newline-omission.elena | 10 +- .../LLVM/hello-world-newline-omission.llvm | 14 + .../Neko/hello-world-newline-omission.neko | 14 + .../R/hello-world-newline-omission.r | 1 + .../Retro/hello-world-newline-omission.retro | 2 +- .../hello-world-newline-omission.visual | 7 + .../LLVM/hello-world-standard-error.llvm | 25 + .../Neko/hello-world-standard-error.neko | 14 + .../Ol/hello-world-standard-error.ol | 1 + .../Retro/hello-world-standard-error.retro | 3 +- .../Rust/hello-world-standard-error-1.rust | 7 +- .../Rust/hello-world-standard-error-2.rust | 13 +- .../Rust/hello-world-standard-error-3.rust | 10 + .../VBA/hello-world-standard-error.vba | 3 + .../hello-world-standard-error.visual | 7 + .../360-Assembly/hello-world-text-1.360 | 2 + .../6502-Assembly/hello-world-text.6502 | 2 +- .../Hello-world-Text/Arc/hello-world-text.arc | 1 + Task/Hello-world-Text/B/hello-world-text.b | 5 + .../hello-world-text.commodore | 3 + ...lo-world-text.dc => hello-world-text-1.dc} | 0 .../Hello-world-Text/Dc/hello-world-text-2.dc | 1 + .../Elena/hello-world-text.elena | 4 + Task/Hello-world-Text/J/hello-world-text-2.j | 24 + .../LLVM/hello-world-text.llvm | 8 +- .../Nickle/hello-world-text.nickle | 1 + .../Oforth/hello-world-text.oforth | 2 +- .../PowerBASIC/hello-world-text.powerbasic | 7 + ...ello-world-text.r => hello-world-text-1.r} | 0 Task/Hello-world-Text/R/hello-world-text-2.r | 1 + Task/Hello-world-Text/R/hello-world-text-3.r | 1 + .../Retro/hello-world-text.retro | 2 +- .../Rust/hello-world-text-1.rust | 2 +- .../Rust/hello-world-text-2.rust | 2 +- .../Visual-Basic/hello-world-text.vb | 19 + .../ZX-Spectrum-Basic/hello-world-text.zx | 1 + .../Free-Pascal/hello-world-web-server.free | 42 ++ .../Mathematica/hello-world-web-server-1.math | 8 + .../Mathematica/hello-world-web-server-2.math | 2 + ...-server.py => hello-world-web-server-1.py} | 0 .../Python/hello-world-web-server-2.py | 35 + Task/Here-document/00DESCRIPTION | 3 +- .../ARM-Assembly/here-document.arm | 56 ++ Task/Here-document/C/here-document.c | 18 +- .../Common-Lisp/here-document.lisp | 10 + ...{here-document.fth => here-document-1.fth} | 2 +- Task/Here-document/Forth/here-document-2.fth | 28 + Task/Here-document/Fortran/here-document.f | 12 +- Task/Here-document/OCaml/here-document.ocaml | 8 + Task/Here-document/Perl/here-document-6.pl | 12 +- .../UNIX-Shell/here-document-3.sh | 6 +- Task/Here-document/VBScript/here-document.vb | 38 +- Task/Here-document/XSLT/here-document.xslt | 2 +- Task/Heronian-triangles/00META.yaml | 1 + .../Ada/heronian-triangles.ada | 131 ++++ .../Factor/heronian-triangles.factor | 62 ++ .../Perl-6/heronian-triangles.pl6 | 19 +- .../Python/heronian-triangles.py | 30 +- .../REXX/heronian-triangles-1.rexx | 69 +- .../REXX/heronian-triangles-2.rexx | 60 +- .../VBA/heronian-triangles.vba | 52 ++ .../00META.yaml | 1 + ...ickerson-series-of-almost-integers.crystal | 21 + ...hickerson-series-of-almost-integers.factor | 18 + .../hickerson-series-of-almost-integers.phix | 9 + .../C-sharp/higher-order-functions-1.cs | 5 + .../C-sharp/higher-order-functions-2.cs | 2 + .../C-sharp/higher-order-functions-3.cs | 10 +- .../Elena/higher-order-functions.elena | 14 +- .../MATLAB/higher-order-functions.m | 2 +- .../Ol/higher-order-functions.ol | 9 + .../Retro/higher-order-functions.retro | 5 +- .../higher-order-functions-1.visual | 39 ++ .../higher-order-functions-2.visual | 29 + Task/History-variables/00META.yaml | 1 + .../ALGOL-W/history-variables.alg | 35 + .../Ada/history-variables-1.ada | 4 +- .../Elena/history-variables.elena | 80 ++- .../Factor/history-variables.factor | 12 + .../Julia/history-variables.julia | 15 + .../Rust/history-variables.rust | 43 ++ .../hofstadter-conway-$10,000-sequence.lua | 36 + .../hofstadter-conway-$10,000-sequence.pl6 | 14 + .../hofstadter-conway-$10,000-sequence.phix | 26 + .../hofstadter-conway-$10,000-sequence.vba | 34 + .../00META.yaml | 1 + .../hofstadter-figure-figure-sequences-1.hs | 27 +- .../hofstadter-figure-figure-sequences-2.hs | 21 +- .../hofstadter-figure-figure-sequences.phix | 35 + .../hofstadter-figure-figure-sequences.vba | 59 ++ Task/Hofstadter-Q-sequence/00META.yaml | 1 + .../APL/hofstadter-q-sequence.apl | 8 + .../BASIC256/hofstadter-q-sequence.basic256 | 17 + .../FreeBASIC/hofstadter-q-sequence.freebasic | 21 + .../Phix/hofstadter-q-sequence.phix | 22 + .../PureBasic/hofstadter-q-sequence.purebasic | 22 + .../REXX/hofstadter-q-sequence-1.rexx | 38 +- .../REXX/hofstadter-q-sequence-2.rexx | 23 +- .../REXX/hofstadter-q-sequence-3.rexx | 26 +- .../VBA/hofstadter-q-sequence.vba | 17 + .../VBA/holidays-related-to-easter.vba | 51 ++ Task/Honeycombs/Go/honeycombs.go | 118 ++++ Task/Honeycombs/Julia/honeycombs.julia | 108 +++ Task/Honeycombs/Scala/honeycombs.scala | 91 +++ .../horizontal-sundial-calculations.factor | 32 + .../horizontal-sundial-calculations.hs | 48 +- .../horizontal-sundial-calculations.liberty | 38 +- .../Perl/horizontal-sundial-calculations.pl | 25 + .../00META.yaml | 1 + ...rners-rule-for-polynomial-evaluation.elena | 20 +- ...s-rule-for-polynomial-evaluation.freebasic | 13 + ...ners-rule-for-polynomial-evaluation-2.rust | 21 +- ...ners-rule-for-polynomial-evaluation.visual | 11 + .../Neko/host-introspection-1.neko | 16 + .../Neko/host-introspection-2.neko | 16 + .../Perl-6/host-introspection-1.pl6 | 4 + .../Perl-6/host-introspection-2.pl6 | 1 + .../Perl-6/host-introspection.pl6 | 3 - .../R/host-introspection-1.r | 1 + .../R/host-introspection-2.r | 1 + .../Host-introspection/R/host-introspection.r | 3 - .../Rust/host-introspection.rust | 22 + Task/Hostname/Phix/hostname.phix | 6 + Task/Hostname/Rust/hostname.rust | 6 + Task/Hostname/Visual-Basic/hostname.vb | 21 + .../Julia/hough-transform.julia | 6 + .../Perl-6/hough-transform.pl6 | 38 ++ Task/Hough-transform/Perl/hough-transform.pl | 39 ++ .../Hough-transform/Phix/hough-transform.phix | 53 ++ .../Haskell/huffman-coding-1.hs | 15 +- .../Haskell/huffman-coding-2.hs | 1 - .../Huffman-coding/Julia/huffman-coding.julia | 53 ++ Task/I-before-E-except-after-C/00DESCRIPTION | 2 +- Task/I-before-E-except-after-C/00META.yaml | 1 + .../AutoHotkey/i-before-e-except-after-c.ahk | 2 +- ...-c.bat => i-before-e-except-after-c-1.bat} | 0 .../i-before-e-except-after-c-2.bat | 11 + .../i-before-e-except-after-c-3.bat | 12 + .../Clojure/i-before-e-except-after-c.clj | 2 +- .../Haskell/i-before-e-except-after-c.hs | 2 +- .../Kotlin/i-before-e-except-after-c.kotlin | 2 +- .../Lasso/i-before-e-except-after-c.lasso | 2 +- .../Lua/i-before-e-except-after-c.lua | 2 +- .../Maple/i-before-e-except-after-c.maple | 2 +- .../i-before-e-except-after-c-1.math | 2 +- .../Objeck/i-before-e-except-after-c.objeck | 2 +- .../Phix/i-before-e-except-after-c.phix | 2 +- .../i-before-e-except-after-c-1.psh | 2 +- .../i-before-e-except-after-c-2.psh | 2 +- .../Python/i-before-e-except-after-c-1.py | 2 +- .../R/i-before-e-except-after-c.r | 2 +- .../Ruby/i-before-e-except-after-c.rb | 2 +- .../Rust/i-before-e-except-after-c.rust | 79 +++ .../Scala/i-before-e-except-after-c.scala | 2 +- .../Seed7/i-before-e-except-after-c.seed7 | 2 +- .../Swift/i-before-e-except-after-c.swift | 2 +- .../TUSCRIPT/i-before-e-except-after-c.tu | 2 +- .../Tcl/i-before-e-except-after-c.tcl | 2 +- .../i-before-e-except-after-c.visual | 135 ++++ Task/IBAN/C/iban.c | 2 +- Task/IBAN/Factor/iban.factor | 50 ++ Task/IBAN/VBA/iban.vba | 80 +++ ...ity-matrix.lisp => identity-matrix-1.lisp} | 0 .../Common-Lisp/identity-matrix-2.lisp | 5 + .../Elena/identity-matrix.elena | 22 +- .../PowerShell/identity-matrix-1.psh | 15 +- .../Python/identity-matrix-2.py | 72 +- .../Python/identity-matrix-3.py | 12 +- .../Python/identity-matrix-4.py | 1 + .../REXX/identity-matrix-1.rexx | 63 +- .../Smalltalk/identity-matrix.st | 1 + .../Swift/identity-matrix.swift | 7 + Task/Identity-matrix/VBA/identity-matrix.vba | 8 + .../Visual-Basic/identity-matrix.vb | 38 ++ .../Common-Lisp/image-convolution.lisp | 68 ++ .../MATLAB/image-convolution.m | 10 +- .../Perl-6/image-convolution.pl6 | 31 + .../Phix/image-convolution.phix | 107 +++ Task/Image-noise/00DESCRIPTION | 6 +- Task/Image-noise/Go/image-noise-2.go | 2 +- Task/Image-noise/Julia/image-noise.julia | 39 ++ Task/Image-noise/Nim/image-noise-1.nim | 23 + Task/Image-noise/Nim/image-noise-2.nim | 35 + Task/Image-noise/Perl-6/image-noise.pl6 | 44 +- Task/Image-noise/Perl/image-noise.pl | 40 ++ Task/Image-noise/Phix/image-noise.phix | 64 ++ Task/Image-noise/Processing/image-noise | 23 + .../Visual-Basic-.NET/image-noise.visual | 221 +++--- Task/Include-a-file/00META.yaml | 1 + .../ARM-Assembly/include-a-file.arm | 232 +++++++ Task/Include-a-file/Processing/include-a-file | 2 + .../Include-a-file/Retro/include-a-file.retro | 2 +- .../Include-a-file/Rust/include-a-file-1.rust | 2 +- .../increment-a-numerical-string.arm | 203 ++++++ .../increment-a-numerical-string.applescript | 107 +++ .../increment-a-numerical-string-2.basic | 4 +- .../increment-a-numerical-string-3.basic | 2 + .../Elena/increment-a-numerical-string.elena | 14 +- .../Haskell/increment-a-numerical-string-5.hs | 30 + .../increment-a-numerical-string-2.js | 61 +- ...g.py => increment-a-numerical-string-1.py} | 0 .../Python/increment-a-numerical-string-2.py | 36 + .../Retro/increment-a-numerical-string.retro | 2 +- Task/Infinity/Clojure/infinity.clj | 3 + Task/Infinity/Ol/infinity.ol | 8 + Task/Infinity/Visual-Basic/infinity.vb | 34 +- .../Elena/inheritance-multiple-1.elena | 24 +- .../Elena/inheritance-multiple-2.elena | 24 +- .../Factor/inheritance-multiple.factor | 3 + .../Julia/inheritance-multiple.julia | 35 + .../Rust/inheritance-multiple.rust | 3 + .../Elena/inheritance-single.elena | 10 +- .../Oberon-2/inheritance-single.oberon-2 | 2 +- .../Rust/inheritance-single.rust | 5 + Task/Input-loop/BASIC/input-loop-3.basic | 15 + Task/Input-loop/BASIC/input-loop-4.basic | 11 + Task/Input-loop/Elena/input-loop-1.elena | 14 +- Task/Input-loop/Elena/input-loop-2.elena | 18 +- Task/Input-loop/OCaml/input-loop-4.ocaml | 7 + Task/Input-loop/REXX/input-loop-4.rexx | 4 +- Task/Input-loop/REXX/input-loop-5.rexx | 6 +- Task/Input-loop/VBA/input-loop.vba | 10 + .../ABAP/integer-comparison.abap | 13 + .../BASIC/integer-comparison-4.basic | 9 + .../BASIC/integer-comparison-5.basic | 10 + .../COBOL/integer-comparison.cobol | 2 +- .../Elena/integer-comparison.elena | 18 +- ...er-comparison.l => integer-comparison-1.l} | 0 .../Emacs-Lisp/integer-comparison-2.l | 7 + .../Emacs-Lisp/integer-comparison-3.l | 1 + .../OCaml/integer-comparison.ocaml | 15 +- .../Ol/integer-comparison.ol | 16 + .../PicoLisp/integer-comparison.l | 2 +- .../Retro/integer-comparison.retro | 4 + .../VBA/integer-comparison.vba | 7 + Task/Integer-overflow/00META.yaml | 1 + .../FreeBASIC/integer-overflow.freebasic | 4 +- .../Groovy/integer-overflow.groovy | 61 ++ .../Lingo/integer-overflow.lingo | 4 +- .../Integer-overflow/Perl/integer-overflow.pl | 3 + Task/Integer-sequence/00META.yaml | 1 + ...-sequence.8080 => integer-sequence-1.8080} | 0 .../8080-Assembly/integer-sequence-2.8080 | 34 + .../Elena/integer-sequence.elena | 16 +- .../LLVM/integer-sequence.llvm | 35 + .../Integer-sequence/Ol/integer-sequence-1.ol | 3 + .../Integer-sequence/Ol/integer-sequence-2.ol | 4 + .../Phix/integer-sequence-3.phix | 10 +- Task/Integer-sequence/Q/integer-sequence-1.q | 1 + Task/Integer-sequence/Q/integer-sequence-2.q | 1 + .../Retro/integer-sequence.retro | 2 +- ...uence.visual => integer-sequence-1.visual} | 0 .../integer-sequence-2.visual | 45 ++ .../Retro/interactive-programming.retro | 4 +- ...amming.st => interactive-programming-1.st} | 0 .../Smalltalk/interactive-programming-2.st | 9 + .../Introspection/Lingo/introspection-2.lingo | 2 +- Task/Introspection/Phix/introspection-1.phix | 2 + Task/Introspection/Phix/introspection-2.phix | 7 + Task/Introspection/Phix/introspection-3.phix | 113 +++ Task/Introspection/Phix/introspection-4.phix | 9 + .../Introspection/Retro/introspection-1.retro | 2 +- .../Introspection/Retro/introspection-2.retro | 10 +- .../Introspection/Retro/introspection-3.retro | 7 +- .../Inverted-index/Julia/inverted-index.julia | 36 + Task/Inverted-syntax/00META.yaml | 1 + Task/Inverted-syntax/Nim/inverted-syntax.nim | 31 + .../Inverted-syntax/Phix/inverted-syntax.phix | 17 + .../Prolog/inverted-syntax.pro | 7 + Task/Iterated-digits-squaring/00META.yaml | 1 + .../AWK/iterated-digits-squaring.awk | 28 + ...aring.cs => iterated-digits-squaring-1.cs} | 0 .../C-sharp/iterated-digits-squaring-2.cs | 38 ++ .../Objeck/iterated-digits-squaring.objeck | 44 ++ .../Perl-6/iterated-digits-squaring-3.pl6 | 60 +- .../Sidef/iterated-digits-squaring.sidef | 10 + .../Swift/iterated-digits-squaring.swift | 53 ++ Task/JSON/00DESCRIPTION | 2 +- Task/JSON/00META.yaml | 1 + Task/JSON/Elena/json.elena | 18 +- .../ARM-Assembly/jensens-device.arm | 82 +++ .../Factor/jensens-device-1.factor | 3 + .../Factor/jensens-device-2.factor | 7 + Task/Jensens-Device/Ruby/jensens-device-3.rb | 6 +- Task/Jensens-Device/VBA/jensens-device.vba | 12 + .../ZX-Spectrum-Basic/jensens-device.zx | 12 + .../BASIC/josephus-problem-3.basic | 14 + .../Crystal/josephus-problem.crystal | 6 + .../FreeBASIC/josephus-problem.freebasic | 12 + .../PowerShell/josephus-problem-1.psh | 1 - .../Processing/josephus-problem | 36 + .../Rust/josephus-problem.rust | 26 + .../Visual-Basic-.NET/josephus-problem.visual | 25 + .../ZX-Spectrum-Basic/josephus-problem.zx | 12 + .../Joystick-position/Go/joystick-position.go | 103 +++ .../Julia/joystick-position.julia | 76 +++ .../OCaml/joystick-position.ocaml | 6 +- .../Jump-anywhere/BASIC/jump-anywhere-5.basic | 22 +- .../Jump-anywhere/BASIC/jump-anywhere-6.basic | 20 + Task/Jump-anywhere/C/jump-anywhere-6.c | 2 +- ...p-anywhere.cobol => jump-anywhere-1.cobol} | 0 .../Jump-anywhere/COBOL/jump-anywhere-2.cobol | 2 + Task/Jump-anywhere/Neko/jump-anywhere.neko | 5 + Task/Jump-anywhere/Ol/jump-anywhere.ol | 13 + Task/Jump-anywhere/Racket/jump-anywhere-3.rkt | 2 +- Task/Jump-anywhere/VBA/jump-anywhere.vba | 19 + Task/K-d-tree/00META.yaml | 1 + Task/K-d-tree/Julia/k-d-tree.julia | 31 + Task/K-d-tree/Phix/k-d-tree.phix | 153 +++++ .../Julia/k-means++-clustering.julia | 34 + .../Lua/k-means++-clustering.lua | 203 ++++++ .../Phix/k-means++-clustering.phix | 182 +++++ Task/Kaprekar-numbers/00DESCRIPTION | 4 +- Task/Kaprekar-numbers/00META.yaml | 1 + .../360-Assembly/kaprekar-numbers.360 | 2 +- .../Factor/kaprekar-numbers.factor | 38 +- .../Maple/kaprekar-numbers.maple | 26 + .../Perl-6/kaprekar-numbers-2.pl6 | 11 +- .../REXX/kaprekar-numbers.rexx | 12 +- .../Sidef/kaprekar-numbers.sidef | 18 +- .../Visual-Basic-.NET/kaprekar-numbers.visual | 51 ++ ...eyboard-input-flush-the-keyboard-buffer.hs | 26 + ...yboard-input-flush-the-keyboard-buffer.pl6 | 34 + .../keyboard-input-keypress-check.arm | 394 +++++++++++ .../keyboard-input-keypress-check-3.basic | 3 +- .../keyboard-input-keypress-check-4.basic | 1 + .../keyboard-input-keypress-check-5.basic | 2 + .../keyboard-input-keypress-check-6.basic | 1 + .../keyboard-input-keypress-check-7.basic | 1 + .../Elena/keyboard-input-keypress-check.elena | 18 +- .../Julia/keyboard-input-keypress-check.julia | 21 + .../Perl-6/keyboard-input-keypress-check.pl6 | 10 + ...ard-input-obtain-a-y-or-n-response-2.basic | 14 +- ...ard-input-obtain-a-y-or-n-response-3.basic | 10 +- ...ard-input-obtain-a-y-or-n-response-4.basic | 15 +- ...ard-input-obtain-a-y-or-n-response-5.basic | 11 +- ...ard-input-obtain-a-y-or-n-response-6.basic | 8 + ...ard-input-obtain-a-y-or-n-response-7.basic | 5 + ...oard-input-obtain-a-y-or-n-response-3.lisp | 2 +- ...yboard-input-obtain-a-y-or-n-response-1.js | 39 +- ...yboard-input-obtain-a-y-or-n-response-2.js | 18 +- ...yboard-input-obtain-a-y-or-n-response-3.js | 6 + ...board-input-obtain-a-y-or-n-response.julia | 16 +- ...board-input-obtain-a-y-or-n-response.mumps | 1 + ...yboard-input-obtain-a-y-or-n-response.math | 6 + Task/Keyboard-macros/00DESCRIPTION | 7 +- Task/Keyboard-macros/Go/keyboard-macros.go | 58 ++ .../Julia/keyboard-macros.julia | 22 + Task/Keyboard-macros/Perl/keyboard-macros.pl | 39 ++ .../Keyboard-macros/REXX/keyboard-macros.rexx | 2 +- .../Crystal/knapsack-problem-0-1.crystal | 86 +++ ...lem-0-1.pl6 => knapsack-problem-0-1-1.pl6} | 0 .../Perl-6/knapsack-problem-0-1-2.pl6 | 57 ++ .../Perl/knapsack-problem-0-1.pl | 50 +- .../Swift/knapsack-problem-0-1.swift | 60 ++ .../knapsack-problem-bounded-1.crystal | 76 +++ .../knapsack-problem-bounded-2.crystal | 60 ++ ...ded.pl6 => knapsack-problem-bounded-1.pl6} | 0 .../Perl-6/knapsack-problem-bounded-2.pl6 | 55 ++ .../Python/knapsack-problem-bounded-1.py | 21 +- .../Ada/knapsack-problem-continuous.ada | 26 +- .../Rust/knapsack-problem-continuous.rust | 34 + .../Perl-6/knapsack-problem-unbounded.pl6 | 2 +- Task/Knights-tour/00META.yaml | 1 + .../FreeBASIC/knights-tour.freebasic | 57 ++ Task/Knights-tour/Julia/knights-tour.julia | 18 + Task/Knights-tour/Rust/knights-tour.rust | 64 +- .../ARM-Assembly/knuth-shuffle.arm | 229 +++++++ Task/Knuth-shuffle/Aime/knuth-shuffle.aime | 4 +- Task/Knuth-shuffle/Clojure/knuth-shuffle.clj | 2 +- Task/Knuth-shuffle/Elena/knuth-shuffle.elena | 34 +- Task/Knuth-shuffle/Haskell/knuth-shuffle-1.hs | 20 +- Task/Knuth-shuffle/Haskell/knuth-shuffle-2.hs | 25 +- Task/Knuth-shuffle/Haskell/knuth-shuffle-3.hs | 24 +- Task/Knuth-shuffle/Haskell/knuth-shuffle-4.hs | 21 + Task/Knuth-shuffle/Ol/knuth-shuffle-1.ol | 15 + Task/Knuth-shuffle/Ol/knuth-shuffle-2.ol | 7 + .../{knuth-shuffle.py => knuth-shuffle-1.py} | 0 Task/Knuth-shuffle/Python/knuth-shuffle-2.py | 95 +++ Task/Knuth-shuffle/VBA/knuth-shuffle.vba | 49 ++ Task/Knuths-algorithm-S/00META.yaml | 1 + .../Elena/knuths-algorithm-s.elena | 75 +- .../Haskell/knuths-algorithm-s.hs | 48 ++ .../Haskell/lu-decomposition.hs | 69 ++ .../LU-decomposition/Perl/lu-decomposition.pl | 84 +++ .../Rust/lu-decomposition.rust | 86 +++ .../LU-decomposition/VBA/lu-decomposition.vba | 95 +++ .../Elixir/lzw-compression.elixir | 2 +- .../FreeBASIC/lzw-compression.freebasic | 110 +++ .../Haskell/lzw-compression.hs | 38 ++ .../Julia/lzw-compression.julia | 12 +- Task/LZW-compression/Ol/lzw-compression-1.ol | 25 + Task/LZW-compression/Ol/lzw-compression-2.ol | 27 + .../REXX/lzw-compression-1.rexx | 6 +- .../REXX/lzw-compression-2.rexx | 46 +- .../LZW-compression/Xojo/lzw-compression.xojo | 105 +++ Task/Langtons-ant/Aime/langtons-ant.aime | 46 +- Task/Langtons-ant/Forth/langtons-ant.fth | 65 ++ Task/Langtons-ant/Julia/langtons-ant.julia | 18 + Task/Langtons-ant/Octave/langtons-ant.octave | 11 + Task/Langtons-ant/Python/langtons-ant.py | 99 ++- .../00META.yaml | 1 + .../largest-int-from-concatenated-ints.aime | 12 +- .../largest-int-from-concatenated-ints-4.hs | 3 +- .../largest-int-from-concatenated-ints.rust | 16 + .../K/last-friday-of-each-month.k | 12 + Task/Last-letter-first-letter/00META.yaml | 1 + .../JavaScript/last-letter-first-letter.js | 90 +++ .../Perl-6/last-letter-first-letter.pl6 | 8 +- .../Perl/last-letter-first-letter.pl | 27 +- .../REXX/last-letter-first-letter-1.rexx | 58 +- .../REXX/last-letter-first-letter-2.rexx | 42 +- .../VBScript/last-letter-first-letter.vb | 58 ++ Task/Leap-year/00DESCRIPTION | 5 +- Task/Leap-year/360-Assembly/leap-year.360 | 10 +- Task/Leap-year/68000-Assembly/leap-year.68000 | 44 ++ Task/Leap-year/Arc/leap-year-1.arc | 3 + Task/Leap-year/Arc/leap-year-2.arc | 2 + Task/Leap-year/BASIC/leap-year-3.basic | 11 +- Task/Leap-year/BASIC/leap-year-4.basic | 8 +- Task/Leap-year/BASIC/leap-year-5.basic | 7 +- Task/Leap-year/BASIC/leap-year-6.basic | 13 +- Task/Leap-year/BASIC/leap-year-7.basic | 12 + Task/Leap-year/Emacs-Lisp/leap-year.l | 4 + Task/Leap-year/LLVM/leap-year.llvm | 94 +++ Task/Leap-year/Neko/leap-year.neko | 9 + Task/Leap-year/Q/leap-year.q | 1 + Task/Leap-year/REXX/leap-year-2.rexx | 2 +- Task/Leap-year/REXX/leap-year-3.rexx | 2 +- Task/Leap-year/REXX/leap-year-4.rexx | 1 - Task/Leap-year/RPG/leap-year.rpg | 27 + Task/Leap-year/Scala/leap-year-2.scala | 9 +- Task/Leap-year/Scala/leap-year-3.scala | 9 +- Task/Leap-year/VBA/leap-year.vba | 3 + .../Visual-Basic-.NET/leap-year.visual | 9 + Task/Least-common-multiple/00META.yaml | 1 + .../360-Assembly/least-common-multiple.360 | 30 + .../BASIC/least-common-multiple-3.basic | 8 + .../Elena/least-common-multiple.elena | 16 +- .../least-common-multiple.liberty | 12 +- .../Python/least-common-multiple-2.py | 114 +++- .../Python/least-common-multiple-3.py | 39 +- .../Python/least-common-multiple-4.py | 25 +- .../Python/least-common-multiple-5.py | 18 + .../VBA/least-common-multiple.vba | 12 + .../Factor/left-factorials.factor | 9 +- .../Perl-6/left-factorials-1.pl6 | 11 +- .../Perl-6/left-factorials-2.pl6 | 9 +- .../Left-factorials/Phix/left-factorials.phix | 25 +- ...eft-factorials.py => left-factorials-1.py} | 0 .../Python/left-factorials-2.py | 95 +++ .../Pascal/letter-frequency.pascal | 37 +- .../Python/letter-frequency-2.py | 186 ++++- .../Python/letter-frequency-3.py | 28 +- .../Python/letter-frequency-4.py | 15 +- .../Python/letter-frequency-5.py | 3 + .../Swift/letter-frequency.swift | 19 + Task/Levenshtein-distance/00META.yaml | 1 + .../Aime/levenshtein-distance.aime | 28 +- .../C/levenshtein-distance-1.c | 2 +- ...crystal => levenshtein-distance-1.crystal} | 0 .../Crystal/levenshtein-distance-2.crystal | 23 + .../Crystal/levenshtein-distance-3.crystal | 31 + .../Haskell/levenshtein-distance.hs | 2 +- .../Java/levenshtein-distance-3.java | 69 ++ .../Julia/levenshtein-distance-1.julia | 8 +- .../Kotlin/levenshtein-distance-2.kotlin | 4 +- .../Nim/levenshtein-distance-1.nim | 4 + ...istance.nim => levenshtein-distance-2.nim} | 0 .../Processing/levenshtein-distance | 18 + .../Python/levenshtein-distance-3.py | 53 +- .../Python/levenshtein-distance-4.py | 13 + .../Python/levenshtein-distance-5.py | 147 ++++ .../REXX/levenshtein-distance-1.rexx | 32 +- .../VBA/levenshtein-distance.vba | 41 ++ .../Visual-Basic/levenshtein-distance.vb | 60 ++ .../00DESCRIPTION | 16 +- .../linear-congruential-generator.pascal | 8 +- .../Phix/linear-congruential-generator.phix | 32 +- .../REXX/linear-congruential-generator.rexx | 10 +- .../VBA/linear-congruential-generator.vba | 26 + .../Factor/list-comprehensions.factor | 9 + .../Go/list-comprehensions.go | 62 ++ .../Python/list-comprehensions-8.py | 59 ++ .../REXX/list-comprehensions-1.rexx | 14 +- .../REXX/list-comprehensions-2.rexx | 13 +- .../Ruby/list-comprehensions-2.rb | 25 +- .../Stata/list-comprehensions.stata | 2 +- .../Elena/literals-floating-point.elena | 6 +- .../Factor/literals-floating-point.factor | 27 + .../Visual-Basic/literals-floating-point-1.vb | 22 + .../Visual-Basic/literals-floating-point-2.vb | 23 + .../ARM-Assembly/literals-integer.arm | 137 ++++ .../BASIC/literals-integer-3.basic | 3 + .../BASIC/literals-integer-4.basic | 3 + .../Elena/literals-integer.elena | 4 +- .../FutureBasic/literals-integer.futurebasic | 1 - .../Neko/literals-integer.neko | 8 + .../Visual-Basic/literals-integer.vb | 28 + .../ARM-Assembly/literals-string.arm | 78 +++ .../BASIC/literals-string-4.basic | 9 +- .../BASIC/literals-string-5.basic | 3 + .../BASIC/literals-string-6.basic | 6 + .../Elena/literals-string.elena | 9 +- .../Factor/literals-string-1.factor | 1 + .../Factor/literals-string-10.factor | 7 + .../Factor/literals-string-11.factor | 15 + .../Factor/literals-string-2.factor | 5 + .../Factor/literals-string-3.factor | 1 + .../Factor/literals-string-4.factor | 1 + .../Factor/literals-string-5.factor | 1 + .../Factor/literals-string-6.factor | 1 + .../Factor/literals-string-7.factor | 3 + .../Factor/literals-string-8.factor | 4 + .../Factor/literals-string-9.factor | 8 + .../FreeBASIC/literals-string.freebasic | 5 + .../Literals-String/IDL/literals-string-3.idl | 2 +- .../Julia/literals-string-1.julia | 3 + .../Julia/literals-string-2.julia | 1 + .../Julia/literals-string-3.julia | 1 + .../Julia/literals-string-4.julia | 5 + .../Julia/literals-string-5.julia | 2 + .../OCaml/literals-string-5.ocaml | 4 + .../Retro/literals-string.retro | 5 +- .../Visual-Basic/literals-string.vb | 2 + .../Literals-String/Xojo/literals-string.xojo | 2 + .../ARM-Assembly/logical-operations.arm | 134 ++++ .../Dc/logical-operations.dc | 21 + .../Elena/logical-operations.elena | 20 +- .../Icon/logical-operations.icon | 2 +- .../LLVM/logical-operations.llvm | 101 +++ .../Neko/logical-operations.neko | 16 + .../Python/logical-operations.py | 6 +- .../Stata/logical-operations-1.stata | 6 + .../Stata/logical-operations-2.stata | 5 + .../ALGOL-W/long-multiplication.alg | 112 +++ .../Aime/long-multiplication.aime | 39 +- .../Haskell/long-multiplication-1.hs | 24 +- .../Lambdatalk/long-multiplication.lambdatalk | 91 ++- .../Ol/long-multiplication.ol | 3 + .../Python/long-multiplication-3.py | 53 +- .../C++/longest-common-subsequence-1.cpp | 18 +- .../Factor/longest-common-subsequence.factor | 2 + .../Python/longest-common-subsequence-3.py | 25 +- .../Scala/longest-common-subsequence-1.scala | 19 +- .../Scala/longest-common-subsequence-2.scala | 21 +- .../Scala/longest-common-subsequence-3.scala | 11 + .../Scala/longest-common-subsequence-4.scala | 16 + .../Swift/longest-common-subsequence-1.swift | 26 +- .../00DESCRIPTION | 3 +- .../00META.yaml | 1 + .../longest-increasing-subsequence.js | 67 +- .../Perl/longest-increasing-subsequence-1.pl | 4 +- .../REXX/longest-increasing-subsequence.rexx | 33 + .../longest-increasing-subsequence.swift | 48 ++ .../Rust/longest-string-challenge.rust | 50 ++ .../FreeBASIC/look-and-say-sequence.freebasic | 25 + .../Julia/look-and-say-sequence.julia | 20 +- .../Perl/look-and-say-sequence-2.pl | 2 +- .../REXX/look-and-say-sequence-1.rexx | 39 +- .../REXX/look-and-say-sequence-2.rexx | 51 +- .../Swift/look-and-say-sequence.swift | 28 + .../00DESCRIPTION | 2 + ...ver-multiple-arrays-simultaneously-1.elena | 27 +- ...ver-multiple-arrays-simultaneously-2.elena | 22 +- ...ver-multiple-arrays-simultaneously.harbour | 10 + ...p-over-multiple-arrays-simultaneously-2.py | 3 +- ...over-multiple-arrays-simultaneously.visual | 18 + Task/Loops-Break/00DESCRIPTION | 1 + Task/Loops-Break/ARM-Assembly/loops-break.arm | 181 +++++ Task/Loops-Break/BASIC/loops-break-3.basic | 14 +- Task/Loops-Break/BASIC/loops-break-4.basic | 12 +- Task/Loops-Break/BASIC/loops-break-5.basic | 10 +- Task/Loops-Break/BASIC/loops-break-6.basic | 5 + Task/Loops-Break/Befunge/loops-break.bf | 11 + Task/Loops-Break/Neko/loops-break.neko | 22 + Task/Loops-Break/Ol/loops-break.ol | 8 + Task/Loops-Break/Rust/loops-break.rust | 6 +- Task/Loops-Break/Spin/loops-break.spin | 25 + Task/Loops-Break/VBA/loops-break.vba | 10 + .../Visual-Basic-.NET/loops-break.visual | 16 + Task/Loops-Continue/00DESCRIPTION | 2 + .../Befunge/loops-continue-1.bf | 6 + .../Befunge/loops-continue-2.bf | 6 + .../Common-Lisp/loops-continue-1.lisp | 9 +- .../Common-Lisp/loops-continue-2.lisp | 6 +- Task/Loops-Continue/Neko/loops-continue.neko | 20 + .../Objeck/loops-continue.objeck | 11 + Task/Loops-Continue/Rust/loops-continue.rust | 4 +- .../Smalltalk/loops-continue.st | 10 + Task/Loops-Continue/Spin/loops-continue.spin | 20 + .../Loops-Continue/Swift/loops-continue.swift | 8 +- Task/Loops-Continue/VBA/loops-continue.vba | 12 + Task/Loops-Do-while/00DESCRIPTION | 2 + .../ARM-Assembly/loops-do-while.arm | 140 ++++ .../BASIC/loops-do-while-3.basic | 9 +- .../BASIC/loops-do-while-4.basic | 4 + .../Loops-Do-while/MUMPS/loops-do-while.mumps | 8 + .../Mathematica/loops-do-while.math | 6 + Task/Loops-Do-while/Neko/loops-do-while.neko | 12 + Task/Loops-Do-while/Spin/loops-do-while.spin | 20 + Task/Loops-Do-while/VBA/loops-do-while.vba | 8 + Task/Loops-Downward-for/00DESCRIPTION | 2 + .../ARM-Assembly/loops-downward-for.arm | 111 +++ .../BASIC/loops-downward-for-5.basic | 3 + .../Prolog/loops-downward-for.pro | 6 + .../Rust/loops-downward-for.rust | 2 +- .../Spin/loops-downward-for.spin | 17 + .../VBA/loops-downward-for.vba | 3 + .../00DESCRIPTION | 2 + .../loops-for-with-a-specified-step.arm | 136 ++++ .../loops-for-with-a-specified-step-4.basic | 8 +- .../loops-for-with-a-specified-step-5.basic | 8 +- .../loops-for-with-a-specified-step-6.basic | 3 + .../loops-for-with-a-specified-step.elena | 16 +- .../loops-for-with-a-specified-step-1.pro | 6 + .../loops-for-with-a-specified-step-2.pro | 2 + .../loops-for-with-a-specified-step-1.rust | 10 +- .../loops-for-with-a-specified-step-2.rust | 12 +- .../Spin/loops-for-with-a-specified-step.spin | 17 + Task/Loops-For/00DESCRIPTION | 2 + Task/Loops-For/BASIC/loops-for-10.basic | 25 +- Task/Loops-For/BASIC/loops-for-11.basic | 17 +- Task/Loops-For/BASIC/loops-for-12.basic | 12 +- Task/Loops-For/BASIC/loops-for-13.basic | 17 +- Task/Loops-For/BASIC/loops-for-14.basic | 13 +- Task/Loops-For/BASIC/loops-for-15.basic | 12 +- Task/Loops-For/BASIC/loops-for-16.basic | 13 +- Task/Loops-For/BASIC/loops-for-17.basic | 12 +- Task/Loops-For/BASIC/loops-for-18.basic | 6 + Task/Loops-For/BASIC/loops-for-4.basic | 27 +- Task/Loops-For/BASIC/loops-for-5.basic | 27 +- Task/Loops-For/BASIC/loops-for-6.basic | 14 +- Task/Loops-For/BASIC/loops-for-7.basic | 13 +- Task/Loops-For/BASIC/loops-for-8.basic | 24 +- Task/Loops-For/BASIC/loops-for-9.basic | 12 +- Task/Loops-For/Elena/loops-for.elena | 20 +- Task/Loops-For/GW-BASIC/loops-for.gw-basic | 7 + Task/Loops-For/Prolog/loops-for.pro | 4 + Task/Loops-For/REXX/loops-for-1.rexx | 5 +- Task/Loops-For/REXX/loops-for-2.rexx | 5 +- Task/Loops-For/Rust/loops-for.rust | 2 +- Task/Loops-For/Scala/loops-for.scala | 2 +- Task/Loops-For/Spin/loops-for.spin | 18 + Task/Loops-For/Swift/loops-for.swift | 6 + Task/Loops-Foreach/00DESCRIPTION | 2 + .../BASIC/loops-foreach-10.basic | 16 +- .../BASIC/loops-foreach-11.basic | 12 +- .../BASIC/loops-foreach-12.basic | 9 +- .../BASIC/loops-foreach-13.basic | 6 + .../BASIC/loops-foreach-14.basic | 5 + .../BASIC/loops-foreach-15.basic | 13 + .../BASIC/loops-foreach-16.basic | 5 + .../BASIC/loops-foreach-17.basic | 8 + .../Loops-Foreach/BASIC/loops-foreach-6.basic | 37 +- .../Loops-Foreach/BASIC/loops-foreach-7.basic | 27 +- .../Loops-Foreach/BASIC/loops-foreach-8.basic | 40 +- .../Loops-Foreach/BASIC/loops-foreach-9.basic | 20 +- Task/Loops-Foreach/Elena/loops-foreach.elena | 20 +- ...oops-foreach.java => loops-foreach-1.java} | 0 Task/Loops-Foreach/Java/loops-foreach-2.java | 3 + Task/Loops-Foreach/Retro/loops-foreach.retro | 30 +- Task/Loops-Foreach/Rust/loops-foreach-3.rust | 2 + .../Loops-Foreach/Scala/loops-foreach-1.scala | 3 +- .../Loops-Foreach/Scala/loops-foreach-2.scala | 3 +- Task/Loops-Infinite/00DESCRIPTION | 2 + .../BASIC/loops-infinite-5.basic | 3 + ...{loops-infinite.bf => loops-infinite-1.bf} | 0 .../Brainf---/loops-infinite-2.bf | 4 + Task/Loops-Infinite/C++/loops-infinite-1.cpp | 2 +- Task/Loops-Infinite/C++/loops-infinite-2.cpp | 2 +- Task/Loops-Infinite/C++/loops-infinite-3.cpp | 2 +- .../Loops-Infinite/Elena/loops-infinite.elena | 12 +- .../Factor/loops-infinite-2.factor | 2 +- .../Factor/loops-infinite-3.factor | 2 + Task/Loops-Infinite/Fish/loops-infinite.fish | 1 + Task/Loops-Infinite/Go/loops-infinite.go | 2 + .../Loops-Infinite/Java/loops-infinite-1.java | 2 +- .../Loops-Infinite/Java/loops-infinite-2.java | 2 +- Task/Loops-Infinite/OPL/loops-infinite.opl | 7 + Task/Loops-Infinite/Ol/loops-infinite.ol | 3 + ...{loops-infinite.py => loops-infinite-1.py} | 0 .../Loops-Infinite/Python/loops-infinite-2.py | 2 + Task/Loops-Infinite/Spin/loops-infinite.spin | 16 + Task/Loops-N-plus-one-half/00DESCRIPTION | 3 + .../ARM-Assembly/loops-n-plus-one-half.arm | 127 ++++ .../BASIC/loops-n-plus-one-half-3.basic | 11 +- .../BASIC/loops-n-plus-one-half-4.basic | 9 +- .../BASIC/loops-n-plus-one-half-5.basic | 10 +- .../BASIC/loops-n-plus-one-half-6.basic | 5 + .../Prolog/loops-n-plus-one-half.pro | 3 + .../Rust/loops-n-plus-one-half-1.rust | 5 + .../Rust/loops-n-plus-one-half-2.rust | 10 + .../Rust/loops-n-plus-one-half-3.rust | 9 + .../Rust/loops-n-plus-one-half.rust | 5 - .../Spin/loops-n-plus-one-half.spin | 19 + .../VBA/loops-n-plus-one-half.vba | 8 + Task/Loops-Nested/00DESCRIPTION | 2 + .../ARM-Assembly/loops-nested.arm | 228 +++++++ Task/Loops-Nested/Neko/loops-nested.neko | 43 ++ Task/Loops-Nested/Rust/loops-nested.rust | 2 +- Task/Loops-Nested/VBA/loops-nested.vba | 20 + .../Visual-Basic-.NET/loops-nested-1.visual | 20 + .../Visual-Basic-.NET/loops-nested-2.visual | 8 + .../Visual-Basic-.NET/loops-nested-3.visual | 9 + .../Visual-Basic-.NET/loops-nested-4.visual | 9 + .../Visual-Basic-.NET/loops-nested-5.visual | 10 + .../Visual-Basic-.NET/loops-nested-6.visual | 1 + .../Visual-Basic-.NET/loops-nested-7.visual | 10 + .../Visual-Basic-.NET/loops-nested-8.visual | 12 + Task/Loops-While/00DESCRIPTION | 2 + Task/Loops-While/ARM-Assembly/loops-while.arm | 118 ++++ Task/Loops-While/BASIC/loops-while-4.basic | 5 + Task/Loops-While/BASIC/loops-while-5.basic | 5 + .../Cache-ObjectScript/loops-while.cos | 8 + Task/Loops-While/Common-Lisp/loops-while.lisp | 18 +- Task/Loops-While/Dc/loops-while.dc | 2 +- Task/Loops-While/Elena/loops-while.elena | 16 +- Task/Loops-While/Scala/loops-while-2.scala | 2 +- Task/Loops-While/Spin/loops-while.spin | 19 + Task/Loops-While/VBA/loops-while.vba | 8 + .../ARM-Assembly/lucas-lehmer-test.arm | 214 ++++++ .../Factor/lucas-lehmer-test.factor | 6 + .../PARI-GP/lucas-lehmer-test.pari | 6 +- .../Perl-6/lucas-lehmer-test.pl6 | 10 +- .../Phix/lucas-lehmer-test.phix | 65 +- .../REXX/lucas-lehmer-test.rexx | 59 +- .../Sidef/lucas-lehmer-test.sidef | 11 +- .../Swift/lucas-lehmer-test.swift | 16 + .../Ludic-numbers/Factor/ludic-numbers.factor | 21 + .../Ludic-numbers/Objeck/ludic-numbers.objeck | 67 ++ Task/Ludic-numbers/Scala/ludic-numbers.scala | 13 + .../luhn-test-of-credit-card-numbers.l | 22 + .../luhn-test-of-credit-card-numbers-3.hs | 15 +- ...uhn-test-of-credit-card-numbers.powerbasic | 30 + ... => luhn-test-of-credit-card-numbers-1.py} | 0 .../luhn-test-of-credit-card-numbers-2.py | 14 + .../Q/luhn-test-of-credit-card-numbers.q | 7 + .../R/luhn-test-of-credit-card-numbers.r | 22 +- .../Ruby/luhn-test-of-credit-card-numbers.rb | 19 +- .../luhn-test-of-credit-card-numbers.rust | 59 +- .../luhn-test-of-credit-card-numbers.sidef | 15 +- .../luhn-test-of-credit-card-numbers.swift | 18 +- .../luhn-test-of-credit-card-numbers-1.vb | 15 + .../luhn-test-of-credit-card-numbers-2.vb | 6 + Task/MD4/JavaScript/md4.js | 212 ++++++ Task/MD4/Perl/md4.pl | 70 +- .../C-sharp/md5-implementation-1.cs | 28 + .../Groovy/md5-implementation.groovy | 125 ++++ .../Julia/md5-implementation.julia | 76 +++ .../Rust/md5-implementation.rust | 238 +++++++ .../Sidef/md5-implementation.sidef | 2 +- Task/MD5/Fortran/md5.f | 6 +- Task/MD5/Neko/md5.neko | 14 + Task/MD5/PureBasic/md5.purebasic | 6 +- Task/Machine-code/00DESCRIPTION | 11 +- Task/Machine-code/00META.yaml | 1 + Task/Machine-code/COBOL/machine-code-1.cobol | 10 + Task/Machine-code/COBOL/machine-code-2.cobol | 71 ++ Task/Machine-code/Go/machine-code.go | 47 ++ Task/Machine-code/Julia/machine-code.julia | 38 ++ Task/Machine-code/Rust/machine-code.rust | 44 ++ Task/Machine-code/Swift/machine-code.swift | 34 + Task/Mad-Libs/00META.yaml | 1 + Task/Mad-Libs/AWK/mad-libs.awk | 34 + Task/Mad-Libs/BASIC256/mad-libs-1.basic256 | 15 + Task/Mad-Libs/BASIC256/mad-libs-2.basic256 | 145 ++++ Task/Mad-Libs/BASIC256/mad-libs-3.basic256 | 48 ++ Task/Mad-Libs/Factor/mad-libs.factor | 22 + Task/Mad-Libs/FreeBASIC/mad-libs.freebasic | 17 + Task/Mad-Libs/Phix/mad-libs.phix | 20 + Task/Mad-Libs/Rust/mad-libs.rust | 45 ++ .../Visual-Basic-.NET/mad-libs.visual | 69 ++ Task/Magic-squares-of-odd-order/00META.yaml | 1 + ...sic => magic-squares-of-odd-order-1.basic} | 0 .../BASIC/magic-squares-of-odd-order-2.basic | 11 + .../Factor/magic-squares-of-odd-order.factor | 18 + .../Haskell/magic-squares-of-odd-order-2.hs | 45 +- .../Perl/magic-squares-of-odd-order.pl | 25 - .../Phix/magic-squares-of-odd-order.phix | 31 + ...der.py => magic-squares-of-odd-order-1.py} | 0 .../Python/magic-squares-of-odd-order-2.py | 188 +++++ .../REXX/magic-squares-of-odd-order.rexx | 4 +- .../Swift/magic-squares-of-odd-order.swift | 157 +++++ .../Perl-6/main-step-of-gost-28147-89.pl6 | 2 +- .../Perl/main-step-of-gost-28147-89.pl | 44 ++ .../Phix/main-step-of-gost-28147-89.phix | 21 +- .../Rust/main-step-of-gost-28147-89.rust | 132 ++++ .../Factor/make-directory-path-1.factor | 2 + .../Factor/make-directory-path-2.factor | 7 + .../make-directory-path.visual | 7 + .../Elena/man-or-boy-test.elena | 37 +- .../Man-or-boy-test/Forth/man-or-boy-test.fth | 7 + .../Haskell/man-or-boy-test.hs | 28 +- Task/Man-or-boy-test/Ol/man-or-boy-test.ol | 27 + ...r-boy-test.rust => man-or-boy-test-1.rust} | 0 .../Rust/man-or-boy-test-2.rust | 18 + .../Rust/man-or-boy-test-3.rust | 22 + .../Mandelbrot-set/ALGOL-W/mandelbrot-set.alg | 39 ++ Task/Mandelbrot-set/AWK/mandelbrot-set.awk | 22 - .../mandelbrot-set-1.applesoft | 26 +- Task/Mandelbrot-set/B/mandelbrot-set.b | 43 ++ Task/Mandelbrot-set/Dc/mandelbrot-set-1.dc | 69 ++ Task/Mandelbrot-set/Dc/mandelbrot-set-2.dc | 37 + Task/Mandelbrot-set/Haskell/mandelbrot-set.hs | 18 +- Task/Mandelbrot-set/Ol/mandelbrot-set.ol | 29 + .../Mandelbrot-set/Python/mandelbrot-set-4.py | 26 + Task/Mandelbrot-set/Spin/mandelbrot-set.spin | 44 ++ Task/Map-range/00META.yaml | 1 + .../AppleScript/map-range.applescript | 287 ++++++++ Task/Map-range/BASIC/map-range-3.basic | 7 + Task/Map-range/JavaScript/map-range-3.js | 129 ++++ Task/Map-range/Swift/map-range.swift | 12 + .../matrix-exponentiation-operator.blq | 2 + .../C-sharp/matrix-exponentiation-operator.cs | 59 ++ .../Go/matrix-exponentiation-operator.go | 71 ++ .../K/matrix-exponentiation-operator.k | 3 + ...py => matrix-exponentiation-operator-1.py} | 0 .../matrix-exponentiation-operator-2.py | 32 + .../VBA/matrix-exponentiation-operator.vba | 56 ++ .../AWK/matrix-multiplication.awk | 54 ++ ...on.basic => matrix-multiplication-1.basic} | 0 .../BASIC/matrix-multiplication-2.basic | 14 + .../Ceylon/matrix-multiplication.ceylon | 65 ++ .../Perl/matrix-multiplication.pl | 17 + .../PowerShell/matrix-multiplication.psh | 29 +- .../Standard-ML/matrix-multiplication-1.ml | 19 + .../Standard-ML/matrix-multiplication-2.ml | 1 + .../VBA/matrix-multiplication.vba | 3 + ...osition.awk => matrix-transposition-1.awk} | 6 +- .../AWK/matrix-transposition-2.awk | 29 + .../Emacs-Lisp/matrix-transposition.l | 5 + .../Erlang/matrix-transposition.erl | 18 + .../JavaScript/matrix-transposition-3.js | 17 +- .../Julia/matrix-transposition.julia | 2 +- ...osition.php => matrix-transposition-1.php} | 0 .../PHP/matrix-transposition-2.php | 3 + .../matrix-transposition.powerbasic | 54 ++ ...sposition.py => matrix-transposition-1.py} | 0 .../Python/matrix-transposition-2.py | 41 ++ .../Python/matrix-transposition-3.py | 8 + .../Python/matrix-transposition-4.py | 130 ++++ ...ition.rust => matrix-transposition-1.rust} | 0 .../Rust/matrix-transposition-2.rust | 25 + .../VBA/matrix-transposition.vba | 3 + .../Visual-Basic/matrix-transposition.vb | 56 ++ Task/Maximum-triangle-path-sum/00META.yaml | 1 + .../Elena/maximum-triangle-path-sum.elena | 56 +- .../Elixir/maximum-triangle-path-sum.elixir | 14 +- .../Factor/maximum-triangle-path-sum.factor | 14 + .../Python/maximum-triangle-path-sum-3.py | 38 ++ .../Maze-generation/Aime/maze-generation.aime | 53 +- .../Commodore-BASIC/maze-generation.commodore | 59 ++ Task/Maze-generation/Ol/maze-generation-1.ol | 37 + Task/Maze-generation/Ol/maze-generation-2.ol | 22 + Task/Maze-generation/PHP/maze-generation.php | 148 ++++ .../REXX/maze-generation-1.rexx | 173 +++-- .../REXX/maze-generation-2.rexx | 90 ++- .../Maze-generation/Rust/maze-generation.rust | 137 ++++ .../Maze-generation/TXR/maze-generation-1.txr | 9 +- .../Maze-generation/TXR/maze-generation-2.txr | 22 +- Task/Maze-solving/Phix/maze-solving.phix | 1 + Task/Maze-solving/Rust/maze-solving.rust | 253 +++++++ Task/Median-filter/Perl-6/median-filter.pl6 | 29 + Task/Median-filter/Phix/median-filter.phix | 51 ++ .../Nim/memory-allocation.nim | 11 + .../Retro/memory-allocation.retro | 35 +- .../Rust/memory-allocation.rust | 17 + .../00META.yaml | 1 + .../memory-layout-of-a-data-structure.free | 23 + Task/Menu/AWK/menu.awk | 20 +- Task/Menu/BASIC/{menu.basic => menu-1.basic} | 0 Task/Menu/BASIC/menu-2.basic | 30 + Task/Menu/Batch-File/menu.bat | 42 +- Task/Menu/Forth/menu-1.fth | 42 ++ Task/Menu/Forth/menu-2.fth | 64 ++ Task/Menu/Fortran/menu.f | 128 ++-- Task/Menu/J/menu.j | 18 + Task/Menu/JavaScript/menu.js | 50 +- Task/Menu/Mathematica/menu.math | 12 +- Task/Menu/Phix/menu.phix | 42 +- Task/Menu/PicoLisp/menu.l | 4 +- Task/Menu/R/menu.r | 6 +- Task/Metaprogramming/00META.yaml | 1 + Task/Metaprogramming/Go/metaprogramming.go | 24 + .../Julia/metaprogramming.julia | 37 + .../Metaprogramming/Phix/metaprogramming.phix | 7 + .../Prolog/metaprogramming-1.pro | 3 + .../Prolog/metaprogramming-2.pro | 3 + .../Julia/metered-concurrency.julia | 21 + Task/Metronome/00META.yaml | 1 + Task/Metronome/AWK/metronome.awk | 20 + Task/Metronome/Ada/metronome.ada | 22 + Task/Metronome/Java/metronome.java | 2 +- Task/Metronome/Perl/metronome.pl | 20 + Task/Metronome/Sidef/metronome.sidef | 20 + Task/Middle-three-digits/00META.yaml | 1 + .../BASIC/middle-three-digits-4.basic | 37 +- .../BASIC/middle-three-digits-5.basic | 39 +- .../BASIC/middle-three-digits-6.basic | 13 + .../Elena/middle-three-digits.elena | 48 +- .../Haskell/middle-three-digits.hs | 60 +- ...ree-digits.js => middle-three-digits-1.js} | 0 .../JavaScript/middle-three-digits-2.js | 126 ++++ .../Julia/middle-three-digits.julia | 14 +- .../K/middle-three-digits.k | 3 + ...ree-digits.py => middle-three-digits-1.py} | 0 .../Python/middle-three-digits-2.py | 85 +++ Task/Minesweeper-game/C/minesweeper-game-1.c | 3 +- Task/Minesweeper-game/Go/minesweeper-game.go | 253 +++++++ .../Julia/minesweeper-game-1.julia | 19 +- .../Julia/minesweeper-game-2.julia | 2 +- .../Prolog/minesweeper-game.pro | 207 ++++++ Task/Modular-exponentiation/00META.yaml | 1 + .../C-sharp/modular-exponentiation.cs | 12 + .../Factor/modular-exponentiation.factor | 1 - .../modular-exponentiation.freebasic | 258 +++++++ .../Perl/modular-exponentiation.pl | 12 + .../Phix/modular-exponentiation.phix | 32 + .../Ruby/modular-exponentiation-1.rb | 6 +- .../Ruby/modular-exponentiation-2.rb | 17 +- .../Ruby/modular-exponentiation-3.rb | 11 + .../Rust/modular-exponentiation-1.rust | 48 ++ .../Rust/modular-exponentiation-2.rust | 20 + .../modular-exponentiation.visual | 24 + Task/Modular-inverse/00META.yaml | 1 + Task/Modular-inverse/Ada/modular-inverse.ada | 2 +- ...ular-inverse.fth => modular-inverse-1.fth} | 0 .../Forth/modular-inverse-2.fth | 18 + .../Haskell/modular-inverse.hs | 37 +- Task/Modular-inverse/Nim/modular-inverse.nim | 7 +- .../Modular-inverse/Phix/modular-inverse.phix | 20 + ...odular-inverse.py => modular-inverse-1.py} | 0 .../Python/modular-inverse-2.py | 91 +++ ...odular-inverse.rb => modular-inverse-1.rb} | 0 .../Modular-inverse/Ruby/modular-inverse-2.rb | 12 + ...ar-inverse.rust => modular-inverse-1.rust} | 0 .../Rust/modular-inverse-2.rust | 19 + Task/Modular-inverse/VBA/modular-inverse.vba | 31 + ...-methods.clj => monte-carlo-methods-1.clj} | 0 .../Clojure/monte-carlo-methods-2.clj | 9 + .../Erlang/monte-carlo-methods-1.erl | 17 + .../Erlang/monte-carlo-methods-2.erl | 20 + Task/Monty-Hall-problem/00DESCRIPTION | 37 +- .../AutoHotkey/monty-hall-problem.ahk | 36 +- .../BASIC/monty-hall-problem-2.basic | 30 +- .../BASIC/monty-hall-problem-3.basic | 15 + .../Forth/monty-hall-problem-3.fth | 29 + .../FreeBASIC/monty-hall-problem.freebasic | 35 + .../JavaScript/monty-hall-problem-3.js | 4 +- .../Perl-6/monty-hall-problem.pl6 | 10 +- .../REXX/monty-hall-problem-2.rexx | 17 +- .../Stata/monty-hall-problem.stata | 10 + .../Swift/monty-hall-problem.swift | 23 + .../{morse-code.basic => morse-code-1.basic} | 0 Task/Morse-code/BASIC/morse-code-2.basic | 26 + Task/Morse-code/BASIC/morse-code-3.basic | 28 + .../Morse-code/CoffeeScript/morse-code.coffee | 51 ++ Task/Morse-code/Factor/morse-code.factor | 2 + Task/Morse-code/Julia/morse-code.julia | 31 + Task/Morse-code/Rust/morse-code-1.rust | 29 + Task/Morse-code/Rust/morse-code-2.rust | 116 ++++ Task/Morse-code/Scala/morse-code.scala | 28 + .../AppleScript/mouse-position-1.applescript | 30 + .../AppleScript/mouse-position-2.applescript | 2 + .../Common-Lisp/mouse-position.lisp | 8 + Task/Mouse-position/Go/mouse-position.go | 35 + .../Mouse-position/Julia/mouse-position.julia | 15 + ...ouse-position.pl6 => mouse-position-1.pl6} | 0 .../Perl-6/mouse-position-2.pl6 | 22 + Task/Move-to-front-algorithm/00META.yaml | 1 + .../Aime/move-to-front-algorithm.aime | 24 +- .../Factor/move-to-front-algorithm.factor | 18 + .../Rust/move-to-front-algorithm.rust | 44 ++ Task/Multifactorial/00META.yaml | 1 + Task/Multifactorial/AWK/multifactorial.awk | 19 + Task/Multifactorial/Aime/multifactorial.aime | 8 +- .../Multifactorial/Swift/multifactorial.swift | 13 + Task/Multiple-distinct-objects/00META.yaml | 1 + .../ALGOL-W/multiple-distinct-objects.alg | 24 + .../Modula-3/multiple-distinct-objects-1.mod3 | 1 + .../Modula-3/multiple-distinct-objects-2.mod3 | 56 ++ .../Modula-3/multiple-distinct-objects.mod3 | 1 - .../Rust/multiple-distinct-objects.rust | 21 + .../Phix/multiple-regression.phix | 54 ++ .../ARM-Assembly/multiplication-tables.arm | 178 +++++ .../BASIC/multiplication-tables-3.basic | 14 + .../Haskell/multiplication-tables-1.hs | 30 + .../Haskell/multiplication-tables-2.hs | 11 + .../Haskell/multiplication-tables.hs | 26 - .../Neko/multiplication-tables.neko | 42 ++ ...n-tables.py => multiplication-tables-1.py} | 0 .../Python/multiplication-tables-2.py | 103 +++ .../Python/multiplication-tables-3.py | 267 ++++++++ .../Scala/multiplication-tables-1.scala | 18 + .../Scala/multiplication-tables-2.scala | 18 + .../Scala/multiplication-tables.scala | 48 -- .../C++/multiplicative-order.cpp | 139 ++++ .../D/multiplicative-order.d | 156 +++++ .../Haskell/multiplicative-order-1.hs | 16 +- .../Haskell/multiplicative-order-2.hs | 26 +- .../Julia/multiplicative-order.julia | 4 +- .../Phix/multiplicative-order.phix | 113 +++ .../REXX/multiplicative-order.rexx | 31 +- .../Sidef/multiplicative-order-1.sidef | 2 + ...der.sidef => multiplicative-order-2.sidef} | 0 Task/Multisplit/Julia/multisplit.julia | 7 + .../Julia/munching-squares.julia | 28 + .../Perl-6/munching-squares-1.pl6 | 3 +- .../Perl-6/munching-squares-2.pl6 | 2 +- .../Phix/munching-squares.phix | 51 ++ .../ABAP/mutual-recursion.abap | 47 ++ ...cursion.basic => mutual-recursion-1.basic} | 0 .../BASIC/mutual-recursion-2.basic | 16 + .../BASIC/mutual-recursion-3.basic | 23 + .../Elena/mutual-recursion.elena | 32 +- Task/Mutual-recursion/Ol/mutual-recursion.ol | 8 + .../Phix/mutual-recursion.phix | 17 + .../Mutual-recursion/VBA/mutual-recursion.vba | 26 + Task/N-queens-problem/00DESCRIPTION | 1 + Task/N-queens-problem/00META.yaml | 1 + ...freebasic => n-queens-problem-1.freebasic} | 0 .../FreeBASIC/n-queens-problem-2.freebasic | 41 ++ .../FreeBASIC/n-queens-problem-3.freebasic | 43 ++ .../N-queens-problem/Go/n-queens-problem-2.go | 248 ++++--- .../N-queens-problem/Go/n-queens-problem-3.go | 136 ++++ .../Haskell/n-queens-problem-4.hs | 41 +- .../Haskell/n-queens-problem-5.hs | 63 ++ .../PDP-11-Assembly/n-queens-problem.pdp-11 | 114 ++++ .../N-queens-problem/Perl/n-queens-problem.pl | 7 +- .../Picat/n-queens-problem.picat | 33 + .../PowerBASIC/n-queens-problem-1.powerbasic | 46 ++ .../PowerBASIC/n-queens-problem-2.powerbasic | 47 ++ .../PowerBASIC/n-queens-problem.powerbasic | 40 -- .../Python/n-queens-problem-5.py | 32 +- .../Python/n-queens-problem-6.py | 22 +- .../Python/n-queens-problem-7.py | 31 + .../Python/n-queens-problem-8.py | 145 ++++ .../REXX/n-queens-problem.rexx | 76 +-- .../Ruby/n-queens-problem-1.rb | 26 +- .../Scala/n-queens-problem.scala | 49 ++ .../Swift/n-queens-problem.swift | 56 ++ .../UNIX-Shell/n-queens-problem.sh | 78 +++ .../Prolog/named-parameters.pro | 14 + .../Swift/named-parameters-1.swift | 6 +- .../Swift/named-parameters-2.swift | 6 +- .../Swift/named-parameters-3.swift | 4 + .../Swift/named-parameters-4.swift | 4 + .../Named-parameters/VBA/named-parameters.vba | 17 + Task/Narcissist/00META.yaml | 1 + Task/Narcissist/Java/narcissist.java | 26 + Task/Narcissist/Phix/narcissist.phix | 1 + Task/Narcissist/REXX/narcissist-1.rexx | 2 +- Task/Narcissist/REXX/narcissist-2.rexx | 2 +- Task/Narcissist/VBA/narcissist.vba | 42 ++ Task/Narcissistic-decimal-number/00META.yaml | 1 + .../Forth/narcissistic-decimal-number.fth | 79 +++ .../Julia/narcissistic-decimal-number.julia | 27 +- .../VBA/narcissistic-decimal-number.vba | 23 + .../Julia/natural-sorting.julia | 84 +++ Task/Nautical-bell/00META.yaml | 1 + .../AutoHotkey/nautical-bell-1.ahk | 20 + .../AutoHotkey/nautical-bell-2.ahk | 13 + Task/Nautical-bell/Go/nautical-bell.go | 47 ++ Task/Nautical-bell/Julia/nautical-bell.julia | 41 ++ Task/Nautical-bell/Perl/nautical-bell.pl | 44 ++ .../C-sharp/non-continuous-subsequences.cs | 30 + .../Perl/non-continuous-subsequences.pl | 5 +- .../non-decimal-radices-convert-3.lisp | 2 + .../Phix/non-decimal-radices-convert.phix | 1 + .../VBA/non-decimal-radices-convert.vba | 24 + .../Haskell/non-decimal-radices-output-3.hs | 20 +- Task/Nth-root/00DESCRIPTION | 3 +- Task/Nth-root/ALGOL-W/nth-root.alg | 25 + Task/Nth-root/ARM-Assembly/nth-root.arm | 101 +++ Task/Nth-root/Factor/nth-root.factor | 12 + Task/Nth-root/FreeBASIC/nth-root.freebasic | 41 ++ .../Haskell/{nth-root.hs => nth-root-1.hs} | 0 Task/Nth-root/Haskell/nth-root-2.hs | 28 + Task/Nth-root/Scala/nth-root-1.scala | 9 + Task/Nth-root/Scala/nth-root-2.scala | 2 + Task/Nth-root/Scala/nth-root.scala | 16 - Task/Nth-root/VBA/nth-root.vba | 27 + Task/Nth/Crystal/nth.crystal | 18 + Task/Nth/Elena/nth.elena | 44 +- Task/Nth/Factor/nth.factor | 34 +- Task/Nth/Liberty-BASIC/nth.liberty | 32 + Task/Nth/VBA/nth.vba | 20 + Task/Null-object/ARM-Assembly/null-object.arm | 60 ++ Task/Null-object/Neko/null-object.neko | 12 + Task/Null-object/Nim/null-object.nim | 5 +- Task/Null-object/Swift/null-object-1.swift | 3 +- Task/Null-object/Swift/null-object-2.swift | 6 +- Task/Null-object/Swift/null-object-3.swift | 5 + Task/Null-object/VBA/null-object.vba | 14 + Task/Number-names/Maple/number-names.maple | 3 + Task/Number-names/PARI-GP/number-names.pari | 6 +- Task/Number-names/Perl-6/number-names-2.pl6 | 2 +- Task/Number-names/Rust/number-names.rust | 71 ++ Task/Number-names/Swift/number-names.swift | 134 ++++ Task/Number-names/VBA/number-names.vba | 114 ++++ Task/Number-reversal-game/00META.yaml | 2 + .../Astro/number-reversal-game.astro | 6 +- .../BASIC256/number-reversal-game.basic256 | 59 ++ .../Elena/number-reversal-game.elena | 38 +- .../PowerShell/number-reversal-game.psh | 17 +- .../VBA/number-reversal-game.vba | 50 ++ Task/Numeric-error-propagation/00META.yaml | 1 + .../Phix/numeric-error-propagation.phix | 56 ++ ...al-integration-gauss-legendre-quadrature.c | 6 +- ...ntegration-gauss-legendre-quadrature.julia | 8 +- ...l-integration-gauss-legendre-quadrature.pl | 69 ++ ...integration-gauss-legendre-quadrature.phix | 78 +++ ...tegration-gauss-legendre-quadrature-2.rexx | 74 +- ...tegration-gauss-legendre-quadrature-3.rexx | 55 ++ ...ntegration-gauss-legendre-quadrature.scala | 49 ++ ...ntegration-gauss-legendre-quadrature.sidef | 38 +- Task/Numerical-integration/00DESCRIPTION | 59 +- .../Comal/numerical-integration.comal | 94 +++ .../PL-I/numerical-integration.pli | 98 ++- .../Perl-6/numerical-integration.pl6 | 59 ++ .../Perl/numerical-integration.pl | 81 +++ .../REXX/numerical-integration.rexx | 34 +- .../Swift/numerical-integration.swift | 105 +++ Task/OLE-Automation/Go/ole-automation.go | 30 + .../Neko/object-serialization.neko | 41 ++ .../Ol/object-serialization.ol | 32 + .../Perl-6/object-serialization.pl6 | 36 + .../Phix/object-serialization.phix | 37 + .../Rust/object-serialization-1.rust | 2 + .../Rust/object-serialization-2.rust | 48 ++ .../Rust/object-serialization-3.rust | 3 + .../Rust/object-serialization-4.rust | 86 +++ Task/Odd-word-problem/00META.yaml | 1 + Task/Odd-word-problem/Ol/odd-word-problem.ol | 31 + .../REXX/odd-word-problem.rexx | 2 +- Task/Old-lady-swallowed-a-fly/00META.yaml | 1 + .../C++/old-lady-swallowed-a-fly.cpp | 30 + .../Elena/old-lady-swallowed-a-fly.elena | 44 +- .../Haskell/old-lady-swallowed-a-fly-1.hs | 29 + .../Haskell/old-lady-swallowed-a-fly-2.hs | 62 ++ .../Haskell/old-lady-swallowed-a-fly.hs | 16 - .../Lua/old-lady-swallowed-a-fly.lua | 30 + .../Mercury/old-lady-swallowed-a-fly.mercury | 73 ++ .../PowerShell/old-lady-swallowed-a-fly.psh | 54 +- .../REXX/old-lady-swallowed-a-fly.rexx | 40 +- .../one-dimensional-cellular-automata-2.alg | 1 - .../one-dimensional-cellular-automata-1.hs | 6 +- .../one-dimensional-cellular-automata.oforth | 22 +- .../one-dimensional-cellular-automata-4.py | 185 +++++ .../one-dimensional-cellular-automata.retro | 181 ++++- .../one-dimensional-cellular-automata.rust | 37 + Task/One-of-n-lines-in-a-file/00META.yaml | 1 + .../Aime/one-of-n-lines-in-a-file.aime | 27 + .../Batch-File/one-of-n-lines-in-a-file-1.bat | 11 + .../Batch-File/one-of-n-lines-in-a-file-2.bat | 13 + .../Maple/one-of-n-lines-in-a-file.maple | 20 + ...ile.psh => one-of-n-lines-in-a-file-1.psh} | 0 .../PowerShell/one-of-n-lines-in-a-file-2.psh | 41 ++ .../REXX/one-of-n-lines-in-a-file.rexx | 27 +- Task/OpenGL/00DESCRIPTION | 1 + Task/OpenGL/Go/opengl.go | 114 ++-- Task/OpenGL/Julia/opengl.julia | 3 + Task/OpenGL/Ol/opengl.ol | 27 + .../Q/operator-precedence.q | 7 + Task/Optional-parameters/00DESCRIPTION | 2 + .../VBA/optional-parameters.vba | 31 + Task/Order-disjoint-list-items/00META.yaml | 1 + .../Aime/order-disjoint-list-items.aime | 6 +- .../Factor/order-disjoint-list-items-1.factor | 1 + .../Factor/order-disjoint-list-items-2.factor | 27 + .../REXX/order-disjoint-list-items.rexx | 65 +- .../Swift/order-disjoint-list-items.swift | 17 + .../order-two-numerical-lists.arm | 154 +++++ .../Aime/order-two-numerical-lists.aime | 8 +- .../Ol/order-two-numerical-lists.ol | 14 + .../REXX/order-two-numerical-lists.rexx | 47 +- .../Rust/order-two-numerical-lists.rust | 1 + .../VBA/order-two-numerical-lists.vba | 20 + .../C-sharp/ordered-partitions.cs | 68 ++ .../Python/ordered-partitions-3.py | 107 +++ Task/Ordered-words/00DESCRIPTION | 2 +- Task/Ordered-words/APL/ordered-words.apl | 13 + Task/Ordered-words/Python/ordered-words-3.py | 53 ++ .../APL/palindrome-detection-1.apl | 4 + .../APL/palindrome-detection-2.apl | 4 + .../APL/palindrome-detection-3.apl | 5 + .../BASIC/palindrome-detection-2.basic | 28 +- .../BASIC/palindrome-detection-3.basic | 15 +- .../BASIC/palindrome-detection-4.basic | 8 + .../BASIC/palindrome-detection-5.basic | 27 + .../Clojure/palindrome-detection-1.clj | 2 +- .../Clojure/palindrome-detection-2.clj | 12 +- .../Haskell/palindrome-detection-2.hs | 4 +- .../JavaScript/palindrome-detection-3.js | 45 +- .../Ol/palindrome-detection.ol | 27 + .../PowerShell/palindrome-detection-1.psh | 2 +- .../PowerShell/palindrome-detection-6.psh | 50 ++ .../Python/palindrome-detection-2.py | 22 +- .../Python/palindrome-detection-3.py | 9 +- .../Python/palindrome-detection-4.py | 11 +- .../Python/palindrome-detection-5.py | 37 +- .../Python/palindrome-detection-6.py | 28 + .../Retro/palindrome-detection.retro | 5 +- .../TypeScript/palindrome-detection.type | 17 + .../palindrome-detection.visual | 12 + .../Pangram-checker/Ada/pangram-checker-1.ada | 14 + .../Pangram-checker/Ada/pangram-checker-2.ada | 14 + Task/Pangram-checker/Ada/pangram-checker.ada | 20 - ...gram-checker.php => pangram-checker-1.php} | 0 .../Pangram-checker/PHP/pangram-checker-2.php | 27 + Task/Pangram-checker/Perl/pangram-checker.pl | 25 +- .../PowerShell/pangram-checker-1.psh | 2 +- .../PowerShell/pangram-checker-2.psh | 18 +- .../Pangram-checker/REXX/pangram-checker.rexx | 10 +- Task/Pangram-checker/Ruby/pangram-checker.rb | 3 +- Task/Paraffins/00META.yaml | 1 + Task/Paraffins/Julia/paraffins.julia | 42 ++ Task/Paraffins/Mathematica/paraffins.math | 16 +- Task/Paraffins/Phix/paraffins.phix | 46 ++ Task/Paraffins/Python/paraffins-3.py | 32 + Task/Paraffins/REXX/paraffins.rexx | 33 +- .../Phix/parallel-calculations.phix | 43 ++ .../Java/parametric-polymorphism.java | 4 +- .../Phix/parametric-polymorphism-2.phix | 3 + .../Racket/parametrized-sql-statement.rkt | 28 +- Task/Parse-an-IP-Address/00DESCRIPTION | 3 +- Task/Parse-an-IP-Address/00META.yaml | 1 + .../Perl-6/parse-an-ip-address.pl6 | 10 +- .../Phix/parse-an-ip-address.phix | 147 ++++ .../00META.yaml | 1 + .../parsing-rpn-calculator-algorithm.360 | 103 +++ .../parsing-rpn-calculator-algorithm.bracmat | 35 + .../Perl/parsing-rpn-calculator-algorithm.pl | 40 +- .../00META.yaml | 1 + .../parsing-rpn-to-infix-conversion.groovy | 59 ++ .../Perl/parsing-rpn-to-infix-conversion.pl | 42 +- .../parsing-rpn-to-infix-conversion.visual | 121 ++++ .../00META.yaml | 1 + .../C++/parsing-shunting-yard-algorithm.cpp | 59 ++ .../C/parsing-shunting-yard-algorithm.c | 6 +- .../Nim/parsing-shunting-yard-algorithm.nim | 45 ++ .../parsing-shunting-yard-algorithm.visual | 83 +++ ...n.cs => partial-function-application-1.cs} | 0 .../C-sharp/partial-function-application-2.cs | 45 ++ .../Elena/partial-function-application.elena | 28 +- .../partial-function-application-1.visual | 32 + .../partial-function-application-2.visual | 11 + .../partial-function-application-3.visual | 40 ++ Task/Pascals-triangle-Puzzle/00META.yaml | 1 + .../Factor/pascals-triangle-puzzle.factor | 14 + .../AppleScript/pascals-triangle.applescript | 218 +++--- .../Haskell/pascals-triangle-6.hs | 9 +- .../Haskell/pascals-triangle-7.hs | 13 +- .../Haskell/pascals-triangle-8.hs | 5 + .../Haskell/pascals-triangle-9.hs | 11 + .../JavaScript/pascals-triangle-4.js | 150 ++-- .../Prolog/pascals-triangle-3.pro | 29 + .../Prolog/pascals-triangle-4.pro | 6 + .../Python/pascals-triangle-3.py | 127 ++++ .../Pascals-triangle/VBA/pascals-triangle.vba | 30 + .../Visual-Basic-.NET/pascals-triangle.visual | 42 ++ .../Emacs-Lisp/pattern-matching.l | 28 + Task/Pattern-matching/Go/pattern-matching.go | 118 ++++ .../Julia/pattern-matching.julia | 68 ++ .../Phix/pattern-matching-1.phix | 30 + .../Phix/pattern-matching-2.phix | 41 ++ Task/Penneys-game/C-sharp/penneys-game.cs | 103 +++ Task/Penneys-game/Pascal/penneys-game.pascal | 196 ++++++ Task/Penneys-game/Phix/penneys-game.phix | 80 +++ Task/Penneys-game/Prolog/penneys-game.pro | 37 + .../percentage-difference-between-images.m | 11 + .../percentage-difference-between-images.pl6 | 38 ++ .../percentage-difference-between-images-1.pl | 19 + .../percentage-difference-between-images-2.pl | 29 + .../percentage-difference-between-images.phix | 27 + .../percentage-difference-between-images.rust | 20 + .../Perl/percolation-bond-percolation.pl | 80 +++ .../Phix/percolation-bond-percolation.phix | 55 ++ .../Swift/percolation-bond-percolation.swift | 121 ++++ .../percolation-mean-cluster-density.factor | 42 ++ .../Perl/percolation-mean-cluster-density.pl | 72 ++ .../percolation-mean-cluster-density.phix | 66 ++ .../percolation-mean-run-density.factor | 32 + .../Phix/percolation-mean-run-density.phix | 31 + ...rkt => percolation-mean-run-density-1.rkt} | 0 .../Racket/percolation-mean-run-density-2.rkt | 29 + .../percolation-site-percolation.factor | 55 ++ .../Perl/percolation-site-percolation.pl | 73 ++ .../Phix/percolation-site-percolation.phix | 47 ++ .../Sidef/percolation-site-percolation.sidef | 66 ++ Task/Perfect-numbers/00DESCRIPTION | 8 +- .../ALGOL-W/perfect-numbers.alg | 22 + .../Axiom/perfect-numbers-2.axiom | 2 +- .../BASIC/perfect-numbers-2.basic | 18 +- .../BASIC/perfect-numbers-3.basic | 6 + .../Elena/perfect-numbers.elena | 28 +- .../Haskell/perfect-numbers-3.hs | 16 + .../JavaScript/perfect-numbers-8.js | 37 +- .../Maple/perfect-numbers.maple | 3 + ...fect-numbers.pl6 => perfect-numbers-1.pl6} | 2 +- .../Perl-6/perfect-numbers-2.pl6 | 7 + ...ct-numbers.phix => perfect-numbers-1.phix} | 0 .../Phix/perfect-numbers-2.phix | 14 + .../Prolog/perfect-numbers-2.pro | 50 +- .../Prolog/perfect-numbers-3.pro | 37 + .../Python/perfect-numbers-2.py | 7 +- .../Python/perfect-numbers-3.py | 35 + .../Sidef/perfect-numbers-1.sidef | 10 +- .../Sidef/perfect-numbers-2.sidef | 12 +- .../Simula/perfect-numbers.simula | 8 + Task/Perfect-numbers/VBA/perfect-numbers.vba | 29 + .../Perl-6/permutation-test.pl6 | 7 +- .../REXX/permutation-test.rexx | 39 +- Task/Permutations-Derangements/00META.yaml | 1 + .../Clojure/permutations-derangements.clj | 39 ++ .../Factor/permutations-derangements.factor | 22 + ....phix => permutations-derangements-1.phix} | 25 +- .../Phix/permutations-derangements-2.phix | 20 + .../permutations-derangements-1.purebasic | 124 ++-- .../00META.yaml | 1 + .../permutations-rank-of-a-permutation.hs | 24 +- .../permutations-rank-of-a-permutation.phix | 29 + Task/Permutations-by-swapping/00META.yaml | 1 + Task/Permutations/Aime/permutations.aime | 24 + .../AppleScript/permutations-1.applescript | 39 +- .../AppleScript/permutations-3.applescript | 124 ++++ Task/Permutations/C/permutations-2.c | 10 +- .../Permutations/Crystal/permutations.crystal | 1 + Task/Permutations/Curry/permutations.curry | 7 + .../Go/{permutations.go => permutations-1.go} | 0 Task/Permutations/Go/permutations-2.go | 29 + Task/Permutations/Haskell/permutations-5.hs | 10 + .../Permutations/JavaScript/permutations-6.js | 53 +- .../Permutations/JavaScript/permutations-8.js | 42 ++ ...ermutations.julia => permutations-1.julia} | 1 + Task/Permutations/Julia/permutations-2.julia | 2 + .../Mathematica/permutations-1.math | 11 + ...{permutations.math => permutations-2.math} | 0 .../Permutations/Mercury/permutations.mercury | 37 + .../Permutations/Modula-3/permutations-1.mod3 | 58 ++ .../Permutations/Modula-3/permutations-2.mod3 | 28 + .../Permutations/Modula-3/permutations-3.mod3 | 71 ++ .../Permutations/Modula-3/permutations-4.mod3 | 43 ++ .../{permutations.nim => permutations-1.nim} | 0 Task/Permutations/Nim/permutations-2.nim | 38 ++ .../OpenEdge-Progress/permutations.openedge | 35 + Task/Permutations/Perl-6/permutations-2.pl6 | 2 +- Task/Permutations/Perl/permutations-1.pl | 12 +- Task/Permutations/Perl/permutations-2.pl | 12 +- Task/Permutations/Python/permutations-5.py | 13 + Task/Permutations/Python/permutations-6.py | 86 +++ Task/Permutations/R/permutations-1.r | 75 +- Task/Permutations/R/permutations-2.r | 16 +- Task/Permutations/R/permutations-3.r | 25 +- Task/Permutations/R/permutations-4.r | 18 + Task/Permutations/Racket/permutations.rkt | 47 ++ .../Haskell/pernicious-numbers-2.hs | 13 +- .../Maple/pernicious-numbers.maple | 27 + .../Seed7/pernicious-numbers.seed7 | 26 + .../VBA/pernicious-numbers.vba | 49 ++ .../pernicious-numbers.visual | 45 ++ Task/Phrase-reversals/00DESCRIPTION | 6 +- Task/Phrase-reversals/00META.yaml | 1 + .../Elena/phrase-reversals.elena | 23 +- Task/Phrase-reversals/K/phrase-reversals.k | 7 + .../MUMPS/phrase-reversals.mumps | 7 + ...ase-reversals.py => phrase-reversals-1.py} | 0 .../Python/phrase-reversals-2.py | 89 +++ .../REXX/phrase-reversals-2.rexx | 8 +- .../Seed7/phrase-reversals.seed7 | 20 + Task/Pi/BASIC/pi-1.basic | 110 ++- Task/Pi/BASIC/pi-2.basic | 110 +-- Task/Pi/BASIC/pi-3.basic | 51 ++ Task/Pi/Crystal/pi.crystal | 2 +- Task/Pi/Factor/pi.factor | 21 + Task/Pi/Julia/pi.julia | 21 +- Task/Pi/Ol/pi.ol | 24 + Task/Pi/Perl-6/pi.pl6 | 2 +- Task/Pi/Phix/pi-1.phix | 3 + Task/Pi/Phix/pi-2.phix | 32 + Task/Pi/Phix/pi.phix | 5 - Task/Pi/R/pi.r | 50 ++ Task/Pi/REXX/pi-2.rexx | 12 +- Task/Pi/Ruby/pi.rb | 12 +- Task/Pi/Rust/pi.rust | 37 + Task/Pi/Scheme/pi.ss | 30 + Task/Pi/Simula/pi-1.simula | 309 +++++++++ Task/Pi/Simula/pi-2.simula | 70 ++ Task/Pi/TypeScript/pi-1.type | 25 + Task/Pi/TypeScript/pi-2.type | 40 ++ Task/Pi/Visual-Basic-.NET/pi-1.visual | 24 + Task/Pi/Visual-Basic-.NET/pi-2.visual | 35 + Task/Pi/Visual-Basic/pi.vb | 35 + .../pick-random-element.applescript | 1 + .../Elena/pick-random-element.elena | 16 +- .../Emacs-Lisp/pick-random-element.l | 7 + .../Erlang/pick-random-element.erl | 2 +- .../Ol/pick-random-element.ol | 4 + .../REXX/pick-random-element-1.rexx | 7 +- .../pick-random-element.visual | 8 + Task/Pig-the-dice-game-Player/00META.yaml | 3 + .../Julia/pig-the-dice-game-player.julia | 56 ++ .../Perl/pig-the-dice-game-player.pl | 66 ++ .../Phix/pig-the-dice-game-player.phix | 77 +++ .../REXX/pig-the-dice-game-player.rexx | 173 ++--- Task/Pig-the-dice-game/00META.yaml | 1 + .../BASIC256/pig-the-dice-game.basic256 | 43 ++ .../FreeBASIC/pig-the-dice-game.freebasic | 42 ++ .../Phix/pig-the-dice-game.phix | 28 + .../Scala/pig-the-dice-game.scala | 45 ++ .../Pinstripe-Display/Go/pinstripe-display.go | 27 + .../Perl-6/pinstripe-display.pl6 | 20 +- .../Perl/pinstripe-display.pl | 19 + .../Pinstripe-Printer/Go/pinstripe-printer.go | 42 ++ .../Go/play-recorded-sounds.go | 22 + .../Phix/play-recorded-sounds.phix | 16 + Task/Playing-cards/Hy/playing-cards.hy | 29 + Task/Plot-coordinate-pairs/00META.yaml | 1 + .../Ol/plot-coordinate-pairs.ol | 14 + .../VBA/plot-coordinate-pairs.vba | 20 + Task/Pointers-and-references/00DESCRIPTION | 2 +- .../Julia/pointers-and-references.julia | 7 + .../VBA/pointers-and-references.vba | 3 + .../Elena/polymorphic-copy.elena | 26 +- .../Julia/polymorphic-copy.julia | 38 ++ .../REXX/polymorphic-copy.rexx | 7 + Task/Polymorphism/Elena/polymorphism.elena | 60 +- Task/Polymorphism/Golo/polymorphism.golo | 73 ++ .../C++/polynomial-long-division.cpp | 97 +++ .../Factor/polynomial-long-division.factor | 3 + .../Perl-6/polynomial-long-division.pl6 | 2 +- .../Phix/polynomial-long-division.phix | 73 ++ .../VBA/polynomial-long-division.vba | 96 +++ .../C++/polynomial-regression.cpp | 62 ++ .../Lua/polynomial-regression.lua | 52 ++ .../Maple/polynomial-regression.maple | 2 + .../Perl/polynomial-regression.pl | 21 +- .../Scala/polynomial-regression.scala | 34 + .../Sidef/polynomial-regression.sidef | 24 +- .../VBA/polynomial-regression.vba | 30 + Task/Power-set/ABAP/power-set.abap | 180 +++++ Task/Power-set/Ada/power-set.ada | 38 +- Task/Power-set/JavaScript/power-set-4.js | 2 +- Task/Power-set/Nim/power-set.nim | 2 +- Task/Power-set/REXX/power-set.rexx | 41 +- Task/Power-set/VBA/power-set.vba | 46 ++ .../Julia/pragmatic-directives.julia | 11 + .../Objeck/price-fraction.objeck | 35 + .../B/primality-by-trial-division.b | 11 + .../BASIC/primality-by-trial-division-2.basic | 32 +- .../BASIC/primality-by-trial-division-3.basic | 16 + .../Clojure/primality-by-trial-division-2.clj | 1 - .../Clojure/primality-by-trial-division-3.clj | 9 +- .../Rust/primality-by-trial-division.rust | 13 +- .../JavaScript/prime-decomposition-2.js | 75 +- ...on.pascal => prime-decomposition-1.pascal} | 0 .../Pascal/prime-decomposition-2.pascal | 46 ++ .../Perl-6/prime-decomposition-1.pl6 | 22 +- .../Phix/prime-decomposition-1.phix | 16 + .../Phix/prime-decomposition-2.phix | 14 + .../Phix/prime-decomposition-3.phix | 5 + .../Phix/prime-decomposition.phix | 31 - .../R/prime-decomposition-1.r | 15 + .../R/prime-decomposition-2.r | 35 + .../R/prime-decomposition.r | 15 - .../Scala/prime-decomposition-4.scala | 3 + .../Simula/prime-decomposition.simula | 80 +++ .../Swift/prime-decomposition.swift | 25 + Task/Priority-queue/00META.yaml | 1 + .../ARM-Assembly/priority-queue.arm | 424 ++++++++++++ ...ority-queue.phix => priority-queue-1.phix} | 0 .../Priority-queue/Phix/priority-queue-2.phix | 51 ++ Task/Priority-queue/VBA/priority-queue.vba | 79 +++ .../E/probabilistic-choice-2.e | 2 +- .../Perl-6/probabilistic-choice.pl6 | 4 +- .../Perl-6/problem-of-apollonius.pl6 | 11 +- .../Perl/problem-of-apollonius.pl | 73 ++ .../Phix/problem-of-apollonius.phix | 63 ++ .../REXX/problem-of-apollonius.rexx | 34 +- Task/Program-name/BASIC/program-name-3.basic | 2 + Task/Program-name/BASIC/program-name-4.basic | 9 + Task/Program-name/COBOL/program-name.cobol | 18 + Task/Program-name/Elena/program-name.elena | 12 +- Task/Program-name/Ol/program-name.ol | 1 + Task/Program-name/Prolog/program-name-1.pro | 8 + Task/Program-name/Prolog/program-name-2.pro | 1 + .../ARM-Assembly/program-termination.arm | 26 + .../BASIC/program-termination-4.basic | 2 +- .../BASIC/program-termination-5.basic | 4 +- .../BASIC/program-termination-6.basic | 3 + .../Neko/program-termination.neko | 10 + .../Ol/program-termination.ol | 1 + .../VBA/program-termination.vba | 5 + Task/Pythagorean-triples/00META.yaml | 1 + .../Common-Lisp/pythagorean-triples-1.lisp | 22 +- .../Crystal/pythagorean-triples.crystal | 30 + .../Mercury/pythagorean-triples.mercury | 22 + .../Ol/pythagorean-triples.ol | 28 + .../Perl-6/pythagorean-triples-2.pl6 | 16 +- .../Perl-6/pythagorean-triples-3.pl6 | 2 +- .../Perl-6/pythagorean-triples-4.pl6 | 2 +- .../REXX/pythagorean-triples-1.rexx | 29 +- .../REXX/pythagorean-triples-2.rexx | 40 +- .../VBA/pythagorean-triples.vba | 22 + .../Visual-Basic/pythagorean-triples.vb | 28 + .../Futhark/qr-decomposition.futhark | 30 + .../Haskell/qr-decomposition.hs | 80 +++ .../Perl-6/qr-decomposition.pl6 | 180 +++++ .../Phix/qr-decomposition-1.phix | 82 +++ .../Phix/qr-decomposition-2.phix | 25 + .../Standard-ML/qr-decomposition-1.ml | 126 ++++ .../Standard-ML/qr-decomposition-2.ml | 33 + .../VBA/qr-decomposition-1.vba | 113 +++ .../VBA/qr-decomposition-2.vba | 30 + Task/Quaternion-type/00META.yaml | 1 + .../Elena/quaternion-type.elena | 127 ++-- .../FreeBASIC/quaternion-type.freebasic | 77 +++ .../Haskell/quaternion-type-1.hs | 56 +- .../Quaternion-type/Lua/quaternion-type-2.lua | 10 - .../Swift/quaternion-type.swift | 134 ++++ Task/Quaternion-type/VBA/quaternion-type.vba | 71 ++ .../quaternion-type-1.visual | 96 +++ .../quaternion-type-2.visual | 25 + .../ARM-Assembly/queue-definition.arm | 283 ++++++++ .../queue-definition-1.component | 138 ++-- .../queue-definition-2.component | 19 +- .../Elena/queue-definition.elena | 91 +-- .../Free-Pascal/queue-definition.free | 21 + .../Queue-Definition/VBA/queue-definition.vba | 19 + .../VBScript/queue-definition.vb | 37 + Task/Queue-Usage/Astro/queue-usage.astro | 14 +- .../Component-Pascal/queue-usage.component | 35 +- Task/Queue-Usage/Elena/queue-usage.elena | 28 +- Task/Queue-Usage/REXX/queue-usage.rexx | 34 +- Task/Queue-Usage/VBA/queue-usage.vba | 6 + Task/Quickselect-algorithm/00META.yaml | 1 + .../Crystal/quickselect-algorithm.crystal | 18 + .../Factor/quickselect-algorithm.factor | 18 + .../PureBasic/quickselect-algorithm.purebasic | 37 + ...lgorithm.py => quickselect-algorithm-1.py} | 0 .../Python/quickselect-algorithm-2.py | 58 ++ .../VBA/quickselect-algorithm.vba | 41 ++ Task/Quine/00META.yaml | 1 + Task/Quine/COBOL/quine-4.cobol | 24 + Task/Quine/Clojure/{quine.clj => quine-1.clj} | 0 Task/Quine/Clojure/quine-2.clj | 1 + Task/Quine/Common-Lisp/quine-3.lisp | 2 +- Task/Quine/Common-Lisp/quine-4.lisp | 2 +- Task/Quine/Common-Lisp/quine-5.lisp | 2 +- Task/Quine/Common-Lisp/quine-6.lisp | 2 +- Task/Quine/Common-Lisp/quine-7.lisp | 1 + Task/Quine/FreeBASIC/quine-1.freebasic | 2 + Task/Quine/FreeBASIC/quine-2.freebasic | 1 + Task/Quine/GAP/quine.gap | 5 + Task/Quine/Mathematica/quine-2.math | 2 +- Task/Quine/Mathematica/quine-3.math | 2 +- Task/Quine/Mathematica/quine-4.math | 2 +- Task/Quine/Mathematica/quine-5.math | 2 +- Task/Quine/Mathematica/quine-6.math | 1 + Task/Quine/Modula-2/quine.mod2 | 11 + Task/Quine/Racket/quine-2.rkt | 7 +- Task/Quine/Racket/quine-3.rkt | 3 + Task/Quine/SmileBASIC/quine.smilebasic | 2 + Task/Quine/VBA/quine.vba | 32 + Task/Quine/Visual-Basic-.NET/quine-1.visual | 12 + Task/Quine/Visual-Basic-.NET/quine-2.visual | 11 + Task/RIPEMD-160/Factor/ripemd-160.factor | 3 + Task/RIPEMD-160/Nim/ripemd-160.nim | 3 + Task/RIPEMD-160/Seed7/ripemd-160.seed7 | 7 + Task/RSA-code/Ada/rsa-code.ada | 38 ++ Task/RSA-code/Perl/rsa-code.pl | 63 ++ Task/RSA-code/Phix/rsa-code.phix | 29 + Task/RSA-code/Python/rsa-code.py | 25 + .../Visual-Basic-.NET/rsa-code.visual | 21 + .../random-number-generator--device-.arm | 205 ++++++ .../random-number-generator--device-.factor | 2 + .../random-number-generator--device-.pl6 | 2 +- .../00META.yaml | 1 + .../random-number-generator--included-.delphi | 26 + .../random-number-generator--included-.elena | 12 +- .../random-number-generator--included-.free | 16 + .../Random-numbers/Elena/random-numbers.elena | 51 +- Task/Range-expansion/00META.yaml | 1 + .../Aime/range-expansion-1.aime | 20 + .../Aime/range-expansion-2.aime | 14 + .../Factor/range-expansion.factor | 10 + .../Haskell/range-expansion-3.hs | 24 +- .../OCaml/range-expansion.ocaml | 4 +- .../Python/range-expansion-3.py | 92 +++ Task/Range-extraction/00DESCRIPTION | 2 +- Task/Range-extraction/00META.yaml | 1 + .../Aime/range-extraction.aime | 47 +- .../C-sharp/range-extraction-2.cs | 62 +- .../Haskell/range-extraction-3.hs | 80 ++- .../Haskell/range-extraction-4.hs | 28 +- .../Mercury/range-extraction.mercury | 40 ++ .../Perl/range-extraction-1.pl | 6 +- ...ge-extraction.py => range-extraction-1.py} | 0 .../Python/range-extraction-2.py | 49 ++ .../Python/range-extraction-3.py | 36 + .../Python/range-extraction-4.py | 89 +++ .../REXX/range-extraction-1.rexx | 23 +- .../REXX/range-extraction-2.rexx | 19 +- Task/Ranking-methods/00META.yaml | 1 + Task/Ranking-methods/C++/ranking-methods.cpp | 176 +++++ .../Haskell/ranking-methods.hs | 91 ++- .../Modula-2/ranking-methods.mod2 | 182 +++++ .../Perl-6/ranking-methods.pl6 | 12 +- Task/Ranking-methods/Perl/ranking-methods.pl | 68 ++ .../Ranking-methods/Phix/ranking-methods.phix | 55 ++ Task/Rate-counter/00META.yaml | 1 + Task/Rate-counter/Julia/rate-counter.julia | 21 + Task/Rate-counter/Phix/rate-counter.phix | 24 + .../C/read-a-configuration-file.c | 2 +- .../ARM-Assembly/read-a-file-line-by-line.arm | 283 ++++++++ .../BASIC/read-a-file-line-by-line-2.basic | 9 +- .../BASIC/read-a-file-line-by-line-3.basic | 12 +- .../BASIC/read-a-file-line-by-line-4.basic | 7 + .../C++/read-a-file-line-by-line-1.cpp | 7 +- .../C++/read-a-file-line-by-line-2.cpp | 24 +- .../C++/read-a-file-line-by-line-3.cpp | 10 + .../Elena/read-a-file-line-by-line.elena | 14 +- .../Neko/read-a-file-line-by-line.neko | 55 ++ .../read-a-file-line-by-line.purebasic | 5 +- .../00META.yaml | 1 + .../read-a-specific-line-from-a-file.factor | 15 + .../C-sharp/read-entire-file.cs | 1 + .../Neko/read-entire-file.neko | 15 + .../OCaml/read-entire-file-1.ocaml | 2 +- .../OCaml/read-entire-file-2.ocaml | 3 +- .../OCaml/read-entire-file-3.ocaml | 11 +- .../OCaml/read-entire-file-4.ocaml | 16 +- .../OCaml/read-entire-file-5.ocaml | 7 + Task/Read-entire-file/Ol/read-entire-file.ol | 5 + ...entire-file.php => read-entire-file-1.php} | 0 .../PHP/read-entire-file-2.php | 1 + .../Retro/read-entire-file.retro | 3 +- .../Visual-Basic/read-entire-file.vb | 37 + .../real-constants-and-functions.arm | 1 + .../real-constants-and-functions-10.basic | 1 + .../real-constants-and-functions-11.basic | 13 + .../real-constants-and-functions-2.basic | 21 +- .../real-constants-and-functions-3.basic | 2 +- .../real-constants-and-functions-4.basic | 2 +- .../real-constants-and-functions-5.basic | 2 +- .../real-constants-and-functions-6.basic | 2 +- .../real-constants-and-functions-7.basic | 2 +- .../real-constants-and-functions-8.basic | 2 +- .../real-constants-and-functions-9.basic | 2 +- .../Elena/real-constants-and-functions.elena | 30 +- .../Neko/real-constants-and-functions.neko | 28 + Task/Record-sound/Go/record-sound.go | 61 ++ .../Aime/reduced-row-echelon-form.aime | 22 +- .../Factor/reduced-row-echelon-form.factor | 2 + .../Perl/reduced-row-echelon-form.pl | 12 + .../Swift/reduced-row-echelon-form.swift | 76 +-- .../reduced-row-echelon-form.ti-83 | 1 + .../VBA/reduced-row-echelon-form.vba | 52 ++ .../NewLISP/regular-expressions.newlisp | 1 + .../Ol/regular-expressions.ol | 11 + .../Rust/regular-expressions.rust | 11 + ...xpressions.st => regular-expressions-1.st} | 0 .../Smalltalk/regular-expressions-2.st | 7 + Task/Remove-duplicate-elements/00META.yaml | 1 + .../Ada/remove-duplicate-elements.ada | 32 +- .../Aime/remove-duplicate-elements-2.aime | 6 +- .../Elena/remove-duplicate-elements.elena | 20 +- .../Neko/remove-duplicate-elements.neko | 24 + .../Python/remove-duplicate-elements-6.py | 22 + .../Python/remove-duplicate-elements-7.py | 38 ++ .../Python/remove-duplicate-elements-8.py | 14 + .../R/remove-duplicate-elements.r | 2 + .../REXX/remove-duplicate-elements-1.rexx | 7 +- .../REXX/remove-duplicate-elements-2.rexx | 11 +- .../REXX/remove-duplicate-elements-3.rexx | 13 +- ...basic => remove-lines-from-a-file-1.basic} | 0 .../BASIC/remove-lines-from-a-file-2.basic | 37 + Task/Rename-a-file/Processing/rename-a-file | 19 + .../Smalltalk/rename-a-file-3.st | 4 + Task/Rendezvous/Julia/rendezvous.julia | 74 ++ Task/Rendezvous/Phix/rendezvous.phix | 45 ++ Task/Rep-string/00META.yaml | 1 + .../C/{rep-string.c => rep-string-1.c} | 0 Task/Rep-string/C/rep-string-2.c | 18 + Task/Rep-string/Haskell/rep-string-2.hs | 43 +- Task/Rep-string/JavaScript/rep-string.js | 178 +++-- Task/Rep-string/Python/rep-string-3.py | 114 +++- Task/Rep-string/Python/rep-string-4.py | 25 + Task/Rep-string/Swift/rep-string.swift | 26 + .../Repeat-a-string/ABAP/repeat-a-string.abap | 3 + .../Elena/repeat-a-string.elena | 13 +- .../Free-Pascal/repeat-a-string-1.free | 1 + .../Free-Pascal/repeat-a-string-2.free | 1 + .../Free-Pascal/repeat-a-string-3.free | 1 + .../Repeat-a-string/Neko/repeat-a-string.neko | 11 + Task/Repeat-a-string/Nim/repeat-a-string.nim | 2 +- Task/Repeat-a-string/PL-I/repeat-a-string.pli | 6 + .../Processing/repeat-a-string | 10 + Task/Repeat-a-string/R/repeat-a-string.r | 2 +- .../Repeat-a-string/VBA/repeat-a-string-1.vba | 17 +- .../Repeat-a-string/VBA/repeat-a-string-2.vba | 2 +- .../Repeat-a-string/VBA/repeat-a-string-3.vba | 1 + .../repeat-a-string-1.visual | 2 +- .../repeat-a-string-2.visual | 4 +- .../Visual-Basic/repeat-a-string-1.vb | 10 + .../Visual-Basic/repeat-a-string-2.vb | 3 + .../Visual-Basic/repeat-a-string-3.vb | 1 + Task/Resistor-mesh/C++/resistor-mesh.cpp | 125 ++++ Task/Resistor-mesh/Perl/resistor-mesh.pl | 8 +- Task/Resistor-mesh/Phix/resistor-mesh.phix | 27 + Task/Resistor-mesh/REXX/resistor-mesh.rexx | 66 +- .../respond-to-an-unknown-method-call.elena | 41 +- ...s.basic => return-multiple-values-1.basic} | 0 .../BASIC/return-multiple-values-2.basic | 9 + .../BASIC/return-multiple-values-3.basic | 7 + .../Dc/return-multiple-values.dc | 2 + .../Elena/return-multiple-values.elena | 30 +- .../Groovy/return-multiple-values-3.groovy | 7 + .../REXX/return-multiple-values.rexx | 4 +- .../AWK/reverse-a-string-3.awk | 7 +- .../BASIC/reverse-a-string-2.basic | 12 +- .../BASIC/reverse-a-string-3.basic | 6 + .../C-sharp/reverse-a-string-1.cs | 6 + .../C-sharp/reverse-a-string-2.cs | 7 + .../C-sharp/reverse-a-string-3.cs | 14 + .../Ceylon/reverse-a-string.ceylon | 13 + Task/Reverse-a-string/Dc/reverse-a-string.dc | 1 + .../Elena/reverse-a-string.elena | 17 +- .../Haskell/reverse-a-string-2.hs | 7 +- .../Haskell/reverse-a-string-3.hs | 3 + .../LLVM/reverse-a-string.llvm | 87 +++ .../Neko/reverse-a-string.neko | 30 + .../OCaml/reverse-a-string-1.ocaml | 15 +- .../OCaml/reverse-a-string-2.ocaml | 17 +- .../OCaml/reverse-a-string-3.ocaml | 9 +- Task/Reverse-a-string/Ol/reverse-a-string.ol | 6 + .../Perl-6/reverse-a-string.pl6 | 3 +- .../Reverse-a-string/Perl/reverse-a-string.pl | 11 + .../PowerBASIC/reverse-a-string.powerbasic | 6 + .../Python/reverse-a-string-1.py | 2 +- .../Python/reverse-a-string-4.py | 35 +- .../Python/reverse-a-string-5.py | 3 + .../Python/reverse-a-string-6.py | 3 + .../Robotic/reverse-a-string.robotic | 16 + .../Simula/reverse-a-string.simula | 26 + .../Visual-Basic-.NET/reverse-a-string.visual | 62 +- .../Visual-Basic/reverse-a-string.vb | 1 + Task/Reverse-words-in-a-string/00META.yaml | 1 + .../Elena/reverse-words-in-a-string.elena | 30 +- .../MAXScript/reverse-words-in-a-string.max | 25 + .../Crystal/rock-paper-scissors.crystal | 106 +++ .../Factor/rock-paper-scissors.factor | 44 ++ .../JavaScript/rock-paper-scissors.js | 25 + .../Mercury/rock-paper-scissors.mercury | 66 ++ .../Prolog/rock-paper-scissors.pro | 27 + .../Swift/rock-paper-scissors.swift | 78 +++ Task/Roman-numerals-Decode/00META.yaml | 1 + .../360-Assembly/roman-numerals-decode.360 | 68 ++ .../Elena/roman-numerals-decode.elena | 72 +- .../Factor/roman-numerals-decode-1.factor | 3 + .../Factor/roman-numerals-decode-2.factor | 20 + .../Forth/roman-numerals-decode-2.fth | 46 +- .../Golo/roman-numerals-decode.golo | 46 ++ .../Haskell/roman-numerals-decode-1.hs | 50 +- .../Haskell/roman-numerals-decode-2.hs | 65 +- .../Haskell/roman-numerals-decode-3.hs | 21 +- .../Haskell/roman-numerals-decode-4.hs | 54 +- .../Haskell/roman-numerals-decode-5.hs | 46 +- .../Haskell/roman-numerals-decode-6.hs | 60 +- .../Haskell/roman-numerals-decode-7.hs | 34 + .../Haskell/roman-numerals-decode-8.hs | 39 ++ ...s-decode.pl => roman-numerals-decode-1.pl} | 0 .../Perl/roman-numerals-decode-2.pl | 20 + .../Perl/roman-numerals-decode-3.pl | 26 + .../PowerShell/roman-numerals-decode-1.psh | 1 + .../Python/roman-numerals-decode-4.py | 131 ++++ .../Swift/roman-numerals-decode-1.swift | 48 +- .../Swift/roman-numerals-decode-2.swift | 34 +- .../VBScript/roman-numerals-decode.vb | 20 + .../BASIC/roman-numerals-encode-2.basic | 41 +- .../BASIC/roman-numerals-encode-3.basic | 17 + ...encode.cpp => roman-numerals-encode-1.cpp} | 0 .../C++/roman-numerals-encode-2.cpp | 28 + .../Elena/roman-numerals-encode.elena | 53 +- .../Emacs-Lisp/roman-numerals-encode.l | 2 +- .../Golo/roman-numerals-encode.golo | 59 ++ .../Haskell/roman-numerals-encode-2.hs | 41 +- .../Haskell/roman-numerals-encode-3.hs | 59 ++ .../JavaScript/roman-numerals-encode-4.js | 8 +- .../JavaScript/roman-numerals-encode-6.js | 18 + .../JavaScript/roman-numerals-encode-7.js | 1 + .../PL-SQL/roman-numerals-encode.sql | 12 +- .../Perl/roman-numerals-encode-3.pl | 26 +- .../Python/roman-numerals-encode-4.py | 33 +- .../Python/roman-numerals-encode-5.py | 33 +- .../Python/roman-numerals-encode-6.py | 64 ++ .../VBA/roman-numerals-encode.vba | 9 + .../Dart/roots-of-a-function.dart | 12 + .../Julia/roots-of-a-function-2.julia | 20 +- .../Crystal/roots-of-unity-1.crystal | 7 + .../Crystal/roots-of-unity-2.crystal | 3 + Task/Roots-of-unity/Python/roots-of-unity.py | 41 +- Task/Roots-of-unity/REXX/roots-of-unity.rexx | 35 +- Task/Roots-of-unity/Rust/roots-of-unity.rust | 8 + Task/Roots-of-unity/VBA/roots-of-unity.vba | 10 + Task/Rot-13/360-Assembly/rot-13.360 | 26 + Task/Rot-13/BASIC256/rot-13.basic256 | 21 + Task/Rot-13/Elena/rot-13.elena | 43 +- Task/Rot-13/Golo/rot-13.golo | 32 + Task/Rot-13/Haskell/rot-13-1.hs | 9 +- Task/Rot-13/Haskell/rot-13-2.hs | 30 +- Task/Rot-13/Haskell/rot-13-3.hs | 26 +- Task/Rot-13/Haskell/rot-13-4.hs | 3 + Task/Rot-13/Julia/rot-13-1.julia | 7 + Task/Rot-13/Julia/rot-13-2.julia | 1 + Task/Rot-13/Julia/rot-13.julia | 6 - Task/Rot-13/Neko/rot-13.neko | 35 + Task/Rot-13/Nim/rot-13.nim | 4 +- Task/Rot-13/Pascal/rot-13.pascal | 50 +- Task/Rot-13/Rust/rot-13-2.rust | 3 + Task/Rot-13/UNIX-Shell/rot-13-1.sh | 11 +- .../BASIC256/run-length-encoding.basic256 | 77 +++ .../C/run-length-encoding.c | 2 +- .../Elena/run-length-encoding.elena | 95 +-- .../Emacs-Lisp/run-length-encoding.l | 18 + .../FreeBASIC/run-length-encoding.freebasic | 54 ++ .../PHP/run-length-encoding.php | 18 +- .../Smalltalk/run-length-encoding-1.st | 34 + .../Smalltalk/run-length-encoding-2.st | 5 + .../Smalltalk/run-length-encoding-3.st | 4 + Task/Runge-Kutta-method/00META.yaml | 1 + ...ethod.basic => runge-kutta-method-1.basic} | 0 .../BASIC/runge-kutta-method-2.basic | 10 + .../Crystal/runge-kutta-method.crystal | 11 + .../Haskell/runge-kutta-method-1.hs | 36 +- .../Haskell/runge-kutta-method-3.hs | 45 ++ ...utta-method.js => runge-kutta-method-1.js} | 0 .../JavaScript/runge-kutta-method-2.js | 163 +++++ .../00META.yaml | 1 + ...time-evaluation-in-an-environment-1.factor | 3 + ...time-evaluation-in-an-environment-2.factor | 2 + ...time-evaluation-in-an-environment-3.factor | 1 + ...time-evaluation-in-an-environment-4.factor | 2 + ...time-evaluation-in-an-environment-5.factor | 4 + ...time-evaluation-in-an-environment-6.factor | 4 + Task/Runtime-evaluation/00META.yaml | 1 + .../S-Expressions/Factor/s-expressions.factor | 27 + Task/S-Expressions/Nim/s-expressions.nim | 145 ++++ Task/SEDOLs/Factor/sedols.factor | 42 ++ Task/SEDOLs/Haskell/sedols.hs | 2 +- .../JavaScript/{sedols.js => sedols-1.js} | 0 Task/SEDOLs/JavaScript/sedols-2.js | 164 +++++ Task/SEDOLs/OCaml/sedols.ocaml | 11 +- Task/SEDOLs/Python/{sedols.py => sedols-1.py} | 0 Task/SEDOLs/Python/sedols-2.py | 125 ++++ Task/SEDOLs/Q/sedols.q | 8 + Task/SEDOLs/Ruby/sedols.rb | 16 +- Task/SHA-1/D/{sha-1.d => sha-1-1.d} | 0 Task/SHA-1/D/sha-1-2.d | 81 +++ Task/SHA-1/Fortran/sha-1.f | 6 +- Task/SHA-1/R/sha-1.r | 4 + Task/SHA-256/AWK/sha-256.awk | 5 + Task/SHA-256/AutoHotkey/sha-256.ahk | 2 - Task/SHA-256/Fortran/sha-256.f | 8 +- Task/SHA-256/Free-Pascal/sha-256.free | 28 + Task/SHA-256/R/sha-256.r | 4 + Task/SHA-256/Rust/sha-256.rust | 27 +- Task/SOAP/Go/soap-1.go | 53 ++ Task/SOAP/Go/soap-2.go | 7 + Task/SOAP/Go/soap-3.go | 20 + Task/SOAP/Perl-6/soap.pl6 | 14 + Task/SOAP/Visual-Objects/soap.vobj | 2 +- .../Perl-6/sql-based-authentication.pl6 | 29 + .../Ruby/sql-based-authentication.rb | 30 + Task/Safe-addition/C++/safe-addition.cpp | 43 ++ Task/Safe-addition/Perl-6/safe-addition.pl6 | 28 + Task/Safe-addition/Perl/safe-addition.pl | 11 + Task/Same-Fringe/00META.yaml | 1 + .../00DESCRIPTION | 2 +- .../Perl/scope-function-names-and-labels.pl | 23 + .../Julia/scope-modifiers.julia | 12 + .../Pascal/scope-modifiers.pascal | 29 + ...rch-a-list.basic => search-a-list-1.basic} | 0 .../Search-a-list/BASIC/search-a-list-2.basic | 17 + Task/Search-a-list/Elena/search-a-list.elena | 29 +- Task/Search-a-list/Haskell/search-a-list-4.hs | 5 +- Task/Search-a-list/REXX/search-a-list-4.rexx | 52 +- Task/Search-a-list/VBA/search-a-list.vba | 32 + .../Phix/secure-temporary-file.phix | 5 + Task/Self-describing-numbers/00META.yaml | 1 + .../Sidef/self-describing-numbers-1.sidef | 2 +- Task/Self-referential-sequence/00DESCRIPTION | 12 +- Task/Self-referential-sequence/00META.yaml | 1 + .../Julia/self-referential-sequence.julia | 61 ++ .../REXX/self-referential-sequence.rexx | 2 +- .../Scala/self-referential-sequence.scala | 35 + Task/Semiprime/AWK/semiprime.awk | 28 + Task/Semiprime/Python/semiprime-1.py | 2 +- Task/Semiprime/Ruby/semiprime.rb | 2 +- Task/Semordnilap/00DESCRIPTION | 2 +- Task/Semordnilap/00META.yaml | 1 + Task/Semordnilap/Aime/semordnilap.aime | 2 +- Task/Semordnilap/Factor/semordnilap.factor | 21 + Task/Semordnilap/Haskell/semordnilap.hs | 2 +- Task/Semordnilap/JavaScript/semordnilap-3.js | 60 ++ Task/Semordnilap/Python/semordnilap-3.py | 112 +++ Task/Semordnilap/Python/semordnilap-4.py | 63 ++ .../Elena/send-an-unknown-method-call.elena | 21 +- .../Factor/send-an-unknown-method-call.factor | 13 + Task/Send-email/Perl-6/send-email.pl6 | 51 ++ Task/Send-email/TXR/send-email.txr | 1 - .../ALGOL-W/sequence-of-non-squares.alg | 30 + .../Ol/sequence-of-non-squares.ol | 19 + .../Python/sequence-of-non-squares.py | 28 +- Task/Set-consolidation/00DESCRIPTION | 1 + Task/Set-consolidation/00META.yaml | 1 + .../Aime/set-consolidation.aime | 30 +- .../Haskell/set-consolidation.hs | 30 +- .../JavaScript/set-consolidation.js | 121 ++++ .../Phix/set-consolidation.phix | 34 + .../Python/set-consolidation-4.py | 73 ++ .../VBA/set-consolidation.vba | 65 ++ Task/Set-of-real-numbers/00META.yaml | 1 + .../C++/set-of-real-numbers.cpp | 134 ++++ .../C/set-of-real-numbers.c | 173 +++++ .../Elena/set-of-real-numbers.elena | 44 +- .../Haskell/set-of-real-numbers-1.hs | 145 ++++ .../Haskell/set-of-real-numbers-2.hs | 100 +++ .../Lua/set-of-real-numbers.lua | 98 +++ .../Perl-6/set-of-real-numbers.pl6 | 9 +- .../Phix/set-of-real-numbers-1.phix | 27 + .../Phix/set-of-real-numbers-2.phix | 12 + Task/Set-puzzle/Haskell/set-puzzle.hs | 118 ++-- Task/Set-puzzle/Julia/set-puzzle.julia | 43 ++ Task/Set/Ada/set.ada | 77 +-- Task/Set/Ol/set.ol | 31 + Task/Set/Sidef/set-1.sidef | 50 +- Task/Set/Sidef/set-2.sidef | 32 +- Task/Set/VBA/set.vba | 124 ++++ ...seven-sided-dice-from-five-sided-dice.phix | 10 + ...seven-sided-dice-from-five-sided-dice.rexx | 35 +- .../seven-sided-dice-from-five-sided-dice.vba | 42 ++ .../seven-sided-dice-from-five-sided-dice.v | 2 +- .../Free-Pascal/shell-one-liner.free | 1 + .../Retro/shell-one-liner.retro | 2 +- .../Elena/short-circuit-evaluation.elena | 36 +- .../VBA/short-circuit-evaluation.vba | 33 + .../short-circuit-evaluation.visual | 29 + Task/Show-the-epoch/00META.yaml | 1 + ...script => sierpinski-carpet-1.applescript} | 0 .../sierpinski-carpet-2.applescript | 188 +++++ .../Crystal/sierpinski-carpet.crystal | 11 + .../Haskell/sierpinski-carpet-4.hs | 68 +- .../Haskell/sierpinski-carpet-5.hs | 63 ++ .../JavaScript/sierpinski-carpet-4.js | 92 +++ .../Python/sierpinski-carpet-3.py | 144 ++++ .../REXX/sierpinski-carpet.rexx | 24 +- .../Rust/sierpinski-carpet.rust | 23 + .../VBA/sierpinski-carpet.vba | 23 + .../Sierpinski-triangle-Graphical/00META.yaml | 1 + .../sierpinski-triangle-graphical.factor | 41 ++ .../sierpinski-triangle-graphical.objeck | 68 ++ .../Perl-6/sierpinski-triangle-graphical.pl6 | 54 +- .../Perl/sierpinski-triangle-graphical.pl | 69 +- .../Seed7/sierpinski-triangle-graphical.seed7 | 3 +- ...ngle.basic => sierpinski-triangle-1.basic} | 0 .../BASIC/sierpinski-triangle-2.basic | 17 + .../BASIC/sierpinski-triangle-3.basic | 12 + .../Python/sierpinski-triangle-3.py | 26 +- .../Python/sierpinski-triangle-4.py | 4 + .../VBA/sierpinski-triangle.vba | 16 + .../ALGOL-M/sieve-of-eratosthenes.algol-m | 65 ++ .../Agda/sieve-of-eratosthenes.agda | 46 ++ .../sieve-of-eratosthenes.applescript | 33 + .../BASIC/sieve-of-eratosthenes-3.basic | 28 +- .../BASIC/sieve-of-eratosthenes-4.basic | 24 +- .../BASIC/sieve-of-eratosthenes-5.basic | 25 +- .../BASIC/sieve-of-eratosthenes-6.basic | 25 +- .../BASIC/sieve-of-eratosthenes-7.basic | 12 + .../C++/sieve-of-eratosthenes-1.cpp | 13 +- .../Clojure/sieve-of-eratosthenes-11.clj | 91 +-- .../Clojure/sieve-of-eratosthenes-13.clj | 95 +-- .../Dart/sieve-of-eratosthenes-2.dart | 50 +- .../Dart/sieve-of-eratosthenes-3.dart | 104 +-- .../Dart/sieve-of-eratosthenes-4.dart | 209 ++++++ .../Elixir/sieve-of-eratosthenes-3.elixir | 53 ++ .../Elixir/sieve-of-eratosthenes-4.elixir | 81 +++ .../F-Sharp/sieve-of-eratosthenes-1.fs | 10 +- .../F-Sharp/sieve-of-eratosthenes-2.fs | 30 +- .../F-Sharp/sieve-of-eratosthenes-3.fs | 30 +- .../F-Sharp/sieve-of-eratosthenes-4.fs | 35 +- .../Factor/sieve-of-eratosthenes.factor | 32 + .../Free-Pascal/sieve-of-eratosthenes-1.free | 73 ++ .../Free-Pascal/sieve-of-eratosthenes-2.free | 129 ++++ .../Julia/sieve-of-eratosthenes-1.julia | 21 +- .../Julia/sieve-of-eratosthenes-10.julia | 39 ++ .../Julia/sieve-of-eratosthenes-2.julia | 16 +- .../Julia/sieve-of-eratosthenes-3.julia | 20 + .../Julia/sieve-of-eratosthenes-4.julia | 49 ++ .../Julia/sieve-of-eratosthenes-5.julia | 6 + .../Julia/sieve-of-eratosthenes-6.julia | 198 ++++++ .../Julia/sieve-of-eratosthenes-7.julia | 15 + .../Julia/sieve-of-eratosthenes-8.julia | 43 ++ .../Julia/sieve-of-eratosthenes-9.julia | 1 + .../Kotlin/sieve-of-eratosthenes-5.kotlin | 33 + .../Kotlin/sieve-of-eratosthenes-6.kotlin | 1 + .../Kotlin/sieve-of-eratosthenes-7.kotlin | 38 ++ .../Kotlin/sieve-of-eratosthenes-8.kotlin | 174 +++++ .../Maple/sieve-of-eratosthenes.maple | 13 + .../Mercury/sieve-of-eratosthenes.mercury | 59 ++ .../Modula-3/sieve-of-eratosthenes-1.mod3 | 58 +- .../Nim/sieve-of-eratosthenes-1.nim | 10 +- .../Nim/sieve-of-eratosthenes-3.nim | 73 ++ .../Nim/sieve-of-eratosthenes-4.nim | 41 ++ .../Nim/sieve-of-eratosthenes-5.nim | 171 +++++ .../Ol/sieve-of-eratosthenes.ol | 16 + .../Perl-6/sieve-of-eratosthenes-3.pl6 | 21 + .../Pony/sieve-of-eratosthenes-1.pony | 59 ++ .../Pony/sieve-of-eratosthenes-2.pony | 60 ++ .../REXX/sieve-of-eratosthenes-1.rexx | 18 +- .../REXX/sieve-of-eratosthenes-2.rexx | 42 +- .../REXX/sieve-of-eratosthenes-3.rexx | 33 +- .../Scheme/sieve-of-eratosthenes-13.ss | 10 +- .../Swift/sieve-of-eratosthenes-1.swift | 37 + .../Swift/sieve-of-eratosthenes-2.swift | 23 + .../Swift/sieve-of-eratosthenes-3.swift | 75 ++ .../Swift/sieve-of-eratosthenes-4.swift | 27 + .../Swift/sieve-of-eratosthenes-5.swift | 315 +++++++++ .../Swift/sieve-of-eratosthenes.swift | 21 - .../UNIX-Shell/sieve-of-eratosthenes-4.sh | 40 +- .../UNIX-Shell/sieve-of-eratosthenes-5.sh | 53 +- .../UNIX-Shell/sieve-of-eratosthenes-6.sh | 28 + .../VBA/sieve-of-eratosthenes.vba | 31 + ....visual => sieve-of-eratosthenes-1.visual} | 0 .../sieve-of-eratosthenes-2.visual | 15 + .../Xojo/sieve-of-eratosthenes-1.xojo | 33 + .../Xojo/sieve-of-eratosthenes-2.xojo | 39 ++ .../Julia/simple-database.julia | 60 ++ .../APL/simple-windowed-application.apl | 17 + .../Elena/simple-windowed-application.elena | 64 +- .../Python/simple-windowed-application-1.py | 38 +- .../Python/simple-windowed-application-2.py | 32 +- .../Python/simple-windowed-application-3.py | 52 +- .../Python/simple-windowed-application-4.py | 49 +- Task/Simulate-input-Keyboard/00DESCRIPTION | 1 + .../Go/simulate-input-keyboard.go | 29 + .../Perl-6/simulate-input-keyboard.pl6 | 31 + .../Go/simulate-input-mouse.go | 8 + .../Perl-6/simulate-input-mouse.pl6 | 47 ++ Task/Singleton/Elena/singleton-1.elena | 4 +- Task/Singleton/Elena/singleton-2.elena | 6 +- Task/Singleton/Julia/singleton.julia | 2 +- .../singly-linked-list-element-definition.arm | 68 ++ ...ingly-linked-list-element-definition.elena | 14 +- ...ngly-linked-list-element-definition-1.pl6} | 0 ...ingly-linked-list-element-definition-2.pl6 | 10 + .../singly-linked-list-element-insertion.arm | 179 +++++ ...singly-linked-list-element-insertion.elena | 6 +- .../singly-linked-list-element-insertion.pl6 | 6 +- .../singly-linked-list-element-insertion.tcl | 12 +- .../singly-linked-list-traversal.arm | 179 +++++ .../Elena/singly-linked-list-traversal.elena | 6 +- .../Perl-6/singly-linked-list-traversal-3.pl6 | 3 + .../Perl-6/singly-linked-list-traversal-4.pl6 | 5 + Task/Sleep/ARM-Assembly/sleep.arm | 163 +++++ Task/Sleep/Cache-ObjectScript/sleep.cos | 7 + Task/Sleep/Elena/sleep.elena | 16 +- Task/Sleep/Visual-Basic-.NET/sleep.visual | 8 + Task/Sockets/Aime/sockets.aime | 3 + Task/Sockets/C++/sockets.cpp | 6 +- Task/Sockets/Elena/sockets.elena | 4 +- Task/Sockets/Neko/sockets.neko | 24 + Task/Sockets/Smalltalk/sockets.st | 25 +- Task/Sokoban/Julia/sokoban.julia | 93 +++ Task/Sokoban/Phix/sokoban-1.phix | 171 +++++ Task/Sokoban/Phix/sokoban-2.phix | 7 + Task/Sokoban/Phix/sokoban-3.phix | 10 + Task/Sokoban/Phix/sokoban-4.phix | 7 + Task/Sokoban/Phix/sokoban-5.phix | 13 + Task/Sokoban/Ring/sokoban.ring | 382 +++++++++++ Task/Solve-a-Hidato-puzzle/00META.yaml | 1 + .../C-sharp/solve-a-hidato-puzzle.cs | 128 ++++ .../Julia/solve-a-hidato-puzzle-1.julia | 56 ++ .../Julia/solve-a-hidato-puzzle-2.julia | 18 + Task/Solve-a-Holy-Knights-tour/00META.yaml | 1 + .../C-sharp/solve-a-holy-knights-tour.cs | 144 ++++ .../Julia/solve-a-holy-knights-tour.julia | 18 + Task/Solve-a-Hopido-puzzle/00META.yaml | 1 + .../C-sharp/solve-a-hopido-puzzle.cs | 126 ++++ .../Julia/solve-a-hopido-puzzle.julia | 16 + .../Perl/solve-a-hopido-puzzle.pl | 38 ++ Task/Solve-a-Numbrix-puzzle/00META.yaml | 1 + .../C-sharp/solve-a-numbrix-puzzle.cs | 142 ++++ .../Julia/solve-a-numbrix-puzzle.julia | 35 + .../00DESCRIPTION | 73 +- .../APL/solve-the-no-connection-puzzle.apl | 15 + .../solve-the-no-connection-puzzle.arm | 536 +++++++++++++++ .../solve-the-no-connection-puzzle.factor | 46 ++ .../Haskell/solve-the-no-connection-puzzle.hs | 32 +- .../solve-the-no-connection-puzzle.julia | 39 ++ .../solve-the-no-connection-puzzle.picat | 40 ++ .../solve-the-no-connection-puzzle.scala | 24 + .../sort-an-array-of-composite-structures.awk | 34 + ...ort-an-array-of-composite-structures.elena | 34 +- ...sort-an-array-of-composite-structures.phix | 20 +- ...sort-an-array-of-composite-structures.rust | 51 ++ .../sort-an-array-of-composite-structures.sql | 7 + .../ALGOL-W/sort-an-integer-array.alg | 16 + .../Elena/sort-an-integer-array.elena | 14 +- .../Java/sort-an-integer-array-1.java | 2 +- .../Java/sort-an-integer-array-2.java | 2 +- .../Neko/sort-an-integer-array.neko | 40 ++ Task/Sort-disjoint-sublist/00DESCRIPTION | 4 +- Task/Sort-disjoint-sublist/00META.yaml | 1 + .../sort-disjoint-sublist-1.applescript | 196 ++++-- .../Elena/sort-disjoint-sublist.elena | 42 +- .../Factor/sort-disjoint-sublist-1.factor | 3 + .../Factor/sort-disjoint-sublist-2.factor | 2 + .../Haskell/sort-disjoint-sublist-1.hs | 34 +- .../Haskell/sort-disjoint-sublist-2.hs | 25 +- .../JavaScript/sort-disjoint-sublist-3.js | 109 ++- .../Phix/sort-disjoint-sublist.phix | 3 - ...-sublist.py => sort-disjoint-sublist-1.py} | 0 .../Python/sort-disjoint-sublist-2.py | 58 ++ .../REXX/sort-disjoint-sublist.rexx | 57 +- .../sort-using-a-custom-comparator.alg | 94 +++ .../AWK/sort-using-a-custom-comparator.awk | 8 +- .../sort-using-a-custom-comparator.elena | 24 +- .../Haskell/sort-using-a-custom-comparator.hs | 18 + .../sort-using-a-custom-comparator-3.js | 143 ++-- .../Phix/sort-using-a-custom-comparator.phix | 10 +- .../Rust/sort-using-a-custom-comparator.rust | 6 +- .../Clojure/sorting-algorithms-bead-sort.clj | 3 +- .../Java/sorting-algorithms-bead-sort.java | 4 +- .../Python/sorting-algorithms-bead-sort.py | 14 +- .../VBA/sorting-algorithms-bead-sort.vba | 33 + .../sorting-algorithms-bogosort.arm | 247 +++++++ .../Elena/sorting-algorithms-bogosort.elena | 34 +- .../Rust/sorting-algorithms-bogosort.rust | 4 +- .../VBA/sorting-algorithms-bogosort.vba | 36 + .../00DESCRIPTION | 2 + .../sorting-algorithms-bubble-sort-4.basic | 24 + .../sorting-algorithms-bubble-sort-5.basic | 22 + .../sorting-algorithms-bubble-sort-6.basic | 26 + .../sorting-algorithms-bubble-sort.elena | 50 +- .../sorting-algorithms-bubble-sort.elixir | 10 +- .../sorting-algorithms-bubble-sort.realbasic | 10 +- .../sorting-algorithms-bubble-sort-4.rexx | 32 + .../sorting-algorithms-bubble-sort-4.spark | 22 + .../sorting-algorithms-bubble-sort-5.spark | 34 + .../sorting-algorithms-bubble-sort-6.spark | 11 + .../sorting-algorithms-bubble-sort-7.spark | 5 + .../sorting-algorithms-bubble-sort.stata | 17 + .../VBA/sorting-algorithms-bubble-sort.vba | 27 + .../Xojo/sorting-algorithms-bubble-sort.xojo | 16 + .../sorting-algorithms-bubble-sort-1.zx | 21 + .../sorting-algorithms-bubble-sort-2.zx | 11 + .../sorting-algorithms-cocktail-sort.elena | 70 +- .../sorting-algorithms-cocktail-sort.swift | 35 + .../VBA/sorting-algorithms-cocktail-sort.vba | 36 + .../sorting-algorithms-cocktail-sort-1.zx | 21 + .../sorting-algorithms-cocktail-sort-2.zx | 33 + .../Elena/sorting-algorithms-comb-sort.elena | 60 +- ...fth => sorting-algorithms-comb-sort-1.fth} | 0 .../Forth/sorting-algorithms-comb-sort-2.fth | 49 ++ .../VBA/sorting-algorithms-comb-sort.vba | 27 + .../00DESCRIPTION | 3 +- .../C/sorting-algorithms-counting-sort-1.c | 14 +- .../sorting-algorithms-counting-sort.elena | 52 +- .../sorting-algorithms-counting-sort-1.f | 4 +- .../sorting-algorithms-counting-sort-1.rexx | 14 +- .../VBA/sorting-algorithms-counting-sort.vba | 21 + .../Elena/sorting-algorithms-gnome-sort.elena | 57 +- .../Lua/sorting-algorithms-gnome-sort-1.lua | 2 +- .../REXX/sorting-algorithms-gnome-sort-1.rexx | 20 +- .../VBA/sorting-algorithms-gnome-sort.vba | 25 + .../sorting-algorithms-heapsort.arm | 288 ++++++++ .../Julia/sorting-algorithms-heapsort.julia | 23 + .../Stata/sorting-algorithms-heapsort.stata | 44 ++ .../sorting-algorithms-insertion-sort.arm | 223 ++++++ ...sorting-algorithms-insertion-sort-1.basic} | 0 .../sorting-algorithms-insertion-sort-2.basic | 21 + .../sorting-algorithms-insertion-sort-3.basic | 8 + .../sorting-algorithms-insertion-sort-4.basic | 27 + .../sorting-algorithms-insertion-sort.elena | 44 +- .../sorting-algorithms-insertion-sort-1.py | 12 +- .../sorting-algorithms-insertion-sort-2.py | 21 +- .../sorting-algorithms-insertion-sort-3.py | 15 +- .../sorting-algorithms-insertion-sort-4.py | 4 + ...sorting-algorithms-insertion-sort-1.scala} | 0 .../sorting-algorithms-insertion-sort-2.scala | 7 + .../VBA/sorting-algorithms-insertion-sort.vba | 22 + .../sorting-algorithms-merge-sort-1.astro | 8 +- .../Dart/sorting-algorithms-merge-sort.dart | 168 +++-- .../Fortran/sorting-algorithms-merge-sort.f | 127 ++-- .../Swift/sorting-algorithms-merge-sort.swift | 81 ++- .../sorting-algorithms-pancake-sort.elena | 83 +-- .../ABAP/sorting-algorithms-quicksort.abap | 38 ++ .../sorting-algorithms-quicksort.arm | 254 +++++++ .../Ada/sorting-algorithms-quicksort-1.ada | 13 +- .../Ada/sorting-algorithms-quicksort-2.ada | 76 +-- .../Ada/sorting-algorithms-quicksort-3.ada | 7 +- ...c => sorting-algorithms-quicksort-1.basic} | 0 .../sorting-algorithms-quicksort-2.basic | 28 + .../sorting-algorithms-quicksort-3.basic | 37 + .../sorting-algorithms-quicksort-4.lisp | 6 + .../Elena/sorting-algorithms-quicksort.elena | 71 +- .../sorting-algorithms-quicksort-1.mumps | 35 + .../sorting-algorithms-quicksort-2.mumps | 1 + .../Red/sorting-algorithms-quicksort.red | 32 + .../Rust/sorting-algorithms-quicksort.rust | 7 +- .../sorting-algorithms-quicksort-1.scala | 15 +- .../sorting-algorithms-quicksort-2.scala | 13 +- .../sorting-algorithms-quicksort-3.scala | 13 +- .../sorting-algorithms-quicksort-4.scala | 13 +- .../Julia/sorting-algorithms-radix-sort.julia | 27 + .../Perl-6/sorting-algorithms-radix-sort.pl6 | 2 +- ....py => sorting-algorithms-radix-sort-1.py} | 0 .../Python/sorting-algorithms-radix-sort-2.py | 70 ++ .../Python/sorting-algorithms-radix-sort-3.py | 21 + .../REXX/sorting-algorithms-radix-sort.rexx | 77 +-- .../sorting-algorithms-selection-sort.arm | 226 ++++++ .../sorting-algorithms-selection-sort.elena | 48 +- .../sorting-algorithms-selection-sort.rexx | 38 +- .../sorting-algorithms-shell-sort.arm | 231 +++++++ .../00DESCRIPTION | 2 +- .../Dart/sorting-algorithms-sleep-sort.dart | 20 +- .../Elena/sorting-algorithms-sleep-sort.elena | 47 +- .../sorting-algorithms-sleep-sort-2.js | 2 +- ....py => sorting-algorithms-sleep-sort-1.py} | 0 .../Python/sorting-algorithms-sleep-sort-2.py | 10 + ...cl => sorting-algorithms-sleep-sort-1.tcl} | 0 .../Tcl/sorting-algorithms-sleep-sort-2.tcl | 37 + .../00META.yaml | 1 + .../sorting-algorithms-stooge-sort.elena | 44 +- .../sorting-algorithms-stooge-sort.factor | 25 + .../REXX/sorting-algorithms-stooge-sort.rexx | 10 +- .../sorting-algorithms-strand-sort.julia | 29 + Task/Soundex/Factor/soundex.factor | 5 + Task/Soundex/Objeck/soundex.objeck | 62 ++ Task/Soundex/Phix/soundex.phix | 79 +++ Task/Sparkline-in-unicode/00DESCRIPTION | 12 +- Task/Sparkline-in-unicode/00META.yaml | 1 + .../sparkline-in-unicode.applescript | 360 ++++++---- .../Haskell/sparkline-in-unicode-1.hs | 64 +- .../Haskell/sparkline-in-unicode-2.hs | 19 +- .../JavaScript/sparkline-in-unicode.js | 181 ++++- .../Kotlin/sparkline-in-unicode.kotlin | 4 +- .../Perl-6/sparkline-in-unicode.pl6 | 5 +- .../Perl/sparkline-in-unicode.pl | 42 +- .../Phix/sparkline-in-unicode.phix | 26 + .../Python/sparkline-in-unicode-1.py | 25 + .../Python/sparkline-in-unicode-2.py | 113 +++ .../Python/sparkline-in-unicode.py | 17 - .../REXX/sparkline-in-unicode-2.rexx | 43 +- Task/Speech-synthesis/00DESCRIPTION | 4 + .../Julia/speech-synthesis.julia | 4 + .../REXX/speech-synthesis.rexx | 26 +- .../Spiral-matrix/Factor/spiral-matrix.factor | 19 + Task/Spiral-matrix/Haskell/spiral-matrix-4.hs | 15 +- Task/Spiral-matrix/Python/spiral-matrix-6.py | 53 +- Task/Spiral-matrix/Python/spiral-matrix-7.py | 17 +- Task/Spiral-matrix/Python/spiral-matrix-8.py | 5 + Task/Stack-traces/Elena/stack-traces.elena | 38 +- Task/Stack-traces/Factor/stack-traces.factor | 2 + Task/Stack/ABAP/stack.abap | 205 ++++++ Task/Stack/Elena/stack.elena | 13 +- Task/Stack/Free-Pascal/stack.free | 23 + Task/Stack/OCaml/stack.ocaml | 2 +- Task/Stack/Racket/stack-1.rkt | 2 +- Task/Stack/Ruby/stack-4.rb | 11 + Task/Stack/VBScript/{stack.vb => stack-1.vb} | 0 Task/Stack/VBScript/stack-2.vb | 39 ++ Task/Stair-climbing-puzzle/00META.yaml | 1 + .../Factor/stair-climbing-puzzle.factor | 1 + .../SAS/stair-climbing-puzzle-1.sas | 3 + ...puzzle.sas => stair-climbing-puzzle-2.sas} | 4 - .../SAS/stair-climbing-puzzle-3.sas | 9 + Task/Start-from-a-main-routine/00META.yaml | 1 + .../ALGOL-68/start-from-a-main-routine.alg | 3 + .../Go/start-from-a-main-routine.go | 24 + .../Seed7/start-from-a-main-routine-1.seed7 | 6 + .../Seed7/start-from-a-main-routine-2.seed7 | 10 + .../start-from-a-main-routine-1.visual | 35 + .../start-from-a-main-routine-2.visual | 6 + .../PARI-GP/statistics-basic-1.pari | 2 +- .../Statistics-Basic/VBA/statistics-basic.vba | 25 + .../Clojure/stem-and-leaf-plot.clj | 42 ++ .../Factor/stem-and-leaf-plot.factor | 18 + .../Nim/stem-and-leaf-plot.nim | 63 ++ .../Python/stem-and-leaf-plot-3.py | 37 + Task/Stern-Brocot-sequence/00DESCRIPTION | 9 +- Task/Stern-Brocot-sequence/00META.yaml | 1 + .../360-Assembly/stern-brocot-sequence-1.360 | 72 ++ .../360-Assembly/stern-brocot-sequence-2.360 | 6 + .../360-Assembly/stern-brocot-sequence-3.360 | 14 + .../stern-brocot-sequence.applescript | 518 ++++++++++++++ .../Clojure/stern-brocot-sequence-1.clj | 46 +- .../Fortran/stern-brocot-sequence-1.f | 31 + .../Fortran/stern-brocot-sequence-2.f | 22 + .../FreeBASIC/stern-brocot-sequence.freebasic | 82 +++ ...sequence.hs => stern-brocot-sequence-1.hs} | 0 .../Haskell/stern-brocot-sequence-2.hs | 20 + .../JavaScript/stern-brocot-sequence.js | 325 +++++++++ .../Perl/stern-brocot-sequence-2.pl | 7 +- .../Python/stern-brocot-sequence-3.py | 191 ++++++ .../Ruby/stern-brocot-sequence.rb | 2 +- .../Swift/stern-brocot-sequence.swift | 40 ++ .../stern-brocot-sequence.visual | 29 + .../ARM-Assembly/string-append.arm | 95 +++ .../String-append/BASIC/string-append-3.basic | 3 + Task/String-append/Elena/string-append.elena | 15 +- Task/String-append/Neko/string-append.neko | 7 + .../{string-case.apl => string-case-1.apl} | 0 Task/String-case/APL/string-case-2.apl | 4 + Task/String-case/BASIC/string-case-4.basic | 10 +- Task/String-case/BASIC/string-case-5.basic | 10 +- Task/String-case/BASIC/string-case-6.basic | 8 +- Task/String-case/BASIC/string-case-7.basic | 11 +- Task/String-case/BASIC/string-case-8.basic | 26 +- Task/String-case/Elena/string-case.elena | 20 +- Task/String-case/OCaml/string-case.ocaml | 6 +- .../{string-case.sno => string-case-1.sno} | 0 Task/String-case/SNOBOL4/string-case-2.sno | 18 + Task/String-case/Visual-Basic/string-case.vb | 23 + .../Elena/string-comparison.elena | 34 +- .../ARM-Assembly/string-concatenation.arm | 71 ++ .../Aime/string-concatenation.aime | 8 +- .../BASIC/string-concatenation-4.basic | 6 +- .../BASIC/string-concatenation-5.basic | 3 + .../Elena/string-concatenation.elena | 16 +- .../Neko/string-concatenation.neko | 22 + .../OCaml/string-concatenation.ocaml | 1 - .../string-interpolation--included-.elena | 12 +- .../Neko/string-interpolation--included-.neko | 9 + .../String-length/BASIC/string-length-4.basic | 2 + .../Bracmat/string-length-4.bracmat | 4 + Task/String-length/Dc/string-length-1.dc | 3 + .../{string-length.dc => string-length-2.dc} | 0 .../String-length/Elena/string-length-1.elena | 18 +- .../String-length/Elena/string-length-2.elena | 16 +- .../String-length/OCaml/string-length-2.ocaml | 8 +- Task/String-length/Phix/string-length.phix | 1 + .../Robotic/string-length.robotic | 3 + .../Visual-Basic-.NET/string-length-1.visual | 5 + .../Visual-Basic-.NET/string-length-2.visual | 20 + .../Visual-Basic-.NET/string-length-3.visual | 13 + .../Visual-Basic-.NET/string-length-4.visual | 39 ++ .../ARM-Assembly/string-matching.arm | 240 +++++++ .../String-matching/Aime/string-matching.aime | 25 +- .../AppleScript/string-matching-1.applescript | 17 + .../AppleScript/string-matching-2.applescript | 23 + .../AppleScript/string-matching-3.applescript | 70 ++ .../Elena/string-matching.elena | 36 +- .../Factor/string-matching-1.factor | 1 + .../Factor/string-matching-2.factor | 1 + .../Factor/string-matching-3.factor | 1 + .../Factor/string-matching-4.factor | 1 + .../Factor/string-matching-5.factor | 2 + .../Julia/string-matching.julia | 14 +- Task/String-matching/VBA/string-matching.vba | 31 + ...g-prepend.basic => string-prepend-1.basic} | 0 .../BASIC/string-prepend-2.basic | 3 + .../String-prepend/Elena/string-prepend.elena | 23 +- Task/String-prepend/Neko/string-prepend.neko | 7 + Task/String-prepend/Xojo/string-prepend.xojo | 3 + ...trip-a-set-of-characters-from-a-string.alg | 41 ++ ...-a-set-of-characters-from-a-string-2.basic | 27 +- ...-a-set-of-characters-from-a-string-3.basic | 14 + ...ip-a-set-of-characters-from-a-string.elena | 17 +- ...a-set-of-characters-from-a-string-1.factor | 1 + ...a-set-of-characters-from-a-string-2.factor | 2 + ...p-a-set-of-characters-from-a-string.factor | 6 - ...ip-a-set-of-characters-from-a-string.julia | 5 +- ...trip-a-set-of-characters-from-a-string.nim | 12 +- ...ip-a-set-of-characters-from-a-string.ocaml | 7 +- .../ALGOL-W/strip-block-comments.alg | 119 ++++ .../VBA/strip-block-comments.vba | 126 ++++ .../Aime/strip-comments-from-a-string.aime | 13 + .../Python/strip-comments-from-a-string-3.py | 32 +- .../Rust/strip-comments-from-a-string.rust | 13 + .../00META.yaml | 1 + ...s-and-extended-characters-from-a-string.hs | 19 +- ...nd-extended-characters-from-a-string.ocaml | 19 +- ...hitespace-from-a-string-top-and-tail.elena | 16 +- ...p-whitespace-from-a-string-top-and-tail.hs | 6 +- ...-whitespace-from-a-string-top-and-tail.vba | 11 + .../BASIC/substring-top-and-tail-2.basic | 12 +- .../BASIC/substring-top-and-tail-3.basic | 8 + .../COBOL/substring-top-and-tail.cobol | 17 + .../Elena/substring-top-and-tail.elena | 16 +- .../Neko/substring-top-and-tail.neko | 11 + ...nd-tail.py => substring-top-and-tail-1.py} | 0 .../Python/substring-top-and-tail-2.py | 55 ++ .../UNIX-Shell/substring-top-and-tail-1.sh | 3 + .../UNIX-Shell/substring-top-and-tail-2.sh | 1 + .../UNIX-Shell/substring-top-and-tail-3.sh | 1 + .../UNIX-Shell/substring-top-and-tail-4.sh | 1 + .../UNIX-Shell/substring-top-and-tail.sh | 5 - Task/Substring/ARM-Assembly/substring.arm | 308 +++++++++ Task/Substring/BASIC/substring-3.basic | 22 +- Task/Substring/BASIC/substring-4.basic | 25 +- Task/Substring/BASIC/substring-5.basic | 12 + Task/Substring/BASIC/substring-6.basic | 25 + Task/Substring/Elena/substring.elena | 28 +- Task/Substring/Free-Pascal/substring.free | 5 + Task/Substring/Groovy/substring.groovy | 11 + Task/Substring/Haskell/substring-2.hs | 29 +- Task/Substring/VBA/substring.vba | 23 + .../Haskell/subtractive-generator.hs | 18 +- .../Julia/subtractive-generator.julia | 16 + .../Phix/subtractive-generator.phix | 36 + .../REXX/subtractive-generator.rexx | 32 +- Task/Sudoku/Nim/sudoku.nim | 75 ++ Task/Sudoku/Rust/sudoku.rust | 64 ++ Task/Sudoku/SQL/sudoku.sql | 29 + .../BASIC/sum-and-product-of-an-array-3.basic | 10 + .../BASIC/sum-and-product-of-an-array-4.basic | 13 + .../Elena/sum-and-product-of-an-array.elena | 16 +- .../Lua/sum-and-product-of-an-array-2.lua | 2 +- .../Ol/sum-and-product-of-an-array.ol | 2 + .../VBA/sum-and-product-of-an-array.vba | 6 + .../sum-and-product-of-an-array.visual | 7 + Task/Sum-digits-of-an-integer/00META.yaml | 1 + .../Dc/sum-digits-of-an-integer.dc | 7 + .../Haskell/sum-digits-of-an-integer-2.hs | 16 +- .../Ol/sum-digits-of-an-integer.ol | 16 + .../Python/sum-digits-of-an-integer-3.py | 95 +++ .../Ruby/sum-digits-of-an-integer.rb | 3 + Task/Sum-multiples-of-3-and-5/00META.yaml | 1 + .../AWK/sum-multiples-of-3-and-5-3.awk | 18 +- .../AWK/sum-multiples-of-3-and-5-4.awk | 10 + .../sum-multiples-of-3-and-5-1.crystal | 5 + .../sum-multiples-of-3-and-5-2.crystal | 13 + .../sum-multiples-of-3-and-5-3.crystal | 14 + .../Crystal/sum-multiples-of-3-and-5.crystal | 8 - .../Ol/sum-multiples-of-3-and-5.ol | 5 + .../Perl/sum-multiples-of-3-and-5-2.pl | 3 +- .../Phix/sum-multiples-of-3-and-5.phix | 33 +- ...and-5.py => sum-multiples-of-3-and-5-1.py} | 0 .../Python/sum-multiples-of-3-and-5-2.py | 71 ++ .../Q/sum-multiples-of-3-and-5-1.q | 2 + .../Q/sum-multiples-of-3-and-5-2.q | 3 + .../Sidef/sum-multiples-of-3-and-5.sidef | 12 +- .../AppleScript/sum-of-a-series-1.applescript | 30 +- .../Crystal/sum-of-a-series.crystal | 4 + .../Dart/sum-of-a-series-1.dart | 10 + .../Dart/sum-of-a-series-2.dart | 10 + .../Elena/sum-of-a-series.elena | 14 +- .../Sum-of-a-series/Fish/sum-of-a-series.fish | 2 + ...um-of-a-series.py => sum-of-a-series-1.py} | 0 .../Python/sum-of-a-series-2.py | 73 ++ Task/Sum-of-a-series/Q/sum-of-a-series.q | 2 + Task/Sum-of-a-series/Ruby/sum-of-a-series.rb | 3 +- Task/Sum-of-a-series/VBA/sum-of-a-series.vba | 10 + .../BASIC/sum-of-squares-3.basic | 4 + .../BASIC/sum-of-squares-4.basic | 13 + .../Sum-of-squares/Elena/sum-of-squares.elena | 21 +- Task/Sum-of-squares/Ol/sum-of-squares.ol | 5 + ...-of-squares.pari => sum-of-squares-1.pari} | 0 .../PARI-GP/sum-of-squares-2.pari | 4 + .../Sum-of-squares/Python/sum-of-squares-1.py | 6 +- .../Sum-of-squares/Python/sum-of-squares-2.py | 28 +- .../Sum-of-squares/Python/sum-of-squares-3.py | 5 +- Task/Sum-of-squares/Q/sum-of-squares.q | 1 + Task/Sum-of-squares/Ruby/sum-of-squares-2.rb | 2 +- Task/Sum-of-squares/VBA/sum-of-squares.vba | 3 + .../sutherland-hodgman-polygon-clipping.cpp | 113 +++ .../sutherland-hodgman-polygon-clipping.julia | 53 ++ .../Aime/symmetric-difference.aime | 5 +- .../MATLAB/symmetric-difference-2.m | 2 +- ...otlin => synchronous-concurrency-1.kotlin} | 0 .../Kotlin/synchronous-concurrency-2.kotlin | 28 + .../Racket/synchronous-concurrency-1.rkt | 17 + .../Racket/synchronous-concurrency-2.rkt | 19 + .../Racket/synchronous-concurrency.rkt | 29 - Task/System-time/Elena/system-time.elena | 11 +- Task/System-time/Neko/system-time.neko | 13 + Task/System-time/REXX/system-time.rexx | 54 +- .../Aime/take-notes-on-the-command-line.aime | 11 +- .../take-notes-on-the-command-line.julia | 12 + ...=> take-notes-on-the-command-line-1.lasso} | 7 +- .../take-notes-on-the-command-line-2.lasso | 3 + Task/Temperature-conversion/00META.yaml | 1 + .../BASIC/temperature-conversion-2.basic | 11 +- .../BASIC/temperature-conversion-3.basic | 6 + .../Elena/temperature-conversion.elena | 50 +- .../terminal-control-clear-the-screen.arm | 65 ++ .../terminal-control-clear-the-screen-7.basic | 2 +- .../terminal-control-clear-the-screen-8.basic | 1 + .../Dc/terminal-control-clear-the-screen-1.dc | 1 + .../Dc/terminal-control-clear-the-screen-2.dc | 1 + .../Dc/terminal-control-clear-the-screen-3.dc | 1 + .../terminal-control-clear-the-screen.elena | 8 +- .../terminal-control-clear-the-screen.pl6 | 2 +- .../terminal-control-clear-the-screen-1.rust | 1 + .../terminal-control-clear-the-screen-2.rust | 1 + ...inal-control-clear-the-screen-1.smilebasic | 1 + ...inal-control-clear-the-screen-2.smilebasic | 1 + .../terminal-control-clear-the-screen.visual | 1 + .../00DESCRIPTION | 8 +- .../terminal-control-coloured-text.arm | 81 +++ .../Golo/terminal-control-coloured-text.golo | 38 ++ .../terminal-control-coloured-text.pascal | 19 + .../Perl/terminal-control-coloured-text.pl | 22 + .../terminal-control-cursor-movement.arm | 84 +++ .../terminal-control-cursor-movement-1.fth | 2 +- .../terminal-control-cursor-movement.julia | 14 + .../Perl/terminal-control-cursor-movement.pl | 13 + .../terminal-control-cursor-positioning.arm | 65 ++ ...erminal-control-cursor-positioning-2.basic | 3 +- ...erminal-control-cursor-positioning-3.basic | 5 +- ...erminal-control-cursor-positioning-4.basic | 4 +- ...erminal-control-cursor-positioning-5.basic | 5 +- ...erminal-control-cursor-positioning-6.basic | 4 + .../terminal-control-cursor-positioning.elena | 8 +- .../terminal-control-cursor-positioning.julia | 6 + .../Julia/terminal-control-dimensions.julia | 6 + .../Nim/terminal-control-dimensions.nim | 4 + ...trol-display-an-extended-character-2.basic | 2 +- ...trol-display-an-extended-character-3.basic | 1 + ...trol-display-an-extended-character-4.basic | 1 + ...l-control-display-an-extended-character.dc | 1 + ...ontrol-display-an-extended-character.julia | 2 + ...ntrol-display-an-extended-character.objeck | 5 + ...l-control-display-an-extended-character.pl | 10 + ...control-display-an-extended-character.rexx | 8 +- .../terminal-control-hiding-the-cursor.julia | 7 + .../terminal-control-hiding-the-cursor.nim | 6 + .../terminal-control-hiding-the-cursor.pl | 4 + .../terminal-control-inverse-video.julia | 5 + .../Perl/terminal-control-inverse-video.pl | 5 + .../Go/terminal-control-positional-read.go | 28 + .../terminal-control-positional-read.julia | 14 + .../terminal-control-positional-read.pl6 | 39 ++ .../terminal-control-preserve-screen.l | 17 + .../terminal-control-preserve-screen.julia | 6 + ...-control-ringing-the-terminal-bell-3.basic | 2 +- ...-control-ringing-the-terminal-bell-4.basic | 2 +- ...-control-ringing-the-terminal-bell-5.basic | 1 + ...al-control-ringing-the-terminal-bell.mumps | 1 + ...al-control-ringing-the-terminal-bell-1.py} | 0 ...nal-control-ringing-the-terminal-bell-2.py | 1 + ...nal-control-ringing-the-terminal-bell.rexx | 40 +- .../Perl/terminal-control-unicode-output.pl | 4 + .../terminal-control-unicode-output-1.phix | 26 +- .../terminal-control-unicode-output.seed7 | 14 + Task/Ternary-logic/Elena/ternary-logic.elena | 107 +-- .../Free-Pascal/ternary-logic-1.free | 66 ++ .../Free-Pascal/ternary-logic-2.free | 46 ++ ...nary-logic.julia => ternary-logic-1.julia} | 0 .../Ternary-logic/Julia/ternary-logic-2.julia | 32 + Task/Ternary-logic/REXX/ternary-logic.rexx | 70 +- Task/Ternary-logic/Rust/ternary-logic.rust | 107 +++ .../Phix/text-processing-1.phix | 20 +- .../Aime/text-processing-2.aime | 30 +- .../Phix/text-processing-2.phix | 33 + Task/Textonyms/00META.yaml | 1 + .../The-ISAAC-Cipher/C++/the-isaac-cipher.cpp | 202 ++++++ .../Haskell/the-isaac-cipher.hs | 114 ++-- .../Modula-2/the-isaac-cipher.mod2 | 30 +- .../Pascal/the-isaac-cipher.pascal | 386 ++++++----- .../Perl-6/the-isaac-cipher.pl6 | 118 ++++ .../Phix/the-isaac-cipher.phix | 142 ++++ Task/The-Twelve-Days-of-Christmas/00META.yaml | 1 + .../the-twelve-days-of-christmas.crystal | 19 + .../Elena/the-twelve-days-of-christmas.elena | 45 +- ...php => the-twelve-days-of-christmas-1.php} | 0 .../PHP/the-twelve-days-of-christmas-2.php | 33 + .../the-twelve-days-of-christmas.visual | 31 + .../Julia/thieles-interpolation-formula.julia | 45 ++ .../Perl-6/thieles-interpolation-formula.pl6 | 11 +- .../Phix/thieles-interpolation-formula.phix | 49 ++ Task/Tic-tac-toe/00DESCRIPTION | 3 + Task/Tic-tac-toe/Julia/tic-tac-toe.julia | 102 +++ Task/Tic-tac-toe/Objeck/tic-tac-toe.objeck | 372 ++++++++++ .../ARM-Assembly/time-a-function.arm | 229 +++++++ .../Time-a-function/Aime/time-a-function.aime | 16 +- .../Elena/time-a-function.elena | 34 +- Task/Time-a-function/VBA/time-a-function.vba | 27 + .../ARM-Assembly/tokenize-a-string.arm | 161 +++++ .../Astro/tokenize-a-string.astro | 2 +- .../Elena/tokenize-a-string.elena | 20 +- .../REXX/tokenize-a-string-2.rexx | 4 +- .../XPath-2.0/tokenize-a-string.xpath | 1 + Task/Top-rank-per-group/00META.yaml | 1 + .../Aime/top-rank-per-group.aime | 57 +- .../Elena/top-rank-per-group.elena | 112 ++- .../Python/top-rank-per-group-2.py | 17 +- .../R/top-rank-per-group-5.r | 4 +- .../SQL/top-rank-per-group-3.sql | 14 + .../Swift/top-rank-per-group.swift | 46 ++ .../VBA/top-rank-per-group.vba | 37 + Task/Topic-variable/00META.yaml | 1 + Task/Topic-variable/Phix/topic-variable.phix | 4 + Task/Topological-sort/00DESCRIPTION | 14 +- Task/Topological-sort/00META.yaml | 1 + .../Topological-sort/C++/topological-sort.cpp | 6 +- .../Haskell/topological-sort-1.hs | 67 +- ...-sort.kotlin => topological-sort-1.kotlin} | 0 .../Kotlin/topological-sort-2.kotlin | 51 ++ .../Mercury/topological-sort.mercury | 76 +++ .../Phix/topological-sort.phix | 90 +++ .../REXX/topological-sort.rexx | 71 +- Task/Topswops/00META.yaml | 1 + Task/Topswops/Perl-6/topswops.pl6 | 8 +- Task/Topswops/R/topswops.r | 25 + Task/Total-circles-area/00DESCRIPTION | 4 +- Task/Total-circles-area/00META.yaml | 3 + .../Perl-6/total-circles-area.pl6 | 8 +- .../Perl/total-circles-area.pl | 55 ++ .../Phix/total-circles-area.phix | 52 ++ .../REXX/total-circles-area-1.rexx | 76 +-- .../REXX/total-circles-area-2.rexx | 30 +- .../VBA/total-circles-area.vba | 248 +++++++ .../AppleScript/towers-of-hanoi.applescript | 62 ++ Task/Towers-of-Hanoi/C/towers-of-hanoi-1.c | 10 +- .../COBOL/towers-of-hanoi-3.cobol | 91 +++ .../Elena/towers-of-hanoi.elena | 21 +- .../Haskell/towers-of-hanoi-2.hs | 8 +- .../Haskell/towers-of-hanoi-3.hs | 9 +- .../Haskell/towers-of-hanoi-4.hs | 28 +- .../Haskell/towers-of-hanoi-5.hs | 20 + ...owers-of-hanoi.py => towers-of-hanoi-1.py} | 0 .../Python/towers-of-hanoi-2.py | 28 + .../Python/towers-of-hanoi-3.py | 197 ++++++ .../REXX/towers-of-hanoi-1.rexx | 28 +- .../Retro/towers-of-hanoi.retro | 25 +- Task/Trabb-Pardo-Knuth-algorithm/00META.yaml | 1 + .../Elena/trabb-pardo-knuth-algorithm.elena | 53 +- .../Rust/trabb-pardo-knuth-algorithm.rust | 30 + .../ARM-Assembly/tree-traversal.arm | 434 ++++++++++++ .../Crystal/tree-traversal.crystal | 80 +++ .../Tree-traversal/Elena/tree-traversal.elena | 186 ++--- ...{tree-traversal.hs => tree-traversal-1.hs} | 0 .../Haskell/tree-traversal-2.hs | 34 + Task/Tree-traversal/Java/tree-traversal.java | 6 +- Task/Tree-traversal/Lua/tree-traversal.lua | 46 ++ .../Tree-traversal/Python/tree-traversal-3.py | 232 +++++++ Task/Tree-traversal/VBA/tree-traversal-1.vba | 3 + Task/Tree-traversal/VBA/tree-traversal-2.vba | 71 ++ ....basic => trigonometric-functions-1.basic} | 0 .../BASIC/trigonometric-functions-2.basic | 14 + .../BASIC/trigonometric-functions-3.basic | 16 + .../Elena/trigonometric-functions.elena | 42 +- .../Factor/trigonometric-functions.factor | 7 + .../REXX/trigonometric-functions.rexx | 20 +- .../VBA/trigonometric-functions.vba | 15 + .../trigonometric-functions.visual | 21 + Task/Truncatable-primes/00DESCRIPTION | 10 +- .../AWK/truncatable-primes.awk | 50 ++ .../Elena/truncatable-primes.elena | 140 ++-- .../Scala/truncatable-primes.scala | 17 + .../Elena/truncate-a-file.elena | 38 +- .../Truncate-a-file/Phix/truncate-a-file.phix | 5 + .../Elena/twelve-statements.elena | 77 +-- .../VBA/twelve-statements.vba | 87 +++ .../Free-Pascal/url-decoding.free | 26 + Task/URL-decoding/Python/url-decoding.py | 4 + Task/URL-decoding/REXX/url-decoding-2.rexx | 31 +- Task/URL-decoding/REXX/url-decoding-3.rexx | 21 +- Task/URL-decoding/Rust/url-decoding.rust | 36 + Task/URL-decoding/VBScript/url-decoding.vb | 51 +- Task/URL-encoding/Factor/url-encoding.factor | 6 + .../Free-Pascal/url-encoding.free | 12 + Task/URL-encoding/Julia/url-encoding.julia | 5 +- Task/URL-encoding/Rust/url-encoding.rust | 18 + Task/URL-encoding/VBScript/url-encoding.vb | 9 +- Task/Ulam-spiral--for-primes-/00DESCRIPTION | 2 +- Task/Ulam-spiral--for-primes-/00META.yaml | 2 + .../Common-Lisp/ulam-spiral--for-primes-.lisp | 16 + .../Factor/ulam-spiral--for-primes-.factor | 23 + .../Forth/ulam-spiral--for-primes-.fth | 101 +++ .../Phix/ulam-spiral--for-primes--1.phix | 20 + .../Phix/ulam-spiral--for-primes--2.phix | 2 + .../REXX/ulam-spiral--for-primes--1.rexx | 35 +- .../REXX/ulam-spiral--for-primes--2.rexx | 35 +- Task/Unbias-a-random-generator/00META.yaml | 1 + .../Elena/unbias-a-random-generator.elena | 66 +- .../Factor/unbias-a-random-generator.factor | 19 + .../Julia/undefined-values.julia | 28 + Task/Unicode-strings/00META.yaml | 1 + .../Elena/unicode-strings.elena | 14 +- .../Visual-Basic-.NET/unicode-strings.visual | 22 + Task/Unicode-variable-names/00DESCRIPTION | 1 - .../Elena/unicode-variable-names.elena | 12 +- .../Factor/unicode-variable-names.factor | 6 + Task/Universal-Turing-machine/00META.yaml | 1 + .../J/universal-turing-machine-1.j | 23 +- .../J/universal-turing-machine-6.j | 137 ++-- .../Julia/universal-turing-machine.julia | 85 +++ .../Scala/universal-turing-machine.scala | 245 +++++++ .../VBA/universal-turing-machine.vba | 113 +++ Task/Unix-ls/00META.yaml | 1 + Task/Unix-ls/Aime/unix-ls.aime | 13 + Task/Unix-ls/PowerShell/unix-ls.psh | 5 + Task/Unix-ls/Seed7/unix-ls.seed7 | 11 + .../Julia/update-a-configuration-file.julia | 104 +++ ...nother-language-to-call-a-function.mercury | 28 + .../Go/user-input-graphical.go | 97 +++ .../Groovy/user-input-graphical.groovy | 7 + .../Julia/user-input-graphical.julia | 31 + .../Perl/user-input-graphical.pl | 39 ++ .../REXX/user-input-graphical.rexx | 19 + .../BASIC/user-input-text-3.basic | 10 +- .../BASIC/user-input-text-4.basic | 8 + .../Elena/user-input-text.elena | 14 +- .../User-input-Text/Neko/user-input-text.neko | 35 + Task/User-input-Text/Perl/user-input-text.pl | 6 +- .../Robotic/user-input-text-1.robotic | 8 + .../Robotic/user-input-text-2.robotic | 10 + Task/User-input-Text/VBA/user-input-text.vba | 4 + Task/Vampire-number/Haskell/vampire-number.hs | 2 +- Task/Vampire-number/Perl-6/vampire-number.pl6 | 33 +- Task/Vampire-number/Phix/vampire-number.phix | 45 ++ Task/Vampire-number/REXX/vampire-number.rexx | 77 ++- .../Vampire-number/Swift/vampire-number.swift | 54 ++ Task/Van-der-Corput-sequence/00META.yaml | 1 + .../Factor/van-der-corput-sequence.factor | 15 + .../Swift/van-der-corput-sequence.swift | 36 + .../VBA/van-der-corput-sequence.vba | 24 + .../van-der-corput-sequence.visual | 30 + .../Delphi/variable-size-get.delphi | 2 +- .../Forth/variable-size-get-1.fth | 2 + .../Forth/variable-size-get-2.fth | 4 + .../Rust/variable-size-get.rust | 10 + .../Free-Pascal/variable-size-set.free | 3 + .../Julia/variable-size-set.julia | 10 + .../Pascal/variable-size-set.pascal | 10 +- .../Phix/variable-size-set.phix | 7 + Task/Variables/ARM-Assembly/variables.arm | 59 ++ Task/Variables/Ada/variables.ada | 2 +- Task/Variables/Common-Lisp/variables-10.lisp | 3 + Task/Variables/Common-Lisp/variables-7.lisp | 6 +- Task/Variables/Common-Lisp/variables-8.lisp | 3 + Task/Variables/Common-Lisp/variables-9.lisp | 3 + Task/Variables/Elena/variables.elena | 16 +- Task/Variables/Mercury/variables-1.mercury | 5 + Task/Variables/Mercury/variables-2.mercury | 4 + Task/Variables/Mercury/variables-3.mercury | 4 + Task/Variables/Mercury/variables-4.mercury | 4 + Task/Variables/Mercury/variables-5.mercury | 9 + Task/Variables/Mercury/variables-6.mercury | 6 + Task/Variables/Mercury/variables-7.mercury | 23 + Task/Variables/Mercury/variables-8.mercury | 39 ++ .../Visual-Basic-.NET/variables-1.visual | 2 + .../Visual-Basic-.NET/variables-2.visual | 4 + .../Visual-Basic-.NET/variables-3.visual | 2 + .../Visual-Basic-.NET/variables-4.visual | 6 + .../Visual-Basic-.NET/variables-5.visual | 1 + .../Visual-Basic-.NET/variables-6.visual | 3 + .../Visual-Basic-.NET/variables-7.visual | 1 + .../Visual-Basic-.NET/variables-8.visual | 8 + .../Visual-Basic-.NET/variables.visual | 4 - .../Elena/variadic-function.elena | 26 +- .../Free-Pascal/variadic-function-1.free | 39 ++ .../Free-Pascal/variadic-function-2.free | 4 + .../Golo/variadic-function.golo | 24 + ...dic-function.hs => variadic-function-1.hs} | 0 .../Haskell/variadic-function-2.hs | 7 + .../Visual-Basic/variadic-function.vb | 39 +- Task/Vector-products/00META.yaml | 1 + .../Ceylon/vector-products.ceylon | 28 + .../Vector-products/GLSL/vector-products.glsl | 23 + .../Sidef/vector-products.sidef | 34 +- Task/Vector-products/VBA/vector-products.vba | 26 + .../00DESCRIPTION | 9 +- ...istribution-uniformity-chi-squared-test.pl | 43 ++ ...tribution-uniformity-chi-squared-test.phix | 61 ++ ...tribution-uniformity-chi-squared-test.rexx | 71 ++ ...ribution-uniformity-chi-squared-test.scala | 30 + ...ribution-uniformity-chi-squared-test.sidef | 42 ++ ...stribution-uniformity-chi-squared-test.vba | 30 + .../verify-distribution-uniformity-naive.pl | 30 + .../verify-distribution-uniformity-naive.phix | 34 + .../verify-distribution-uniformity-naive.rexx | 24 +- .../Groovy/video-display-modes.groovy | 9 + .../Julia/video-display-modes.julia | 9 + .../Perl/video-display-modes.pl | 19 + .../Python/video-display-modes.py | 8 + Task/Vigen-re-cipher/Ada/vigen-re-cipher.ada | 106 ++- .../Ceylon/vigen-re-cipher.ceylon | 25 + .../Elena/vigen-re-cipher.elena | 70 +- .../Vigen-re-cipher/Python/vigen-re-cipher.py | 49 ++ Task/Visualize-a-tree/00META.yaml | 1 + .../AppleScript/visualize-a-tree.applescript | 571 ++++++++++++++++ .../Elena/visualize-a-tree.elena | 89 ++- .../Factor/visualize-a-tree-1.factor | 6 + .../Factor/visualize-a-tree-2.factor | 2 + ...ualize-a-tree.hs => visualize-a-tree-1.hs} | 0 .../Haskell/visualize-a-tree-2.hs | 12 + ...ualize-a-tree.js => visualize-a-tree-1.js} | 0 .../JavaScript/visualize-a-tree-2.js | 300 ++++++++ .../JavaScript/visualize-a-tree-3.js | 130 ++++ .../Julia/visualize-a-tree.julia | 4 + .../Python/visualize-a-tree-5.py | 331 +++++++++ .../Python/visualize-a-tree-6.py | 93 +++ Task/Vogels-approximation-method/00META.yaml | 1 + ...thod.c => vogels-approximation-method-1.c} | 2 +- .../C/vogels-approximation-method-2.c | 35 + ...od.go => vogels-approximation-method-1.go} | 0 .../Go/vogels-approximation-method-2.go | 46 ++ .../Perl-6/vogels-approximation-method.pl6 | 61 ++ .../Phix/vogels-approximation-method-1.phix | 68 ++ .../Phix/vogels-approximation-method-2.phix | 7 + .../Sidef/vogels-approximation-method.sidef | 15 +- Task/Voronoi-diagram/00META.yaml | 1 + Task/Voronoi-diagram/Nim/voronoi-diagram.nim | 53 ++ .../Perl-6/voronoi-diagram.pl6 | 8 +- Task/Voronoi-diagram/Perl/voronoi-diagram.pl | 54 ++ .../Scala/voronoi-diagram.scala | 42 ++ .../walk-a-directory-non-recursively.bacon | 1 + ...=> walk-a-directory-non-recursively-1.cpp} | 0 .../walk-a-directory-non-recursively-2.cpp | 13 + .../walk-a-directory-non-recursively.elena | 10 + ...=> walk-a-directory-non-recursively-1.lua} | 0 .../walk-a-directory-non-recursively-2.lua | 31 + .../BaCon/walk-a-directory-recursively.bacon | 1 + ...cpp => walk-a-directory-recursively-1.cpp} | 0 .../C++/walk-a-directory-recursively-2.cpp | 13 + .../Julia/walk-a-directory-recursively.julia | 2 +- .../Lua/walk-a-directory-recursively.lua | 31 + .../walk-a-directory-recursively.objeck | 28 + Task/Web-scraping/Phix/web-scraping.phix | 24 + Task/Web-scraping/Racket/web-scraping.rkt | 2 +- .../ARM-Assembly/window-creation-x11.arm | 472 +++++++++++++ .../Common-Lisp/window-creation-x11.lisp | 48 +- .../OCaml/window-creation-5.ocaml | 26 +- .../OCaml/window-creation-6.ocaml | 24 +- .../OCaml/window-creation-7.ocaml | 12 + .../Window-creation/Perl/window-creation-3.pl | 8 +- .../Window-creation/Perl/window-creation-4.pl | 14 +- .../Window-creation/Perl/window-creation-5.pl | 11 +- .../Window-creation/Phix/window-creation.phix | 8 +- Task/Window-management/C/window-management.c | 138 ++++ .../Window-management/Go/window-management.go | 100 +++ .../Icon/window-management.icon | 8 +- .../Java/window-management.java | 101 ++- .../Julia/window-management.julia | 43 ++ .../Perl-6/window-management.pl6 | 63 ++ Task/Wireworld/Elena/wireworld.elena | 189 ++--- Task/Wireworld/Julia/wireworld.julia | 42 ++ Task/Wireworld/REXX/wireworld.rexx | 53 +- Task/Word-wrap/Elena/word-wrap.elena | 76 +-- Task/Word-wrap/PHP/word-wrap.php | 30 + .../R/{word-wrap.r => word-wrap-1.r} | 0 Task/Word-wrap/R/word-wrap-2.r | 8 + Task/World-Cup-group-stage/00META.yaml | 1 + .../Common-Lisp/world-cup-group-stage.lisp | 33 + .../Elena/world-cup-group-stage.elena | 79 ++- .../Go/world-cup-group-stage.go | 54 ++ .../Julia/world-cup-group-stage.julia | 40 ++ .../Perl/world-cup-group-stage.pl | 21 + .../Phix/world-cup-group-stage.phix | 46 ++ .../REXX/world-cup-group-stage-1.rexx | 73 ++ .../REXX/world-cup-group-stage-2.rexx | 56 ++ .../VBA/write-float-arrays-to-a-text-file.vba | 11 + .../00META.yaml | 1 + .../write-language-name-in-3d-ascii.julia | 10 + .../Lua/write-language-name-in-3d-ascii.lua | 8 + .../write-language-name-in-3d-ascii-1.phix | 10 + .../write-language-name-in-3d-ascii-2.phix | 2 + .../write-language-name-in-3d-ascii-3.phix | 19 + .../Phix/write-language-name-in-3d-ascii.phix | 9 - .../write-language-name-in-3d-ascii-3.py | 17 + .../Rust/write-language-name-in-3d-ascii.rust | 38 ++ .../write-language-name-in-3d-ascii.visual | 17 + Task/Write-to-Windows-event-log/00META.yaml | 1 + .../AWK/write-to-windows-event-log.awk | 18 + .../C++/write-to-windows-event-log.cpp | 21 + .../Go/write-to-windows-event-log.go | 17 + .../Java/write-to-windows-event-log.java | 29 + .../Julia/write-to-windows-event-log.julia | 2 + .../Phix/write-to-windows-event-log.phix | 1 + .../ARM-Assembly/xml-dom-serialization.arm | 174 +++++ .../Julia/xml-dom-serialization.julia | 17 + .../Phix/xml-dom-serialization.phix | 5 + Task/XML-Input/ARM-Assembly/xml-input.arm | 281 ++++++++ Task/XML-Input/Factor/xml-input.factor | 6 +- Task/XML-Input/Neko/xml-input-1.neko | 30 + Task/XML-Input/Neko/xml-input-2.neko | 5 + Task/XML-Input/Perl/xml-input.pl | 1 + Task/XML-Output/ARM-Assembly/xml-output.arm | 200 ++++++ Task/XML-Output/Julia/xml-output.julia | 16 + Task/XML-Output/Rust/xml-output.rust | 58 ++ Task/XML-XPath/ARM-Assembly/xml-xpath.arm | 232 +++++++ Task/XML-XPath/Julia/xml-xpath.julia | 45 ++ Task/XML-XPath/Scala/xml-xpath.scala | 74 +- .../xiaolin-wus-line-algorithm.arm | 643 ++++++++++++++++++ .../C/xiaolin-wus-line-algorithm-3.c | 171 ++--- .../C/xiaolin-wus-line-algorithm-4.c | 108 +++ .../Haskell/xiaolin-wus-line-algorithm.hs | 111 +++ .../ARM-Assembly/y-combinator.arm | 250 +++++++ .../Common-Lisp/y-combinator.lisp | 40 +- Task/Y-combinator/Elena/y-combinator.elena | 20 +- Task/Y-combinator/Haskell/y-combinator-1.hs | 37 +- Task/Y-combinator/Haskell/y-combinator-2.hs | 52 +- Task/Y-combinator/J/y-combinator-1.j | 4 +- Task/Y-combinator/J/y-combinator-10.j | 6 + Task/Y-combinator/J/y-combinator-11.j | 20 + Task/Y-combinator/J/y-combinator-12.j | 6 + Task/Y-combinator/J/y-combinator-13.j | 9 + Task/Y-combinator/J/y-combinator-14.j | 2 + Task/Y-combinator/J/y-combinator-2.j | 11 +- Task/Y-combinator/J/y-combinator-3.j | 15 +- Task/Y-combinator/J/y-combinator-4.j | 5 +- Task/Y-combinator/J/y-combinator-5.j | 54 +- Task/Y-combinator/J/y-combinator-6.j | 7 +- Task/Y-combinator/J/y-combinator-7.j | 1 + Task/Y-combinator/J/y-combinator-8.j | 11 + Task/Y-combinator/J/y-combinator-9.j | 12 + Task/Y-combinator/Java/y-combinator-1.java | 2 +- Task/Y-combinator/Phix/y-combinator.phix | 26 + Task/Y-combinator/Racket/y-combinator-1.rkt | 6 +- Task/Y-combinator/Racket/y-combinator-2.rkt | 4 +- Task/Y-combinator/Rust/y-combinator.rust | 133 ++-- Task/Y-combinator/Scheme/y-combinator-1.ss | 61 +- Task/Y-combinator/Scheme/y-combinator-2.ss | 6 +- Task/Y-combinator/Scheme/y-combinator-3.ss | 3 + Task/Y-combinator/Scheme/y-combinator-4.ss | 5 + Task/Y-combinator/VBA/y-combinator.vba | 38 ++ Task/Yin-and-yang/AWK/yin-and-yang.awk | 52 ++ Task/Yin-and-yang/BASIC/yin-and-yang-1.basic | 20 + Task/Yin-and-yang/BASIC/yin-and-yang-10.basic | 41 ++ Task/Yin-and-yang/BASIC/yin-and-yang-11.basic | 87 +++ Task/Yin-and-yang/BASIC/yin-and-yang-12.basic | 41 ++ Task/Yin-and-yang/BASIC/yin-and-yang-13.basic | 14 + Task/Yin-and-yang/BASIC/yin-and-yang-14.basic | 7 + Task/Yin-and-yang/BASIC/yin-and-yang-15.basic | 4 + Task/Yin-and-yang/BASIC/yin-and-yang-16.basic | 49 ++ Task/Yin-and-yang/BASIC/yin-and-yang-17.basic | 21 + Task/Yin-and-yang/BASIC/yin-and-yang-18.basic | 72 ++ Task/Yin-and-yang/BASIC/yin-and-yang-2.basic | 17 + Task/Yin-and-yang/BASIC/yin-and-yang-3.basic | 16 + Task/Yin-and-yang/BASIC/yin-and-yang-4.basic | 9 + Task/Yin-and-yang/BASIC/yin-and-yang-5.basic | 17 + Task/Yin-and-yang/BASIC/yin-and-yang-6.basic | 23 + Task/Yin-and-yang/BASIC/yin-and-yang-7.basic | 13 + Task/Yin-and-yang/BASIC/yin-and-yang-8.basic | 46 ++ Task/Yin-and-yang/BASIC/yin-and-yang-9.basic | 22 + Task/Yin-and-yang/Maple/yin-and-yang.maple | 11 + Task/Yin-and-yang/PARI-GP/yin-and-yang.pari | 6 + Task/Yin-and-yang/Pascal/yin-and-yang.pascal | 64 ++ Task/Zebra-puzzle/00DESCRIPTION | 37 +- .../Zebra-puzzle/Crystal/zebra-puzzle.crystal | 58 ++ Task/Zebra-puzzle/GAP/zebra-puzzle.gap | 60 ++ Task/Zebra-puzzle/Julia/zebra-puzzle.julia | 20 +- Task/Zebra-puzzle/Perl-6/zebra-puzzle.pl6 | 79 +++ Task/Zebra-puzzle/Prolog/zebra-puzzle-2.pro | 24 +- Task/Zebra-puzzle/Prolog/zebra-puzzle-3.pro | 2 +- Task/Zebra-puzzle/Prolog/zebra-puzzle-5.pro | 2 +- Task/Zebra-puzzle/Scala/zebra-puzzle-1.scala | 2 +- Task/Zebra-puzzle/VBA/zebra-puzzle.vba | 165 +++++ .../Elena/zeckendorf-arithmetic.elena | 379 ++++++----- .../Go/zeckendorf-arithmetic.go | 184 +++++ .../Julia/zeckendorf-arithmetic.julia | 172 +++++ .../Perl-6/zeckendorf-arithmetic.pl6 | 7 +- .../Phix/zeckendorf-arithmetic.phix | 267 ++++++++ .../Python/zeckendorf-arithmetic.py | 144 ++++ .../00META.yaml | 1 + .../zeckendorf-number-representation.elena | 95 ++- .../zeckendorf-number-representation.factor | 11 + .../zeckendorf-number-representation-4.hs | 13 +- .../zeckendorf-number-representation.js | 162 +++-- .../zeckendorf-number-representation-2.rexx | 27 +- .../zeckendorf-number-representation-3.rexx | 13 +- .../zeckendorf-number-representation.ss | 30 + .../zeckendorf-number-representation.simula | 37 + .../VBA/zeckendorf-number-representation.vba | 23 + .../zero-to-the-zero-power.cos | 10 + .../Elena/zero-to-the-zero-power.elena | 10 +- .../K/zero-to-the-zero-power.k | 2 + .../Neko/zero-to-the-zero-power.neko | 7 + .../Ol/zero-to-the-zero-power.ol | 2 + .../PARI-GP/zero-to-the-zero-power.pari | 2 + .../PowerShell/zero-to-the-zero-power.psh | 2 +- .../VBA/zero-to-the-zero-power.vba | 6 + .../zero-to-the-zero-power.visual | 5 + .../00DESCRIPTION | 42 +- .../Zhang-Suen-thinning-algorithm/00META.yaml | 1 + .../Elena/zhang-suen-thinning-algorithm.elena | 35 +- .../J/zhang-suen-thinning-algorithm-1.j | 4 +- .../Perl-6/zhang-suen-thinning-algorithm.pl6 | 19 +- .../Perl/zhang-suen-thinning-algorithm.pl | 63 ++ .../VBA/zhang-suen-thinning-algorithm.vba | 83 +++ .../Ceylon/zig-zag-matrix.ceylon | 50 ++ .../Crystal/zig-zag-matrix.crystal | 12 + .../Zig-zag-matrix/Elena/zig-zag-matrix.elena | 64 +- .../Factor/zig-zag-matrix.factor | 25 + .../Haskell/zig-zag-matrix-1.hs | 15 +- .../Haskell/zig-zag-matrix-2.hs | 16 +- .../Haskell/zig-zag-matrix-3.hs | 45 +- .../Zig-zag-matrix/Python/zig-zag-matrix-1.py | 25 +- .../Zig-zag-matrix/Python/zig-zag-matrix-2.py | 41 +- 6856 files changed, 141342 insertions(+), 21127 deletions(-) create mode 120000 Lang/360-Assembly/Align-columns create mode 120000 Lang/360-Assembly/Bitmap-Bresenhams-line-algorithm create mode 120000 Lang/360-Assembly/Caesar-cipher create mode 120000 Lang/360-Assembly/Fractran create mode 120000 Lang/360-Assembly/Gaussian-elimination create mode 120000 Lang/360-Assembly/Harshad-or-Niven-series create mode 120000 Lang/360-Assembly/Least-common-multiple create mode 120000 Lang/360-Assembly/Parsing-RPN-calculator-algorithm create mode 120000 Lang/360-Assembly/Roman-numerals-Decode create mode 120000 Lang/360-Assembly/Rot-13 create mode 120000 Lang/360-Assembly/Stern-Brocot-sequence create mode 120000 Lang/68000-Assembly/Leap-year create mode 120000 Lang/ABAP/Array-concatenation create mode 120000 Lang/ABAP/Bitwise-operations create mode 120000 Lang/ABAP/Catalan-numbers create mode 120000 Lang/ABAP/Catamorphism create mode 120000 Lang/ABAP/Dutch-national-flag-problem create mode 120000 Lang/ABAP/Empty-program create mode 120000 Lang/ABAP/HTTP create mode 120000 Lang/ABAP/Integer-comparison create mode 120000 Lang/ABAP/Mutual-recursion create mode 120000 Lang/ABAP/Power-set create mode 120000 Lang/ABAP/Repeat-a-string create mode 120000 Lang/ABAP/Sorting-algorithms-Quicksort create mode 120000 Lang/ABAP/Stack create mode 120000 Lang/ALGOL-68/Sort-using-a-custom-comparator create mode 120000 Lang/ALGOL-68/Start-from-a-main-routine create mode 120000 Lang/ALGOL-M/99-Bottles-of-Beer create mode 120000 Lang/ALGOL-M/Day-of-the-week create mode 120000 Lang/ALGOL-M/Factors-of-an-integer create mode 120000 Lang/ALGOL-M/Sieve-of-Eratosthenes create mode 120000 Lang/ALGOL-W/Arithmetic-Complex create mode 120000 Lang/ALGOL-W/Calendar create mode 120000 Lang/ALGOL-W/Forward-difference create mode 120000 Lang/ALGOL-W/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/ALGOL-W/Hailstone-sequence create mode 120000 Lang/ALGOL-W/Happy-numbers create mode 120000 Lang/ALGOL-W/History-variables create mode 120000 Lang/ALGOL-W/Long-multiplication create mode 120000 Lang/ALGOL-W/Mandelbrot-set create mode 120000 Lang/ALGOL-W/Multiple-distinct-objects create mode 120000 Lang/ALGOL-W/Nth-root create mode 120000 Lang/ALGOL-W/Perfect-numbers create mode 120000 Lang/ALGOL-W/Sequence-of-non-squares create mode 120000 Lang/ALGOL-W/Sort-an-integer-array create mode 120000 Lang/ALGOL-W/Strip-a-set-of-characters-from-a-string create mode 120000 Lang/ALGOL-W/Strip-block-comments create mode 120000 Lang/APL/Dynamic-variable-names create mode 120000 Lang/APL/Hofstadter-Q-sequence create mode 120000 Lang/APL/Ordered-words create mode 120000 Lang/APL/Palindrome-detection create mode 120000 Lang/APL/Simple-windowed-application create mode 120000 Lang/APL/Solve-the-no-connection-puzzle create mode 120000 Lang/ARM-Assembly/100-doors create mode 120000 Lang/ARM-Assembly/Almost-prime create mode 120000 Lang/ARM-Assembly/Array-concatenation create mode 120000 Lang/ARM-Assembly/Arrays create mode 120000 Lang/ARM-Assembly/Binary-search create mode 120000 Lang/ARM-Assembly/Boolean-values create mode 120000 Lang/ARM-Assembly/Caesar-cipher create mode 120000 Lang/ARM-Assembly/Call-a-foreign-language-function create mode 120000 Lang/ARM-Assembly/Character-codes create mode 120000 Lang/ARM-Assembly/Check-that-file-exists create mode 120000 Lang/ARM-Assembly/Command-line-arguments create mode 120000 Lang/ARM-Assembly/Compound-data-type create mode 120000 Lang/ARM-Assembly/Conditional-structures create mode 120000 Lang/ARM-Assembly/Copy-a-string create mode 120000 Lang/ARM-Assembly/Count-in-octal create mode 120000 Lang/ARM-Assembly/Create-a-file create mode 120000 Lang/ARM-Assembly/DNS-query create mode 120000 Lang/ARM-Assembly/Determine-if-a-string-is-numeric create mode 120000 Lang/ARM-Assembly/Doubly-linked-list-Definition create mode 120000 Lang/ARM-Assembly/Doubly-linked-list-Element-definition create mode 120000 Lang/ARM-Assembly/Doubly-linked-list-Traversal create mode 120000 Lang/ARM-Assembly/Empty-string create mode 120000 Lang/ARM-Assembly/Factorial create mode 120000 Lang/ARM-Assembly/File-input-output create mode 120000 Lang/ARM-Assembly/Formatted-numeric-output create mode 120000 Lang/ARM-Assembly/Greatest-element-of-a-list create mode 120000 Lang/ARM-Assembly/Here-document create mode 120000 Lang/ARM-Assembly/Include-a-file create mode 120000 Lang/ARM-Assembly/Increment-a-numerical-string create mode 120000 Lang/ARM-Assembly/Jensens-Device create mode 120000 Lang/ARM-Assembly/Keyboard-input-Keypress-check create mode 120000 Lang/ARM-Assembly/Knuth-shuffle create mode 120000 Lang/ARM-Assembly/Literals-Integer create mode 120000 Lang/ARM-Assembly/Literals-String create mode 120000 Lang/ARM-Assembly/Logical-operations create mode 120000 Lang/ARM-Assembly/Loops-Break create mode 120000 Lang/ARM-Assembly/Loops-Do-while create mode 120000 Lang/ARM-Assembly/Loops-Downward-for create mode 120000 Lang/ARM-Assembly/Loops-For-with-a-specified-step create mode 120000 Lang/ARM-Assembly/Loops-N-plus-one-half create mode 120000 Lang/ARM-Assembly/Loops-Nested create mode 120000 Lang/ARM-Assembly/Loops-While create mode 120000 Lang/ARM-Assembly/Lucas-Lehmer-test create mode 120000 Lang/ARM-Assembly/Multiplication-tables create mode 120000 Lang/ARM-Assembly/Nth-root create mode 120000 Lang/ARM-Assembly/Null-object create mode 120000 Lang/ARM-Assembly/Order-two-numerical-lists create mode 120000 Lang/ARM-Assembly/Priority-queue create mode 120000 Lang/ARM-Assembly/Program-termination create mode 120000 Lang/ARM-Assembly/Queue-Definition create mode 120000 Lang/ARM-Assembly/Random-number-generator--device- create mode 120000 Lang/ARM-Assembly/Read-a-file-line-by-line create mode 120000 Lang/ARM-Assembly/Real-constants-and-functions create mode 120000 Lang/ARM-Assembly/Singly-linked-list-Element-definition create mode 120000 Lang/ARM-Assembly/Singly-linked-list-Element-insertion create mode 120000 Lang/ARM-Assembly/Singly-linked-list-Traversal create mode 120000 Lang/ARM-Assembly/Sleep create mode 120000 Lang/ARM-Assembly/Solve-the-no-connection-puzzle create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Bogosort create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Heapsort create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Insertion-sort create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Quicksort create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Selection-sort create mode 120000 Lang/ARM-Assembly/Sorting-algorithms-Shell-sort create mode 120000 Lang/ARM-Assembly/String-append create mode 120000 Lang/ARM-Assembly/String-concatenation create mode 120000 Lang/ARM-Assembly/String-matching create mode 120000 Lang/ARM-Assembly/Substring create mode 120000 Lang/ARM-Assembly/Terminal-control-Clear-the-screen create mode 120000 Lang/ARM-Assembly/Terminal-control-Coloured-text create mode 120000 Lang/ARM-Assembly/Terminal-control-Cursor-movement create mode 120000 Lang/ARM-Assembly/Terminal-control-Cursor-positioning create mode 120000 Lang/ARM-Assembly/Time-a-function create mode 120000 Lang/ARM-Assembly/Tokenize-a-string create mode 120000 Lang/ARM-Assembly/Tree-traversal create mode 120000 Lang/ARM-Assembly/Variables create mode 120000 Lang/ARM-Assembly/Window-creation-X11 create mode 120000 Lang/ARM-Assembly/XML-DOM-serialization create mode 120000 Lang/ARM-Assembly/XML-Input create mode 120000 Lang/ARM-Assembly/XML-Output create mode 120000 Lang/ARM-Assembly/XML-XPath create mode 120000 Lang/ARM-Assembly/Xiaolin-Wus-line-algorithm create mode 120000 Lang/ARM-Assembly/Y-combinator create mode 120000 Lang/AWK/Bulls-and-cows create mode 120000 Lang/AWK/Catalan-numbers-Pascals-triangle create mode 120000 Lang/AWK/Chinese-remainder-theorem create mode 120000 Lang/AWK/Draw-a-cuboid create mode 120000 Lang/AWK/Draw-a-sphere create mode 120000 Lang/AWK/Fibonacci-n-step-number-sequences create mode 120000 Lang/AWK/Iterated-digits-squaring create mode 120000 Lang/AWK/Matrix-multiplication create mode 120000 Lang/AWK/Metronome create mode 120000 Lang/AWK/Multifactorial create mode 120000 Lang/AWK/SHA-256 create mode 120000 Lang/AWK/Semiprime create mode 120000 Lang/AWK/Sort-an-array-of-composite-structures create mode 120000 Lang/AWK/Truncatable-primes create mode 120000 Lang/AWK/Write-to-Windows-event-log create mode 120000 Lang/AWK/Yin-and-yang create mode 120000 Lang/Ada/Abundant,-deficient-and-perfect-number-classifications create mode 120000 Lang/Ada/Bernoulli-numbers create mode 120000 Lang/Ada/Heronian-triangles create mode 120000 Lang/Ada/Metronome create mode 120000 Lang/Ada/RSA-code create mode 120000 Lang/Agda/Even-or-odd create mode 120000 Lang/Agda/Factorial create mode 120000 Lang/Agda/Function-composition create mode 120000 Lang/Agda/Sieve-of-Eratosthenes create mode 120000 Lang/Aime/Accumulator-factory create mode 120000 Lang/Aime/Bitmap-Write-a-PPM-file create mode 120000 Lang/Aime/Catamorphism create mode 120000 Lang/Aime/Currying create mode 120000 Lang/Aime/Delete-a-file create mode 120000 Lang/Aime/File-size create mode 120000 Lang/Aime/Formatted-numeric-output create mode 120000 Lang/Aime/Function-composition create mode 120000 Lang/Aime/Greatest-subsequential-sum create mode 120000 Lang/Aime/One-of-n-lines-in-a-file create mode 120000 Lang/Aime/Permutations create mode 120000 Lang/Aime/Range-expansion create mode 120000 Lang/Aime/Sockets create mode 120000 Lang/Aime/Strip-comments-from-a-string create mode 120000 Lang/Aime/Unix-ls create mode 120000 Lang/AppleScript/Bitwise-operations create mode 120000 Lang/AppleScript/Boolean-values create mode 120000 Lang/AppleScript/Combinations-with-repetitions create mode 120000 Lang/AppleScript/Convert-decimal-number-to-rational create mode 120000 Lang/AppleScript/Date-format create mode 120000 Lang/AppleScript/Digital-root create mode 120000 Lang/AppleScript/Fibonacci-n-step-number-sequences create mode 120000 Lang/AppleScript/Find-limit-of-recursion create mode 120000 Lang/AppleScript/Generator-Exponential create mode 120000 Lang/AppleScript/Greatest-subsequential-sum create mode 120000 Lang/AppleScript/Increment-a-numerical-string create mode 120000 Lang/AppleScript/Map-range create mode 120000 Lang/AppleScript/Mouse-position create mode 120000 Lang/AppleScript/Pick-random-element create mode 120000 Lang/AppleScript/Sieve-of-Eratosthenes create mode 120000 Lang/AppleScript/Stern-Brocot-sequence create mode 120000 Lang/AppleScript/String-matching create mode 120000 Lang/AppleScript/Visualize-a-tree create mode 120000 Lang/Applesoft-BASIC/Address-of-a-variable create mode 120000 Lang/Applesoft-BASIC/Brownian-tree create mode 120000 Lang/Arc/Caesar-cipher create mode 120000 Lang/Arc/Day-of-the-week create mode 120000 Lang/Arc/Factors-of-an-integer create mode 120000 Lang/Arc/Hello-world-Text create mode 120000 Lang/Arc/Leap-year create mode 120000 Lang/AutoHotkey/Nautical-bell create mode 120000 Lang/B/100-doors create mode 120000 Lang/B/Hello-world-Newline-omission create mode 120000 Lang/B/Hello-world-Text create mode 120000 Lang/B/Mandelbrot-set create mode 120000 Lang/B/Primality-by-trial-division create mode 120000 Lang/BASIC/Four-bit-adder create mode 120000 Lang/BASIC/Yin-and-yang create mode 120000 Lang/BASIC256/Caesar-cipher create mode 120000 Lang/BASIC256/Closest-pair-problem create mode 120000 Lang/BASIC256/Execute-HQ9+ create mode 120000 Lang/BASIC256/Hofstadter-Q-sequence create mode 120000 Lang/BASIC256/Mad-Libs create mode 120000 Lang/BASIC256/Number-reversal-game create mode 120000 Lang/BASIC256/Pig-the-dice-game create mode 120000 Lang/BASIC256/Rot-13 create mode 120000 Lang/BASIC256/Run-length-encoding create mode 120000 Lang/BaCon/Walk-a-directory-Non-recursively create mode 120000 Lang/BaCon/Walk-a-directory-Recursively create mode 120000 Lang/Batch-File/Boolean-values create mode 120000 Lang/Batch-File/Evaluate-binomial-coefficients create mode 120000 Lang/Batch-File/Fork create mode 120000 Lang/Batch-File/One-of-n-lines-in-a-file create mode 120000 Lang/Bc/Hello-world-Newline-omission create mode 120000 Lang/Befunge/Loops-Break create mode 120000 Lang/Befunge/Loops-Continue create mode 120000 Lang/Bracmat/Bernoulli-numbers create mode 120000 Lang/Bracmat/Parsing-RPN-calculator-algorithm create mode 120000 Lang/Brainf---/Caesar-cipher create mode 120000 Lang/Brainf---/Execute-Brain---- create mode 120000 Lang/Burlesque/Factors-of-an-integer create mode 120000 Lang/Burlesque/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/Burlesque/Matrix-exponentiation-operator create mode 120000 Lang/C++/AKS-test-for-primes create mode 120000 Lang/C++/Append-a-record-to-the-end-of-a-text-file create mode 120000 Lang/C++/Averages-Mean-angle create mode 120000 Lang/C++/Chinese-remainder-theorem create mode 120000 Lang/C++/Create-a-file-on-magnetic-tape create mode 120000 Lang/C++/Handle-a-signal create mode 120000 Lang/C++/Multiplicative-order create mode 120000 Lang/C++/Old-lady-swallowed-a-fly create mode 120000 Lang/C++/Parsing-Shunting-yard-algorithm create mode 120000 Lang/C++/Polynomial-regression create mode 120000 Lang/C++/Ranking-methods create mode 120000 Lang/C++/Resistor-mesh create mode 120000 Lang/C++/Safe-addition create mode 120000 Lang/C++/Set-of-real-numbers create mode 120000 Lang/C++/Sutherland-Hodgman-polygon-clipping create mode 120000 Lang/C++/The-ISAAC-Cipher create mode 120000 Lang/C++/Write-to-Windows-event-log create mode 120000 Lang/C-sharp/Compile-time-calculation create mode 120000 Lang/C-sharp/Discordian-date create mode 120000 Lang/C-sharp/Flow-control-structures create mode 120000 Lang/C-sharp/GUI-Maximum-window-dimensions create mode 120000 Lang/C-sharp/GUI-enabling-disabling-of-controls create mode 120000 Lang/C-sharp/Matrix-exponentiation-operator create mode 120000 Lang/C-sharp/Modular-exponentiation create mode 120000 Lang/C-sharp/Non-continuous-subsequences create mode 120000 Lang/C-sharp/Ordered-Partitions create mode 120000 Lang/C-sharp/Penneys-game create mode 120000 Lang/C-sharp/Reverse-a-string create mode 120000 Lang/C-sharp/Solve-a-Hidato-puzzle create mode 120000 Lang/C-sharp/Solve-a-Holy-Knights-tour create mode 120000 Lang/C-sharp/Solve-a-Hopido-puzzle create mode 120000 Lang/C-sharp/Solve-a-Numbrix-puzzle create mode 120000 Lang/C/Calendar---for-REAL-programmers create mode 120000 Lang/C/Set-of-real-numbers create mode 120000 Lang/C/Window-management create mode 120000 Lang/COBOL/Align-columns create mode 120000 Lang/COBOL/Compound-data-type create mode 120000 Lang/COBOL/File-size create mode 120000 Lang/COBOL/Machine-code create mode 120000 Lang/COBOL/Program-name create mode 120000 Lang/COBOL/Substring-Top-and-tail create mode 120000 Lang/Cache-ObjectScript/Guess-the-number-With-feedback create mode 120000 Lang/Cache-ObjectScript/Loops-While create mode 120000 Lang/Cache-ObjectScript/Sleep create mode 120000 Lang/Cache-ObjectScript/Zero-to-the-zero-power create mode 120000 Lang/Ceylon/24-game-Solve create mode 120000 Lang/Ceylon/Matrix-multiplication create mode 120000 Lang/Ceylon/Reverse-a-string create mode 120000 Lang/Ceylon/Vector-products create mode 120000 Lang/Ceylon/Vigen-re-cipher create mode 120000 Lang/Ceylon/Zig-zag-matrix create mode 120000 Lang/Clojure/Infinity create mode 120000 Lang/Clojure/Permutations-Derangements create mode 120000 Lang/Clojure/Stem-and-leaf-plot create mode 120000 Lang/CoffeeScript/Morse-code create mode 120000 Lang/Comal/Numerical-integration create mode 120000 Lang/Commodore-BASIC/Hello-world-Text create mode 120000 Lang/Commodore-BASIC/Maze-generation create mode 120000 Lang/Common-Lisp/Brownian-tree create mode 120000 Lang/Common-Lisp/Catalan-numbers-Pascals-triangle create mode 120000 Lang/Common-Lisp/Here-document create mode 120000 Lang/Common-Lisp/Image-convolution create mode 120000 Lang/Common-Lisp/Mouse-position create mode 120000 Lang/Common-Lisp/Ulam-spiral--for-primes- create mode 120000 Lang/Common-Lisp/World-Cup-group-stage create mode 120000 Lang/Coq/Extend-your-language create mode 120000 Lang/Crystal/9-billion-names-of-God-the-integer create mode 120000 Lang/Crystal/AKS-test-for-primes create mode 120000 Lang/Crystal/Abstract-type create mode 120000 Lang/Crystal/Ackermann-function create mode 120000 Lang/Crystal/Averages-Root-mean-square create mode 120000 Lang/Crystal/Binary-digits create mode 120000 Lang/Crystal/Binary-search create mode 120000 Lang/Crystal/Bulls-and-cows create mode 120000 Lang/Crystal/Bulls-and-cows-Player create mode 120000 Lang/Crystal/Call-a-foreign-language-function create mode 120000 Lang/Crystal/Combinations-and-permutations create mode 120000 Lang/Crystal/Combinations-with-repetitions create mode 120000 Lang/Crystal/Constrained-genericity create mode 120000 Lang/Crystal/Dinesmans-multiple-dwelling-problem create mode 120000 Lang/Crystal/Gamma-function create mode 120000 Lang/Crystal/HTTP create mode 120000 Lang/Crystal/Harshad-or-Niven-series create mode 120000 Lang/Crystal/Haversine-formula create mode 120000 Lang/Crystal/Hickerson-series-of-almost-integers create mode 120000 Lang/Crystal/Josephus-problem create mode 120000 Lang/Crystal/Knapsack-problem-0-1 create mode 120000 Lang/Crystal/Knapsack-problem-Bounded create mode 120000 Lang/Crystal/Nth create mode 120000 Lang/Crystal/Permutations create mode 120000 Lang/Crystal/Pythagorean-triples create mode 120000 Lang/Crystal/Quickselect-algorithm create mode 120000 Lang/Crystal/Rock-paper-scissors create mode 120000 Lang/Crystal/Roots-of-unity create mode 120000 Lang/Crystal/Runge-Kutta-method create mode 120000 Lang/Crystal/Sierpinski-carpet create mode 120000 Lang/Crystal/Sum-of-a-series create mode 120000 Lang/Crystal/The-Twelve-Days-of-Christmas create mode 120000 Lang/Crystal/Tree-traversal create mode 120000 Lang/Crystal/Zebra-puzzle create mode 120000 Lang/Crystal/Zig-zag-matrix create mode 120000 Lang/Curry/Permutations create mode 120000 Lang/D/Arithmetic-geometric-mean-Calculate-Pi create mode 120000 Lang/D/Multiplicative-order create mode 120000 Lang/Dart/Extensible-prime-generator create mode 120000 Lang/Dart/Forward-difference create mode 120000 Lang/Dart/Hamming-numbers create mode 120000 Lang/Dart/Haversine-formula create mode 120000 Lang/Dart/Roots-of-a-function create mode 120000 Lang/Dart/Sum-of-a-series create mode 120000 Lang/Dc/Ackermann-function create mode 120000 Lang/Dc/Fibonacci-sequence create mode 120000 Lang/Dc/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/Dc/Hello-world-Newline-omission create mode 120000 Lang/Dc/Logical-operations create mode 120000 Lang/Dc/Mandelbrot-set create mode 120000 Lang/Dc/Return-multiple-values create mode 120000 Lang/Dc/Reverse-a-string create mode 120000 Lang/Dc/Sum-digits-of-an-integer create mode 120000 Lang/Dc/Terminal-control-Clear-the-screen create mode 120000 Lang/Dc/Terminal-control-Display-an-extended-character create mode 120000 Lang/Delphi/Address-of-a-variable create mode 120000 Lang/Delphi/Random-number-generator--included- create mode 120000 Lang/Eiffel/Classes create mode 120000 Lang/Elena/Walk-a-directory-Non-recursively create mode 120000 Lang/Elixir/Dining-philosophers create mode 120000 Lang/Elixir/Extensible-prime-generator create mode 120000 Lang/Emacs-Lisp/Ackermann-function create mode 120000 Lang/Emacs-Lisp/Binary-search create mode 120000 Lang/Emacs-Lisp/Generator-Exponential create mode 120000 Lang/Emacs-Lisp/Leap-year create mode 120000 Lang/Emacs-Lisp/Luhn-test-of-credit-card-numbers create mode 120000 Lang/Emacs-Lisp/Matrix-transposition create mode 120000 Lang/Emacs-Lisp/Pattern-matching create mode 120000 Lang/Emacs-Lisp/Pick-random-element create mode 120000 Lang/Emacs-Lisp/Run-length-encoding create mode 120000 Lang/Emacs-Lisp/Terminal-control-Preserve-screen create mode 120000 Lang/Erlang/Arithmetic-geometric-mean-Calculate-Pi create mode 120000 Lang/Erlang/Matrix-transposition create mode 120000 Lang/Erlang/Monte-Carlo-methods create mode 120000 Lang/Excel/Factorial create mode 120000 Lang/FALSE/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/Factor/ABC-Problem create mode 120000 Lang/Factor/AKS-test-for-primes create mode 120000 Lang/Factor/Averages-Mean-angle create mode 120000 Lang/Factor/Averages-Mean-time-of-day create mode 120000 Lang/Factor/Averages-Simple-moving-average create mode 120000 Lang/Factor/Brownian-tree create mode 120000 Lang/Factor/Calendar create mode 120000 Lang/Factor/Call-an-object-method create mode 120000 Lang/Factor/Check-Machin-like-formulas create mode 120000 Lang/Factor/Circles-of-given-radius-through-two-points create mode 120000 Lang/Factor/Collections create mode 120000 Lang/Factor/Continued-fraction-Arithmetic-Construct-from-rational-number create mode 120000 Lang/Factor/DNS-query create mode 120000 Lang/Factor/Date-manipulation create mode 120000 Lang/Factor/Deal-cards-for-FreeCell create mode 120000 Lang/Factor/Draw-a-cuboid create mode 120000 Lang/Factor/Element-wise-operations create mode 120000 Lang/Factor/Euler-method create mode 120000 Lang/Factor/Exceptions-Catch-an-exception-thrown-in-a-nested-call create mode 120000 Lang/Factor/Execute-HQ9+ create mode 120000 Lang/Factor/Factors-of-a-Mersenne-number create mode 120000 Lang/Factor/Fibonacci-n-step-number-sequences create mode 120000 Lang/Factor/Fibonacci-word-fractal create mode 120000 Lang/Factor/Find-limit-of-recursion create mode 120000 Lang/Factor/Floyds-triangle create mode 120000 Lang/Factor/Forest-fire create mode 120000 Lang/Factor/Fractran create mode 120000 Lang/Factor/Function-frequency create mode 120000 Lang/Factor/Galton-box-animation create mode 120000 Lang/Factor/Gamma-function create mode 120000 Lang/Factor/Generator-Exponential create mode 120000 Lang/Factor/Heronian-triangles create mode 120000 Lang/Factor/Hickerson-series-of-almost-integers create mode 120000 Lang/Factor/History-variables create mode 120000 Lang/Factor/Horizontal-sundial-calculations create mode 120000 Lang/Factor/IBAN create mode 120000 Lang/Factor/Inheritance-Multiple create mode 120000 Lang/Factor/Jensens-Device create mode 120000 Lang/Factor/List-comprehensions create mode 120000 Lang/Factor/Literals-Floating-point create mode 120000 Lang/Factor/Literals-String create mode 120000 Lang/Factor/Longest-common-subsequence create mode 120000 Lang/Factor/Lucas-Lehmer-test create mode 120000 Lang/Factor/Ludic-numbers create mode 120000 Lang/Factor/Mad-Libs create mode 120000 Lang/Factor/Magic-squares-of-odd-order create mode 120000 Lang/Factor/Make-directory-path create mode 120000 Lang/Factor/Maximum-triangle-path-sum create mode 120000 Lang/Factor/Morse-code create mode 120000 Lang/Factor/Move-to-front-algorithm create mode 120000 Lang/Factor/Nth-root create mode 120000 Lang/Factor/Order-disjoint-list-items create mode 120000 Lang/Factor/Pascals-triangle-Puzzle create mode 120000 Lang/Factor/Percolation-Mean-cluster-density create mode 120000 Lang/Factor/Percolation-Mean-run-density create mode 120000 Lang/Factor/Percolation-Site-percolation create mode 120000 Lang/Factor/Permutations-Derangements create mode 120000 Lang/Factor/Pi create mode 120000 Lang/Factor/Polynomial-long-division create mode 120000 Lang/Factor/Quickselect-algorithm create mode 120000 Lang/Factor/RIPEMD-160 create mode 120000 Lang/Factor/Random-number-generator--device- create mode 120000 Lang/Factor/Range-expansion create mode 120000 Lang/Factor/Read-a-specific-line-from-a-file create mode 120000 Lang/Factor/Reduced-row-echelon-form create mode 120000 Lang/Factor/Rock-paper-scissors create mode 120000 Lang/Factor/Roman-numerals-Decode create mode 120000 Lang/Factor/Runtime-evaluation-In-an-environment create mode 120000 Lang/Factor/S-Expressions create mode 120000 Lang/Factor/SEDOLs create mode 120000 Lang/Factor/Semordnilap create mode 120000 Lang/Factor/Send-an-unknown-method-call create mode 120000 Lang/Factor/Sierpinski-triangle-Graphical create mode 120000 Lang/Factor/Sieve-of-Eratosthenes create mode 120000 Lang/Factor/Solve-the-no-connection-puzzle create mode 120000 Lang/Factor/Sort-disjoint-sublist create mode 120000 Lang/Factor/Sorting-algorithms-Stooge-sort create mode 120000 Lang/Factor/Soundex create mode 120000 Lang/Factor/Spiral-matrix create mode 120000 Lang/Factor/Stack-traces create mode 120000 Lang/Factor/Stair-climbing-puzzle create mode 120000 Lang/Factor/Stem-and-leaf-plot create mode 120000 Lang/Factor/String-matching create mode 120000 Lang/Factor/Trigonometric-functions create mode 120000 Lang/Factor/URL-encoding create mode 120000 Lang/Factor/Ulam-spiral--for-primes- create mode 120000 Lang/Factor/Unbias-a-random-generator create mode 120000 Lang/Factor/Unicode-variable-names create mode 120000 Lang/Factor/Van-der-Corput-sequence create mode 120000 Lang/Factor/Visualize-a-tree create mode 120000 Lang/Factor/Zeckendorf-number-representation create mode 120000 Lang/Factor/Zig-zag-matrix create mode 120000 Lang/Fish/100-doors create mode 120000 Lang/Fish/Function-definition create mode 120000 Lang/Fish/Generic-swap create mode 120000 Lang/Fish/Loops-Infinite create mode 120000 Lang/Fish/Sum-of-a-series create mode 120000 Lang/Forth/Colour-bars-Display create mode 120000 Lang/Forth/Draw-a-clock create mode 120000 Lang/Forth/Langtons-ant create mode 120000 Lang/Forth/Man-or-boy-test create mode 120000 Lang/Forth/Menu create mode 120000 Lang/Forth/Narcissistic-decimal-number create mode 120000 Lang/Forth/Ulam-spiral--for-primes- create mode 120000 Lang/Forth/Variable-size-Get create mode 120000 Lang/Fortran/Stern-Brocot-sequence create mode 120000 Lang/Free-Pascal/100-doors create mode 120000 Lang/Free-Pascal/Array-concatenation create mode 120000 Lang/Free-Pascal/Associative-array-Creation create mode 120000 Lang/Free-Pascal/Associative-array-Iteration create mode 120000 Lang/Free-Pascal/Binary-digits create mode 120000 Lang/Free-Pascal/Bitwise-operations create mode 120000 Lang/Free-Pascal/Casting-out-nines create mode 120000 Lang/Free-Pascal/Define-a-primitive-data-type create mode 120000 Lang/Free-Pascal/Delete-a-file create mode 120000 Lang/Free-Pascal/Determine-if-a-string-is-numeric create mode 120000 Lang/Free-Pascal/Empty-string create mode 120000 Lang/Free-Pascal/Extend-your-language create mode 120000 Lang/Free-Pascal/Fibonacci-sequence create mode 120000 Lang/Free-Pascal/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/Free-Pascal/Generic-swap create mode 120000 Lang/Free-Pascal/Haversine-formula create mode 120000 Lang/Free-Pascal/Hello-world-Web-server create mode 120000 Lang/Free-Pascal/Memory-layout-of-a-data-structure create mode 120000 Lang/Free-Pascal/Queue-Definition create mode 120000 Lang/Free-Pascal/Random-number-generator--included- create mode 120000 Lang/Free-Pascal/Repeat-a-string create mode 120000 Lang/Free-Pascal/SHA-256 create mode 120000 Lang/Free-Pascal/Shell-one-liner create mode 120000 Lang/Free-Pascal/Sieve-of-Eratosthenes create mode 120000 Lang/Free-Pascal/Stack create mode 120000 Lang/Free-Pascal/Substring create mode 120000 Lang/Free-Pascal/Ternary-logic create mode 120000 Lang/Free-Pascal/URL-decoding create mode 120000 Lang/Free-Pascal/URL-encoding create mode 120000 Lang/Free-Pascal/Variable-size-Set create mode 120000 Lang/Free-Pascal/Variadic-function create mode 120000 Lang/FreeBASIC/24-game create mode 120000 Lang/FreeBASIC/ABC-Problem create mode 120000 Lang/FreeBASIC/Closest-pair-problem create mode 120000 Lang/FreeBASIC/Dutch-national-flag-problem create mode 120000 Lang/FreeBASIC/Execute-Brain---- create mode 120000 Lang/FreeBASIC/Execute-HQ9+ create mode 120000 Lang/FreeBASIC/Find-common-directory-path create mode 120000 Lang/FreeBASIC/Generate-Chess960-starting-position create mode 120000 Lang/FreeBASIC/Go-Fish create mode 120000 Lang/FreeBASIC/Hofstadter-Q-sequence create mode 120000 Lang/FreeBASIC/Horners-rule-for-polynomial-evaluation create mode 120000 Lang/FreeBASIC/Josephus-problem create mode 120000 Lang/FreeBASIC/Knights-tour create mode 120000 Lang/FreeBASIC/LZW-compression create mode 120000 Lang/FreeBASIC/Literals-String create mode 120000 Lang/FreeBASIC/Look-and-say-sequence create mode 120000 Lang/FreeBASIC/Mad-Libs create mode 120000 Lang/FreeBASIC/Modular-exponentiation create mode 120000 Lang/FreeBASIC/Monty-Hall-problem create mode 120000 Lang/FreeBASIC/Nth-root create mode 120000 Lang/FreeBASIC/Pig-the-dice-game create mode 120000 Lang/FreeBASIC/Quaternion-type create mode 120000 Lang/FreeBASIC/Quine create mode 120000 Lang/FreeBASIC/Run-length-encoding create mode 120000 Lang/FreeBASIC/Stern-Brocot-sequence create mode 120000 Lang/Frink/Amicable-pairs create mode 120000 Lang/Futhark/Associative-array-Creation create mode 120000 Lang/Futhark/QR-decomposition create mode 120000 Lang/GAP/Quine create mode 120000 Lang/GAP/Zebra-puzzle create mode 120000 Lang/GLSL/Classes create mode 120000 Lang/GLSL/Dot-product create mode 120000 Lang/GLSL/Vector-products create mode 120000 Lang/GW-BASIC/Loops-For create mode 120000 Lang/Gambas/Factorial create mode 120000 Lang/Go/Active-Directory-Connect create mode 120000 Lang/Go/Active-Directory-Search-for-a-user create mode 120000 Lang/Go/Add-a-variable-to-a-class-instance-at-runtime create mode 120000 Lang/Go/Calendar---for-REAL-programmers create mode 120000 Lang/Go/Canny-edge-detector create mode 120000 Lang/Go/Color-of-a-screen-pixel create mode 120000 Lang/Go/Colour-bars-Display create mode 120000 Lang/Go/Colour-pinstripe-Display create mode 120000 Lang/Go/Colour-pinstripe-Printer create mode 120000 Lang/Go/Deconvolution-2D+ create mode 120000 Lang/Go/Dynamic-variable-names create mode 120000 Lang/Go/Fibonacci-word-fractal create mode 120000 Lang/Go/GUI-Maximum-window-dimensions create mode 120000 Lang/Go/GUI-component-interaction create mode 120000 Lang/Go/GUI-enabling-disabling-of-controls create mode 120000 Lang/Go/Greyscale-bars-Display create mode 120000 Lang/Go/Honeycombs create mode 120000 Lang/Go/Joystick-position create mode 120000 Lang/Go/Keyboard-macros create mode 120000 Lang/Go/List-comprehensions create mode 120000 Lang/Go/Machine-code create mode 120000 Lang/Go/Matrix-exponentiation-operator create mode 120000 Lang/Go/Metaprogramming create mode 120000 Lang/Go/Minesweeper-game create mode 120000 Lang/Go/Mouse-position create mode 120000 Lang/Go/Nautical-bell create mode 120000 Lang/Go/OLE-Automation create mode 120000 Lang/Go/Pattern-matching create mode 120000 Lang/Go/Pinstripe-Display create mode 120000 Lang/Go/Pinstripe-Printer create mode 120000 Lang/Go/Play-recorded-sounds create mode 120000 Lang/Go/Record-sound create mode 120000 Lang/Go/SOAP create mode 120000 Lang/Go/Simulate-input-Keyboard create mode 120000 Lang/Go/Simulate-input-Mouse create mode 120000 Lang/Go/Start-from-a-main-routine create mode 120000 Lang/Go/Terminal-control-Positional-read create mode 120000 Lang/Go/User-input-Graphical create mode 120000 Lang/Go/Window-management create mode 120000 Lang/Go/World-Cup-group-stage create mode 120000 Lang/Go/Write-to-Windows-event-log create mode 120000 Lang/Go/Zeckendorf-arithmetic create mode 120000 Lang/Golo/99-Bottles-of-Beer create mode 120000 Lang/Golo/A+B create mode 120000 Lang/Golo/Bulls-and-cows create mode 120000 Lang/Golo/Polymorphism create mode 120000 Lang/Golo/Roman-numerals-Decode create mode 120000 Lang/Golo/Roman-numerals-Encode create mode 120000 Lang/Golo/Rot-13 create mode 120000 Lang/Golo/Terminal-control-Coloured-text create mode 120000 Lang/Golo/Variadic-function create mode 120000 Lang/Groovy/Active-object create mode 120000 Lang/Groovy/Benfords-law create mode 120000 Lang/Groovy/Call-a-function create mode 120000 Lang/Groovy/Chat-server create mode 120000 Lang/Groovy/Convert-decimal-number-to-rational create mode 120000 Lang/Groovy/Element-wise-operations create mode 120000 Lang/Groovy/Integer-overflow create mode 120000 Lang/Groovy/MD5-Implementation create mode 120000 Lang/Groovy/Parsing-RPN-to-infix-conversion create mode 120000 Lang/Groovy/User-input-Graphical create mode 120000 Lang/Groovy/Video-display-modes create mode 120000 Lang/Harbour/Align-columns create mode 120000 Lang/Harbour/Loop-over-multiple-arrays-simultaneously create mode 120000 Lang/Haskell/Function-prototype create mode 120000 Lang/Haskell/Keyboard-input-Flush-the-keyboard-buffer create mode 120000 Lang/Haskell/Knuths-algorithm-S create mode 120000 Lang/Haskell/LU-decomposition create mode 120000 Lang/Haskell/QR-decomposition create mode 120000 Lang/Haskell/Set-of-real-numbers create mode 120000 Lang/Haskell/Xiaolin-Wus-line-algorithm create mode 120000 Lang/HolyC/99-Bottles-of-Beer create mode 120000 Lang/Hy/Playing-cards create mode 120000 Lang/J/Dining-philosophers create mode 120000 Lang/Java/Create-a-file-on-magnetic-tape create mode 120000 Lang/Java/Extend-your-language create mode 120000 Lang/Java/FizzBuzz create mode 120000 Lang/Java/Narcissist create mode 120000 Lang/Java/Write-to-Windows-event-log create mode 120000 Lang/JavaScript/CRC-32 create mode 120000 Lang/JavaScript/Convert-decimal-number-to-rational create mode 120000 Lang/JavaScript/Execute-a-Markov-algorithm create mode 120000 Lang/JavaScript/Find-common-directory-path create mode 120000 Lang/JavaScript/Galton-box-animation create mode 120000 Lang/JavaScript/Hello-world-Newbie create mode 120000 Lang/JavaScript/Last-letter-first-letter create mode 120000 Lang/JavaScript/MD4 create mode 120000 Lang/JavaScript/Rock-paper-scissors create mode 120000 Lang/JavaScript/Set-consolidation create mode 120000 Lang/JavaScript/Stern-Brocot-sequence create mode 120000 Lang/Julia/9-billion-names-of-God-the-integer create mode 120000 Lang/Julia/Binary-strings create mode 120000 Lang/Julia/Bitwise-IO create mode 120000 Lang/Julia/Calendar create mode 120000 Lang/Julia/Calendar---for-REAL-programmers create mode 120000 Lang/Julia/Check-Machin-like-formulas create mode 120000 Lang/Julia/Checkpoint-synchronization create mode 120000 Lang/Julia/Color-of-a-screen-pixel create mode 120000 Lang/Julia/Color-quantization create mode 120000 Lang/Julia/Colour-pinstripe-Display create mode 120000 Lang/Julia/Compare-sorting-algorithms-performance create mode 120000 Lang/Julia/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N- create mode 120000 Lang/Julia/Create-a-file-on-magnetic-tape create mode 120000 Lang/Julia/Cut-a-rectangle create mode 120000 Lang/Julia/DNS-query create mode 120000 Lang/Julia/Deal-cards-for-FreeCell create mode 120000 Lang/Julia/Death-Star create mode 120000 Lang/Julia/Deconvolution-2D+ create mode 120000 Lang/Julia/Determine-if-only-one-instance-is-running create mode 120000 Lang/Julia/Distributed-programming create mode 120000 Lang/Julia/Documentation create mode 120000 Lang/Julia/Doubly-linked-list-Definition create mode 120000 Lang/Julia/Doubly-linked-list-Element-insertion create mode 120000 Lang/Julia/Doubly-linked-list-Traversal create mode 120000 Lang/Julia/Draw-a-clock create mode 120000 Lang/Julia/Echo-server create mode 120000 Lang/Julia/Execute-SNUSP create mode 120000 Lang/Julia/Extend-your-language create mode 120000 Lang/Julia/First-class-environments create mode 120000 Lang/Julia/Fork create mode 120000 Lang/Julia/Fractal-tree create mode 120000 Lang/Julia/Function-prototype create mode 120000 Lang/Julia/GUI-Maximum-window-dimensions create mode 120000 Lang/Julia/Galton-box-animation create mode 120000 Lang/Julia/Greyscale-bars-Display create mode 120000 Lang/Julia/HTTPS-Authenticated create mode 120000 Lang/Julia/HTTPS-Client-authenticated create mode 120000 Lang/Julia/Hello-world-Line-printer create mode 120000 Lang/Julia/History-variables create mode 120000 Lang/Julia/Honeycombs create mode 120000 Lang/Julia/Hough-transform create mode 120000 Lang/Julia/Huffman-coding create mode 120000 Lang/Julia/Image-noise create mode 120000 Lang/Julia/Inheritance-Multiple create mode 120000 Lang/Julia/Inverted-index create mode 120000 Lang/Julia/Joystick-position create mode 120000 Lang/Julia/K-d-tree create mode 120000 Lang/Julia/K-means++-clustering create mode 120000 Lang/Julia/Keyboard-input-Keypress-check create mode 120000 Lang/Julia/Keyboard-macros create mode 120000 Lang/Julia/Knights-tour create mode 120000 Lang/Julia/Langtons-ant create mode 120000 Lang/Julia/Literals-String create mode 120000 Lang/Julia/MD5-Implementation create mode 120000 Lang/Julia/Machine-code create mode 120000 Lang/Julia/Metaprogramming create mode 120000 Lang/Julia/Metered-concurrency create mode 120000 Lang/Julia/Morse-code create mode 120000 Lang/Julia/Mouse-position create mode 120000 Lang/Julia/Multisplit create mode 120000 Lang/Julia/Munching-squares create mode 120000 Lang/Julia/Natural-sorting create mode 120000 Lang/Julia/Nautical-bell create mode 120000 Lang/Julia/OpenGL create mode 120000 Lang/Julia/Paraffins create mode 120000 Lang/Julia/Pattern-matching create mode 120000 Lang/Julia/Pig-the-dice-game-Player create mode 120000 Lang/Julia/Pointers-and-references create mode 120000 Lang/Julia/Polymorphic-copy create mode 120000 Lang/Julia/Pragmatic-directives create mode 120000 Lang/Julia/Rate-counter create mode 120000 Lang/Julia/Rendezvous create mode 120000 Lang/Julia/Scope-modifiers create mode 120000 Lang/Julia/Self-referential-sequence create mode 120000 Lang/Julia/Set-puzzle create mode 120000 Lang/Julia/Simple-database create mode 120000 Lang/Julia/Sokoban create mode 120000 Lang/Julia/Solve-a-Hidato-puzzle create mode 120000 Lang/Julia/Solve-a-Holy-Knights-tour create mode 120000 Lang/Julia/Solve-a-Hopido-puzzle create mode 120000 Lang/Julia/Solve-a-Numbrix-puzzle create mode 120000 Lang/Julia/Solve-the-no-connection-puzzle create mode 120000 Lang/Julia/Sorting-algorithms-Heapsort create mode 120000 Lang/Julia/Sorting-algorithms-Radix-sort create mode 120000 Lang/Julia/Sorting-algorithms-Strand-sort create mode 120000 Lang/Julia/Speech-synthesis create mode 120000 Lang/Julia/Subtractive-generator create mode 120000 Lang/Julia/Sutherland-Hodgman-polygon-clipping create mode 120000 Lang/Julia/Take-notes-on-the-command-line create mode 120000 Lang/Julia/Terminal-control-Cursor-movement create mode 120000 Lang/Julia/Terminal-control-Cursor-positioning create mode 120000 Lang/Julia/Terminal-control-Dimensions create mode 120000 Lang/Julia/Terminal-control-Display-an-extended-character create mode 120000 Lang/Julia/Terminal-control-Hiding-the-cursor create mode 120000 Lang/Julia/Terminal-control-Inverse-video create mode 120000 Lang/Julia/Terminal-control-Positional-read create mode 120000 Lang/Julia/Terminal-control-Preserve-screen create mode 120000 Lang/Julia/Thieles-interpolation-formula create mode 120000 Lang/Julia/Tic-tac-toe create mode 120000 Lang/Julia/Undefined-values create mode 120000 Lang/Julia/Universal-Turing-machine create mode 120000 Lang/Julia/Update-a-configuration-file create mode 120000 Lang/Julia/User-input-Graphical create mode 120000 Lang/Julia/Variable-size-Set create mode 120000 Lang/Julia/Video-display-modes create mode 120000 Lang/Julia/Visualize-a-tree create mode 120000 Lang/Julia/Window-management create mode 120000 Lang/Julia/Wireworld create mode 120000 Lang/Julia/World-Cup-group-stage create mode 120000 Lang/Julia/Write-language-name-in-3D-ASCII create mode 120000 Lang/Julia/Write-to-Windows-event-log create mode 120000 Lang/Julia/XML-DOM-serialization create mode 120000 Lang/Julia/XML-Output create mode 120000 Lang/Julia/XML-XPath create mode 120000 Lang/Julia/Zeckendorf-arithmetic create mode 120000 Lang/K/Abundant,-deficient-and-perfect-number-classifications create mode 120000 Lang/K/Find-the-last-Sunday-of-each-month create mode 120000 Lang/K/Last-Friday-of-each-month create mode 120000 Lang/K/Matrix-exponentiation-operator create mode 120000 Lang/K/Middle-three-digits create mode 120000 Lang/K/Phrase-reversals create mode 120000 Lang/K/Zero-to-the-zero-power create mode 120000 Lang/Kotlin/Chat-server create mode 120000 Lang/LLVM/Arithmetic-geometric-mean create mode 120000 Lang/LLVM/Binary-digits create mode 120000 Lang/LLVM/Box-the-compass create mode 120000 Lang/LLVM/Dot-product create mode 120000 Lang/LLVM/Even-or-odd create mode 120000 Lang/LLVM/Factorial create mode 120000 Lang/LLVM/Fibonacci-sequence create mode 120000 Lang/LLVM/FizzBuzz create mode 120000 Lang/LLVM/Hello-world-Newline-omission create mode 120000 Lang/LLVM/Hello-world-Standard-error create mode 120000 Lang/LLVM/Integer-sequence create mode 120000 Lang/LLVM/Leap-year create mode 120000 Lang/LLVM/Logical-operations create mode 120000 Lang/LLVM/Reverse-a-string create mode 120000 Lang/Lambdatalk/Create-an-HTML-table create mode 120000 Lang/Lambdatalk/Guess-the-number-With-feedback create mode 120000 Lang/Liberty-BASIC/AKS-test-for-primes create mode 120000 Lang/Liberty-BASIC/Almost-prime create mode 120000 Lang/Liberty-BASIC/Nth create mode 120000 Lang/Lua/Append-a-record-to-the-end-of-a-text-file create mode 120000 Lang/Lua/CRC-32 create mode 120000 Lang/Lua/Chinese-remainder-theorem create mode 120000 Lang/Lua/Circles-of-given-radius-through-two-points create mode 120000 Lang/Lua/Create-a-file-on-magnetic-tape create mode 120000 Lang/Lua/Execute-Brain---- create mode 120000 Lang/Lua/Hofstadter-Conway-$10,000-sequence create mode 120000 Lang/Lua/K-means++-clustering create mode 120000 Lang/Lua/Old-lady-swallowed-a-fly create mode 120000 Lang/Lua/Polynomial-regression create mode 120000 Lang/Lua/Set-of-real-numbers create mode 120000 Lang/Lua/Tree-traversal create mode 120000 Lang/Lua/Walk-a-directory-Recursively create mode 120000 Lang/Lua/Write-language-name-in-3D-ASCII create mode 120000 Lang/M4/Count-in-factors create mode 120000 Lang/M4/Count-in-octal create mode 120000 Lang/MATLAB/Percentage-difference-between-images create mode 120000 Lang/MAXScript/Binary-digits create mode 120000 Lang/MAXScript/Even-or-odd create mode 120000 Lang/MAXScript/Reverse-words-in-a-string create mode 120000 Lang/MUMPS/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/MUMPS/Keyboard-input-Obtain-a-Y-or-N-response create mode 120000 Lang/MUMPS/Loops-Do-while create mode 120000 Lang/MUMPS/Phrase-reversals create mode 120000 Lang/MUMPS/Sorting-algorithms-Quicksort create mode 120000 Lang/MUMPS/Terminal-control-Ringing-the-terminal-bell create mode 120000 Lang/Maple/9-billion-names-of-God-the-integer create mode 120000 Lang/Maple/Abundant,-deficient-and-perfect-number-classifications create mode 120000 Lang/Maple/Death-Star create mode 120000 Lang/Maple/Draw-a-cuboid create mode 120000 Lang/Maple/Hello-world-Line-printer create mode 120000 Lang/Maple/Kaprekar-numbers create mode 120000 Lang/Maple/Number-names create mode 120000 Lang/Maple/One-of-n-lines-in-a-file create mode 120000 Lang/Maple/Perfect-numbers create mode 120000 Lang/Maple/Pernicious-numbers create mode 120000 Lang/Maple/Polynomial-regression create mode 120000 Lang/Maple/Sieve-of-Eratosthenes create mode 120000 Lang/Maple/Yin-and-yang create mode 120000 Lang/Mathematica/Color-of-a-screen-pixel create mode 120000 Lang/Mathematica/Hello-world-Web-server create mode 120000 Lang/Mathematica/Keyboard-input-Obtain-a-Y-or-N-response create mode 120000 Lang/Mercury/ABC-Problem create mode 120000 Lang/Mercury/Abstract-type create mode 120000 Lang/Mercury/Accumulator-factory create mode 120000 Lang/Mercury/Arrays create mode 120000 Lang/Mercury/Balanced-brackets create mode 120000 Lang/Mercury/Empty-string create mode 120000 Lang/Mercury/Old-lady-swallowed-a-fly create mode 120000 Lang/Mercury/Permutations create mode 120000 Lang/Mercury/Pythagorean-triples create mode 120000 Lang/Mercury/Range-extraction create mode 120000 Lang/Mercury/Rock-paper-scissors create mode 120000 Lang/Mercury/Sieve-of-Eratosthenes create mode 120000 Lang/Mercury/Topological-sort create mode 120000 Lang/Mercury/Use-another-language-to-call-a-function create mode 120000 Lang/Mercury/Variables create mode 120000 Lang/Modula-2/Arithmetic-geometric-mean create mode 120000 Lang/Modula-2/Chinese-remainder-theorem create mode 120000 Lang/Modula-2/Quine create mode 120000 Lang/Modula-2/Ranking-methods create mode 120000 Lang/Modula-3/Caesar-cipher create mode 120000 Lang/Modula-3/Dining-philosophers create mode 120000 Lang/Modula-3/Gaussian-elimination create mode 120000 Lang/Modula-3/Permutations create mode 120000 Lang/Neko/99-Bottles-of-Beer create mode 120000 Lang/Neko/A+B create mode 120000 Lang/Neko/Array-concatenation create mode 120000 Lang/Neko/Bitwise-operations create mode 120000 Lang/Neko/Boolean-values create mode 120000 Lang/Neko/CRC-32 create mode 120000 Lang/Neko/Character-codes create mode 120000 Lang/Neko/Check-that-file-exists create mode 120000 Lang/Neko/Command-line-arguments create mode 120000 Lang/Neko/Concurrent-computing create mode 120000 Lang/Neko/DNS-query create mode 120000 Lang/Neko/Date-format create mode 120000 Lang/Neko/Documentation create mode 120000 Lang/Neko/Find-limit-of-recursion create mode 120000 Lang/Neko/Generate-lower-case-ASCII-alphabet create mode 120000 Lang/Neko/Greatest-element-of-a-list create mode 120000 Lang/Neko/Hash-from-two-arrays create mode 120000 Lang/Neko/Hello-world-Graphical create mode 120000 Lang/Neko/Hello-world-Newline-omission create mode 120000 Lang/Neko/Hello-world-Standard-error create mode 120000 Lang/Neko/Host-introspection create mode 120000 Lang/Neko/Jump-anywhere create mode 120000 Lang/Neko/Leap-year create mode 120000 Lang/Neko/Literals-Integer create mode 120000 Lang/Neko/Logical-operations create mode 120000 Lang/Neko/Loops-Break create mode 120000 Lang/Neko/Loops-Continue create mode 120000 Lang/Neko/Loops-Do-while create mode 120000 Lang/Neko/Loops-Nested create mode 120000 Lang/Neko/MD5 create mode 120000 Lang/Neko/Multiplication-tables create mode 120000 Lang/Neko/Null-object create mode 120000 Lang/Neko/Object-serialization create mode 120000 Lang/Neko/Program-termination create mode 120000 Lang/Neko/Read-a-file-line-by-line create mode 120000 Lang/Neko/Read-entire-file create mode 120000 Lang/Neko/Real-constants-and-functions create mode 120000 Lang/Neko/Remove-duplicate-elements create mode 120000 Lang/Neko/Repeat-a-string create mode 120000 Lang/Neko/Reverse-a-string create mode 120000 Lang/Neko/Rot-13 create mode 120000 Lang/Neko/Sockets create mode 120000 Lang/Neko/Sort-an-integer-array create mode 120000 Lang/Neko/String-append create mode 120000 Lang/Neko/String-concatenation create mode 120000 Lang/Neko/String-interpolation--included- create mode 120000 Lang/Neko/String-prepend create mode 120000 Lang/Neko/Substring-Top-and-tail create mode 120000 Lang/Neko/System-time create mode 120000 Lang/Neko/User-input-Text create mode 120000 Lang/Neko/XML-Input create mode 120000 Lang/Neko/Zero-to-the-zero-power create mode 120000 Lang/NewLISP/Arithmetic-geometric-mean create mode 120000 Lang/NewLISP/Regular-expressions create mode 120000 Lang/Nial/Arithmetic-Integer create mode 120000 Lang/Nial/Array-concatenation create mode 120000 Lang/Nickle/Factorial create mode 120000 Lang/Nickle/Hello-world-Text create mode 120000 Lang/Nim/24-game-Solve create mode 120000 Lang/Nim/Arithmetic-evaluation create mode 120000 Lang/Nim/Best-shuffle create mode 120000 Lang/Nim/Bitcoin-address-validation create mode 120000 Lang/Nim/Bitcoin-public-point-to-address create mode 120000 Lang/Nim/Create-an-object-at-a-given-address create mode 120000 Lang/Nim/DNS-query create mode 120000 Lang/Nim/Extensible-prime-generator create mode 120000 Lang/Nim/Image-noise create mode 120000 Lang/Nim/Inverted-syntax create mode 120000 Lang/Nim/Parsing-Shunting-yard-algorithm create mode 120000 Lang/Nim/RIPEMD-160 create mode 120000 Lang/Nim/S-Expressions create mode 120000 Lang/Nim/Stem-and-leaf-plot create mode 120000 Lang/Nim/Sudoku create mode 120000 Lang/Nim/Terminal-control-Dimensions create mode 120000 Lang/Nim/Terminal-control-Hiding-the-cursor create mode 120000 Lang/Nim/Voronoi-diagram create mode 120000 Lang/OCaml/Calendar create mode 120000 Lang/OCaml/Function-prototype create mode 120000 Lang/OCaml/Here-document create mode 120000 Lang/OPL/Loops-Infinite create mode 120000 Lang/Objeck/Assertions create mode 120000 Lang/Objeck/CRC-32 create mode 120000 Lang/Objeck/CSV-data-manipulation create mode 120000 Lang/Objeck/CSV-to-HTML-translation create mode 120000 Lang/Objeck/Closures-Value-capture create mode 120000 Lang/Objeck/Comma-quibbling create mode 120000 Lang/Objeck/Constrained-genericity create mode 120000 Lang/Objeck/Delegates create mode 120000 Lang/Objeck/Documentation create mode 120000 Lang/Objeck/First-class-functions create mode 120000 Lang/Objeck/First-class-functions-Use-numbers-analogously create mode 120000 Lang/Objeck/Iterated-digits-squaring create mode 120000 Lang/Objeck/Loops-Continue create mode 120000 Lang/Objeck/Ludic-numbers create mode 120000 Lang/Objeck/Price-fraction create mode 120000 Lang/Objeck/Sierpinski-triangle-Graphical create mode 120000 Lang/Objeck/Soundex create mode 120000 Lang/Objeck/Terminal-control-Display-an-extended-character create mode 120000 Lang/Objeck/Tic-tac-toe create mode 120000 Lang/Objeck/Walk-a-directory-Recursively create mode 120000 Lang/Octave/Langtons-ant create mode 120000 Lang/Ol/100-doors create mode 120000 Lang/Ol/Anonymous-recursion create mode 120000 Lang/Ol/Arrays create mode 120000 Lang/Ol/Comma-quibbling create mode 120000 Lang/Ol/Conditional-structures create mode 120000 Lang/Ol/Conways-Game-of-Life create mode 120000 Lang/Ol/Detect-division-by-zero create mode 120000 Lang/Ol/Dot-product create mode 120000 Lang/Ol/Fibonacci-n-step-number-sequences create mode 120000 Lang/Ol/First-class-functions create mode 120000 Lang/Ol/Forest-fire create mode 120000 Lang/Ol/Function-definition create mode 120000 Lang/Ol/Greatest-common-divisor create mode 120000 Lang/Ol/Hello-world-Graphical create mode 120000 Lang/Ol/Hello-world-Standard-error create mode 120000 Lang/Ol/Higher-order-functions create mode 120000 Lang/Ol/Infinity create mode 120000 Lang/Ol/Integer-comparison create mode 120000 Lang/Ol/Integer-sequence create mode 120000 Lang/Ol/Jump-anywhere create mode 120000 Lang/Ol/Knuth-shuffle create mode 120000 Lang/Ol/LZW-compression create mode 120000 Lang/Ol/Long-multiplication create mode 120000 Lang/Ol/Loops-Break create mode 120000 Lang/Ol/Loops-Infinite create mode 120000 Lang/Ol/Man-or-boy-test create mode 120000 Lang/Ol/Mandelbrot-set create mode 120000 Lang/Ol/Maze-generation create mode 120000 Lang/Ol/Mutual-recursion create mode 120000 Lang/Ol/Object-serialization create mode 120000 Lang/Ol/Odd-word-problem create mode 120000 Lang/Ol/OpenGL create mode 120000 Lang/Ol/Order-two-numerical-lists create mode 120000 Lang/Ol/Palindrome-detection create mode 120000 Lang/Ol/Pi create mode 120000 Lang/Ol/Pick-random-element create mode 120000 Lang/Ol/Plot-coordinate-pairs create mode 120000 Lang/Ol/Program-name create mode 120000 Lang/Ol/Program-termination create mode 120000 Lang/Ol/Pythagorean-triples create mode 120000 Lang/Ol/Read-entire-file create mode 120000 Lang/Ol/Regular-expressions create mode 120000 Lang/Ol/Reverse-a-string create mode 120000 Lang/Ol/Sequence-of-non-squares create mode 120000 Lang/Ol/Set create mode 120000 Lang/Ol/Sieve-of-Eratosthenes create mode 120000 Lang/Ol/Sum-and-product-of-an-array create mode 120000 Lang/Ol/Sum-digits-of-an-integer create mode 120000 Lang/Ol/Sum-multiples-of-3-and-5 create mode 120000 Lang/Ol/Sum-of-squares create mode 120000 Lang/Ol/Zero-to-the-zero-power create mode 120000 Lang/OpenEdge-Progress/Combinations create mode 120000 Lang/OpenEdge-Progress/Permutations create mode 120000 Lang/PARI-GP/Yin-and-yang create mode 120000 Lang/PDP-11-Assembly/N-queens-problem create mode 120000 Lang/PHP/Deal-cards-for-FreeCell create mode 120000 Lang/PHP/Maze-generation create mode 120000 Lang/PHP/Word-wrap create mode 120000 Lang/Pascal/Dining-philosophers create mode 120000 Lang/Pascal/Enumerations create mode 120000 Lang/Pascal/Formatted-numeric-output create mode 120000 Lang/Pascal/Penneys-game create mode 120000 Lang/Pascal/Scope-modifiers create mode 120000 Lang/Pascal/Terminal-control-Coloured-text create mode 120000 Lang/Pascal/Yin-and-yang create mode 120000 Lang/Perl-6/Active-Directory-Connect create mode 120000 Lang/Perl-6/Active-Directory-Search-for-a-user create mode 120000 Lang/Perl-6/Active-object create mode 120000 Lang/Perl-6/Animate-a-pendulum create mode 120000 Lang/Perl-6/Animation create mode 120000 Lang/Perl-6/Bitmap-PPM-conversion-through-a-pipe create mode 120000 Lang/Perl-6/Checkpoint-synchronization create mode 120000 Lang/Perl-6/Color-quantization create mode 120000 Lang/Perl-6/Create-an-object-at-a-given-address create mode 120000 Lang/Perl-6/GUI-Maximum-window-dimensions create mode 120000 Lang/Perl-6/HTTPS-Client-authenticated create mode 120000 Lang/Perl-6/Hough-transform create mode 120000 Lang/Perl-6/Image-convolution create mode 120000 Lang/Perl-6/Keyboard-input-Flush-the-keyboard-buffer create mode 120000 Lang/Perl-6/Keyboard-input-Keypress-check create mode 120000 Lang/Perl-6/Median-filter create mode 120000 Lang/Perl-6/Object-serialization create mode 120000 Lang/Perl-6/Percentage-difference-between-images create mode 120000 Lang/Perl-6/QR-decomposition create mode 120000 Lang/Perl-6/SOAP create mode 120000 Lang/Perl-6/SQL-based-authentication create mode 120000 Lang/Perl-6/Safe-addition create mode 120000 Lang/Perl-6/Send-email create mode 120000 Lang/Perl-6/Simulate-input-Keyboard create mode 120000 Lang/Perl-6/Simulate-input-Mouse create mode 120000 Lang/Perl-6/Terminal-control-Positional-read create mode 120000 Lang/Perl-6/The-ISAAC-Cipher create mode 120000 Lang/Perl-6/Vogels-approximation-method create mode 120000 Lang/Perl-6/Window-management create mode 120000 Lang/Perl-6/Zebra-puzzle create mode 120000 Lang/Perl/Average-loop-length create mode 120000 Lang/Perl/Deconvolution-1D create mode 120000 Lang/Perl/Deconvolution-2D+ create mode 120000 Lang/Perl/Galton-box-animation create mode 120000 Lang/Perl/Greyscale-bars-Display create mode 120000 Lang/Perl/Horizontal-sundial-calculations create mode 120000 Lang/Perl/Hough-transform create mode 120000 Lang/Perl/Image-noise create mode 120000 Lang/Perl/Keyboard-macros create mode 120000 Lang/Perl/LU-decomposition create mode 120000 Lang/Perl/Main-step-of-GOST-28147-89 create mode 120000 Lang/Perl/Metronome create mode 120000 Lang/Perl/Nautical-bell create mode 120000 Lang/Perl/Numerical-integration create mode 120000 Lang/Perl/Numerical-integration-Gauss-Legendre-Quadrature create mode 120000 Lang/Perl/Percentage-difference-between-images create mode 120000 Lang/Perl/Percolation-Bond-percolation create mode 120000 Lang/Perl/Percolation-Mean-cluster-density create mode 120000 Lang/Perl/Percolation-Site-percolation create mode 120000 Lang/Perl/Pig-the-dice-game-Player create mode 120000 Lang/Perl/Pinstripe-Display create mode 120000 Lang/Perl/Problem-of-Apollonius create mode 120000 Lang/Perl/RSA-code create mode 120000 Lang/Perl/Ranking-methods create mode 120000 Lang/Perl/Safe-addition create mode 120000 Lang/Perl/Scope-Function-names-and-labels create mode 120000 Lang/Perl/Solve-a-Hopido-puzzle create mode 120000 Lang/Perl/Terminal-control-Coloured-text create mode 120000 Lang/Perl/Terminal-control-Cursor-movement create mode 120000 Lang/Perl/Terminal-control-Display-an-extended-character create mode 120000 Lang/Perl/Terminal-control-Hiding-the-cursor create mode 120000 Lang/Perl/Terminal-control-Inverse-video create mode 120000 Lang/Perl/Terminal-control-Unicode-output create mode 120000 Lang/Perl/Total-circles-area create mode 120000 Lang/Perl/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/Perl/Verify-distribution-uniformity-Naive create mode 120000 Lang/Perl/Video-display-modes create mode 120000 Lang/Perl/Voronoi-diagram create mode 120000 Lang/Perl/World-Cup-group-stage create mode 120000 Lang/Perl/Zhang-Suen-thinning-algorithm create mode 120000 Lang/Phix/Accumulator-factory create mode 120000 Lang/Phix/Active-object create mode 120000 Lang/Phix/Bitwise-IO create mode 120000 Lang/Phix/Carmichael-3-strong-pseudoprimes create mode 120000 Lang/Phix/Check-Machin-like-formulas create mode 120000 Lang/Phix/Checkpoint-synchronization create mode 120000 Lang/Phix/Chinese-remainder-theorem create mode 120000 Lang/Phix/Circles-of-given-radius-through-two-points create mode 120000 Lang/Phix/Color-quantization create mode 120000 Lang/Phix/Continued-fraction-Arithmetic-Construct-from-rational-number create mode 120000 Lang/Phix/Create-a-file-on-magnetic-tape create mode 120000 Lang/Phix/Cut-a-rectangle create mode 120000 Lang/Phix/DNS-query create mode 120000 Lang/Phix/Deconvolution-2D+ create mode 120000 Lang/Phix/Events create mode 120000 Lang/Phix/File-modification-time create mode 120000 Lang/Phix/Find-largest-left-truncatable-prime-in-a-given-base create mode 120000 Lang/Phix/Flipping-bits-game create mode 120000 Lang/Phix/Formal-power-series create mode 120000 Lang/Phix/Fractran create mode 120000 Lang/Phix/Function-frequency create mode 120000 Lang/Phix/Gaussian-elimination create mode 120000 Lang/Phix/Handle-a-signal create mode 120000 Lang/Phix/Hickerson-series-of-almost-integers create mode 120000 Lang/Phix/Hofstadter-Conway-$10,000-sequence create mode 120000 Lang/Phix/Hofstadter-Figure-Figure-sequences create mode 120000 Lang/Phix/Hofstadter-Q-sequence create mode 120000 Lang/Phix/Hostname create mode 120000 Lang/Phix/Hough-transform create mode 120000 Lang/Phix/Image-convolution create mode 120000 Lang/Phix/Image-noise create mode 120000 Lang/Phix/Introspection create mode 120000 Lang/Phix/Inverted-syntax create mode 120000 Lang/Phix/K-d-tree create mode 120000 Lang/Phix/K-means++-clustering create mode 120000 Lang/Phix/Mad-Libs create mode 120000 Lang/Phix/Magic-squares-of-odd-order create mode 120000 Lang/Phix/Median-filter create mode 120000 Lang/Phix/Metaprogramming create mode 120000 Lang/Phix/Modular-exponentiation create mode 120000 Lang/Phix/Modular-inverse create mode 120000 Lang/Phix/Multiple-regression create mode 120000 Lang/Phix/Multiplicative-order create mode 120000 Lang/Phix/Munching-squares create mode 120000 Lang/Phix/Narcissist create mode 120000 Lang/Phix/Numeric-error-propagation create mode 120000 Lang/Phix/Numerical-integration-Gauss-Legendre-Quadrature create mode 120000 Lang/Phix/Object-serialization create mode 120000 Lang/Phix/Paraffins create mode 120000 Lang/Phix/Parallel-calculations create mode 120000 Lang/Phix/Parse-an-IP-Address create mode 120000 Lang/Phix/Pattern-matching create mode 120000 Lang/Phix/Penneys-game create mode 120000 Lang/Phix/Percentage-difference-between-images create mode 120000 Lang/Phix/Percolation-Bond-percolation create mode 120000 Lang/Phix/Percolation-Mean-cluster-density create mode 120000 Lang/Phix/Percolation-Mean-run-density create mode 120000 Lang/Phix/Percolation-Site-percolation create mode 120000 Lang/Phix/Permutations-Rank-of-a-permutation create mode 120000 Lang/Phix/Pig-the-dice-game create mode 120000 Lang/Phix/Pig-the-dice-game-Player create mode 120000 Lang/Phix/Play-recorded-sounds create mode 120000 Lang/Phix/Polynomial-long-division create mode 120000 Lang/Phix/Problem-of-Apollonius create mode 120000 Lang/Phix/QR-decomposition create mode 120000 Lang/Phix/RSA-code create mode 120000 Lang/Phix/Ranking-methods create mode 120000 Lang/Phix/Rate-counter create mode 120000 Lang/Phix/Rendezvous create mode 120000 Lang/Phix/Resistor-mesh create mode 120000 Lang/Phix/Secure-temporary-file create mode 120000 Lang/Phix/Set-consolidation create mode 120000 Lang/Phix/Set-of-real-numbers create mode 120000 Lang/Phix/Seven-sided-dice-from-five-sided-dice create mode 120000 Lang/Phix/Sokoban create mode 120000 Lang/Phix/Soundex create mode 120000 Lang/Phix/Sparkline-in-unicode create mode 120000 Lang/Phix/Subtractive-generator create mode 120000 Lang/Phix/Text-processing-2 create mode 120000 Lang/Phix/The-ISAAC-Cipher create mode 120000 Lang/Phix/Thieles-interpolation-formula create mode 120000 Lang/Phix/Topic-variable create mode 120000 Lang/Phix/Topological-sort create mode 120000 Lang/Phix/Total-circles-area create mode 120000 Lang/Phix/Truncate-a-file create mode 120000 Lang/Phix/Ulam-spiral--for-primes- create mode 120000 Lang/Phix/Vampire-number create mode 120000 Lang/Phix/Variable-size-Set create mode 120000 Lang/Phix/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/Phix/Verify-distribution-uniformity-Naive create mode 120000 Lang/Phix/Vogels-approximation-method create mode 120000 Lang/Phix/Web-scraping create mode 120000 Lang/Phix/World-Cup-group-stage create mode 120000 Lang/Phix/Write-to-Windows-event-log create mode 120000 Lang/Phix/XML-DOM-serialization create mode 120000 Lang/Phix/Y-combinator create mode 120000 Lang/Phix/Zeckendorf-arithmetic create mode 120000 Lang/Picat/100-doors create mode 120000 Lang/Picat/24-game-Solve create mode 120000 Lang/Picat/99-Bottles-of-Beer create mode 120000 Lang/Picat/Caesar-cipher create mode 120000 Lang/Picat/N-queens-problem create mode 120000 Lang/Picat/Solve-the-no-connection-puzzle create mode 120000 Lang/PicoLisp/Continued-fraction create mode 120000 Lang/Pony/100-doors create mode 120000 Lang/Pony/A+B create mode 120000 Lang/Pony/Accumulator-factory create mode 120000 Lang/Pony/Array-concatenation create mode 120000 Lang/Pony/Sieve-of-Eratosthenes create mode 120000 Lang/PowerBASIC/CRC-32 create mode 120000 Lang/PowerBASIC/Find-common-directory-path create mode 120000 Lang/PowerBASIC/Hello-world-Text create mode 120000 Lang/PowerBASIC/Luhn-test-of-credit-card-numbers create mode 120000 Lang/PowerBASIC/Matrix-transposition create mode 120000 Lang/PowerBASIC/Reverse-a-string create mode 120000 Lang/PowerShell/Unix-ls create mode 120000 Lang/Processing/Anagrams create mode 120000 Lang/Processing/Animation create mode 120000 Lang/Processing/Binary-digits create mode 120000 Lang/Processing/Bulls-and-cows create mode 120000 Lang/Processing/Color-of-a-screen-pixel create mode 120000 Lang/Processing/Fibonacci-sequence create mode 120000 Lang/Processing/Image-noise create mode 120000 Lang/Processing/Include-a-file create mode 120000 Lang/Processing/Josephus-problem create mode 120000 Lang/Processing/Levenshtein-distance create mode 120000 Lang/Processing/Rename-a-file create mode 120000 Lang/Processing/Repeat-a-string create mode 120000 Lang/Prolog/Binary-strings create mode 120000 Lang/Prolog/Calendar create mode 120000 Lang/Prolog/Chat-server create mode 120000 Lang/Prolog/Collections create mode 120000 Lang/Prolog/Compound-data-type create mode 120000 Lang/Prolog/Copy-a-string create mode 120000 Lang/Prolog/Create-an-HTML-table create mode 120000 Lang/Prolog/Day-of-the-week create mode 120000 Lang/Prolog/Exceptions create mode 120000 Lang/Prolog/Five-weekends create mode 120000 Lang/Prolog/Four-bit-adder create mode 120000 Lang/Prolog/Inverted-syntax create mode 120000 Lang/Prolog/Loops-Downward-for create mode 120000 Lang/Prolog/Loops-For create mode 120000 Lang/Prolog/Loops-For-with-a-specified-step create mode 120000 Lang/Prolog/Loops-N-plus-one-half create mode 120000 Lang/Prolog/Metaprogramming create mode 120000 Lang/Prolog/Minesweeper-game create mode 120000 Lang/Prolog/Named-parameters create mode 120000 Lang/Prolog/Penneys-game create mode 120000 Lang/Prolog/Program-name create mode 120000 Lang/Prolog/Rock-paper-scissors create mode 120000 Lang/Pure-Data/100-doors create mode 120000 Lang/PureBasic/Function-prototype create mode 120000 Lang/PureBasic/Hofstadter-Q-sequence create mode 120000 Lang/PureBasic/Quickselect-algorithm create mode 120000 Lang/Python/Bitmap-PPM-conversion-through-a-pipe create mode 120000 Lang/Python/Bitmap-Read-an-image-through-a-pipe create mode 120000 Lang/Python/Catmull-Clark-subdivision-surface create mode 120000 Lang/Python/Checkpoint-synchronization create mode 120000 Lang/Python/Colour-pinstripe-Printer create mode 120000 Lang/Python/Deconvolution-2D+ create mode 120000 Lang/Python/Video-display-modes create mode 120000 Lang/Python/Zeckendorf-arithmetic create mode 120000 Lang/Q/99-Bottles-of-Beer create mode 120000 Lang/Q/Array-concatenation create mode 120000 Lang/Q/Averages-Arithmetic-mean create mode 120000 Lang/Q/Averages-Mode create mode 120000 Lang/Q/CSV-data-manipulation create mode 120000 Lang/Q/Detect-division-by-zero create mode 120000 Lang/Q/Filter create mode 120000 Lang/Q/Flatten-a-list create mode 120000 Lang/Q/Integer-sequence create mode 120000 Lang/Q/Leap-year create mode 120000 Lang/Q/Luhn-test-of-credit-card-numbers create mode 120000 Lang/Q/Operator-precedence create mode 120000 Lang/Q/SEDOLs create mode 120000 Lang/Q/Sum-multiples-of-3-and-5 create mode 120000 Lang/Q/Sum-of-a-series create mode 120000 Lang/Q/Sum-of-squares create mode 120000 Lang/R/Average-loop-length create mode 120000 Lang/R/Binary-digits create mode 120000 Lang/R/CRC-32 create mode 120000 Lang/R/Check-Machin-like-formulas create mode 120000 Lang/R/Convert-decimal-number-to-rational create mode 120000 Lang/R/Generate-Chess960-starting-position create mode 120000 Lang/R/Hello-world-Newline-omission create mode 120000 Lang/R/Pi create mode 120000 Lang/R/Remove-duplicate-elements create mode 120000 Lang/R/SHA-1 create mode 120000 Lang/R/SHA-256 create mode 120000 Lang/R/Topswops create mode 120000 Lang/REXX/Animation create mode 120000 Lang/REXX/Galton-box-animation create mode 120000 Lang/REXX/Longest-increasing-subsequence create mode 120000 Lang/REXX/Polymorphic-copy create mode 120000 Lang/REXX/User-input-Graphical create mode 120000 Lang/REXX/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/REXX/World-Cup-group-stage create mode 120000 Lang/RPG/99-Bottles-of-Beer create mode 120000 Lang/RPG/Leap-year create mode 120000 Lang/RPL/Dot-product create mode 120000 Lang/Red/24-game create mode 120000 Lang/Red/Bulls-and-cows create mode 120000 Lang/Red/Copy-a-string create mode 120000 Lang/Red/Create-an-HTML-table create mode 120000 Lang/Red/Guess-the-number create mode 120000 Lang/Red/Sorting-algorithms-Quicksort create mode 120000 Lang/Ring/Sokoban create mode 120000 Lang/Robotic/A+B create mode 120000 Lang/Robotic/Arithmetic-Integer create mode 120000 Lang/Robotic/Arrays create mode 120000 Lang/Robotic/Bitwise-operations create mode 120000 Lang/Robotic/Comments create mode 120000 Lang/Robotic/Empty-program create mode 120000 Lang/Robotic/FizzBuzz create mode 120000 Lang/Robotic/Reverse-a-string create mode 120000 Lang/Robotic/String-length create mode 120000 Lang/Robotic/User-input-Text create mode 120000 Lang/Ruby/HTTPS-Authenticated create mode 120000 Lang/Ruby/HTTPS-Client-authenticated create mode 120000 Lang/Ruby/SQL-based-authentication create mode 120000 Lang/Rust/Active-Directory-Connect create mode 120000 Lang/Rust/Active-object create mode 120000 Lang/Rust/Anagrams-Deranged-anagrams create mode 120000 Lang/Rust/Anonymous-recursion create mode 120000 Lang/Rust/Append-a-record-to-the-end-of-a-text-file create mode 120000 Lang/Rust/Arithmetic-evaluation create mode 120000 Lang/Rust/Arithmetic-geometric-mean-Calculate-Pi create mode 120000 Lang/Rust/Bitmap create mode 120000 Lang/Rust/Bitmap-Bresenhams-line-algorithm create mode 120000 Lang/Rust/Bitmap-Flood-fill create mode 120000 Lang/Rust/Box-the-compass create mode 120000 Lang/Rust/CSV-data-manipulation create mode 120000 Lang/Rust/CSV-to-HTML-translation create mode 120000 Lang/Rust/Calendar create mode 120000 Lang/Rust/Conways-Game-of-Life create mode 120000 Lang/Rust/Count-in-factors create mode 120000 Lang/Rust/Create-a-file-on-magnetic-tape create mode 120000 Lang/Rust/Define-a-primitive-data-type create mode 120000 Lang/Rust/Delegates create mode 120000 Lang/Rust/Documentation create mode 120000 Lang/Rust/Environment-variables create mode 120000 Lang/Rust/Euler-method create mode 120000 Lang/Rust/Events create mode 120000 Lang/Rust/Exceptions-Catch-an-exception-thrown-in-a-nested-call create mode 120000 Lang/Rust/Find-common-directory-path create mode 120000 Lang/Rust/Floyds-triangle create mode 120000 Lang/Rust/Fork create mode 120000 Lang/Rust/Four-bit-adder create mode 120000 Lang/Rust/Gaussian-elimination create mode 120000 Lang/Rust/Generator-Exponential create mode 120000 Lang/Rust/History-variables create mode 120000 Lang/Rust/Host-introspection create mode 120000 Lang/Rust/Hostname create mode 120000 Lang/Rust/I-before-E-except-after-C create mode 120000 Lang/Rust/Inheritance-Multiple create mode 120000 Lang/Rust/Inheritance-Single create mode 120000 Lang/Rust/Josephus-problem create mode 120000 Lang/Rust/Knapsack-problem-Continuous create mode 120000 Lang/Rust/LU-decomposition create mode 120000 Lang/Rust/Largest-int-from-concatenated-ints create mode 120000 Lang/Rust/Longest-string-challenge create mode 120000 Lang/Rust/MD5-Implementation create mode 120000 Lang/Rust/Machine-code create mode 120000 Lang/Rust/Mad-Libs create mode 120000 Lang/Rust/Main-step-of-GOST-28147-89 create mode 120000 Lang/Rust/Maze-generation create mode 120000 Lang/Rust/Maze-solving create mode 120000 Lang/Rust/Memory-allocation create mode 120000 Lang/Rust/Modular-exponentiation create mode 120000 Lang/Rust/Morse-code create mode 120000 Lang/Rust/Move-to-front-algorithm create mode 120000 Lang/Rust/Multiple-distinct-objects create mode 120000 Lang/Rust/Number-names create mode 120000 Lang/Rust/Object-serialization create mode 120000 Lang/Rust/One-dimensional-cellular-automata create mode 120000 Lang/Rust/Order-two-numerical-lists create mode 120000 Lang/Rust/Percentage-difference-between-images create mode 120000 Lang/Rust/Pi create mode 120000 Lang/Rust/Regular-expressions create mode 120000 Lang/Rust/Roots-of-unity create mode 120000 Lang/Rust/Sierpinski-carpet create mode 120000 Lang/Rust/Sort-an-array-of-composite-structures create mode 120000 Lang/Rust/Strip-comments-from-a-string create mode 120000 Lang/Rust/Sudoku create mode 120000 Lang/Rust/Terminal-control-Clear-the-screen create mode 120000 Lang/Rust/Ternary-logic create mode 120000 Lang/Rust/Trabb-Pardo-Knuth-algorithm create mode 120000 Lang/Rust/URL-decoding create mode 120000 Lang/Rust/URL-encoding create mode 120000 Lang/Rust/Variable-size-Get create mode 120000 Lang/Rust/Write-language-name-in-3D-ASCII create mode 120000 Lang/Rust/XML-Output create mode 120000 Lang/SQL/Arithmetic-geometric-mean create mode 120000 Lang/SQL/Averages-Mode create mode 120000 Lang/SQL/Averages-Pythagorean-means create mode 120000 Lang/SQL/Day-of-the-week create mode 120000 Lang/SQL/Hamming-numbers create mode 120000 Lang/SQL/Sort-an-array-of-composite-structures create mode 120000 Lang/SQL/Sudoku create mode 120000 Lang/Scala/Flipping-bits-game create mode 120000 Lang/Scala/Guess-the-number-With-feedback--player- create mode 120000 Lang/Scala/Honeycombs create mode 120000 Lang/Scala/Ludic-numbers create mode 120000 Lang/Scala/Morse-code create mode 120000 Lang/Scala/Numerical-integration-Gauss-Legendre-Quadrature create mode 120000 Lang/Scala/Pig-the-dice-game create mode 120000 Lang/Scala/Polynomial-regression create mode 120000 Lang/Scala/Self-referential-sequence create mode 120000 Lang/Scala/Solve-the-no-connection-puzzle create mode 120000 Lang/Scala/Truncatable-primes create mode 120000 Lang/Scala/Universal-Turing-machine create mode 120000 Lang/Scala/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/Scala/Voronoi-diagram create mode 120000 Lang/Scheme/AKS-test-for-primes create mode 120000 Lang/Scheme/Deepcopy create mode 120000 Lang/Scheme/Pi create mode 120000 Lang/Scheme/Zeckendorf-number-representation create mode 120000 Lang/Seed7/Abundant,-deficient-and-perfect-number-classifications create mode 120000 Lang/Seed7/Almost-prime create mode 120000 Lang/Seed7/Bernoulli-numbers create mode 120000 Lang/Seed7/Bitcoin-address-validation create mode 120000 Lang/Seed7/Bitcoin-public-point-to-address create mode 120000 Lang/Seed7/Bitwise-IO create mode 120000 Lang/Seed7/Pernicious-numbers create mode 120000 Lang/Seed7/Phrase-reversals create mode 120000 Lang/Seed7/RIPEMD-160 create mode 120000 Lang/Seed7/Start-from-a-main-routine create mode 120000 Lang/Seed7/Terminal-control-Unicode-output create mode 120000 Lang/Seed7/Unix-ls create mode 120000 Lang/Sidef/Flow-control-structures create mode 120000 Lang/Sidef/Generate-Chess960-starting-position create mode 120000 Lang/Sidef/Iterated-digits-squaring create mode 120000 Lang/Sidef/Metronome create mode 120000 Lang/Sidef/Percolation-Site-percolation create mode 120000 Lang/Sidef/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/Simula/Anagrams-Deranged-anagrams create mode 120000 Lang/Simula/Average-loop-length create mode 120000 Lang/Simula/Balanced-brackets create mode 120000 Lang/Simula/Binary-digits create mode 120000 Lang/Simula/Binary-search create mode 120000 Lang/Simula/Bitwise-operations create mode 120000 Lang/Simula/Calendar create mode 120000 Lang/Simula/Dining-philosophers create mode 120000 Lang/Simula/Perfect-numbers create mode 120000 Lang/Simula/Pi create mode 120000 Lang/Simula/Prime-decomposition create mode 120000 Lang/Simula/Reverse-a-string create mode 120000 Lang/Simula/Zeckendorf-number-representation create mode 120000 Lang/Smalltalk/Calendar create mode 120000 Lang/Smalltalk/Delegates create mode 120000 Lang/Smalltalk/Identity-matrix create mode 120000 Lang/Smalltalk/Loops-Continue create mode 120000 Lang/Smalltalk/Run-length-encoding create mode 120000 Lang/SmileBASIC/99-Bottles-of-Beer create mode 120000 Lang/SmileBASIC/Ackermann-function create mode 120000 Lang/SmileBASIC/Character-codes create mode 120000 Lang/SmileBASIC/Color-of-a-screen-pixel create mode 120000 Lang/SmileBASIC/Colour-bars-Display create mode 120000 Lang/SmileBASIC/Colour-pinstripe-Display create mode 120000 Lang/SmileBASIC/Digital-root create mode 120000 Lang/SmileBASIC/Hello-world-Graphical create mode 120000 Lang/SmileBASIC/Quine create mode 120000 Lang/SmileBASIC/Terminal-control-Clear-the-screen create mode 120000 Lang/Spin/100-doors create mode 120000 Lang/Spin/Factorial create mode 120000 Lang/Spin/Fibonacci-sequence create mode 120000 Lang/Spin/Loops-Break create mode 120000 Lang/Spin/Loops-Continue create mode 120000 Lang/Spin/Loops-Do-while create mode 120000 Lang/Spin/Loops-Downward-for create mode 120000 Lang/Spin/Loops-For create mode 120000 Lang/Spin/Loops-For-with-a-specified-step create mode 120000 Lang/Spin/Loops-Infinite create mode 120000 Lang/Spin/Loops-N-plus-one-half create mode 120000 Lang/Spin/Loops-While create mode 120000 Lang/Spin/Mandelbrot-set create mode 120000 Lang/Standard-ML/Element-wise-operations create mode 120000 Lang/Standard-ML/Matrix-multiplication create mode 120000 Lang/Standard-ML/QR-decomposition create mode 120000 Lang/Stata/First-class-functions create mode 120000 Lang/Stata/Logical-operations create mode 120000 Lang/Stata/Monty-Hall-problem create mode 120000 Lang/Stata/Sorting-algorithms-Bubble-sort create mode 120000 Lang/Stata/Sorting-algorithms-Heapsort create mode 120000 Lang/SuperCollider/Call-an-object-method create mode 120000 Lang/Swift/Atomic-updates create mode 120000 Lang/Swift/Break-OO-privacy create mode 120000 Lang/Swift/Bulls-and-cows create mode 120000 Lang/Swift/Cholesky-decomposition create mode 120000 Lang/Swift/Circles-of-given-radius-through-two-points create mode 120000 Lang/Swift/Closest-pair-problem create mode 120000 Lang/Swift/Combinations-and-permutations create mode 120000 Lang/Swift/Count-the-coins create mode 120000 Lang/Swift/Deal-cards-for-FreeCell create mode 120000 Lang/Swift/Enforced-immutability create mode 120000 Lang/Swift/Evolutionary-algorithm create mode 120000 Lang/Swift/Exponentiation-operator create mode 120000 Lang/Swift/Extensible-prime-generator create mode 120000 Lang/Swift/Find-largest-left-truncatable-prime-in-a-given-base create mode 120000 Lang/Swift/Forward-difference create mode 120000 Lang/Swift/Harshad-or-Niven-series create mode 120000 Lang/Swift/Identity-matrix create mode 120000 Lang/Swift/Iterated-digits-squaring create mode 120000 Lang/Swift/Knapsack-problem-0-1 create mode 120000 Lang/Swift/Letter-frequency create mode 120000 Lang/Swift/Longest-increasing-subsequence create mode 120000 Lang/Swift/Look-and-say-sequence create mode 120000 Lang/Swift/Lucas-Lehmer-test create mode 120000 Lang/Swift/Machine-code create mode 120000 Lang/Swift/Magic-squares-of-odd-order create mode 120000 Lang/Swift/Map-range create mode 120000 Lang/Swift/Monty-Hall-problem create mode 120000 Lang/Swift/Multifactorial create mode 120000 Lang/Swift/N-queens-problem create mode 120000 Lang/Swift/Number-names create mode 120000 Lang/Swift/Numerical-integration create mode 120000 Lang/Swift/Order-disjoint-list-items create mode 120000 Lang/Swift/Percolation-Bond-percolation create mode 120000 Lang/Swift/Prime-decomposition create mode 120000 Lang/Swift/Quaternion-type create mode 120000 Lang/Swift/Rep-string create mode 120000 Lang/Swift/Rock-paper-scissors create mode 120000 Lang/Swift/Sorting-algorithms-Cocktail-sort create mode 120000 Lang/Swift/Stern-Brocot-sequence create mode 120000 Lang/Swift/Top-rank-per-group create mode 120000 Lang/Swift/Vampire-number create mode 120000 Lang/Swift/Van-der-Corput-sequence create mode 120000 Lang/TI-83-BASIC/Digital-root create mode 120000 Lang/TI-83-BASIC/Fractran create mode 120000 Lang/TI-83-BASIC/Reduced-row-echelon-form create mode 120000 Lang/Transact-SQL/Haversine-formula create mode 120000 Lang/TypeScript/99-Bottles-of-Beer create mode 120000 Lang/TypeScript/Function-composition create mode 120000 Lang/TypeScript/Haversine-formula create mode 120000 Lang/TypeScript/Palindrome-detection create mode 120000 Lang/TypeScript/Pi create mode 120000 Lang/UNIX-Shell/N-queens-problem create mode 120000 Lang/VBA/9-billion-names-of-God-the-integer create mode 120000 Lang/VBA/AKS-test-for-primes create mode 120000 Lang/VBA/Ackermann-function create mode 120000 Lang/VBA/Almost-prime create mode 120000 Lang/VBA/Arithmetic-geometric-mean create mode 120000 Lang/VBA/Arrays create mode 120000 Lang/VBA/Assertions create mode 120000 Lang/VBA/Average-loop-length create mode 120000 Lang/VBA/Averages-Arithmetic-mean create mode 120000 Lang/VBA/Averages-Mean-angle create mode 120000 Lang/VBA/Averages-Mean-time-of-day create mode 120000 Lang/VBA/Averages-Median create mode 120000 Lang/VBA/Averages-Mode create mode 120000 Lang/VBA/Averages-Pythagorean-means create mode 120000 Lang/VBA/Averages-Simple-moving-average create mode 120000 Lang/VBA/Boolean-values create mode 120000 Lang/VBA/Box-the-compass create mode 120000 Lang/VBA/CSV-to-HTML-translation create mode 120000 Lang/VBA/Call-a-function create mode 120000 Lang/VBA/Case-sensitivity-of-identifiers create mode 120000 Lang/VBA/Catamorphism create mode 120000 Lang/VBA/Chinese-remainder-theorem create mode 120000 Lang/VBA/Circles-of-given-radius-through-two-points create mode 120000 Lang/VBA/Compound-data-type create mode 120000 Lang/VBA/Concurrent-computing create mode 120000 Lang/VBA/Continued-fraction create mode 120000 Lang/VBA/Copy-a-string create mode 120000 Lang/VBA/Count-the-coins create mode 120000 Lang/VBA/Create-a-file create mode 120000 Lang/VBA/Digital-root create mode 120000 Lang/VBA/Dining-philosophers create mode 120000 Lang/VBA/Dot-product create mode 120000 Lang/VBA/Euler-method create mode 120000 Lang/VBA/Exponentiation-operator create mode 120000 Lang/VBA/Fractran create mode 120000 Lang/VBA/Gaussian-elimination create mode 120000 Lang/VBA/Generator-Exponential create mode 120000 Lang/VBA/Hailstone-sequence create mode 120000 Lang/VBA/Hamming-numbers create mode 120000 Lang/VBA/Haversine-formula create mode 120000 Lang/VBA/Hello-world-Graphical create mode 120000 Lang/VBA/Hello-world-Standard-error create mode 120000 Lang/VBA/Heronian-triangles create mode 120000 Lang/VBA/Hofstadter-Conway-$10,000-sequence create mode 120000 Lang/VBA/Hofstadter-Figure-Figure-sequences create mode 120000 Lang/VBA/Hofstadter-Q-sequence create mode 120000 Lang/VBA/Holidays-related-to-Easter create mode 120000 Lang/VBA/IBAN create mode 120000 Lang/VBA/Identity-matrix create mode 120000 Lang/VBA/Input-loop create mode 120000 Lang/VBA/Integer-comparison create mode 120000 Lang/VBA/Jensens-Device create mode 120000 Lang/VBA/Jump-anywhere create mode 120000 Lang/VBA/Knuth-shuffle create mode 120000 Lang/VBA/LU-decomposition create mode 120000 Lang/VBA/Leap-year create mode 120000 Lang/VBA/Least-common-multiple create mode 120000 Lang/VBA/Levenshtein-distance create mode 120000 Lang/VBA/Linear-congruential-generator create mode 120000 Lang/VBA/Loops-Break create mode 120000 Lang/VBA/Loops-Continue create mode 120000 Lang/VBA/Loops-Do-while create mode 120000 Lang/VBA/Loops-Downward-for create mode 120000 Lang/VBA/Loops-N-plus-one-half create mode 120000 Lang/VBA/Loops-Nested create mode 120000 Lang/VBA/Loops-While create mode 120000 Lang/VBA/Matrix-exponentiation-operator create mode 120000 Lang/VBA/Matrix-multiplication create mode 120000 Lang/VBA/Matrix-transposition create mode 120000 Lang/VBA/Modular-inverse create mode 120000 Lang/VBA/Mutual-recursion create mode 120000 Lang/VBA/Named-parameters create mode 120000 Lang/VBA/Narcissist create mode 120000 Lang/VBA/Narcissistic-decimal-number create mode 120000 Lang/VBA/Non-decimal-radices-Convert create mode 120000 Lang/VBA/Nth create mode 120000 Lang/VBA/Nth-root create mode 120000 Lang/VBA/Null-object create mode 120000 Lang/VBA/Number-names create mode 120000 Lang/VBA/Number-reversal-game create mode 120000 Lang/VBA/Optional-parameters create mode 120000 Lang/VBA/Order-two-numerical-lists create mode 120000 Lang/VBA/Pascals-triangle create mode 120000 Lang/VBA/Perfect-numbers create mode 120000 Lang/VBA/Pernicious-numbers create mode 120000 Lang/VBA/Plot-coordinate-pairs create mode 120000 Lang/VBA/Pointers-and-references create mode 120000 Lang/VBA/Polynomial-long-division create mode 120000 Lang/VBA/Polynomial-regression create mode 120000 Lang/VBA/Power-set create mode 120000 Lang/VBA/Priority-queue create mode 120000 Lang/VBA/Program-termination create mode 120000 Lang/VBA/Pythagorean-triples create mode 120000 Lang/VBA/QR-decomposition create mode 120000 Lang/VBA/Quaternion-type create mode 120000 Lang/VBA/Queue-Definition create mode 120000 Lang/VBA/Queue-Usage create mode 120000 Lang/VBA/Quickselect-algorithm create mode 120000 Lang/VBA/Quine create mode 120000 Lang/VBA/Reduced-row-echelon-form create mode 120000 Lang/VBA/Roman-numerals-Encode create mode 120000 Lang/VBA/Roots-of-unity create mode 120000 Lang/VBA/Search-a-list create mode 120000 Lang/VBA/Set create mode 120000 Lang/VBA/Set-consolidation create mode 120000 Lang/VBA/Seven-sided-dice-from-five-sided-dice create mode 120000 Lang/VBA/Short-circuit-evaluation create mode 120000 Lang/VBA/Sierpinski-carpet create mode 120000 Lang/VBA/Sierpinski-triangle create mode 120000 Lang/VBA/Sieve-of-Eratosthenes create mode 120000 Lang/VBA/Sorting-algorithms-Bead-sort create mode 120000 Lang/VBA/Sorting-algorithms-Bogosort create mode 120000 Lang/VBA/Sorting-algorithms-Bubble-sort create mode 120000 Lang/VBA/Sorting-algorithms-Cocktail-sort create mode 120000 Lang/VBA/Sorting-algorithms-Comb-sort create mode 120000 Lang/VBA/Sorting-algorithms-Counting-sort create mode 120000 Lang/VBA/Sorting-algorithms-Gnome-sort create mode 120000 Lang/VBA/Sorting-algorithms-Insertion-sort create mode 120000 Lang/VBA/Statistics-Basic create mode 120000 Lang/VBA/String-matching create mode 120000 Lang/VBA/Strip-block-comments create mode 120000 Lang/VBA/Strip-whitespace-from-a-string-Top-and-tail create mode 120000 Lang/VBA/Substring create mode 120000 Lang/VBA/Sum-and-product-of-an-array create mode 120000 Lang/VBA/Sum-of-a-series create mode 120000 Lang/VBA/Sum-of-squares create mode 120000 Lang/VBA/Time-a-function create mode 120000 Lang/VBA/Top-rank-per-group create mode 120000 Lang/VBA/Total-circles-area create mode 120000 Lang/VBA/Tree-traversal create mode 120000 Lang/VBA/Trigonometric-functions create mode 120000 Lang/VBA/Twelve-statements create mode 120000 Lang/VBA/Universal-Turing-machine create mode 120000 Lang/VBA/User-input-Text create mode 120000 Lang/VBA/Van-der-Corput-sequence create mode 120000 Lang/VBA/Vector-products create mode 120000 Lang/VBA/Verify-distribution-uniformity-Chi-squared-test create mode 120000 Lang/VBA/Write-float-arrays-to-a-text-file create mode 120000 Lang/VBA/Y-combinator create mode 120000 Lang/VBA/Zebra-puzzle create mode 120000 Lang/VBA/Zeckendorf-number-representation create mode 120000 Lang/VBA/Zero-to-the-zero-power create mode 120000 Lang/VBA/Zhang-Suen-thinning-algorithm create mode 120000 Lang/VBScript/Align-columns create mode 120000 Lang/VBScript/Bitmap-Bresenhams-line-algorithm create mode 120000 Lang/VBScript/Boolean-values create mode 120000 Lang/VBScript/Gaussian-elimination create mode 120000 Lang/VBScript/Last-letter-first-letter create mode 120000 Lang/VBScript/Queue-Definition create mode 120000 Lang/VBScript/Roman-numerals-Decode create mode 120000 Lang/VHDL/Arrays create mode 120000 Lang/Vala/Hello-world-Graphical create mode 120000 Lang/Verilog/Greatest-common-divisor create mode 120000 Lang/Visual-Basic-.NET/Abundant,-deficient-and-perfect-number-classifications create mode 120000 Lang/Visual-Basic-.NET/Almost-prime create mode 120000 Lang/Visual-Basic-.NET/Apply-a-callback-to-an-array create mode 120000 Lang/Visual-Basic-.NET/Arbitrary-precision-integers--included- create mode 120000 Lang/Visual-Basic-.NET/Arithmetic-geometric-mean create mode 120000 Lang/Visual-Basic-.NET/Arithmetic-geometric-mean-Calculate-Pi create mode 120000 Lang/Visual-Basic-.NET/Averages-Mean-angle create mode 120000 Lang/Visual-Basic-.NET/Averages-Pythagorean-means create mode 120000 Lang/Visual-Basic-.NET/Break-OO-privacy create mode 120000 Lang/Visual-Basic-.NET/CSV-to-HTML-translation create mode 120000 Lang/Visual-Basic-.NET/Caesar-cipher create mode 120000 Lang/Visual-Basic-.NET/Calendar create mode 120000 Lang/Visual-Basic-.NET/Calendar---for-REAL-programmers create mode 120000 Lang/Visual-Basic-.NET/Catalan-numbers create mode 120000 Lang/Visual-Basic-.NET/Chat-server create mode 120000 Lang/Visual-Basic-.NET/Check-Machin-like-formulas create mode 120000 Lang/Visual-Basic-.NET/Chinese-remainder-theorem create mode 120000 Lang/Visual-Basic-.NET/Circles-of-given-radius-through-two-points create mode 120000 Lang/Visual-Basic-.NET/Comma-quibbling create mode 120000 Lang/Visual-Basic-.NET/Compile-time-calculation create mode 120000 Lang/Visual-Basic-.NET/Continued-fraction create mode 120000 Lang/Visual-Basic-.NET/Count-occurrences-of-a-substring create mode 120000 Lang/Visual-Basic-.NET/Create-a-two-dimensional-array-at-runtime create mode 120000 Lang/Visual-Basic-.NET/Create-an-HTML-table create mode 120000 Lang/Visual-Basic-.NET/Currying create mode 120000 Lang/Visual-Basic-.NET/Digital-root create mode 120000 Lang/Visual-Basic-.NET/Dot-product create mode 120000 Lang/Visual-Basic-.NET/Empty-string create mode 120000 Lang/Visual-Basic-.NET/Even-or-odd create mode 120000 Lang/Visual-Basic-.NET/Exceptions-Catch-an-exception-thrown-in-a-nested-call create mode 120000 Lang/Visual-Basic-.NET/Factorial create mode 120000 Lang/Visual-Basic-.NET/Floyds-triangle create mode 120000 Lang/Visual-Basic-.NET/GUI-Maximum-window-dimensions create mode 120000 Lang/Visual-Basic-.NET/Generator-Exponential create mode 120000 Lang/Visual-Basic-.NET/Guess-the-number create mode 120000 Lang/Visual-Basic-.NET/Haversine-formula create mode 120000 Lang/Visual-Basic-.NET/Hello-world-Newline-omission create mode 120000 Lang/Visual-Basic-.NET/Hello-world-Standard-error create mode 120000 Lang/Visual-Basic-.NET/Higher-order-functions create mode 120000 Lang/Visual-Basic-.NET/Horners-rule-for-polynomial-evaluation create mode 120000 Lang/Visual-Basic-.NET/I-before-E-except-after-C create mode 120000 Lang/Visual-Basic-.NET/Josephus-problem create mode 120000 Lang/Visual-Basic-.NET/Kaprekar-numbers create mode 120000 Lang/Visual-Basic-.NET/Leap-year create mode 120000 Lang/Visual-Basic-.NET/Loop-over-multiple-arrays-simultaneously create mode 120000 Lang/Visual-Basic-.NET/Loops-Break create mode 120000 Lang/Visual-Basic-.NET/Loops-Nested create mode 120000 Lang/Visual-Basic-.NET/Mad-Libs create mode 120000 Lang/Visual-Basic-.NET/Make-directory-path create mode 120000 Lang/Visual-Basic-.NET/Modular-exponentiation create mode 120000 Lang/Visual-Basic-.NET/Palindrome-detection create mode 120000 Lang/Visual-Basic-.NET/Parsing-RPN-to-infix-conversion create mode 120000 Lang/Visual-Basic-.NET/Parsing-Shunting-yard-algorithm create mode 120000 Lang/Visual-Basic-.NET/Partial-function-application create mode 120000 Lang/Visual-Basic-.NET/Pascals-triangle create mode 120000 Lang/Visual-Basic-.NET/Pernicious-numbers create mode 120000 Lang/Visual-Basic-.NET/Pi create mode 120000 Lang/Visual-Basic-.NET/Pick-random-element create mode 120000 Lang/Visual-Basic-.NET/Quaternion-type create mode 120000 Lang/Visual-Basic-.NET/Quine create mode 120000 Lang/Visual-Basic-.NET/RSA-code create mode 120000 Lang/Visual-Basic-.NET/Short-circuit-evaluation create mode 120000 Lang/Visual-Basic-.NET/Sleep create mode 120000 Lang/Visual-Basic-.NET/Start-from-a-main-routine create mode 120000 Lang/Visual-Basic-.NET/Stern-Brocot-sequence create mode 120000 Lang/Visual-Basic-.NET/String-length create mode 120000 Lang/Visual-Basic-.NET/Sum-and-product-of-an-array create mode 120000 Lang/Visual-Basic-.NET/Terminal-control-Clear-the-screen create mode 120000 Lang/Visual-Basic-.NET/The-Twelve-Days-of-Christmas create mode 120000 Lang/Visual-Basic-.NET/Trigonometric-functions create mode 120000 Lang/Visual-Basic-.NET/Unicode-strings create mode 120000 Lang/Visual-Basic-.NET/Van-der-Corput-sequence create mode 120000 Lang/Visual-Basic-.NET/Write-language-name-in-3D-ASCII create mode 120000 Lang/Visual-Basic-.NET/Zero-to-the-zero-power create mode 120000 Lang/Visual-Basic/CRC-32 create mode 120000 Lang/Visual-Basic/Count-the-coins create mode 120000 Lang/Visual-Basic/Dot-product create mode 120000 Lang/Visual-Basic/Environment-variables create mode 120000 Lang/Visual-Basic/Factorial create mode 120000 Lang/Visual-Basic/File-size create mode 120000 Lang/Visual-Basic/Find-common-directory-path create mode 120000 Lang/Visual-Basic/Greatest-common-divisor create mode 120000 Lang/Visual-Basic/HTTP create mode 120000 Lang/Visual-Basic/HTTPS create mode 120000 Lang/Visual-Basic/HTTPS-Authenticated create mode 120000 Lang/Visual-Basic/Hello-world-Text create mode 120000 Lang/Visual-Basic/Hostname create mode 120000 Lang/Visual-Basic/Identity-matrix create mode 120000 Lang/Visual-Basic/Levenshtein-distance create mode 120000 Lang/Visual-Basic/Literals-Floating-point create mode 120000 Lang/Visual-Basic/Literals-Integer create mode 120000 Lang/Visual-Basic/Literals-String create mode 120000 Lang/Visual-Basic/Luhn-test-of-credit-card-numbers create mode 120000 Lang/Visual-Basic/Matrix-transposition create mode 120000 Lang/Visual-Basic/Pi create mode 120000 Lang/Visual-Basic/Pythagorean-triples create mode 120000 Lang/Visual-Basic/Read-entire-file create mode 120000 Lang/Visual-Basic/Repeat-a-string create mode 120000 Lang/Visual-Basic/Reverse-a-string create mode 120000 Lang/Visual-Basic/String-case create mode 120000 Lang/Visual-Objects/Comments create mode 120000 Lang/Visual-Objects/Create-a-file create mode 120000 Lang/Visual-Objects/Day-of-the-week create mode 120000 Lang/X86-Assembly/Caesar-cipher create mode 120000 Lang/X86-Assembly/FizzBuzz create mode 120000 Lang/XPath-2.0/Tokenize-a-string create mode 120000 Lang/Xojo/100-doors create mode 120000 Lang/Xojo/Bitmap create mode 120000 Lang/Xojo/Comments create mode 120000 Lang/Xojo/Even-or-odd create mode 120000 Lang/Xojo/Fibonacci-sequence create mode 120000 Lang/Xojo/FizzBuzz create mode 120000 Lang/Xojo/Function-definition create mode 120000 Lang/Xojo/LZW-compression create mode 120000 Lang/Xojo/Literals-String create mode 120000 Lang/Xojo/Sieve-of-Eratosthenes create mode 120000 Lang/Xojo/Sorting-algorithms-Bubble-sort create mode 120000 Lang/Xojo/String-prepend create mode 120000 Lang/ZX-Spectrum-Basic/Create-a-two-dimensional-array-at-runtime create mode 120000 Lang/ZX-Spectrum-Basic/Draw-a-clock create mode 120000 Lang/ZX-Spectrum-Basic/Extend-your-language create mode 120000 Lang/ZX-Spectrum-Basic/Function-composition create mode 120000 Lang/ZX-Spectrum-Basic/Hello-world-Text create mode 120000 Lang/ZX-Spectrum-Basic/Jensens-Device create mode 120000 Lang/ZX-Spectrum-Basic/Josephus-problem create mode 120000 Lang/ZX-Spectrum-Basic/Sorting-algorithms-Bubble-sort create mode 120000 Lang/ZX-Spectrum-Basic/Sorting-algorithms-Cocktail-sort create mode 100644 Task/100-doors/00META.yaml create mode 100644 Task/100-doors/ARM-Assembly/100-doors-1.arm create mode 100644 Task/100-doors/ARM-Assembly/100-doors-2.arm create mode 100644 Task/100-doors/B/100-doors.b create mode 100644 Task/100-doors/BASIC/100-doors-10.basic create mode 100644 Task/100-doors/BASIC/100-doors-9.basic create mode 100644 Task/100-doors/Dart/100-doors-3.dart create mode 100644 Task/100-doors/Fish/100-doors.fish create mode 100644 Task/100-doors/Free-Pascal/100-doors.free create mode 100644 Task/100-doors/Ol/100-doors.ol create mode 100644 Task/100-doors/PARI-GP/100-doors-3.pari create mode 100644 Task/100-doors/Picat/100-doors-1.picat create mode 100644 Task/100-doors/Picat/100-doors-2.picat create mode 100644 Task/100-doors/Picat/100-doors-3.picat create mode 100644 Task/100-doors/Pony/100-doors.pony create mode 100644 Task/100-doors/Pure-Data/100-doors.pure create mode 100644 Task/100-doors/Spin/100-doors.spin create mode 100644 Task/100-doors/Xojo/100-doors.xojo create mode 100644 Task/24-game-Solve/00META.yaml create mode 100644 Task/24-game-Solve/Ceylon/24-game-solve.ceylon create mode 100644 Task/24-game-Solve/Nim/24-game-solve.nim rename Task/24-game-Solve/Perl-6/{24-game-solve.pl6 => 24-game-solve-1.pl6} (95%) create mode 100644 Task/24-game-Solve/Perl-6/24-game-solve-2.pl6 create mode 100644 Task/24-game-Solve/Picat/24-game-solve-1.picat create mode 100644 Task/24-game-Solve/Picat/24-game-solve-2.picat create mode 100644 Task/24-game/00META.yaml create mode 100644 Task/24-game/FreeBASIC/24-game.freebasic create mode 100644 Task/24-game/Red/24-game.red create mode 100644 Task/9-billion-names-of-God-the-integer/00META.yaml create mode 100644 Task/9-billion-names-of-God-the-integer/Crystal/9-billion-names-of-god-the-integer.crystal create mode 100644 Task/9-billion-names-of-God-the-integer/Julia/9-billion-names-of-god-the-integer.julia create mode 100644 Task/9-billion-names-of-God-the-integer/Maple/9-billion-names-of-god-the-integer.maple create mode 100644 Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-1.phix create mode 100644 Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-2.phix create mode 100644 Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-3.phix delete mode 100644 Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer.phix create mode 100644 Task/9-billion-names-of-God-the-integer/VBA/9-billion-names-of-god-the-integer.vba create mode 100644 Task/99-Bottles-of-Beer/00META.yaml create mode 100644 Task/99-Bottles-of-Beer/ALGOL-M/99-bottles-of-beer.algol-m create mode 100644 Task/99-Bottles-of-Beer/Golo/99-bottles-of-beer.golo create mode 100644 Task/99-Bottles-of-Beer/HolyC/99-bottles-of-beer.holyc create mode 100644 Task/99-Bottles-of-Beer/Neko/99-bottles-of-beer.neko create mode 100644 Task/99-Bottles-of-Beer/PHP/99-bottles-of-beer-6.php create mode 100644 Task/99-Bottles-of-Beer/Picat/99-bottles-of-beer.picat create mode 100644 Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-3.py create mode 100644 Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-4.py create mode 100644 Task/99-Bottles-of-Beer/Q/99-bottles-of-beer.q create mode 100644 Task/99-Bottles-of-Beer/RPG/99-bottles-of-beer.rpg create mode 100644 Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-1.rust rename Task/99-Bottles-of-Beer/Rust/{99-bottles-of-beer.rust => 99-bottles-of-beer-2.rust} (100%) create mode 100644 Task/99-Bottles-of-Beer/SmileBASIC/99-bottles-of-beer.smilebasic create mode 100644 Task/99-Bottles-of-Beer/TypeScript/99-bottles-of-beer.type rename Task/99-Bottles-of-Beer/XSLT/{99-bottles-of-beer.xslt => 99-bottles-of-beer-1.xslt} (100%) create mode 100644 Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-2.xslt create mode 100644 Task/A+B/BASIC/a+b-12.basic create mode 100644 Task/A+B/Golo/a+b.golo create mode 100644 Task/A+B/Neko/a+b.neko create mode 100644 Task/A+B/Pascal/a+b-3.pascal create mode 100644 Task/A+B/Pony/a+b.pony create mode 100644 Task/A+B/REXX/a+b-5.rexx create mode 100644 Task/A+B/Robotic/a+b.robotic rename Task/A+B/ZX-Spectrum-Basic/{a+b.zx => a+b-1.zx} (100%) create mode 100644 Task/A+B/ZX-Spectrum-Basic/a+b-2.zx create mode 100644 Task/ABC-Problem/00META.yaml create mode 100644 Task/ABC-Problem/Factor/abc-problem.factor create mode 100644 Task/ABC-Problem/FreeBASIC/abc-problem.freebasic create mode 100644 Task/ABC-Problem/Mercury/abc-problem.mercury create mode 100644 Task/AKS-test-for-primes/C++/aks-test-for-primes.cpp create mode 100644 Task/AKS-test-for-primes/Crystal/aks-test-for-primes.crystal create mode 100644 Task/AKS-test-for-primes/Factor/aks-test-for-primes.factor create mode 100644 Task/AKS-test-for-primes/Liberty-BASIC/aks-test-for-primes.liberty create mode 100644 Task/AKS-test-for-primes/Python/aks-test-for-primes-4.py create mode 100644 Task/AKS-test-for-primes/Scheme/aks-test-for-primes.ss create mode 100644 Task/AKS-test-for-primes/VBA/aks-test-for-primes.vba create mode 100644 Task/Abstract-type/Crystal/abstract-type.crystal create mode 100644 Task/Abstract-type/Mercury/abstract-type.mercury create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/00META.yaml create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/Ada/abundant,-deficient-and-perfect-number-classifications.ada create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/K/abundant,-deficient-and-perfect-number-classifications.k create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/Maple/abundant,-deficient-and-perfect-number-classifications.maple create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/Seed7/abundant,-deficient-and-perfect-number-classifications.seed7 create mode 100644 Task/Abundant,-deficient-and-perfect-number-classifications/Visual-Basic-.NET/abundant,-deficient-and-perfect-number-classifications.visual create mode 100644 Task/Accumulator-factory/Aime/accumulator-factory-1.aime create mode 100644 Task/Accumulator-factory/Aime/accumulator-factory-2.aime create mode 100644 Task/Accumulator-factory/Mercury/accumulator-factory-1.mercury create mode 100644 Task/Accumulator-factory/Mercury/accumulator-factory-2.mercury create mode 100644 Task/Accumulator-factory/Mercury/accumulator-factory-3.mercury create mode 100644 Task/Accumulator-factory/Mercury/accumulator-factory-4.mercury create mode 100644 Task/Accumulator-factory/Phix/accumulator-factory.phix create mode 100644 Task/Accumulator-factory/Pony/accumulator-factory.pony rename Task/Accumulator-factory/Retro/{accumulator-factory.retro => accumulator-factory-1.retro} (100%) create mode 100644 Task/Accumulator-factory/Retro/accumulator-factory-2.retro create mode 100644 Task/Ackermann-function/BASIC/ackermann-function-1.basic create mode 100644 Task/Ackermann-function/BASIC/ackermann-function-2.basic create mode 100644 Task/Ackermann-function/BASIC/ackermann-function-3.basic create mode 100644 Task/Ackermann-function/BASIC/ackermann-function-4.basic rename Task/Ackermann-function/BASIC/{ackermann-function.basic => ackermann-function-5.basic} (100%) create mode 100644 Task/Ackermann-function/Crystal/ackermann-function.crystal create mode 100644 Task/Ackermann-function/Dc/ackermann-function.dc create mode 100644 Task/Ackermann-function/Emacs-Lisp/ackermann-function.l create mode 100644 Task/Ackermann-function/Java/ackermann-function-5.java create mode 100644 Task/Ackermann-function/Phix/ackermann-function-1.phix create mode 100644 Task/Ackermann-function/Phix/ackermann-function-2.phix delete mode 100644 Task/Ackermann-function/Phix/ackermann-function.phix rename Task/Ackermann-function/Scheme/{ackermann-function.ss => ackermann-function-1.ss} (100%) create mode 100644 Task/Ackermann-function/Scheme/ackermann-function-2.ss create mode 100644 Task/Ackermann-function/SmileBASIC/ackermann-function.smilebasic create mode 100644 Task/Ackermann-function/VBA/ackermann-function.vba create mode 100644 Task/Active-Directory-Connect/Go/active-directory-connect.go create mode 100644 Task/Active-Directory-Connect/Perl-6/active-directory-connect.pl6 create mode 100644 Task/Active-Directory-Connect/Rust/active-directory-connect.rust create mode 100644 Task/Active-Directory-Search-for-a-user/Go/active-directory-search-for-a-user.go create mode 100644 Task/Active-Directory-Search-for-a-user/Perl-6/active-directory-search-for-a-user.pl6 create mode 100644 Task/Active-object/Groovy/active-object.groovy create mode 100644 Task/Active-object/Perl-6/active-object.pl6 create mode 100644 Task/Active-object/Phix/active-object.phix create mode 100644 Task/Active-object/Rust/active-object.rust create mode 100644 Task/Add-a-variable-to-a-class-instance-at-runtime/Go/add-a-variable-to-a-class-instance-at-runtime.go create mode 100644 Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-1.applesoft create mode 100644 Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-2.applesoft create mode 100644 Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-3.applesoft create mode 100644 Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-4.applesoft create mode 100644 Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-5.applesoft create mode 100644 Task/Address-of-a-variable/Delphi/address-of-a-variable-1.delphi create mode 100644 Task/Address-of-a-variable/Delphi/address-of-a-variable-2.delphi create mode 100644 Task/Align-columns/360-Assembly/align-columns.360 create mode 100644 Task/Align-columns/COBOL/align-columns-1.cobol create mode 100644 Task/Align-columns/COBOL/align-columns-2.cobol create mode 100644 Task/Align-columns/Harbour/align-columns-1.harbour create mode 100644 Task/Align-columns/Harbour/align-columns-2.harbour create mode 100644 Task/Align-columns/Python/align-columns-4.py create mode 100644 Task/Align-columns/VBScript/align-columns.vb create mode 100644 Task/Aliquot-sequence-classifications/00META.yaml create mode 100644 Task/Almost-prime/ARM-Assembly/almost-prime.arm rename Task/Almost-prime/Julia/{almost-prime.julia => almost-prime-1.julia} (100%) create mode 100644 Task/Almost-prime/Julia/almost-prime-2.julia create mode 100644 Task/Almost-prime/Liberty-BASIC/almost-prime.liberty rename Task/Almost-prime/Python/{almost-prime.py => almost-prime-1.py} (100%) create mode 100644 Task/Almost-prime/Python/almost-prime-2.py create mode 100644 Task/Almost-prime/Seed7/almost-prime.seed7 create mode 100644 Task/Almost-prime/VBA/almost-prime.vba create mode 100644 Task/Almost-prime/Visual-Basic-.NET/almost-prime.visual create mode 100644 Task/Amb/00META.yaml rename Task/Amb/Haskell/{amb.hs => amb-1.hs} (100%) create mode 100644 Task/Amb/Haskell/amb-2.hs create mode 100644 Task/Amb/Haskell/amb-3.hs create mode 100644 Task/Amb/Haskell/amb-4.hs rename Task/Amb/JavaScript/{amb.js => amb-1.js} (100%) create mode 100644 Task/Amb/JavaScript/amb-2.js rename Task/Amb/Python/{amb.py => amb-1.py} (100%) create mode 100644 Task/Amb/Python/amb-2.py create mode 100644 Task/Amb/Python/amb-3.py create mode 100644 Task/Amb/Python/amb-4.py create mode 100644 Task/Amb/Python/amb-5.py create mode 100644 Task/Amicable-pairs/00META.yaml create mode 100644 Task/Amicable-pairs/Frink/amicable-pairs.frink create mode 100644 Task/Anagrams-Deranged-anagrams/00META.yaml create mode 100644 Task/Anagrams-Deranged-anagrams/Rust/anagrams-deranged-anagrams.rust create mode 100644 Task/Anagrams-Deranged-anagrams/Simula/anagrams-deranged-anagrams.simula rename Task/Anagrams/PowerShell/{anagrams.psh => anagrams-1.psh} (80%) create mode 100644 Task/Anagrams/PowerShell/anagrams-2.psh create mode 100644 Task/Anagrams/Processing/anagrams create mode 100644 Task/Anagrams/Python/anagrams-4.py create mode 100644 Task/Animate-a-pendulum/BASIC/animate-a-pendulum-4.basic create mode 100644 Task/Animate-a-pendulum/Perl-6/animate-a-pendulum.pl6 create mode 100644 Task/Animation/Perl-6/animation.pl6 create mode 100644 Task/Animation/Processing/animation create mode 100644 Task/Animation/REXX/animation.rexx create mode 100644 Task/Anonymous-recursion/Ol/anonymous-recursion.ol create mode 100644 Task/Anonymous-recursion/Rust/anonymous-recursion.rust create mode 100644 Task/Append-a-record-to-the-end-of-a-text-file/C++/append-a-record-to-the-end-of-a-text-file.cpp create mode 100644 Task/Append-a-record-to-the-end-of-a-text-file/Lua/append-a-record-to-the-end-of-a-text-file.lua create mode 100644 Task/Append-a-record-to-the-end-of-a-text-file/Rust/append-a-record-to-the-end-of-a-text-file.rust create mode 100644 Task/Apply-a-callback-to-an-array/Retro/apply-a-callback-to-an-array.retro create mode 100644 Task/Apply-a-callback-to-an-array/Visual-Basic-.NET/apply-a-callback-to-an-array.visual create mode 100644 Task/Arbitrary-precision-integers--included-/Visual-Basic-.NET/arbitrary-precision-integers--included-.visual create mode 100644 Task/Arithmetic-Complex/ALGOL-W/arithmetic-complex.alg create mode 100644 Task/Arithmetic-Integer/Nial/arithmetic-integer-1.nial create mode 100644 Task/Arithmetic-Integer/Nial/arithmetic-integer-2.nial create mode 100644 Task/Arithmetic-Integer/Nial/arithmetic-integer-3.nial create mode 100644 Task/Arithmetic-Integer/Robotic/arithmetic-integer.robotic rename Task/Arithmetic-Rational/Phix/{arithmetic-rational.phix => arithmetic-rational-1.phix} (100%) create mode 100644 Task/Arithmetic-Rational/Phix/arithmetic-rational-2.phix create mode 100644 Task/Arithmetic-evaluation/Nim/arithmetic-evaluation.nim create mode 100644 Task/Arithmetic-evaluation/Rust/arithmetic-evaluation.rust create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/00META.yaml create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/D/arithmetic-geometric-mean-calculate-pi.d create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/Erlang/arithmetic-geometric-mean-calculate-pi.erl create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/Rust/arithmetic-geometric-mean-calculate-pi-1.rust create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/Rust/arithmetic-geometric-mean-calculate-pi-2.rust create mode 100644 Task/Arithmetic-geometric-mean-Calculate-Pi/Visual-Basic-.NET/arithmetic-geometric-mean-calculate-pi.visual create mode 100644 Task/Arithmetic-geometric-mean/00META.yaml rename Task/Arithmetic-geometric-mean/BASIC/{arithmetic-geometric-mean.basic => arithmetic-geometric-mean-1.basic} (100%) create mode 100644 Task/Arithmetic-geometric-mean/BASIC/arithmetic-geometric-mean-2.basic create mode 100644 Task/Arithmetic-geometric-mean/BASIC/arithmetic-geometric-mean-3.basic rename Task/Arithmetic-geometric-mean/C-sharp/{arithmetic-geometric-mean.cs => arithmetic-geometric-mean-1.cs} (100%) create mode 100644 Task/Arithmetic-geometric-mean/C-sharp/arithmetic-geometric-mean-2.cs create mode 100644 Task/Arithmetic-geometric-mean/LLVM/arithmetic-geometric-mean.llvm create mode 100644 Task/Arithmetic-geometric-mean/Modula-2/arithmetic-geometric-mean.mod2 create mode 100644 Task/Arithmetic-geometric-mean/NewLISP/arithmetic-geometric-mean.newlisp create mode 100644 Task/Arithmetic-geometric-mean/SQL/arithmetic-geometric-mean.sql create mode 100644 Task/Arithmetic-geometric-mean/VBA/arithmetic-geometric-mean.vba create mode 100644 Task/Arithmetic-geometric-mean/Visual-Basic-.NET/arithmetic-geometric-mean.visual create mode 100644 Task/Array-concatenation/ABAP/array-concatenation.abap create mode 100644 Task/Array-concatenation/ARM-Assembly/array-concatenation.arm create mode 100644 Task/Array-concatenation/Free-Pascal/array-concatenation.free create mode 100644 Task/Array-concatenation/Neko/array-concatenation.neko create mode 100644 Task/Array-concatenation/Nial/array-concatenation-1.nial create mode 100644 Task/Array-concatenation/Nial/array-concatenation-2.nial create mode 100644 Task/Array-concatenation/Nial/array-concatenation-3.nial create mode 100644 Task/Array-concatenation/Nial/array-concatenation-4.nial create mode 100644 Task/Array-concatenation/Nial/array-concatenation-5.nial create mode 100644 Task/Array-concatenation/Pony/array-concatenation.pony create mode 100644 Task/Array-concatenation/Q/array-concatenation.q create mode 100644 Task/Array-concatenation/Rust/array-concatenation-1.rust create mode 100644 Task/Array-concatenation/Rust/array-concatenation-2.rust delete mode 100644 Task/Array-concatenation/Rust/array-concatenation.rust create mode 100644 Task/Arrays/ARM-Assembly/arrays.arm create mode 100644 Task/Arrays/Mercury/arrays.mercury create mode 100644 Task/Arrays/Ol/arrays.ol create mode 100644 Task/Arrays/Robotic/arrays-1.robotic create mode 100644 Task/Arrays/Robotic/arrays-2.robotic create mode 100644 Task/Arrays/VBA/arrays.vba create mode 100644 Task/Arrays/VHDL/arrays.vhdl create mode 100644 Task/Assertions/C-sharp/assertions-1.cs create mode 100644 Task/Assertions/C-sharp/assertions-2.cs create mode 100644 Task/Assertions/C-sharp/assertions-3.cs delete mode 100644 Task/Assertions/C-sharp/assertions.cs create mode 100644 Task/Assertions/Objeck/assertions.objeck create mode 100644 Task/Assertions/VBA/assertions.vba create mode 100644 Task/Associative-array-Creation/Free-Pascal/associative-array-creation-1.free create mode 100644 Task/Associative-array-Creation/Free-Pascal/associative-array-creation-2.free create mode 100644 Task/Associative-array-Creation/Futhark/associative-array-creation.futhark create mode 100644 Task/Associative-array-Creation/PowerShell/associative-array-creation-6.psh create mode 100644 Task/Associative-array-Iteration/Free-Pascal/associative-array-iteration.free create mode 100644 Task/Atomic-updates/Swift/atomic-updates.swift create mode 100644 Task/Average-loop-length/00META.yaml create mode 100644 Task/Average-loop-length/Perl/average-loop-length.pl create mode 100644 Task/Average-loop-length/R/average-loop-length.r create mode 100644 Task/Average-loop-length/Simula/average-loop-length.simula create mode 100644 Task/Average-loop-length/VBA/average-loop-length.vba rename Task/Averages-Arithmetic-mean/BASIC/{averages-arithmetic-mean.basic => averages-arithmetic-mean-1.basic} (100%) create mode 100644 Task/Averages-Arithmetic-mean/BASIC/averages-arithmetic-mean-2.basic create mode 100644 Task/Averages-Arithmetic-mean/BASIC/averages-arithmetic-mean-3.basic create mode 100644 Task/Averages-Arithmetic-mean/Q/averages-arithmetic-mean.q rename Task/Averages-Arithmetic-mean/SQL/{averages-arithmetic-mean.sql => averages-arithmetic-mean-1.sql} (100%) create mode 100644 Task/Averages-Arithmetic-mean/SQL/averages-arithmetic-mean-2.sql create mode 100644 Task/Averages-Arithmetic-mean/VBA/averages-arithmetic-mean.vba create mode 100644 Task/Averages-Mean-angle/00META.yaml create mode 100644 Task/Averages-Mean-angle/C++/averages-mean-angle.cpp create mode 100644 Task/Averages-Mean-angle/Factor/averages-mean-angle.factor create mode 100644 Task/Averages-Mean-angle/VBA/averages-mean-angle.vba create mode 100644 Task/Averages-Mean-angle/Visual-Basic-.NET/averages-mean-angle.visual create mode 100644 Task/Averages-Mean-time-of-day/Factor/averages-mean-time-of-day.factor create mode 100644 Task/Averages-Mean-time-of-day/VBA/averages-mean-time-of-day.vba create mode 100644 Task/Averages-Median/VBA/averages-median.vba create mode 100644 Task/Averages-Mode/Clojure/averages-mode-4.clj create mode 100644 Task/Averages-Mode/Q/averages-mode.q create mode 100644 Task/Averages-Mode/SQL/averages-mode.sql create mode 100644 Task/Averages-Mode/VBA/averages-mode.vba create mode 100644 Task/Averages-Pythagorean-means/00META.yaml create mode 100644 Task/Averages-Pythagorean-means/SQL/averages-pythagorean-means.sql create mode 100644 Task/Averages-Pythagorean-means/VBA/averages-pythagorean-means.vba create mode 100644 Task/Averages-Pythagorean-means/Visual-Basic-.NET/averages-pythagorean-means.visual create mode 100644 Task/Averages-Root-mean-square/00META.yaml create mode 100644 Task/Averages-Root-mean-square/BASIC/averages-root-mean-square-4.basic create mode 100644 Task/Averages-Root-mean-square/BASIC/averages-root-mean-square-5.basic create mode 100644 Task/Averages-Root-mean-square/Crystal/averages-root-mean-square.crystal rename Task/Averages-Root-mean-square/Python/{averages-root-mean-square.py => averages-root-mean-square-1.py} (100%) create mode 100644 Task/Averages-Root-mean-square/Python/averages-root-mean-square-2.py create mode 100644 Task/Averages-Root-mean-square/VBA/averages-root-mean-square-1.vba rename Task/Averages-Root-mean-square/VBA/{averages-root-mean-square.vba => averages-root-mean-square-2.vba} (100%) create mode 100644 Task/Averages-Simple-moving-average/Factor/averages-simple-moving-average.factor create mode 100644 Task/Averages-Simple-moving-average/VBA/averages-simple-moving-average.vba create mode 100644 Task/Balanced-brackets/00META.yaml rename Task/Balanced-brackets/Clojure/{balanced-brackets.clj => balanced-brackets-1.clj} (100%) create mode 100644 Task/Balanced-brackets/Clojure/balanced-brackets-2.clj create mode 100644 Task/Balanced-brackets/Clojure/balanced-brackets-3.clj create mode 100644 Task/Balanced-brackets/Mercury/balanced-brackets.mercury create mode 100644 Task/Balanced-brackets/Simula/balanced-brackets.simula create mode 100644 Task/Balanced-ternary/00META.yaml create mode 100644 Task/Balanced-ternary/Scala/balanced-ternary-3.scala create mode 100644 Task/Benfords-law/00META.yaml create mode 100644 Task/Benfords-law/Groovy/benfords-law-1.groovy create mode 100644 Task/Benfords-law/Groovy/benfords-law-2.groovy create mode 100644 Task/Bernoulli-numbers/Ada/bernoulli-numbers.ada create mode 100644 Task/Bernoulli-numbers/Bracmat/bernoulli-numbers.bracmat rename Task/Bernoulli-numbers/Crystal/{bernoulli-numbers.crystal => bernoulli-numbers-1.crystal} (100%) create mode 100644 Task/Bernoulli-numbers/Crystal/bernoulli-numbers-2.crystal create mode 100644 Task/Bernoulli-numbers/Crystal/bernoulli-numbers-3.crystal create mode 100644 Task/Bernoulli-numbers/Phix/bernoulli-numbers.phix create mode 100644 Task/Bernoulli-numbers/Seed7/bernoulli-numbers.seed7 create mode 100644 Task/Best-shuffle/00META.yaml create mode 100644 Task/Best-shuffle/Common-Lisp/best-shuffle-4.lisp create mode 100644 Task/Best-shuffle/Nim/best-shuffle.nim create mode 100644 Task/Binary-digits/BASIC/binary-digits-5.basic create mode 100644 Task/Binary-digits/BASIC/binary-digits-6.basic create mode 100644 Task/Binary-digits/Crystal/binary-digits-1.crystal create mode 100644 Task/Binary-digits/Crystal/binary-digits-2.crystal create mode 100644 Task/Binary-digits/Free-Pascal/binary-digits.free create mode 100644 Task/Binary-digits/LLVM/binary-digits.llvm create mode 100644 Task/Binary-digits/MAXScript/binary-digits.max create mode 100644 Task/Binary-digits/Processing/binary-digits-1 create mode 100644 Task/Binary-digits/Processing/binary-digits-2 create mode 100644 Task/Binary-digits/Python/binary-digits-4.py create mode 100644 Task/Binary-digits/Python/binary-digits-5.py create mode 100644 Task/Binary-digits/R/binary-digits.r create mode 100644 Task/Binary-digits/Simula/binary-digits.simula create mode 100644 Task/Binary-search/ARM-Assembly/binary-search.arm create mode 100644 Task/Binary-search/BASIC/binary-search-4.basic create mode 100644 Task/Binary-search/BASIC/binary-search-5.basic create mode 100644 Task/Binary-search/Crystal/binary-search-1.crystal create mode 100644 Task/Binary-search/Crystal/binary-search-2.crystal create mode 100644 Task/Binary-search/Emacs-Lisp/binary-search.l rename Task/Binary-search/Haskell/{binary-search.hs => binary-search-1.hs} (100%) create mode 100644 Task/Binary-search/Haskell/binary-search-2.hs create mode 100644 Task/Binary-search/Haskell/binary-search-3.hs create mode 100644 Task/Binary-search/JavaScript/binary-search-3.js create mode 100644 Task/Binary-search/Python/binary-search-6.py create mode 100644 Task/Binary-search/Python/binary-search-7.py create mode 100644 Task/Binary-search/Rust/binary-search-3.rust create mode 100644 Task/Binary-search/Simula/binary-search.simula create mode 100644 Task/Binary-strings/Julia/binary-strings.julia create mode 100644 Task/Binary-strings/Prolog/binary-strings.pro create mode 100644 Task/Bitcoin-address-validation/Nim/bitcoin-address-validation.nim create mode 100644 Task/Bitcoin-address-validation/Seed7/bitcoin-address-validation.seed7 create mode 100644 Task/Bitcoin-public-point-to-address/00META.yaml create mode 100644 Task/Bitcoin-public-point-to-address/Nim/bitcoin-public-point-to-address.nim create mode 100644 Task/Bitcoin-public-point-to-address/Seed7/bitcoin-public-point-to-address.seed7 create mode 100644 Task/Bitmap-Bresenhams-line-algorithm/360-Assembly/bitmap-bresenhams-line-algorithm.360 create mode 100644 Task/Bitmap-Bresenhams-line-algorithm/Rust/bitmap-bresenhams-line-algorithm.rust create mode 100644 Task/Bitmap-Bresenhams-line-algorithm/VBScript/bitmap-bresenhams-line-algorithm.vb create mode 100644 Task/Bitmap-Flood-fill/Rust/bitmap-flood-fill.rust create mode 100644 Task/Bitmap-PPM-conversion-through-a-pipe/Perl-6/bitmap-ppm-conversion-through-a-pipe.pl6 create mode 100644 Task/Bitmap-PPM-conversion-through-a-pipe/Python/bitmap-ppm-conversion-through-a-pipe.py create mode 100644 Task/Bitmap-Read-an-image-through-a-pipe/Python/bitmap-read-an-image-through-a-pipe.py create mode 100644 Task/Bitmap-Write-a-PPM-file/Aime/bitmap-write-a-ppm-file.aime create mode 100644 Task/Bitmap-Write-a-PPM-file/Perl/bitmap-write-a-ppm-file.pl create mode 100644 Task/Bitmap/Rust/bitmap.rust create mode 100644 Task/Bitmap/Xojo/bitmap.xojo create mode 100644 Task/Bitwise-IO/Julia/bitwise-io.julia create mode 100644 Task/Bitwise-IO/Phix/bitwise-io.phix create mode 100644 Task/Bitwise-IO/Seed7/bitwise-io.seed7 create mode 100644 Task/Bitwise-operations/ABAP/bitwise-operations.abap create mode 100644 Task/Bitwise-operations/AppleScript/bitwise-operations-1.applescript create mode 100644 Task/Bitwise-operations/AppleScript/bitwise-operations-2.applescript create mode 100644 Task/Bitwise-operations/BASIC/bitwise-operations-5.basic create mode 100644 Task/Bitwise-operations/BASIC/bitwise-operations-6.basic create mode 100644 Task/Bitwise-operations/Free-Pascal/bitwise-operations.free create mode 100644 Task/Bitwise-operations/Neko/bitwise-operations.neko create mode 100644 Task/Bitwise-operations/Robotic/bitwise-operations.robotic create mode 100644 Task/Bitwise-operations/Simula/bitwise-operations.simula create mode 100644 Task/Boolean-values/ARM-Assembly/boolean-values.arm create mode 100644 Task/Boolean-values/AppleScript/boolean-values-1.applescript create mode 100644 Task/Boolean-values/AppleScript/boolean-values-2.applescript create mode 100644 Task/Boolean-values/AppleScript/boolean-values-3.applescript create mode 100644 Task/Boolean-values/AppleScript/boolean-values-4.applescript create mode 100644 Task/Boolean-values/AppleScript/boolean-values-5.applescript create mode 100644 Task/Boolean-values/Batch-File/boolean-values.bat create mode 100644 Task/Boolean-values/Neko/boolean-values.neko create mode 100644 Task/Boolean-values/VBA/boolean-values.vba create mode 100644 Task/Boolean-values/VBScript/boolean-values.vb create mode 100644 Task/Box-the-compass/00META.yaml create mode 100644 Task/Box-the-compass/LLVM/box-the-compass.llvm rename Task/Box-the-compass/Phix/{box-the-compass.phix => box-the-compass-1.phix} (100%) create mode 100644 Task/Box-the-compass/Phix/box-the-compass-2.phix create mode 100644 Task/Box-the-compass/Ruby/box-the-compass.rb create mode 100644 Task/Box-the-compass/Rust/box-the-compass.rust create mode 100644 Task/Box-the-compass/VBA/box-the-compass.vba rename Task/Break-OO-privacy/Java/{break-oo-privacy.java => break-oo-privacy-1.java} (100%) create mode 100644 Task/Break-OO-privacy/Java/break-oo-privacy-2.java create mode 100644 Task/Break-OO-privacy/Swift/break-oo-privacy.swift create mode 100644 Task/Break-OO-privacy/Visual-Basic-.NET/break-oo-privacy.visual create mode 100644 Task/Brownian-tree/Applesoft-BASIC/brownian-tree.applesoft create mode 100644 Task/Brownian-tree/Common-Lisp/brownian-tree.lisp create mode 100644 Task/Brownian-tree/Factor/brownian-tree.factor create mode 100644 Task/Bulls-and-cows-Player/Crystal/bulls-and-cows-player.crystal create mode 100644 Task/Bulls-and-cows/AWK/bulls-and-cows.awk create mode 100644 Task/Bulls-and-cows/Crystal/bulls-and-cows.crystal create mode 100644 Task/Bulls-and-cows/Golo/bulls-and-cows.golo create mode 100644 Task/Bulls-and-cows/Processing/bulls-and-cows create mode 100644 Task/Bulls-and-cows/Red/bulls-and-cows.red create mode 100644 Task/Bulls-and-cows/Swift/bulls-and-cows.swift create mode 100644 Task/CRC-32/JavaScript/crc-32.js create mode 100644 Task/CRC-32/Julia/crc-32-1.julia rename Task/CRC-32/Julia/{crc-32.julia => crc-32-2.julia} (100%) create mode 100644 Task/CRC-32/Lua/crc-32.lua create mode 100644 Task/CRC-32/Neko/crc-32.neko create mode 100644 Task/CRC-32/Objeck/crc-32.objeck create mode 100644 Task/CRC-32/PowerBASIC/crc-32.powerbasic create mode 100644 Task/CRC-32/Python/crc-32-3.py create mode 100644 Task/CRC-32/R/crc-32.r create mode 100644 Task/CRC-32/Racket/crc-32.rkt create mode 100644 Task/CRC-32/Visual-Basic/crc-32.vb create mode 100644 Task/CSV-data-manipulation/00META.yaml create mode 100644 Task/CSV-data-manipulation/Objeck/csv-data-manipulation.objeck rename Task/CSV-data-manipulation/Python/{csv-data-manipulation.py => csv-data-manipulation-1.py} (100%) create mode 100644 Task/CSV-data-manipulation/Python/csv-data-manipulation-2.py create mode 100644 Task/CSV-data-manipulation/Python/csv-data-manipulation-3.py create mode 100644 Task/CSV-data-manipulation/Q/csv-data-manipulation.q rename Task/CSV-data-manipulation/REXX/{csv-data-manipulation.rexx => csv-data-manipulation-1.rexx} (100%) create mode 100644 Task/CSV-data-manipulation/REXX/csv-data-manipulation-2.rexx create mode 100644 Task/CSV-data-manipulation/Rust/csv-data-manipulation.rust create mode 100644 Task/CSV-to-HTML-translation/00META.yaml create mode 100644 Task/CSV-to-HTML-translation/Bracmat/csv-to-html-translation-3.bracmat create mode 100644 Task/CSV-to-HTML-translation/Bracmat/csv-to-html-translation-4.bracmat create mode 100644 Task/CSV-to-HTML-translation/Bracmat/csv-to-html-translation-5.bracmat create mode 100644 Task/CSV-to-HTML-translation/Objeck/csv-to-html-translation.objeck create mode 100644 Task/CSV-to-HTML-translation/Python/csv-to-html-translation-5.py create mode 100644 Task/CSV-to-HTML-translation/Python/csv-to-html-translation-6.py create mode 100644 Task/CSV-to-HTML-translation/Rust/csv-to-html-translation-1.rust create mode 100644 Task/CSV-to-HTML-translation/Rust/csv-to-html-translation-2.rust create mode 100644 Task/CSV-to-HTML-translation/VBA/csv-to-html-translation-1.vba create mode 100644 Task/CSV-to-HTML-translation/VBA/csv-to-html-translation-2.vba create mode 100644 Task/CSV-to-HTML-translation/Visual-Basic-.NET/csv-to-html-translation-1.visual create mode 100644 Task/CSV-to-HTML-translation/Visual-Basic-.NET/csv-to-html-translation-2.visual create mode 100644 Task/Caesar-cipher/360-Assembly/caesar-cipher.360 create mode 100644 Task/Caesar-cipher/ARM-Assembly/caesar-cipher.arm create mode 100644 Task/Caesar-cipher/Arc/caesar-cipher-1.arc create mode 100644 Task/Caesar-cipher/Arc/caesar-cipher-2.arc create mode 100644 Task/Caesar-cipher/BASIC256/caesar-cipher.basic256 create mode 100644 Task/Caesar-cipher/Brainf---/caesar-cipher-1.bf create mode 100644 Task/Caesar-cipher/Brainf---/caesar-cipher-2.bf create mode 100644 Task/Caesar-cipher/Brainf---/caesar-cipher-3.bf rename Task/Caesar-cipher/Common-Lisp/{caesar-cipher.lisp => caesar-cipher-1.lisp} (100%) create mode 100644 Task/Caesar-cipher/Common-Lisp/caesar-cipher-2.lisp create mode 100644 Task/Caesar-cipher/Modula-3/caesar-cipher.mod3 create mode 100644 Task/Caesar-cipher/Picat/caesar-cipher.picat create mode 100644 Task/Caesar-cipher/Visual-Basic-.NET/caesar-cipher.visual create mode 100644 Task/Caesar-cipher/X86-Assembly/caesar-cipher-1.x86 create mode 100644 Task/Caesar-cipher/X86-Assembly/caesar-cipher-2.x86 create mode 100644 Task/Calendar---for-REAL-programmers/C/calendar---for-real-programmers.c create mode 100644 Task/Calendar---for-REAL-programmers/Go/calendar---for-real-programmers-1.go create mode 100644 Task/Calendar---for-REAL-programmers/Go/calendar---for-real-programmers-2.go create mode 100644 Task/Calendar---for-REAL-programmers/Julia/calendar---for-real-programmers.julia create mode 100644 Task/Calendar---for-REAL-programmers/Visual-Basic-.NET/calendar---for-real-programmers.visual create mode 100644 Task/Calendar/ALGOL-W/calendar.alg create mode 100644 Task/Calendar/Factor/calendar.factor create mode 100644 Task/Calendar/Julia/calendar.julia create mode 100644 Task/Calendar/OCaml/calendar.ocaml create mode 100644 Task/Calendar/Prolog/calendar.pro create mode 100644 Task/Calendar/Rust/calendar.rust create mode 100644 Task/Calendar/Simula/calendar.simula create mode 100644 Task/Calendar/Smalltalk/calendar-1.st create mode 100644 Task/Calendar/Smalltalk/calendar-2.st create mode 100644 Task/Calendar/Visual-Basic-.NET/calendar-1.visual create mode 100644 Task/Calendar/Visual-Basic-.NET/calendar-2.visual create mode 100644 Task/Calendar/Visual-Basic-.NET/calendar-3.visual create mode 100644 Task/Call-a-foreign-language-function/ARM-Assembly/call-a-foreign-language-function.arm create mode 100644 Task/Call-a-foreign-language-function/Crystal/call-a-foreign-language-function.crystal create mode 100644 Task/Call-a-function/Groovy/call-a-function-1.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-10.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-2.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-3.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-4.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-5.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-6.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-7.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-8.groovy create mode 100644 Task/Call-a-function/Groovy/call-a-function-9.groovy create mode 100644 Task/Call-a-function/VBA/call-a-function.vba create mode 100644 Task/Call-an-object-method/Factor/call-an-object-method.factor create mode 100644 Task/Call-an-object-method/SuperCollider/call-an-object-method.supercollider create mode 100644 Task/Canny-edge-detector/Go/canny-edge-detector.go create mode 100644 Task/Carmichael-3-strong-pseudoprimes/00META.yaml create mode 100644 Task/Carmichael-3-strong-pseudoprimes/Phix/carmichael-3-strong-pseudoprimes.phix create mode 100644 Task/Case-sensitivity-of-identifiers/VBA/case-sensitivity-of-identifiers.vba create mode 100644 Task/Casting-out-nines/Free-Pascal/casting-out-nines.free create mode 100644 Task/Catalan-numbers-Pascals-triangle/00META.yaml create mode 100644 Task/Catalan-numbers-Pascals-triangle/AWK/catalan-numbers-pascals-triangle.awk create mode 100644 Task/Catalan-numbers-Pascals-triangle/Common-Lisp/catalan-numbers-pascals-triangle.lisp create mode 100644 Task/Catalan-numbers-Pascals-triangle/Python/catalan-numbers-pascals-triangle-3.py create mode 100644 Task/Catalan-numbers/ABAP/catalan-numbers.abap rename Task/Catalan-numbers/PHP/{catalan-numbers.php => catalan-numbers-1.php} (100%) create mode 100644 Task/Catalan-numbers/PHP/catalan-numbers-2.php create mode 100644 Task/Catalan-numbers/Phix/catalan-numbers-1.phix create mode 100644 Task/Catalan-numbers/Phix/catalan-numbers-2.phix delete mode 100644 Task/Catalan-numbers/Phix/catalan-numbers.phix create mode 100644 Task/Catalan-numbers/Visual-Basic-.NET/catalan-numbers.visual create mode 100644 Task/Catamorphism/00META.yaml create mode 100644 Task/Catamorphism/ABAP/catamorphism.abap create mode 100644 Task/Catamorphism/Aime/catamorphism.aime create mode 100644 Task/Catamorphism/VBA/catamorphism.vba create mode 100644 Task/Catmull-Clark-subdivision-surface/Python/catmull-clark-subdivision-surface.py create mode 100644 Task/Character-codes/ARM-Assembly/character-codes.arm create mode 100644 Task/Character-codes/BASIC/character-codes-7.basic create mode 100644 Task/Character-codes/Neko/character-codes-1.neko create mode 100644 Task/Character-codes/Neko/character-codes-2.neko create mode 100644 Task/Character-codes/SmileBASIC/character-codes.smilebasic create mode 100644 Task/Chat-server/Groovy/chat-server.groovy create mode 100644 Task/Chat-server/Kotlin/chat-server.kotlin create mode 100644 Task/Chat-server/Prolog/chat-server.pro create mode 100644 Task/Chat-server/Visual-Basic-.NET/chat-server.visual create mode 100644 Task/Check-Machin-like-formulas/00META.yaml create mode 100644 Task/Check-Machin-like-formulas/Factor/check-machin-like-formulas.factor create mode 100644 Task/Check-Machin-like-formulas/Julia/check-machin-like-formulas.julia create mode 100644 Task/Check-Machin-like-formulas/Phix/check-machin-like-formulas-1.phix create mode 100644 Task/Check-Machin-like-formulas/Phix/check-machin-like-formulas-2.phix create mode 100644 Task/Check-Machin-like-formulas/R/check-machin-like-formulas-1.r create mode 100644 Task/Check-Machin-like-formulas/R/check-machin-like-formulas-2.r create mode 100644 Task/Check-Machin-like-formulas/Visual-Basic-.NET/check-machin-like-formulas.visual create mode 100644 Task/Check-that-file-exists/ARM-Assembly/check-that-file-exists.arm create mode 100644 Task/Check-that-file-exists/BASIC/check-that-file-exists-5.basic create mode 100644 Task/Check-that-file-exists/Neko/check-that-file-exists.neko create mode 100644 Task/Checkpoint-synchronization/Julia/checkpoint-synchronization.julia create mode 100644 Task/Checkpoint-synchronization/Perl-6/checkpoint-synchronization.pl6 create mode 100644 Task/Checkpoint-synchronization/Phix/checkpoint-synchronization.phix create mode 100644 Task/Checkpoint-synchronization/Python/checkpoint-synchronization.py create mode 100644 Task/Chinese-remainder-theorem/00META.yaml create mode 100644 Task/Chinese-remainder-theorem/AWK/chinese-remainder-theorem.awk create mode 100644 Task/Chinese-remainder-theorem/C++/chinese-remainder-theorem.cpp create mode 100644 Task/Chinese-remainder-theorem/Lua/chinese-remainder-theorem.lua create mode 100644 Task/Chinese-remainder-theorem/Modula-2/chinese-remainder-theorem.mod2 create mode 100644 Task/Chinese-remainder-theorem/Phix/chinese-remainder-theorem.phix rename Task/Chinese-remainder-theorem/Python/{chinese-remainder-theorem.py => chinese-remainder-theorem-1.py} (100%) create mode 100644 Task/Chinese-remainder-theorem/Python/chinese-remainder-theorem-2.py create mode 100644 Task/Chinese-remainder-theorem/Python/chinese-remainder-theorem-3.py create mode 100644 Task/Chinese-remainder-theorem/VBA/chinese-remainder-theorem.vba create mode 100644 Task/Chinese-remainder-theorem/Visual-Basic-.NET/chinese-remainder-theorem.visual create mode 100644 Task/Cholesky-decomposition/Swift/cholesky-decomposition.swift create mode 100644 Task/Circles-of-given-radius-through-two-points/00META.yaml create mode 100644 Task/Circles-of-given-radius-through-two-points/Factor/circles-of-given-radius-through-two-points.factor create mode 100644 Task/Circles-of-given-radius-through-two-points/Lua/circles-of-given-radius-through-two-points.lua create mode 100644 Task/Circles-of-given-radius-through-two-points/Phix/circles-of-given-radius-through-two-points.phix create mode 100644 Task/Circles-of-given-radius-through-two-points/Swift/circles-of-given-radius-through-two-points.swift create mode 100644 Task/Circles-of-given-radius-through-two-points/VBA/circles-of-given-radius-through-two-points.vba create mode 100644 Task/Circles-of-given-radius-through-two-points/Visual-Basic-.NET/circles-of-given-radius-through-two-points.visual create mode 100644 Task/Classes/Component-Pascal/classes-1.component create mode 100644 Task/Classes/Component-Pascal/classes-2.component delete mode 100644 Task/Classes/Component-Pascal/classes.component create mode 100644 Task/Classes/Eiffel/classes-1.e create mode 100644 Task/Classes/Eiffel/classes-2.e create mode 100644 Task/Classes/Eiffel/classes-3.e create mode 100644 Task/Classes/Eiffel/classes-4.e create mode 100644 Task/Classes/GLSL/classes.glsl create mode 100644 Task/Closest-pair-problem/BASIC256/closest-pair-problem.basic256 create mode 100644 Task/Closest-pair-problem/FreeBASIC/closest-pair-problem.freebasic create mode 100644 Task/Closest-pair-problem/Swift/closest-pair-problem.swift create mode 100644 Task/Closures-Value-capture/00META.yaml create mode 100644 Task/Closures-Value-capture/Objeck/closures-value-capture.objeck create mode 100644 Task/Collections/Factor/collections.factor create mode 100644 Task/Collections/Prolog/collections-1.pro create mode 100644 Task/Collections/Prolog/collections-2.pro create mode 100644 Task/Color-of-a-screen-pixel/Go/color-of-a-screen-pixel.go create mode 100644 Task/Color-of-a-screen-pixel/Julia/color-of-a-screen-pixel.julia create mode 100644 Task/Color-of-a-screen-pixel/Mathematica/color-of-a-screen-pixel.math create mode 100644 Task/Color-of-a-screen-pixel/Processing/color-of-a-screen-pixel-1 create mode 100644 Task/Color-of-a-screen-pixel/Processing/color-of-a-screen-pixel-2 create mode 100644 Task/Color-of-a-screen-pixel/SmileBASIC/color-of-a-screen-pixel.smilebasic create mode 100644 Task/Color-quantization/Julia/color-quantization.julia create mode 100644 Task/Color-quantization/Perl-6/color-quantization.pl6 create mode 100644 Task/Color-quantization/Phix/color-quantization.phix create mode 100644 Task/Colour-bars-Display/00META.yaml create mode 100644 Task/Colour-bars-Display/BASIC/colour-bars-display-10.basic create mode 100644 Task/Colour-bars-Display/BASIC/colour-bars-display-9.basic create mode 100644 Task/Colour-bars-Display/Forth/colour-bars-display.fth create mode 100644 Task/Colour-bars-Display/Go/colour-bars-display.go create mode 100644 Task/Colour-bars-Display/SmileBASIC/colour-bars-display.smilebasic create mode 100644 Task/Colour-pinstripe-Display/Go/colour-pinstripe-display.go create mode 100644 Task/Colour-pinstripe-Display/Julia/colour-pinstripe-display.julia create mode 100644 Task/Colour-pinstripe-Display/SmileBASIC/colour-pinstripe-display.smilebasic create mode 100644 Task/Colour-pinstripe-Printer/00META.yaml create mode 100644 Task/Colour-pinstripe-Printer/Go/colour-pinstripe-printer.go create mode 100644 Task/Colour-pinstripe-Printer/Python/colour-pinstripe-printer.py create mode 100644 Task/Combinations-and-permutations/Crystal/combinations-and-permutations.crystal create mode 100644 Task/Combinations-and-permutations/Swift/combinations-and-permutations.swift create mode 100644 Task/Combinations-with-repetitions/AppleScript/combinations-with-repetitions.applescript create mode 100644 Task/Combinations-with-repetitions/Crystal/combinations-with-repetitions.crystal rename Task/Combinations-with-repetitions/Python/{combinations-with-repetitions.py => combinations-with-repetitions-1.py} (100%) create mode 100644 Task/Combinations-with-repetitions/Python/combinations-with-repetitions-2.py create mode 100644 Task/Combinations-with-repetitions/Sidef/combinations-with-repetitions-1.sidef create mode 100644 Task/Combinations-with-repetitions/Sidef/combinations-with-repetitions-2.sidef create mode 100644 Task/Combinations-with-repetitions/Sidef/combinations-with-repetitions-3.sidef delete mode 100644 Task/Combinations-with-repetitions/Sidef/combinations-with-repetitions.sidef rename Task/Combinations/Nim/{combinations.nim => combinations-1.nim} (100%) create mode 100644 Task/Combinations/Nim/combinations-2.nim create mode 100644 Task/Combinations/OCaml/combinations.ocaml create mode 100644 Task/Combinations/OpenEdge-Progress/combinations.openedge rename Task/Combinations/Rust/{combinations.rust => combinations-1.rust} (100%) create mode 100644 Task/Combinations/Rust/combinations-2.rust rename Task/Combinations/VBA/{combinations.vba => combinations-1.vba} (100%) create mode 100644 Task/Combinations/VBA/combinations-2.vba create mode 100644 Task/Comma-quibbling/00META.yaml create mode 100644 Task/Comma-quibbling/Objeck/comma-quibbling.objeck create mode 100644 Task/Comma-quibbling/Ol/comma-quibbling.ol create mode 100644 Task/Comma-quibbling/Visual-Basic-.NET/comma-quibbling.visual create mode 100644 Task/Command-line-arguments/00META.yaml create mode 100644 Task/Command-line-arguments/ARM-Assembly/command-line-arguments.arm create mode 100644 Task/Command-line-arguments/COBOL/command-line-arguments-3.cobol create mode 100644 Task/Command-line-arguments/Neko/command-line-arguments.neko create mode 100644 Task/Comments/BASIC/comments-3.basic create mode 100644 Task/Comments/Robotic/comments-1.robotic create mode 100644 Task/Comments/Robotic/comments-2.robotic create mode 100644 Task/Comments/Visual-Objects/comments.vobj create mode 100644 Task/Comments/Xojo/comments.xojo create mode 100644 Task/Compare-sorting-algorithms-performance/Julia/compare-sorting-algorithms-performance.julia create mode 100644 Task/Compile-time-calculation/00META.yaml create mode 100644 Task/Compile-time-calculation/C-sharp/compile-time-calculation-1.cs create mode 100644 Task/Compile-time-calculation/C-sharp/compile-time-calculation-2.cs create mode 100644 Task/Compile-time-calculation/C-sharp/compile-time-calculation-3.cs create mode 100644 Task/Compile-time-calculation/C-sharp/compile-time-calculation-4.cs create mode 100644 Task/Compile-time-calculation/C-sharp/compile-time-calculation-5.cs create mode 100644 Task/Compile-time-calculation/Visual-Basic-.NET/compile-time-calculation-1.visual create mode 100644 Task/Compile-time-calculation/Visual-Basic-.NET/compile-time-calculation-2.visual create mode 100644 Task/Compile-time-calculation/Visual-Basic-.NET/compile-time-calculation-3.visual create mode 100644 Task/Compile-time-calculation/Visual-Basic-.NET/compile-time-calculation-4.visual create mode 100644 Task/Compile-time-calculation/Visual-Basic-.NET/compile-time-calculation-5.visual create mode 100644 Task/Compound-data-type/ARM-Assembly/compound-data-type.arm create mode 100644 Task/Compound-data-type/COBOL/compound-data-type.cobol create mode 100644 Task/Compound-data-type/Prolog/compound-data-type-1.pro create mode 100644 Task/Compound-data-type/Prolog/compound-data-type-2.pro create mode 100644 Task/Compound-data-type/Prolog/compound-data-type-3.pro create mode 100644 Task/Compound-data-type/VBA/compound-data-type.vba create mode 100644 Task/Concurrent-computing/Neko/concurrent-computing.neko create mode 100644 Task/Concurrent-computing/Perl-6/concurrent-computing.pl6 create mode 100644 Task/Concurrent-computing/Python/concurrent-computing-8.py create mode 100644 Task/Concurrent-computing/VBA/concurrent-computing.vba rename Task/Concurrent-computing/Visual-Basic-.NET/{concurrent-computing.visual => concurrent-computing-1.visual} (100%) create mode 100644 Task/Concurrent-computing/Visual-Basic-.NET/concurrent-computing-2.visual create mode 100644 Task/Conditional-structures/ARM-Assembly/conditional-structures.arm create mode 100644 Task/Conditional-structures/AutoHotkey/conditional-structures-3.ahk create mode 100644 Task/Conditional-structures/Forth/conditional-structures-6.fth create mode 100644 Task/Conditional-structures/Ol/conditional-structures-1.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-2.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-3.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-4.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-5.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-6.ol create mode 100644 Task/Conditional-structures/Ol/conditional-structures-7.ol create mode 100644 Task/Conditional-structures/Phix/conditional-structures-5.phix create mode 100644 Task/Constrained-genericity/Crystal/constrained-genericity.crystal create mode 100644 Task/Constrained-genericity/Objeck/constrained-genericity.objeck rename Task/Constrained-random-points-on-a-circle/Perl/{constrained-random-points-on-a-circle.pl => constrained-random-points-on-a-circle-1.pl} (100%) create mode 100644 Task/Constrained-random-points-on-a-circle/Perl/constrained-random-points-on-a-circle-2.pl create mode 100644 Task/Continued-fraction-Arithmetic-Construct-from-rational-number/00META.yaml create mode 100644 Task/Continued-fraction-Arithmetic-Construct-from-rational-number/Factor/continued-fraction-arithmetic-construct-from-rational-number.factor create mode 100644 Task/Continued-fraction-Arithmetic-Construct-from-rational-number/Phix/continued-fraction-arithmetic-construct-from-rational-number.phix create mode 100644 Task/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N-/00META.yaml create mode 100644 Task/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N-/Julia/continued-fraction-arithmetic-g-matrix-ng,-contined-fraction-n-.julia create mode 100644 Task/Continued-fraction/00META.yaml create mode 100644 Task/Continued-fraction/PicoLisp/continued-fraction.l create mode 100644 Task/Continued-fraction/VBA/continued-fraction.vba create mode 100644 Task/Continued-fraction/Visual-Basic-.NET/continued-fraction.visual create mode 100644 Task/Convert-decimal-number-to-rational/00META.yaml create mode 100644 Task/Convert-decimal-number-to-rational/AppleScript/convert-decimal-number-to-rational.applescript create mode 100644 Task/Convert-decimal-number-to-rational/Groovy/convert-decimal-number-to-rational.groovy create mode 100644 Task/Convert-decimal-number-to-rational/JavaScript/convert-decimal-number-to-rational.js create mode 100644 Task/Convert-decimal-number-to-rational/Julia/convert-decimal-number-to-rational-1.julia create mode 100644 Task/Convert-decimal-number-to-rational/Julia/convert-decimal-number-to-rational-2.julia delete mode 100644 Task/Convert-decimal-number-to-rational/Julia/convert-decimal-number-to-rational.julia rename Task/Convert-decimal-number-to-rational/Python/{convert-decimal-number-to-rational.py => convert-decimal-number-to-rational-1.py} (100%) create mode 100644 Task/Convert-decimal-number-to-rational/Python/convert-decimal-number-to-rational-2.py create mode 100644 Task/Convert-decimal-number-to-rational/R/convert-decimal-number-to-rational.r create mode 100644 Task/Conways-Game-of-Life/C++/conways-game-of-life-3.cpp create mode 100644 Task/Conways-Game-of-Life/Ol/conways-game-of-life.ol create mode 100644 Task/Conways-Game-of-Life/Rust/conways-game-of-life.rust create mode 100644 Task/Copy-a-string/ARM-Assembly/copy-a-string.arm create mode 100644 Task/Copy-a-string/Prolog/copy-a-string.pro create mode 100644 Task/Copy-a-string/Red/copy-a-string.red create mode 100644 Task/Copy-a-string/VBA/copy-a-string.vba create mode 100644 Task/Count-in-factors/M4/count-in-factors.m4 create mode 100644 Task/Count-in-factors/Perl-6/count-in-factors-3.pl6 create mode 100644 Task/Count-in-factors/Rust/count-in-factors.rust create mode 100644 Task/Count-in-octal/ARM-Assembly/count-in-octal.arm rename Task/Count-in-octal/Dc/{count-in-octal.dc => count-in-octal-1.dc} (100%) create mode 100644 Task/Count-in-octal/Dc/count-in-octal-2.dc create mode 100644 Task/Count-in-octal/Dc/count-in-octal-3.dc create mode 100644 Task/Count-in-octal/M4/count-in-octal.m4 create mode 100644 Task/Count-occurrences-of-a-substring/BASIC/count-occurrences-of-a-substring-4.basic create mode 100644 Task/Count-occurrences-of-a-substring/Visual-Basic-.NET/count-occurrences-of-a-substring.visual create mode 100644 Task/Count-the-coins/00META.yaml create mode 100644 Task/Count-the-coins/Swift/count-the-coins.swift create mode 100644 Task/Count-the-coins/VBA/count-the-coins.vba create mode 100644 Task/Count-the-coins/Visual-Basic/count-the-coins.vb create mode 100644 Task/Create-a-file-on-magnetic-tape/C++/create-a-file-on-magnetic-tape.cpp create mode 100644 Task/Create-a-file-on-magnetic-tape/Java/create-a-file-on-magnetic-tape.java create mode 100644 Task/Create-a-file-on-magnetic-tape/Julia/create-a-file-on-magnetic-tape.julia create mode 100644 Task/Create-a-file-on-magnetic-tape/Lua/create-a-file-on-magnetic-tape.lua create mode 100644 Task/Create-a-file-on-magnetic-tape/Phix/create-a-file-on-magnetic-tape.phix create mode 100644 Task/Create-a-file-on-magnetic-tape/Rust/create-a-file-on-magnetic-tape.rust create mode 100644 Task/Create-a-file/ARM-Assembly/create-a-file.arm create mode 100644 Task/Create-a-file/VBA/create-a-file.vba create mode 100644 Task/Create-a-file/Visual-Objects/create-a-file.vobj create mode 100644 Task/Create-a-two-dimensional-array-at-runtime/Visual-Basic-.NET/create-a-two-dimensional-array-at-runtime.visual create mode 100644 Task/Create-a-two-dimensional-array-at-runtime/ZX-Spectrum-Basic/create-a-two-dimensional-array-at-runtime.zx create mode 100644 Task/Create-an-HTML-table/Lambdatalk/create-an-html-table.lambdatalk create mode 100644 Task/Create-an-HTML-table/Prolog/create-an-html-table-1.pro create mode 100644 Task/Create-an-HTML-table/Prolog/create-an-html-table-2.pro create mode 100644 Task/Create-an-HTML-table/Python/create-an-html-table-3.py create mode 100644 Task/Create-an-HTML-table/Python/create-an-html-table-4.py create mode 100644 Task/Create-an-HTML-table/Red/create-an-html-table.red create mode 100644 Task/Create-an-HTML-table/Visual-Basic-.NET/create-an-html-table-1.visual create mode 100644 Task/Create-an-HTML-table/Visual-Basic-.NET/create-an-html-table-2.visual create mode 100644 Task/Create-an-HTML-table/Visual-Basic-.NET/create-an-html-table-3.visual create mode 100644 Task/Create-an-object-at-a-given-address/Nim/create-an-object-at-a-given-address.nim create mode 100644 Task/Create-an-object-at-a-given-address/Perl-6/create-an-object-at-a-given-address.pl6 create mode 100644 Task/Currying/00META.yaml create mode 100644 Task/Currying/Aime/currying.aime create mode 100644 Task/Currying/Python/currying-5.py create mode 100644 Task/Currying/Visual-Basic-.NET/currying-1.visual create mode 100644 Task/Currying/Visual-Basic-.NET/currying-2.visual create mode 100644 Task/Currying/Visual-Basic-.NET/currying-3.visual create mode 100644 Task/Currying/Visual-Basic-.NET/currying-4.visual create mode 100644 Task/Cut-a-rectangle/00META.yaml create mode 100644 Task/Cut-a-rectangle/Julia/cut-a-rectangle.julia create mode 100644 Task/Cut-a-rectangle/Phix/cut-a-rectangle.phix create mode 100644 Task/DNS-query/ARM-Assembly/dns-query.arm create mode 100644 Task/DNS-query/Common-Lisp/dns-query-7.lisp create mode 100644 Task/DNS-query/Factor/dns-query.factor create mode 100644 Task/DNS-query/J/dns-query-3.j create mode 100644 Task/DNS-query/Julia/dns-query.julia create mode 100644 Task/DNS-query/Lua/dns-query.lua create mode 100644 Task/DNS-query/Neko/dns-query-1.neko create mode 100644 Task/DNS-query/Neko/dns-query-2.neko create mode 100644 Task/DNS-query/Neko/dns-query-3.neko create mode 100644 Task/DNS-query/Nim/dns-query.nim create mode 100644 Task/DNS-query/Phix/dns-query.phix create mode 100644 Task/Date-format/AppleScript/date-format.applescript create mode 100644 Task/Date-format/Neko/date-format.neko rename Task/Date-format/Smalltalk/{date-format.st => date-format-1.st} (100%) create mode 100644 Task/Date-format/Smalltalk/date-format-2.st create mode 100644 Task/Date-manipulation/Factor/date-manipulation.factor create mode 100644 Task/Day-of-the-week/ALGOL-M/day-of-the-week.algol-m create mode 100644 Task/Day-of-the-week/Arc/day-of-the-week-1.arc create mode 100644 Task/Day-of-the-week/Arc/day-of-the-week-2.arc create mode 100644 Task/Day-of-the-week/BASIC/day-of-the-week-6.basic create mode 100644 Task/Day-of-the-week/Prolog/day-of-the-week.pro rename Task/Day-of-the-week/Python/{day-of-the-week.py => day-of-the-week-1.py} (100%) create mode 100644 Task/Day-of-the-week/Python/day-of-the-week-2.py create mode 100644 Task/Day-of-the-week/SQL/day-of-the-week.sql rename Task/Day-of-the-week/Stata/{day-of-the-week.stata => day-of-the-week-1.stata} (71%) create mode 100644 Task/Day-of-the-week/Stata/day-of-the-week-2.stata create mode 100644 Task/Day-of-the-week/Visual-Objects/day-of-the-week.vobj create mode 100644 Task/Deal-cards-for-FreeCell/Factor/deal-cards-for-freecell.factor create mode 100644 Task/Deal-cards-for-FreeCell/Julia/deal-cards-for-freecell.julia create mode 100644 Task/Deal-cards-for-FreeCell/PHP/deal-cards-for-freecell.php create mode 100644 Task/Deal-cards-for-FreeCell/Swift/deal-cards-for-freecell.swift create mode 100644 Task/Death-Star/Julia/death-star.julia create mode 100644 Task/Death-Star/Maple/death-star.maple create mode 100644 Task/Deconvolution-1D/Perl/deconvolution-1d.pl rename Task/Deconvolution-1D/Python/{deconvolution-1d.py => deconvolution-1d-1.py} (100%) create mode 100644 Task/Deconvolution-1D/Python/deconvolution-1d-2.py create mode 100644 Task/Deconvolution-2D+/Go/deconvolution-2d+.go create mode 100644 Task/Deconvolution-2D+/Julia/deconvolution-2d+.julia create mode 100644 Task/Deconvolution-2D+/Perl/deconvolution-2d+.pl create mode 100644 Task/Deconvolution-2D+/Phix/deconvolution-2d+.phix create mode 100644 Task/Deconvolution-2D+/Python/deconvolution-2d+.py create mode 100644 Task/Deepcopy/00META.yaml create mode 100644 Task/Deepcopy/Scheme/deepcopy.ss create mode 100644 Task/Define-a-primitive-data-type/Free-Pascal/define-a-primitive-data-type.free create mode 100644 Task/Define-a-primitive-data-type/Rust/define-a-primitive-data-type.rust create mode 100644 Task/Delegates/Objeck/delegates.objeck create mode 100644 Task/Delegates/Rust/delegates-1.rust create mode 100644 Task/Delegates/Rust/delegates-2.rust create mode 100644 Task/Delegates/Smalltalk/delegates-1.st create mode 100644 Task/Delegates/Smalltalk/delegates-2.st create mode 100644 Task/Delegates/Smalltalk/delegates-3.st create mode 100644 Task/Delete-a-file/Aime/delete-a-file.aime create mode 100644 Task/Delete-a-file/BASIC/delete-a-file-5.basic create mode 100644 Task/Delete-a-file/BASIC/delete-a-file-6.basic create mode 100644 Task/Delete-a-file/BASIC/delete-a-file-7.basic create mode 100644 Task/Delete-a-file/Free-Pascal/delete-a-file.free create mode 100644 Task/Detect-division-by-zero/BASIC/detect-division-by-zero-8.basic create mode 100644 Task/Detect-division-by-zero/Ol/detect-division-by-zero.ol create mode 100644 Task/Detect-division-by-zero/Q/detect-division-by-zero.q create mode 100644 Task/Determine-if-a-string-is-numeric/ARM-Assembly/determine-if-a-string-is-numeric.arm create mode 100644 Task/Determine-if-a-string-is-numeric/Free-Pascal/determine-if-a-string-is-numeric.free create mode 100644 Task/Determine-if-a-string-is-numeric/Scala/determine-if-a-string-is-numeric-4.scala create mode 100644 Task/Determine-if-only-one-instance-is-running/Julia/determine-if-only-one-instance-is-running.julia create mode 100644 Task/Digital-root/00META.yaml create mode 100644 Task/Digital-root/AppleScript/digital-root.applescript rename Task/Digital-root/Python/{digital-root.py => digital-root-1.py} (100%) create mode 100644 Task/Digital-root/Python/digital-root-2.py create mode 100644 Task/Digital-root/SmileBASIC/digital-root.smilebasic create mode 100644 Task/Digital-root/TI-83-BASIC/digital-root.ti-83 create mode 100644 Task/Digital-root/VBA/digital-root.vba create mode 100644 Task/Digital-root/Visual-Basic-.NET/digital-root.visual create mode 100644 Task/Dinesmans-multiple-dwelling-problem/Crystal/dinesmans-multiple-dwelling-problem.crystal rename Task/Dinesmans-multiple-dwelling-problem/PureBasic/{dinesmans-multiple-dwelling-problem.purebasic => dinesmans-multiple-dwelling-problem-1.purebasic} (100%) create mode 100644 Task/Dinesmans-multiple-dwelling-problem/PureBasic/dinesmans-multiple-dwelling-problem-2.purebasic create mode 100644 Task/Dinesmans-multiple-dwelling-problem/Python/dinesmans-multiple-dwelling-problem-5.py create mode 100644 Task/Dinesmans-multiple-dwelling-problem/Python/dinesmans-multiple-dwelling-problem-6.py create mode 100644 Task/Dining-philosophers/Elixir/dining-philosophers.elixir create mode 100644 Task/Dining-philosophers/J/dining-philosophers-1.j create mode 100644 Task/Dining-philosophers/J/dining-philosophers-2.j create mode 100644 Task/Dining-philosophers/J/dining-philosophers-3.j create mode 100644 Task/Dining-philosophers/J/dining-philosophers-4.j create mode 100644 Task/Dining-philosophers/Modula-3/dining-philosophers.mod3 create mode 100644 Task/Dining-philosophers/Pascal/dining-philosophers-1.pascal create mode 100644 Task/Dining-philosophers/Pascal/dining-philosophers-2.pascal create mode 100644 Task/Dining-philosophers/Pascal/dining-philosophers-3.pascal create mode 100644 Task/Dining-philosophers/Pascal/dining-philosophers-4.pascal create mode 100644 Task/Dining-philosophers/Simula/dining-philosophers.simula create mode 100644 Task/Dining-philosophers/VBA/dining-philosophers.vba create mode 100644 Task/Discordian-date/C-sharp/discordian-date.cs create mode 100644 Task/Distributed-programming/Julia/distributed-programming-1.julia create mode 100644 Task/Distributed-programming/Julia/distributed-programming-2.julia create mode 100644 Task/Documentation/Julia/documentation-1.julia create mode 100644 Task/Documentation/Julia/documentation-2.julia create mode 100644 Task/Documentation/Neko/documentation-1.neko create mode 100644 Task/Documentation/Neko/documentation-2.neko create mode 100644 Task/Documentation/Neko/documentation-3.neko create mode 100644 Task/Documentation/Objeck/documentation.objeck create mode 100644 Task/Documentation/Rust/documentation.rust create mode 100644 Task/Dot-product/00META.yaml create mode 100644 Task/Dot-product/GLSL/dot-product.glsl create mode 100644 Task/Dot-product/LLVM/dot-product.llvm create mode 100644 Task/Dot-product/Ol/dot-product.ol rename Task/Dot-product/Python/{dot-product.py => dot-product-1.py} (100%) create mode 100644 Task/Dot-product/Python/dot-product-2.py create mode 100644 Task/Dot-product/RPL/dot-product.rpl create mode 100644 Task/Dot-product/VBA/dot-product.vba create mode 100644 Task/Dot-product/Visual-Basic-.NET/dot-product.visual create mode 100644 Task/Dot-product/Visual-Basic/dot-product.vb create mode 100644 Task/Doubly-linked-list-Definition/ARM-Assembly/doubly-linked-list-definition.arm create mode 100644 Task/Doubly-linked-list-Definition/Julia/doubly-linked-list-definition-1.julia create mode 100644 Task/Doubly-linked-list-Definition/Julia/doubly-linked-list-definition-2.julia create mode 100644 Task/Doubly-linked-list-Element-definition/ARM-Assembly/doubly-linked-list-element-definition.arm create mode 100644 Task/Doubly-linked-list-Element-insertion/Julia/doubly-linked-list-element-insertion.julia create mode 100644 Task/Doubly-linked-list-Traversal/ARM-Assembly/doubly-linked-list-traversal.arm create mode 100644 Task/Doubly-linked-list-Traversal/Julia/doubly-linked-list-traversal.julia rename Task/Dragon-curve/BASIC/{dragon-curve.basic => dragon-curve-1.basic} (100%) create mode 100644 Task/Dragon-curve/BASIC/dragon-curve-2.basic rename Task/Draw-a-clock/BASIC/{draw-a-clock.basic => draw-a-clock-1.basic} (100%) create mode 100644 Task/Draw-a-clock/BASIC/draw-a-clock-2.basic create mode 100644 Task/Draw-a-clock/Forth/draw-a-clock.fth create mode 100644 Task/Draw-a-clock/Julia/draw-a-clock.julia create mode 100644 Task/Draw-a-clock/ZX-Spectrum-Basic/draw-a-clock.zx create mode 100644 Task/Draw-a-cuboid/AWK/draw-a-cuboid.awk create mode 100644 Task/Draw-a-cuboid/Factor/draw-a-cuboid.factor create mode 100644 Task/Draw-a-cuboid/Maple/draw-a-cuboid.maple rename Task/Draw-a-cuboid/Phix/{draw-a-cuboid.phix => draw-a-cuboid-1.phix} (100%) create mode 100644 Task/Draw-a-cuboid/Phix/draw-a-cuboid-2.phix create mode 100644 Task/Draw-a-cuboid/Phix/draw-a-cuboid-3.phix create mode 100644 Task/Draw-a-sphere/AWK/draw-a-sphere.awk create mode 100644 Task/Draw-a-sphere/BASIC/draw-a-sphere-12.basic create mode 100644 Task/Draw-a-sphere/Perl-6/draw-a-sphere-1.pl6 create mode 100644 Task/Draw-a-sphere/Perl-6/draw-a-sphere-2.pl6 delete mode 100644 Task/Draw-a-sphere/Perl-6/draw-a-sphere.pl6 create mode 100644 Task/Dutch-national-flag-problem/00META.yaml create mode 100644 Task/Dutch-national-flag-problem/ABAP/dutch-national-flag-problem.abap create mode 100644 Task/Dutch-national-flag-problem/FreeBASIC/dutch-national-flag-problem.freebasic create mode 100644 Task/Dynamic-variable-names/APL/dynamic-variable-names.apl create mode 100644 Task/Dynamic-variable-names/Go/dynamic-variable-names.go create mode 100644 Task/Echo-server/Julia/echo-server.julia rename Task/Echo-server/Python/{echo-server.py => echo-server-1.py} (100%) create mode 100644 Task/Echo-server/Python/echo-server-2.py create mode 100644 Task/Echo-server/Python/echo-server-3.py create mode 100644 Task/Element-wise-operations/Factor/element-wise-operations.factor create mode 100644 Task/Element-wise-operations/Groovy/element-wise-operations-1.groovy create mode 100644 Task/Element-wise-operations/Groovy/element-wise-operations-2.groovy create mode 100644 Task/Element-wise-operations/Groovy/element-wise-operations-3.groovy create mode 100644 Task/Element-wise-operations/Standard-ML/element-wise-operations-1.ml create mode 100644 Task/Element-wise-operations/Standard-ML/element-wise-operations-2.ml create mode 100644 Task/Empty-directory/00META.yaml create mode 100644 Task/Empty-program/ABAP/empty-program.abap create mode 100644 Task/Empty-program/Retro/empty-program.retro create mode 100644 Task/Empty-program/Robotic/empty-program.robotic create mode 100644 Task/Empty-string/00META.yaml create mode 100644 Task/Empty-string/ARM-Assembly/empty-string.arm create mode 100644 Task/Empty-string/BASIC/empty-string-4.basic rename Task/Empty-string/C-sharp/{empty-string.cs => empty-string-1.cs} (100%) create mode 100644 Task/Empty-string/C-sharp/empty-string-2.cs create mode 100644 Task/Empty-string/Free-Pascal/empty-string-1.free create mode 100644 Task/Empty-string/Free-Pascal/empty-string-2.free create mode 100644 Task/Empty-string/Free-Pascal/empty-string-3.free create mode 100644 Task/Empty-string/Mercury/empty-string.mercury create mode 100644 Task/Empty-string/Visual-Basic-.NET/empty-string-1.visual create mode 100644 Task/Empty-string/Visual-Basic-.NET/empty-string-2.visual create mode 100644 Task/Enforced-immutability/Swift/enforced-immutability-1.swift create mode 100644 Task/Enforced-immutability/Swift/enforced-immutability-2.swift create mode 100644 Task/Enforced-immutability/Swift/enforced-immutability-3.swift create mode 100644 Task/Enumerations/Pascal/enumerations.pascal create mode 100644 Task/Environment-variables/BASIC/environment-variables-4.basic create mode 100644 Task/Environment-variables/BASIC/environment-variables-5.basic create mode 100644 Task/Environment-variables/Rust/environment-variables.rust create mode 100644 Task/Environment-variables/Visual-Basic/environment-variables.vb create mode 100644 Task/Equilibrium-index/00META.yaml create mode 100644 Task/Equilibrium-index/Python/equilibrium-index-6.py create mode 100644 Task/Ethiopian-multiplication/BASIC/ethiopian-multiplication-11.basic create mode 100644 Task/Ethiopian-multiplication/Python/ethiopian-multiplication-4.py create mode 100644 Task/Euler-method/Factor/euler-method.factor create mode 100644 Task/Euler-method/Rust/euler-method.rust create mode 100644 Task/Euler-method/VBA/euler-method.vba rename Task/Evaluate-binomial-coefficients/AppleScript/{evaluate-binomial-coefficients.applescript => evaluate-binomial-coefficients-1.applescript} (100%) create mode 100644 Task/Evaluate-binomial-coefficients/AppleScript/evaluate-binomial-coefficients-2.applescript create mode 100644 Task/Evaluate-binomial-coefficients/Batch-File/evaluate-binomial-coefficients.bat create mode 100644 Task/Evaluate-binomial-coefficients/Python/evaluate-binomial-coefficients-3.py create mode 100644 Task/Evaluate-binomial-coefficients/Python/evaluate-binomial-coefficients-4.py rename Task/Evaluate-binomial-coefficients/Rust/{evaluate-binomial-coefficients.rust => evaluate-binomial-coefficients-1.rust} (100%) create mode 100644 Task/Evaluate-binomial-coefficients/Rust/evaluate-binomial-coefficients-2.rust create mode 100644 Task/Even-or-odd/00META.yaml create mode 100644 Task/Even-or-odd/Agda/even-or-odd.agda rename Task/Even-or-odd/BASIC/{even-or-odd.basic => even-or-odd-1.basic} (100%) create mode 100644 Task/Even-or-odd/BASIC/even-or-odd-2.basic create mode 100644 Task/Even-or-odd/LLVM/even-or-odd.llvm create mode 100644 Task/Even-or-odd/MAXScript/even-or-odd.max create mode 100644 Task/Even-or-odd/Visual-Basic-.NET/even-or-odd.visual create mode 100644 Task/Even-or-odd/Xojo/even-or-odd.xojo create mode 100644 Task/Events/Phix/events-1.phix create mode 100644 Task/Events/Phix/events-2.phix create mode 100644 Task/Events/Rust/events.rust create mode 100644 Task/Evolutionary-algorithm/00META.yaml create mode 100644 Task/Evolutionary-algorithm/Swift/evolutionary-algorithm.swift create mode 100644 Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Factor/exceptions-catch-an-exception-thrown-in-a-nested-call.factor create mode 100644 Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Rust/exceptions-catch-an-exception-thrown-in-a-nested-call.rust create mode 100644 Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Visual-Basic-.NET/exceptions-catch-an-exception-thrown-in-a-nested-call-1.visual create mode 100644 Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Visual-Basic-.NET/exceptions-catch-an-exception-thrown-in-a-nested-call-2.visual create mode 100644 Task/Exceptions/Prolog/exceptions.pro create mode 100644 Task/Executable-library/00META.yaml create mode 100644 Task/Execute-Brain----/Brainf---/execute-brain-----1.bf create mode 100644 Task/Execute-Brain----/Brainf---/execute-brain-----2.bf create mode 100644 Task/Execute-Brain----/Brainf---/execute-brain-----3.bf create mode 100644 Task/Execute-Brain----/FreeBASIC/execute-brain----.freebasic create mode 100644 Task/Execute-Brain----/Lua/execute-brain----.lua create mode 100644 Task/Execute-HQ9+/00META.yaml create mode 100644 Task/Execute-HQ9+/BASIC256/execute-hq9+.basic256 create mode 100644 Task/Execute-HQ9+/Factor/execute-hq9+.factor create mode 100644 Task/Execute-HQ9+/FreeBASIC/execute-hq9+.freebasic create mode 100644 Task/Execute-SNUSP/Julia/execute-snusp.julia create mode 100644 Task/Execute-a-Markov-algorithm/JavaScript/execute-a-markov-algorithm.js rename Task/Exponentiation-operator/BASIC/{exponentiation-operator.basic => exponentiation-operator-1.basic} (100%) create mode 100644 Task/Exponentiation-operator/BASIC/exponentiation-operator-2.basic create mode 100644 Task/Exponentiation-operator/BASIC/exponentiation-operator-3.basic create mode 100644 Task/Exponentiation-operator/Swift/exponentiation-operator.swift create mode 100644 Task/Exponentiation-operator/VBA/exponentiation-operator.vba create mode 100644 Task/Extend-your-language/00META.yaml create mode 100644 Task/Extend-your-language/Coq/extend-your-language.coq create mode 100644 Task/Extend-your-language/Free-Pascal/extend-your-language.free create mode 100644 Task/Extend-your-language/Java/extend-your-language-1.java create mode 100644 Task/Extend-your-language/Java/extend-your-language-2.java create mode 100644 Task/Extend-your-language/Java/extend-your-language-3.java create mode 100644 Task/Extend-your-language/Java/extend-your-language-4.java create mode 100644 Task/Extend-your-language/Julia/extend-your-language.julia create mode 100644 Task/Extend-your-language/ZX-Spectrum-Basic/extend-your-language.zx create mode 100644 Task/Extensible-prime-generator/00META.yaml rename Task/Extensible-prime-generator/Clojure/{extensible-prime-generator.clj => extensible-prime-generator-1.clj} (100%) create mode 100644 Task/Extensible-prime-generator/Clojure/extensible-prime-generator-2.clj create mode 100644 Task/Extensible-prime-generator/Dart/extensible-prime-generator.dart create mode 100644 Task/Extensible-prime-generator/Elixir/extensible-prime-generator.elixir rename Task/Extensible-prime-generator/Julia/{extensible-prime-generator.julia => extensible-prime-generator-1.julia} (100%) create mode 100644 Task/Extensible-prime-generator/Julia/extensible-prime-generator-2.julia create mode 100644 Task/Extensible-prime-generator/Julia/extensible-prime-generator-3.julia create mode 100644 Task/Extensible-prime-generator/Julia/extensible-prime-generator-4.julia create mode 100644 Task/Extensible-prime-generator/Julia/extensible-prime-generator-5.julia rename Task/Extensible-prime-generator/Kotlin/{extensible-prime-generator.kotlin => extensible-prime-generator-1.kotlin} (82%) create mode 100644 Task/Extensible-prime-generator/Kotlin/extensible-prime-generator-2.kotlin create mode 100644 Task/Extensible-prime-generator/Kotlin/extensible-prime-generator-3.kotlin create mode 100644 Task/Extensible-prime-generator/Nim/extensible-prime-generator-1.nim create mode 100644 Task/Extensible-prime-generator/Nim/extensible-prime-generator-2.nim create mode 100644 Task/Extensible-prime-generator/Nim/extensible-prime-generator-3.nim create mode 100644 Task/Extensible-prime-generator/Pascal/extensible-prime-generator-1.pascal create mode 100644 Task/Extensible-prime-generator/Pascal/extensible-prime-generator-2.pascal rename Task/Extensible-prime-generator/Pascal/{extensible-prime-generator.pascal => extensible-prime-generator-3.pascal} (100%) create mode 100644 Task/Extensible-prime-generator/Python/extensible-prime-generator-4.py create mode 100644 Task/Extensible-prime-generator/Swift/extensible-prime-generator.swift create mode 100644 Task/Factorial/ARM-Assembly/factorial.arm create mode 100644 Task/Factorial/Agda/factorial.agda create mode 100644 Task/Factorial/BASIC/factorial-6.basic create mode 100644 Task/Factorial/C++/factorial-4.cpp create mode 100644 Task/Factorial/Common-Lisp/factorial-5.lisp create mode 100644 Task/Factorial/Dylan/factorial-1.dylan create mode 100644 Task/Factorial/Dylan/factorial-2.dylan create mode 100644 Task/Factorial/Dylan/factorial-3.dylan create mode 100644 Task/Factorial/Dylan/factorial-4.dylan delete mode 100644 Task/Factorial/Dylan/factorial.dylan create mode 100644 Task/Factorial/Excel/factorial.excel create mode 100644 Task/Factorial/Gambas/factorial.gambas create mode 100644 Task/Factorial/LLVM/factorial.llvm create mode 100644 Task/Factorial/Nickle/factorial.nickle rename Task/Factorial/Phix/{factorial.phix => factorial-1.phix} (100%) create mode 100644 Task/Factorial/Phix/factorial-2.phix create mode 100644 Task/Factorial/Python/factorial-6.py create mode 100644 Task/Factorial/Python/factorial-7.py create mode 100644 Task/Factorial/Racket/factorial-3.rkt create mode 100644 Task/Factorial/Racket/factorial-4.rkt create mode 100644 Task/Factorial/Scala/factorial-6.scala create mode 100644 Task/Factorial/Smalltalk/factorial-5.st create mode 100644 Task/Factorial/Spin/factorial.spin create mode 100644 Task/Factorial/Visual-Basic-.NET/factorial.visual create mode 100644 Task/Factorial/Visual-Basic/factorial.vb create mode 100644 Task/Factors-of-a-Mersenne-number/Factor/factors-of-a-mersenne-number.factor create mode 100644 Task/Factors-of-an-integer/ALGOL-M/factors-of-an-integer.algol-m create mode 100644 Task/Factors-of-an-integer/Arc/factors-of-an-integer-1.arc create mode 100644 Task/Factors-of-an-integer/Arc/factors-of-an-integer-2.arc create mode 100644 Task/Factors-of-an-integer/BASIC/factors-of-an-integer-3.basic create mode 100644 Task/Factors-of-an-integer/Burlesque/factors-of-an-integer.blq rename Task/Factors-of-an-integer/Rust/{factors-of-an-integer.rust => factors-of-an-integer-1.rust} (100%) create mode 100644 Task/Factors-of-an-integer/Rust/factors-of-an-integer-2.rust create mode 100644 Task/Fast-Fourier-transform/00META.yaml create mode 100644 Task/Fast-Fourier-transform/Common-Lisp/fast-fourier-transform-1.lisp create mode 100644 Task/Fast-Fourier-transform/Common-Lisp/fast-fourier-transform-2.lisp delete mode 100644 Task/Fast-Fourier-transform/Common-Lisp/fast-fourier-transform.lisp create mode 100644 Task/Fast-Fourier-transform/Julia/fast-fourier-transform-3.julia create mode 100644 Task/Fast-Fourier-transform/Julia/fast-fourier-transform-4.julia create mode 100644 Task/Fibonacci-n-step-number-sequences/00META.yaml create mode 100644 Task/Fibonacci-n-step-number-sequences/AWK/fibonacci-n-step-number-sequences.awk create mode 100644 Task/Fibonacci-n-step-number-sequences/AppleScript/fibonacci-n-step-number-sequences.applescript create mode 100644 Task/Fibonacci-n-step-number-sequences/Factor/fibonacci-n-step-number-sequences.factor rename Task/Fibonacci-n-step-number-sequences/Haskell/{fibonacci-n-step-number-sequences.hs => fibonacci-n-step-number-sequences-1.hs} (100%) create mode 100644 Task/Fibonacci-n-step-number-sequences/Haskell/fibonacci-n-step-number-sequences-2.hs rename Task/Fibonacci-n-step-number-sequences/JavaScript/{fibonacci-n-step-number-sequences.js => fibonacci-n-step-number-sequences-1.js} (100%) create mode 100644 Task/Fibonacci-n-step-number-sequences/JavaScript/fibonacci-n-step-number-sequences-2.js create mode 100644 Task/Fibonacci-n-step-number-sequences/Ol/fibonacci-n-step-number-sequences-1.ol create mode 100644 Task/Fibonacci-n-step-number-sequences/Ol/fibonacci-n-step-number-sequences-2.ol create mode 100644 Task/Fibonacci-n-step-number-sequences/Python/fibonacci-n-step-number-sequences-4.py create mode 100644 Task/Fibonacci-sequence/Ada/fibonacci-sequence-4.ada create mode 100644 Task/Fibonacci-sequence/BASIC/fibonacci-sequence-10.basic create mode 100644 Task/Fibonacci-sequence/BASIC/fibonacci-sequence-11.basic create mode 100644 Task/Fibonacci-sequence/Clojure/fibonacci-sequence-10.clj create mode 100644 Task/Fibonacci-sequence/Common-Lisp/fibonacci-sequence-8.lisp create mode 100644 Task/Fibonacci-sequence/Dc/fibonacci-sequence.dc create mode 100644 Task/Fibonacci-sequence/Free-Pascal/fibonacci-sequence.free create mode 100644 Task/Fibonacci-sequence/LLVM/fibonacci-sequence.llvm create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-1.lua create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-2.lua create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-3.lua create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-4.lua create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-5.lua create mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence-6.lua delete mode 100644 Task/Fibonacci-sequence/Lua/fibonacci-sequence.lua rename Task/Fibonacci-sequence/Modula-3/{fibonacci-sequence.mod3 => fibonacci-sequence-1.mod3} (100%) create mode 100644 Task/Fibonacci-sequence/Modula-3/fibonacci-sequence-2.mod3 create mode 100644 Task/Fibonacci-sequence/Processing/fibonacci-sequence create mode 100644 Task/Fibonacci-sequence/Python/fibonacci-sequence-14.py create mode 100644 Task/Fibonacci-sequence/Python/fibonacci-sequence-15.py create mode 100644 Task/Fibonacci-sequence/Rust/fibonacci-sequence-5.rust create mode 100644 Task/Fibonacci-sequence/Spin/fibonacci-sequence.spin create mode 100644 Task/Fibonacci-sequence/Visual-Basic-.NET/fibonacci-sequence-4.visual create mode 100644 Task/Fibonacci-sequence/Xojo/fibonacci-sequence.xojo create mode 100644 Task/Fibonacci-word-fractal/00META.yaml create mode 100644 Task/Fibonacci-word-fractal/Factor/fibonacci-word-fractal.factor create mode 100644 Task/Fibonacci-word-fractal/Go/fibonacci-word-fractal.go create mode 100644 Task/Fibonacci-word/00META.yaml create mode 100644 Task/File-input-output/ARM-Assembly/file-input-output.arm create mode 100644 Task/File-input-output/BASIC/file-input-output-4.basic create mode 100644 Task/File-modification-time/Phix/file-modification-time.phix create mode 100644 Task/File-size/Aime/file-size.aime create mode 100644 Task/File-size/COBOL/file-size.cobol create mode 100644 Task/File-size/Visual-Basic/file-size.vb create mode 100644 Task/Filter/Elena/filter-1.elena create mode 100644 Task/Filter/Elena/filter-2.elena delete mode 100644 Task/Filter/Elena/filter.elena create mode 100644 Task/Filter/Python/filter-4.py create mode 100644 Task/Filter/Q/filter.q create mode 100644 Task/Find-common-directory-path/FreeBASIC/find-common-directory-path.freebasic rename Task/Find-common-directory-path/Haskell/{find-common-directory-path.hs => find-common-directory-path-1.hs} (100%) create mode 100644 Task/Find-common-directory-path/Haskell/find-common-directory-path-2.hs create mode 100644 Task/Find-common-directory-path/JavaScript/find-common-directory-path.js create mode 100644 Task/Find-common-directory-path/PowerBASIC/find-common-directory-path.powerbasic create mode 100644 Task/Find-common-directory-path/Rust/find-common-directory-path.rust create mode 100644 Task/Find-common-directory-path/Visual-Basic/find-common-directory-path.vb create mode 100644 Task/Find-largest-left-truncatable-prime-in-a-given-base/00META.yaml create mode 100644 Task/Find-largest-left-truncatable-prime-in-a-given-base/Phix/find-largest-left-truncatable-prime-in-a-given-base.phix rename Task/Find-largest-left-truncatable-prime-in-a-given-base/Sidef/{find-largest-left-truncatable-prime-in-a-given-base.sidef => find-largest-left-truncatable-prime-in-a-given-base-1.sidef} (59%) create mode 100644 Task/Find-largest-left-truncatable-prime-in-a-given-base/Sidef/find-largest-left-truncatable-prime-in-a-given-base-2.sidef create mode 100644 Task/Find-largest-left-truncatable-prime-in-a-given-base/Swift/find-largest-left-truncatable-prime-in-a-given-base.swift create mode 100644 Task/Find-limit-of-recursion/00META.yaml create mode 100644 Task/Find-limit-of-recursion/AppleScript/find-limit-of-recursion-1.applescript create mode 100644 Task/Find-limit-of-recursion/AppleScript/find-limit-of-recursion-2.applescript create mode 100644 Task/Find-limit-of-recursion/Factor/find-limit-of-recursion-1.factor create mode 100644 Task/Find-limit-of-recursion/Factor/find-limit-of-recursion-2.factor create mode 100644 Task/Find-limit-of-recursion/Neko/find-limit-of-recursion.neko create mode 100644 Task/Find-the-last-Sunday-of-each-month/K/find-the-last-sunday-of-each-month.k create mode 100644 Task/Find-the-missing-permutation/00META.yaml create mode 100644 Task/First-class-environments/Julia/first-class-environments.julia create mode 100644 Task/First-class-functions-Use-numbers-analogously/00META.yaml create mode 100644 Task/First-class-functions-Use-numbers-analogously/Objeck/first-class-functions-use-numbers-analogously.objeck create mode 100644 Task/First-class-functions/Objeck/first-class-functions.objeck create mode 100644 Task/First-class-functions/Ol/first-class-functions.ol rename Task/First-class-functions/Python/{first-class-functions.py => first-class-functions-1.py} (100%) create mode 100644 Task/First-class-functions/Python/first-class-functions-2.py create mode 100644 Task/First-class-functions/Racket/first-class-functions.rkt create mode 100644 Task/First-class-functions/Stata/first-class-functions.stata create mode 100644 Task/Five-weekends/Prolog/five-weekends.pro rename Task/FizzBuzz/D/{fizzbuzz.d => fizzbuzz-1.d} (100%) create mode 100644 Task/FizzBuzz/D/fizzbuzz-2.d rename Task/FizzBuzz/Go/{fizzbuzz.go => fizzbuzz-1.go} (100%) create mode 100644 Task/FizzBuzz/Go/fizzbuzz-2.go create mode 100644 Task/FizzBuzz/Haskell/fizzbuzz-10.hs create mode 100644 Task/FizzBuzz/Haskell/fizzbuzz-8.hs create mode 100644 Task/FizzBuzz/Haskell/fizzbuzz-9.hs create mode 100644 Task/FizzBuzz/Java/fizzbuzz.java create mode 100644 Task/FizzBuzz/JavaScript/fizzbuzz-7.js create mode 100644 Task/FizzBuzz/JavaScript/fizzbuzz-8.js create mode 100644 Task/FizzBuzz/Kotlin/fizzbuzz-4.kotlin create mode 100644 Task/FizzBuzz/LLVM/fizzbuzz.llvm create mode 100644 Task/FizzBuzz/Lua/fizzbuzz-4.lua create mode 100644 Task/FizzBuzz/PHP/fizzbuzz-4.php create mode 100644 Task/FizzBuzz/PHP/fizzbuzz-5.php create mode 100644 Task/FizzBuzz/Perl/fizzbuzz-7.pl create mode 100644 Task/FizzBuzz/PowerShell/fizzbuzz-5.psh create mode 100644 Task/FizzBuzz/Processing/fizzbuzz-4 create mode 100644 Task/FizzBuzz/Python/fizzbuzz-10.py create mode 100644 Task/FizzBuzz/Python/fizzbuzz-7.py create mode 100644 Task/FizzBuzz/Python/fizzbuzz-8.py create mode 100644 Task/FizzBuzz/Python/fizzbuzz-9.py create mode 100644 Task/FizzBuzz/Robotic/fizzbuzz.robotic rename Task/FizzBuzz/Shen/{fizzbuzz.shen => fizzbuzz-1.shen} (100%) create mode 100644 Task/FizzBuzz/Shen/fizzbuzz-2.shen rename Task/FizzBuzz/VBA/{fizzbuzz.vba => fizzbuzz-1.vba} (100%) create mode 100644 Task/FizzBuzz/VBA/fizzbuzz-2.vba create mode 100644 Task/FizzBuzz/X86-Assembly/fizzbuzz.x86 create mode 100644 Task/FizzBuzz/Xojo/fizzbuzz-1.xojo create mode 100644 Task/FizzBuzz/Xojo/fizzbuzz-2.xojo create mode 100644 Task/Flatten-a-list/00META.yaml create mode 100644 Task/Flatten-a-list/JavaScript/flatten-a-list-7.js create mode 100644 Task/Flatten-a-list/JavaScript/flatten-a-list-8.js rename Task/Flatten-a-list/Kotlin/{flatten-a-list.kotlin => flatten-a-list-1.kotlin} (100%) create mode 100644 Task/Flatten-a-list/Kotlin/flatten-a-list-2.kotlin create mode 100644 Task/Flatten-a-list/Python/flatten-a-list-4.py create mode 100644 Task/Flatten-a-list/Python/flatten-a-list-5.py create mode 100644 Task/Flatten-a-list/Q/flatten-a-list.q create mode 100644 Task/Flatten-a-list/REXX/flatten-a-list.rexx create mode 100644 Task/Flipping-bits-game/Phix/flipping-bits-game.phix create mode 100644 Task/Flipping-bits-game/Scala/flipping-bits-game.scala create mode 100644 Task/Flow-control-structures/C-sharp/flow-control-structures-1.cs create mode 100644 Task/Flow-control-structures/C-sharp/flow-control-structures-2.cs create mode 100644 Task/Flow-control-structures/C-sharp/flow-control-structures-3.cs create mode 100644 Task/Flow-control-structures/C-sharp/flow-control-structures-4.cs create mode 100644 Task/Flow-control-structures/C-sharp/flow-control-structures-5.cs create mode 100644 Task/Flow-control-structures/Sidef/flow-control-structures.sidef create mode 100644 Task/Floyds-triangle/00META.yaml rename Task/Floyds-triangle/AppleScript/{floyds-triangle.applescript => floyds-triangle-1.applescript} (100%) create mode 100644 Task/Floyds-triangle/AppleScript/floyds-triangle-2.applescript create mode 100644 Task/Floyds-triangle/BASIC/floyds-triangle-3.basic create mode 100644 Task/Floyds-triangle/BASIC/floyds-triangle-4.basic create mode 100644 Task/Floyds-triangle/Factor/floyds-triangle.factor create mode 100644 Task/Floyds-triangle/Haskell/floyds-triangle-4.hs create mode 100644 Task/Floyds-triangle/Perl-6/floyds-triangle.pl6 create mode 100644 Task/Floyds-triangle/Python/floyds-triangle-3.py create mode 100644 Task/Floyds-triangle/Python/floyds-triangle-4.py create mode 100644 Task/Floyds-triangle/Rust/floyds-triangle.rust create mode 100644 Task/Floyds-triangle/Visual-Basic-.NET/floyds-triangle.visual create mode 100644 Task/Forest-fire/Factor/forest-fire.factor create mode 100644 Task/Forest-fire/Ol/forest-fire.ol rename Task/Forest-fire/Perl-6/{forest-fire.pl6 => forest-fire-1.pl6} (100%) create mode 100644 Task/Forest-fire/Perl-6/forest-fire-2.pl6 create mode 100644 Task/Fork/Batch-File/fork.bat create mode 100644 Task/Fork/Julia/fork.julia create mode 100644 Task/Fork/Rust/fork-1.rust create mode 100644 Task/Fork/Rust/fork-2.rust create mode 100644 Task/Formal-power-series/Phix/formal-power-series.phix create mode 100644 Task/Formatted-numeric-output/ARM-Assembly/formatted-numeric-output.arm create mode 100644 Task/Formatted-numeric-output/Aime/formatted-numeric-output.aime create mode 100644 Task/Formatted-numeric-output/Pascal/formatted-numeric-output.pascal create mode 100644 Task/Forward-difference/ALGOL-W/forward-difference.alg create mode 100644 Task/Forward-difference/Dart/forward-difference.dart create mode 100644 Task/Forward-difference/Swift/forward-difference.swift create mode 100644 Task/Four-bit-adder/BASIC/four-bit-adder-1.basic create mode 100644 Task/Four-bit-adder/BASIC/four-bit-adder-2.basic create mode 100644 Task/Four-bit-adder/Prolog/four-bit-adder.pro create mode 100644 Task/Four-bit-adder/Rust/four-bit-adder.rust create mode 100644 Task/Fractal-tree/BASIC/fractal-tree-5.basic create mode 100644 Task/Fractal-tree/Julia/fractal-tree.julia create mode 100644 Task/Fractran/00META.yaml create mode 100644 Task/Fractran/360-Assembly/fractran.360 create mode 100644 Task/Fractran/Factor/fractran.factor create mode 100644 Task/Fractran/J/fractran-3.j create mode 100644 Task/Fractran/J/fractran-4.j create mode 100644 Task/Fractran/J/fractran-5.j create mode 100644 Task/Fractran/J/fractran-6.j create mode 100644 Task/Fractran/J/fractran-7.j create mode 100644 Task/Fractran/J/fractran-8.j create mode 100644 Task/Fractran/J/fractran-9.j create mode 100644 Task/Fractran/JavaScript/fractran-1.js create mode 100644 Task/Fractran/JavaScript/fractran-2.js delete mode 100644 Task/Fractran/JavaScript/fractran.js create mode 100644 Task/Fractran/Phix/fractran.phix create mode 100644 Task/Fractran/TI-83-BASIC/fractran.ti-83 create mode 100644 Task/Fractran/VBA/fractran.vba create mode 100644 Task/Function-composition/Agda/function-composition.agda create mode 100644 Task/Function-composition/Aime/function-composition.aime create mode 100644 Task/Function-composition/Haskell/function-composition-3.hs create mode 100644 Task/Function-composition/Python/function-composition-3.py create mode 100644 Task/Function-composition/Python/function-composition-4.py create mode 100644 Task/Function-composition/TypeScript/function-composition.type create mode 100644 Task/Function-composition/ZX-Spectrum-Basic/function-composition-1.zx create mode 100644 Task/Function-composition/ZX-Spectrum-Basic/function-composition-2.zx rename Task/Function-definition/6502-Assembly/{function-definition.6502 => function-definition-1.6502} (100%) create mode 100644 Task/Function-definition/6502-Assembly/function-definition-2.6502 create mode 100644 Task/Function-definition/BASIC/function-definition-3.basic create mode 100644 Task/Function-definition/Elena/function-definition-3.elena create mode 100644 Task/Function-definition/Fish/function-definition.fish create mode 100644 Task/Function-definition/Ol/function-definition-1.ol create mode 100644 Task/Function-definition/Ol/function-definition-2.ol create mode 100644 Task/Function-definition/Ol/function-definition-3.ol create mode 100644 Task/Function-definition/Racket/function-definition-3.rkt create mode 100644 Task/Function-definition/Racket/function-definition-4.rkt rename Task/Function-definition/Visual-Basic/{function-definition.vb => function-definition-1.vb} (100%) create mode 100644 Task/Function-definition/Visual-Basic/function-definition-2.vb create mode 100644 Task/Function-definition/Xojo/function-definition-1.xojo create mode 100644 Task/Function-definition/Xojo/function-definition-2.xojo create mode 100644 Task/Function-frequency/Factor/function-frequency.factor create mode 100644 Task/Function-frequency/Phix/function-frequency.phix create mode 100644 Task/Function-prototype/00META.yaml create mode 100644 Task/Function-prototype/Common-Lisp/function-prototype.lisp create mode 100644 Task/Function-prototype/Haskell/function-prototype-1.hs create mode 100644 Task/Function-prototype/Haskell/function-prototype-2.hs create mode 100644 Task/Function-prototype/Haskell/function-prototype-3.hs create mode 100644 Task/Function-prototype/Haskell/function-prototype-4.hs create mode 100644 Task/Function-prototype/Haskell/function-prototype-5.hs create mode 100644 Task/Function-prototype/Haskell/function-prototype-6.hs create mode 100644 Task/Function-prototype/Julia/function-prototype-1.julia create mode 100644 Task/Function-prototype/Julia/function-prototype-2.julia create mode 100644 Task/Function-prototype/OCaml/function-prototype.ocaml create mode 100644 Task/Function-prototype/PureBasic/function-prototype.purebasic create mode 100644 Task/GUI-Maximum-window-dimensions/C-sharp/gui-maximum-window-dimensions-1.cs create mode 100644 Task/GUI-Maximum-window-dimensions/C-sharp/gui-maximum-window-dimensions-2.cs create mode 100644 Task/GUI-Maximum-window-dimensions/Go/gui-maximum-window-dimensions.go create mode 100644 Task/GUI-Maximum-window-dimensions/Julia/gui-maximum-window-dimensions.julia create mode 100644 Task/GUI-Maximum-window-dimensions/Perl-6/gui-maximum-window-dimensions.pl6 create mode 100644 Task/GUI-Maximum-window-dimensions/Visual-Basic-.NET/gui-maximum-window-dimensions-1.visual create mode 100644 Task/GUI-Maximum-window-dimensions/Visual-Basic-.NET/gui-maximum-window-dimensions-2.visual create mode 100644 Task/GUI-component-interaction/Go/gui-component-interaction.go create mode 100644 Task/GUI-enabling-disabling-of-controls/C-sharp/gui-enabling-disabling-of-controls.cs create mode 100644 Task/GUI-enabling-disabling-of-controls/Gambas/gui-enabling-disabling-of-controls.gambas create mode 100644 Task/GUI-enabling-disabling-of-controls/Go/gui-enabling-disabling-of-controls-1.go create mode 100644 Task/GUI-enabling-disabling-of-controls/Go/gui-enabling-disabling-of-controls-2.go create mode 100644 Task/Galton-box-animation/Factor/galton-box-animation.factor create mode 100644 Task/Galton-box-animation/JavaScript/galton-box-animation.js create mode 100644 Task/Galton-box-animation/Julia/galton-box-animation.julia create mode 100644 Task/Galton-box-animation/Perl/galton-box-animation.pl create mode 100644 Task/Galton-box-animation/REXX/galton-box-animation.rexx create mode 100644 Task/Gamma-function/Crystal/gamma-function.crystal create mode 100644 Task/Gamma-function/Factor/gamma-function.factor create mode 100644 Task/Gamma-function/Haskell/gamma-function-3.hs rename Task/Gamma-function/Phix/{gamma-function.phix => gamma-function-1.phix} (100%) create mode 100644 Task/Gamma-function/Phix/gamma-function-2.phix rename Task/Gamma-function/Python/{gamma-function.py => gamma-function-1.py} (100%) create mode 100644 Task/Gamma-function/Python/gamma-function-2.py rename Task/Gamma-function/REXX/{gamma-function.rexx => gamma-function-1.rexx} (100%) create mode 100644 Task/Gamma-function/REXX/gamma-function-2.rexx create mode 100644 Task/Gaussian-elimination/360-Assembly/gaussian-elimination.360 create mode 100644 Task/Gaussian-elimination/Modula-3/gaussian-elimination-1.mod3 create mode 100644 Task/Gaussian-elimination/Modula-3/gaussian-elimination-2.mod3 create mode 100644 Task/Gaussian-elimination/Modula-3/gaussian-elimination-3.mod3 create mode 100644 Task/Gaussian-elimination/Modula-3/gaussian-elimination-4.mod3 create mode 100644 Task/Gaussian-elimination/Phix/gaussian-elimination.phix rename Task/Gaussian-elimination/Python/{gaussian-elimination.py => gaussian-elimination-1.py} (100%) create mode 100644 Task/Gaussian-elimination/Python/gaussian-elimination-2.py create mode 100644 Task/Gaussian-elimination/Rust/gaussian-elimination.rust create mode 100644 Task/Gaussian-elimination/VBA/gaussian-elimination.vba create mode 100644 Task/Gaussian-elimination/VBScript/gaussian-elimination.vb create mode 100644 Task/Generate-Chess960-starting-position/00META.yaml create mode 100644 Task/Generate-Chess960-starting-position/FreeBASIC/generate-chess960-starting-position.freebasic create mode 100644 Task/Generate-Chess960-starting-position/R/generate-chess960-starting-position.r create mode 100644 Task/Generate-Chess960-starting-position/Sidef/generate-chess960-starting-position.sidef create mode 100644 Task/Generate-lower-case-ASCII-alphabet/ALGOL-W/generate-lower-case-ascii-alphabet.alg create mode 100644 Task/Generate-lower-case-ASCII-alphabet/BASIC/generate-lower-case-ascii-alphabet-8.basic create mode 100644 Task/Generate-lower-case-ASCII-alphabet/BASIC/generate-lower-case-ascii-alphabet-9.basic create mode 100644 Task/Generate-lower-case-ASCII-alphabet/Burlesque/generate-lower-case-ascii-alphabet.blq create mode 100644 Task/Generate-lower-case-ASCII-alphabet/Dc/generate-lower-case-ascii-alphabet.dc create mode 100644 Task/Generate-lower-case-ASCII-alphabet/FALSE/generate-lower-case-ascii-alphabet.false create mode 100644 Task/Generate-lower-case-ASCII-alphabet/Free-Pascal/generate-lower-case-ascii-alphabet.free create mode 100644 Task/Generate-lower-case-ASCII-alphabet/MUMPS/generate-lower-case-ascii-alphabet.mumps create mode 100644 Task/Generate-lower-case-ASCII-alphabet/Neko/generate-lower-case-ascii-alphabet.neko create mode 100644 Task/Generate-lower-case-ASCII-alphabet/PowerShell/generate-lower-case-ascii-alphabet-3.psh create mode 100644 Task/Generate-lower-case-ASCII-alphabet/PowerShell/generate-lower-case-ascii-alphabet-4.psh rename Task/Generate-lower-case-ASCII-alphabet/Python/{generate-lower-case-ascii-alphabet.py => generate-lower-case-ascii-alphabet-1.py} (100%) create mode 100644 Task/Generate-lower-case-ASCII-alphabet/Python/generate-lower-case-ascii-alphabet-2.py create mode 100644 Task/Generator-Exponential/00META.yaml create mode 100644 Task/Generator-Exponential/AppleScript/generator-exponential.applescript create mode 100644 Task/Generator-Exponential/Emacs-Lisp/generator-exponential.l create mode 100644 Task/Generator-Exponential/Factor/generator-exponential.factor create mode 100644 Task/Generator-Exponential/JavaScript/generator-exponential-4.js rename Task/Generator-Exponential/Python/{generator-exponential.py => generator-exponential-1.py} (100%) create mode 100644 Task/Generator-Exponential/Python/generator-exponential-2.py create mode 100644 Task/Generator-Exponential/Rust/generator-exponential.rust create mode 100644 Task/Generator-Exponential/VBA/generator-exponential.vba create mode 100644 Task/Generator-Exponential/Visual-Basic-.NET/generator-exponential-1.visual create mode 100644 Task/Generator-Exponential/Visual-Basic-.NET/generator-exponential-2.visual create mode 100644 Task/Generic-swap/Fish/generic-swap.fish create mode 100644 Task/Generic-swap/Free-Pascal/generic-swap.free rename Task/Generic-swap/MATLAB/{generic-swap.m => generic-swap-1.m} (100%) create mode 100644 Task/Generic-swap/MATLAB/generic-swap-2.m rename Task/Generic-swap/Pascal/{generic-swap.pascal => generic-swap-1.pascal} (100%) create mode 100644 Task/Generic-swap/Pascal/generic-swap-2.pascal create mode 100644 Task/Globally-replace-text-in-several-files/00META.yaml create mode 100644 Task/Go-Fish/FreeBASIC/go-fish.freebasic create mode 100644 Task/Gray-code/00META.yaml create mode 100644 Task/Greatest-common-divisor/BASIC/greatest-common-divisor-4.basic create mode 100644 Task/Greatest-common-divisor/C++/greatest-common-divisor-1.cpp create mode 100644 Task/Greatest-common-divisor/C++/greatest-common-divisor-2.cpp delete mode 100644 Task/Greatest-common-divisor/C++/greatest-common-divisor.cpp rename Task/Greatest-common-divisor/Lua/{greatest-common-divisor.lua => greatest-common-divisor-1.lua} (100%) create mode 100644 Task/Greatest-common-divisor/Lua/greatest-common-divisor-2.lua create mode 100644 Task/Greatest-common-divisor/Ol/greatest-common-divisor.ol create mode 100644 Task/Greatest-common-divisor/Python/greatest-common-divisor-5.py rename Task/Greatest-common-divisor/SQL/{greatest-common-divisor.sql => greatest-common-divisor-1.sql} (100%) create mode 100644 Task/Greatest-common-divisor/SQL/greatest-common-divisor-2.sql create mode 100644 Task/Greatest-common-divisor/SQL/greatest-common-divisor-3.sql create mode 100644 Task/Greatest-common-divisor/VBA/greatest-common-divisor-1.vba rename Task/Greatest-common-divisor/VBA/{greatest-common-divisor.vba => greatest-common-divisor-2.vba} (100%) create mode 100644 Task/Greatest-common-divisor/Verilog/greatest-common-divisor.v create mode 100644 Task/Greatest-common-divisor/Visual-Basic/greatest-common-divisor.vb create mode 100644 Task/Greatest-element-of-a-list/ARM-Assembly/greatest-element-of-a-list.arm create mode 100644 Task/Greatest-element-of-a-list/D/greatest-element-of-a-list.d create mode 100644 Task/Greatest-element-of-a-list/Elena/greatest-element-of-a-list.elena create mode 100644 Task/Greatest-element-of-a-list/Neko/greatest-element-of-a-list.neko create mode 100644 Task/Greatest-element-of-a-list/Ol/greatest-element-of-a-list.ol create mode 100644 Task/Greatest-subsequential-sum/Aime/greatest-subsequential-sum.aime create mode 100644 Task/Greatest-subsequential-sum/AppleScript/greatest-subsequential-sum.applescript rename Task/Greatest-subsequential-sum/JavaScript/{greatest-subsequential-sum.js => greatest-subsequential-sum-1.js} (100%) create mode 100644 Task/Greatest-subsequential-sum/JavaScript/greatest-subsequential-sum-2.js create mode 100644 Task/Greatest-subsequential-sum/Python/greatest-subsequential-sum-6.py create mode 100644 Task/Greyscale-bars-Display/Go/greyscale-bars-display.go create mode 100644 Task/Greyscale-bars-Display/Julia/greyscale-bars-display.julia create mode 100644 Task/Greyscale-bars-Display/Perl/greyscale-bars-display.pl create mode 100644 Task/Guess-the-number-With-feedback--player-/Scala/guess-the-number-with-feedback--player-.scala rename Task/Guess-the-number-With-feedback/BASIC/{guess-the-number-with-feedback.basic => guess-the-number-with-feedback-1.basic} (100%) create mode 100644 Task/Guess-the-number-With-feedback/BASIC/guess-the-number-with-feedback-2.basic create mode 100644 Task/Guess-the-number-With-feedback/BASIC/guess-the-number-with-feedback-3.basic create mode 100644 Task/Guess-the-number-With-feedback/Cache-ObjectScript/guess-the-number-with-feedback.cos create mode 100644 Task/Guess-the-number-With-feedback/Lambdatalk/guess-the-number-with-feedback.lambdatalk create mode 100644 Task/Guess-the-number/BASIC/guess-the-number-4.basic create mode 100644 Task/Guess-the-number/Red/guess-the-number.red create mode 100644 Task/Guess-the-number/Visual-Basic-.NET/guess-the-number.visual create mode 100644 Task/HTTP/ABAP/http.abap create mode 100644 Task/HTTP/Crystal/http.crystal create mode 100644 Task/HTTP/Python/http-5.py create mode 100644 Task/HTTP/Visual-Basic/http.vb create mode 100644 Task/HTTPS-Authenticated/Julia/https-authenticated.julia rename Task/HTTPS-Authenticated/Python/{https-authenticated.py => https-authenticated-1.py} (100%) create mode 100644 Task/HTTPS-Authenticated/Python/https-authenticated-2.py create mode 100644 Task/HTTPS-Authenticated/Ruby/https-authenticated.rb create mode 100644 Task/HTTPS-Authenticated/Visual-Basic/https-authenticated.vb create mode 100644 Task/HTTPS-Client-authenticated/Julia/https-client-authenticated.julia create mode 100644 Task/HTTPS-Client-authenticated/Perl-6/https-client-authenticated.pl6 create mode 100644 Task/HTTPS-Client-authenticated/Ruby/https-client-authenticated.rb create mode 100644 Task/HTTPS/JavaScript/https-1.js create mode 100644 Task/HTTPS/JavaScript/https-2.js delete mode 100644 Task/HTTPS/JavaScript/https.js create mode 100644 Task/HTTPS/Python/https-3.py create mode 100644 Task/HTTPS/Visual-Basic/https.vb create mode 100644 Task/Hailstone-sequence/00META.yaml create mode 100644 Task/Hailstone-sequence/ALGOL-W/hailstone-sequence.alg rename Task/Hailstone-sequence/C++/{hailstone-sequence.cpp => hailstone-sequence-1.cpp} (100%) create mode 100644 Task/Hailstone-sequence/C++/hailstone-sequence-2.cpp rename Task/Hailstone-sequence/Python/{hailstone-sequence.py => hailstone-sequence-1.py} (100%) create mode 100644 Task/Hailstone-sequence/Python/hailstone-sequence-2.py create mode 100644 Task/Hailstone-sequence/VBA/hailstone-sequence.vba create mode 100644 Task/Hamming-numbers/00META.yaml create mode 100644 Task/Hamming-numbers/Dart/hamming-numbers-1.dart create mode 100644 Task/Hamming-numbers/Dart/hamming-numbers-2.dart create mode 100644 Task/Hamming-numbers/Dart/hamming-numbers-3.dart create mode 100644 Task/Hamming-numbers/Haskell/hamming-numbers-7.hs create mode 100644 Task/Hamming-numbers/Haskell/hamming-numbers-8.hs create mode 100644 Task/Hamming-numbers/Julia/hamming-numbers-1.julia create mode 100644 Task/Hamming-numbers/Julia/hamming-numbers-2.julia create mode 100644 Task/Hamming-numbers/Julia/hamming-numbers-3.julia create mode 100644 Task/Hamming-numbers/Julia/hamming-numbers-4.julia create mode 100644 Task/Hamming-numbers/Julia/hamming-numbers-5.julia delete mode 100644 Task/Hamming-numbers/Julia/hamming-numbers.julia create mode 100644 Task/Hamming-numbers/Nim/hamming-numbers-7.nim rename Task/Hamming-numbers/Perl-6/{hamming-numbers.pl6 => hamming-numbers-1.pl6} (100%) create mode 100644 Task/Hamming-numbers/Perl-6/hamming-numbers-2.pl6 create mode 100644 Task/Hamming-numbers/SQL/hamming-numbers.sql create mode 100644 Task/Hamming-numbers/VBA/hamming-numbers.vba create mode 100644 Task/Handle-a-signal/C++/handle-a-signal.cpp rename Task/Handle-a-signal/Perl/{handle-a-signal.pl => handle-a-signal-1.pl} (51%) create mode 100644 Task/Handle-a-signal/Perl/handle-a-signal-2.pl create mode 100644 Task/Handle-a-signal/Phix/handle-a-signal.phix create mode 100644 Task/Happy-numbers/ALGOL-W/happy-numbers.alg rename Task/Happy-numbers/Java/{happy-numbers.java => happy-numbers-1.java} (100%) create mode 100644 Task/Happy-numbers/Java/happy-numbers-2.java rename Task/Happy-numbers/K/{happy-numbers.k => happy-numbers-1.k} (100%) create mode 100644 Task/Happy-numbers/K/happy-numbers-2.k rename Task/Happy-numbers/Python/{happy-numbers.py => happy-numbers-1.py} (100%) create mode 100644 Task/Happy-numbers/Python/happy-numbers-2.py rename Task/Happy-numbers/Visual-Basic-.NET/{happy-numbers.visual => happy-numbers-1.visual} (100%) create mode 100644 Task/Happy-numbers/Visual-Basic-.NET/happy-numbers-2.visual create mode 100644 Task/Harshad-or-Niven-series/00META.yaml create mode 100644 Task/Harshad-or-Niven-series/360-Assembly/harshad-or-niven-series.360 create mode 100644 Task/Harshad-or-Niven-series/Crystal/harshad-or-niven-series.crystal create mode 100644 Task/Harshad-or-Niven-series/Python/harshad-or-niven-series-3.py create mode 100644 Task/Harshad-or-Niven-series/Swift/harshad-or-niven-series.swift create mode 100644 Task/Hash-from-two-arrays/Neko/hash-from-two-arrays.neko create mode 100644 Task/Hash-join/00META.yaml create mode 100644 Task/Haversine-formula/00META.yaml create mode 100644 Task/Haversine-formula/Crystal/haversine-formula.crystal create mode 100644 Task/Haversine-formula/Dart/haversine-formula.dart create mode 100644 Task/Haversine-formula/Free-Pascal/haversine-formula.free rename Task/Haversine-formula/Ruby/{haversine-formula.rb => haversine-formula-1.rb} (100%) create mode 100644 Task/Haversine-formula/Ruby/haversine-formula-2.rb create mode 100644 Task/Haversine-formula/Transact-SQL/haversine-formula.sql create mode 100644 Task/Haversine-formula/TypeScript/haversine-formula.type create mode 100644 Task/Haversine-formula/VBA/haversine-formula.vba create mode 100644 Task/Haversine-formula/Visual-Basic-.NET/haversine-formula.visual create mode 100644 Task/Hello-world-Graphical/C/hello-world-graphical-3.c create mode 100644 Task/Hello-world-Graphical/Neko/hello-world-graphical-1.neko create mode 100644 Task/Hello-world-Graphical/Neko/hello-world-graphical-2.neko create mode 100644 Task/Hello-world-Graphical/Ol/hello-world-graphical.ol create mode 100644 Task/Hello-world-Graphical/SmileBASIC/hello-world-graphical.smilebasic create mode 100644 Task/Hello-world-Graphical/VBA/hello-world-graphical.vba create mode 100644 Task/Hello-world-Graphical/Vala/hello-world-graphical.vala create mode 100644 Task/Hello-world-Line-printer/BASIC/hello-world-line-printer-3.basic create mode 100644 Task/Hello-world-Line-printer/Julia/hello-world-line-printer.julia create mode 100644 Task/Hello-world-Line-printer/Maple/hello-world-line-printer.maple create mode 100644 Task/Hello-world-Newbie/00META.yaml create mode 100644 Task/Hello-world-Newbie/JavaScript/hello-world-newbie-1.js create mode 100644 Task/Hello-world-Newbie/JavaScript/hello-world-newbie-2.js create mode 100644 Task/Hello-world-Newbie/JavaScript/hello-world-newbie-3.js create mode 100644 Task/Hello-world-Newline-omission/B/hello-world-newline-omission.b create mode 100644 Task/Hello-world-Newline-omission/BASIC/hello-world-newline-omission-5.basic create mode 100644 Task/Hello-world-Newline-omission/BASIC/hello-world-newline-omission-6.basic create mode 100644 Task/Hello-world-Newline-omission/Bc/hello-world-newline-omission.bc create mode 100644 Task/Hello-world-Newline-omission/Dc/hello-world-newline-omission-1.dc create mode 100644 Task/Hello-world-Newline-omission/Dc/hello-world-newline-omission-2.dc create mode 100644 Task/Hello-world-Newline-omission/LLVM/hello-world-newline-omission.llvm create mode 100644 Task/Hello-world-Newline-omission/Neko/hello-world-newline-omission.neko create mode 100644 Task/Hello-world-Newline-omission/R/hello-world-newline-omission.r create mode 100644 Task/Hello-world-Newline-omission/Visual-Basic-.NET/hello-world-newline-omission.visual create mode 100644 Task/Hello-world-Standard-error/LLVM/hello-world-standard-error.llvm create mode 100644 Task/Hello-world-Standard-error/Neko/hello-world-standard-error.neko create mode 100644 Task/Hello-world-Standard-error/Ol/hello-world-standard-error.ol create mode 100644 Task/Hello-world-Standard-error/Rust/hello-world-standard-error-3.rust create mode 100644 Task/Hello-world-Standard-error/VBA/hello-world-standard-error.vba create mode 100644 Task/Hello-world-Standard-error/Visual-Basic-.NET/hello-world-standard-error.visual create mode 100644 Task/Hello-world-Text/Arc/hello-world-text.arc create mode 100644 Task/Hello-world-Text/B/hello-world-text.b create mode 100644 Task/Hello-world-Text/Commodore-BASIC/hello-world-text.commodore rename Task/Hello-world-Text/Dc/{hello-world-text.dc => hello-world-text-1.dc} (100%) create mode 100644 Task/Hello-world-Text/Dc/hello-world-text-2.dc create mode 100644 Task/Hello-world-Text/Elena/hello-world-text.elena create mode 100644 Task/Hello-world-Text/Nickle/hello-world-text.nickle create mode 100644 Task/Hello-world-Text/PowerBASIC/hello-world-text.powerbasic rename Task/Hello-world-Text/R/{hello-world-text.r => hello-world-text-1.r} (100%) create mode 100644 Task/Hello-world-Text/R/hello-world-text-2.r create mode 100644 Task/Hello-world-Text/R/hello-world-text-3.r create mode 100644 Task/Hello-world-Text/Visual-Basic/hello-world-text.vb create mode 100644 Task/Hello-world-Text/ZX-Spectrum-Basic/hello-world-text.zx create mode 100644 Task/Hello-world-Web-server/Free-Pascal/hello-world-web-server.free create mode 100644 Task/Hello-world-Web-server/Mathematica/hello-world-web-server-1.math create mode 100644 Task/Hello-world-Web-server/Mathematica/hello-world-web-server-2.math rename Task/Hello-world-Web-server/Python/{hello-world-web-server.py => hello-world-web-server-1.py} (100%) create mode 100644 Task/Hello-world-Web-server/Python/hello-world-web-server-2.py create mode 100644 Task/Here-document/ARM-Assembly/here-document.arm create mode 100644 Task/Here-document/Common-Lisp/here-document.lisp rename Task/Here-document/Forth/{here-document.fth => here-document-1.fth} (96%) create mode 100644 Task/Here-document/Forth/here-document-2.fth create mode 100644 Task/Here-document/OCaml/here-document.ocaml create mode 100644 Task/Heronian-triangles/00META.yaml create mode 100644 Task/Heronian-triangles/Ada/heronian-triangles.ada create mode 100644 Task/Heronian-triangles/Factor/heronian-triangles.factor create mode 100644 Task/Heronian-triangles/VBA/heronian-triangles.vba create mode 100644 Task/Hickerson-series-of-almost-integers/00META.yaml create mode 100644 Task/Hickerson-series-of-almost-integers/Crystal/hickerson-series-of-almost-integers.crystal create mode 100644 Task/Hickerson-series-of-almost-integers/Factor/hickerson-series-of-almost-integers.factor create mode 100644 Task/Hickerson-series-of-almost-integers/Phix/hickerson-series-of-almost-integers.phix create mode 100644 Task/Higher-order-functions/Ol/higher-order-functions.ol create mode 100644 Task/Higher-order-functions/Visual-Basic-.NET/higher-order-functions-1.visual create mode 100644 Task/Higher-order-functions/Visual-Basic-.NET/higher-order-functions-2.visual create mode 100644 Task/History-variables/00META.yaml create mode 100644 Task/History-variables/ALGOL-W/history-variables.alg create mode 100644 Task/History-variables/Factor/history-variables.factor create mode 100644 Task/History-variables/Julia/history-variables.julia create mode 100644 Task/History-variables/Rust/history-variables.rust create mode 100644 Task/Hofstadter-Conway-$10,000-sequence/Lua/hofstadter-conway-$10,000-sequence.lua create mode 100644 Task/Hofstadter-Conway-$10,000-sequence/Perl-6/hofstadter-conway-$10,000-sequence.pl6 create mode 100644 Task/Hofstadter-Conway-$10,000-sequence/Phix/hofstadter-conway-$10,000-sequence.phix create mode 100644 Task/Hofstadter-Conway-$10,000-sequence/VBA/hofstadter-conway-$10,000-sequence.vba create mode 100644 Task/Hofstadter-Figure-Figure-sequences/00META.yaml create mode 100644 Task/Hofstadter-Figure-Figure-sequences/Phix/hofstadter-figure-figure-sequences.phix create mode 100644 Task/Hofstadter-Figure-Figure-sequences/VBA/hofstadter-figure-figure-sequences.vba create mode 100644 Task/Hofstadter-Q-sequence/00META.yaml create mode 100644 Task/Hofstadter-Q-sequence/APL/hofstadter-q-sequence.apl create mode 100644 Task/Hofstadter-Q-sequence/BASIC256/hofstadter-q-sequence.basic256 create mode 100644 Task/Hofstadter-Q-sequence/FreeBASIC/hofstadter-q-sequence.freebasic create mode 100644 Task/Hofstadter-Q-sequence/Phix/hofstadter-q-sequence.phix create mode 100644 Task/Hofstadter-Q-sequence/PureBasic/hofstadter-q-sequence.purebasic create mode 100644 Task/Hofstadter-Q-sequence/VBA/hofstadter-q-sequence.vba create mode 100644 Task/Holidays-related-to-Easter/VBA/holidays-related-to-easter.vba create mode 100644 Task/Honeycombs/Go/honeycombs.go create mode 100644 Task/Honeycombs/Julia/honeycombs.julia create mode 100644 Task/Honeycombs/Scala/honeycombs.scala create mode 100644 Task/Horizontal-sundial-calculations/Factor/horizontal-sundial-calculations.factor create mode 100644 Task/Horizontal-sundial-calculations/Perl/horizontal-sundial-calculations.pl create mode 100644 Task/Horners-rule-for-polynomial-evaluation/00META.yaml create mode 100644 Task/Horners-rule-for-polynomial-evaluation/FreeBASIC/horners-rule-for-polynomial-evaluation.freebasic create mode 100644 Task/Horners-rule-for-polynomial-evaluation/Visual-Basic-.NET/horners-rule-for-polynomial-evaluation.visual create mode 100644 Task/Host-introspection/Neko/host-introspection-1.neko create mode 100644 Task/Host-introspection/Neko/host-introspection-2.neko create mode 100644 Task/Host-introspection/Perl-6/host-introspection-1.pl6 create mode 100644 Task/Host-introspection/Perl-6/host-introspection-2.pl6 delete mode 100644 Task/Host-introspection/Perl-6/host-introspection.pl6 create mode 100644 Task/Host-introspection/R/host-introspection-1.r create mode 100644 Task/Host-introspection/R/host-introspection-2.r delete mode 100644 Task/Host-introspection/R/host-introspection.r create mode 100644 Task/Host-introspection/Rust/host-introspection.rust create mode 100644 Task/Hostname/Phix/hostname.phix create mode 100644 Task/Hostname/Rust/hostname.rust create mode 100644 Task/Hostname/Visual-Basic/hostname.vb create mode 100644 Task/Hough-transform/Julia/hough-transform.julia create mode 100644 Task/Hough-transform/Perl-6/hough-transform.pl6 create mode 100644 Task/Hough-transform/Perl/hough-transform.pl create mode 100644 Task/Hough-transform/Phix/hough-transform.phix create mode 100644 Task/Huffman-coding/Julia/huffman-coding.julia create mode 100644 Task/I-before-E-except-after-C/00META.yaml rename Task/I-before-E-except-after-C/Batch-File/{i-before-e-except-after-c.bat => i-before-e-except-after-c-1.bat} (100%) create mode 100644 Task/I-before-E-except-after-C/Batch-File/i-before-e-except-after-c-2.bat create mode 100644 Task/I-before-E-except-after-C/Batch-File/i-before-e-except-after-c-3.bat create mode 100644 Task/I-before-E-except-after-C/Rust/i-before-e-except-after-c.rust create mode 100644 Task/I-before-E-except-after-C/Visual-Basic-.NET/i-before-e-except-after-c.visual create mode 100644 Task/IBAN/Factor/iban.factor create mode 100644 Task/IBAN/VBA/iban.vba rename Task/Identity-matrix/Common-Lisp/{identity-matrix.lisp => identity-matrix-1.lisp} (100%) create mode 100644 Task/Identity-matrix/Common-Lisp/identity-matrix-2.lisp create mode 100644 Task/Identity-matrix/Python/identity-matrix-4.py create mode 100644 Task/Identity-matrix/Smalltalk/identity-matrix.st create mode 100644 Task/Identity-matrix/Swift/identity-matrix.swift create mode 100644 Task/Identity-matrix/VBA/identity-matrix.vba create mode 100644 Task/Identity-matrix/Visual-Basic/identity-matrix.vb create mode 100644 Task/Image-convolution/Common-Lisp/image-convolution.lisp create mode 100644 Task/Image-convolution/Perl-6/image-convolution.pl6 create mode 100644 Task/Image-convolution/Phix/image-convolution.phix create mode 100644 Task/Image-noise/Julia/image-noise.julia create mode 100644 Task/Image-noise/Nim/image-noise-1.nim create mode 100644 Task/Image-noise/Nim/image-noise-2.nim create mode 100644 Task/Image-noise/Perl/image-noise.pl create mode 100644 Task/Image-noise/Phix/image-noise.phix create mode 100644 Task/Image-noise/Processing/image-noise create mode 100644 Task/Include-a-file/00META.yaml create mode 100644 Task/Include-a-file/ARM-Assembly/include-a-file.arm create mode 100644 Task/Include-a-file/Processing/include-a-file create mode 100644 Task/Increment-a-numerical-string/ARM-Assembly/increment-a-numerical-string.arm create mode 100644 Task/Increment-a-numerical-string/AppleScript/increment-a-numerical-string.applescript create mode 100644 Task/Increment-a-numerical-string/BASIC/increment-a-numerical-string-3.basic create mode 100644 Task/Increment-a-numerical-string/Haskell/increment-a-numerical-string-5.hs rename Task/Increment-a-numerical-string/Python/{increment-a-numerical-string.py => increment-a-numerical-string-1.py} (100%) create mode 100644 Task/Increment-a-numerical-string/Python/increment-a-numerical-string-2.py create mode 100644 Task/Infinity/Clojure/infinity.clj create mode 100644 Task/Infinity/Ol/infinity.ol create mode 100644 Task/Inheritance-Multiple/Factor/inheritance-multiple.factor create mode 100644 Task/Inheritance-Multiple/Julia/inheritance-multiple.julia create mode 100644 Task/Inheritance-Multiple/Rust/inheritance-multiple.rust create mode 100644 Task/Inheritance-Single/Rust/inheritance-single.rust create mode 100644 Task/Input-loop/BASIC/input-loop-3.basic create mode 100644 Task/Input-loop/BASIC/input-loop-4.basic create mode 100644 Task/Input-loop/OCaml/input-loop-4.ocaml create mode 100644 Task/Input-loop/VBA/input-loop.vba create mode 100644 Task/Integer-comparison/ABAP/integer-comparison.abap create mode 100644 Task/Integer-comparison/BASIC/integer-comparison-4.basic create mode 100644 Task/Integer-comparison/BASIC/integer-comparison-5.basic rename Task/Integer-comparison/Emacs-Lisp/{integer-comparison.l => integer-comparison-1.l} (100%) create mode 100644 Task/Integer-comparison/Emacs-Lisp/integer-comparison-2.l create mode 100644 Task/Integer-comparison/Emacs-Lisp/integer-comparison-3.l create mode 100644 Task/Integer-comparison/Ol/integer-comparison.ol create mode 100644 Task/Integer-comparison/Retro/integer-comparison.retro create mode 100644 Task/Integer-comparison/VBA/integer-comparison.vba create mode 100644 Task/Integer-overflow/00META.yaml create mode 100644 Task/Integer-overflow/Groovy/integer-overflow.groovy create mode 100644 Task/Integer-sequence/00META.yaml rename Task/Integer-sequence/8080-Assembly/{integer-sequence.8080 => integer-sequence-1.8080} (100%) create mode 100644 Task/Integer-sequence/8080-Assembly/integer-sequence-2.8080 create mode 100644 Task/Integer-sequence/LLVM/integer-sequence.llvm create mode 100644 Task/Integer-sequence/Ol/integer-sequence-1.ol create mode 100644 Task/Integer-sequence/Ol/integer-sequence-2.ol create mode 100644 Task/Integer-sequence/Q/integer-sequence-1.q create mode 100644 Task/Integer-sequence/Q/integer-sequence-2.q rename Task/Integer-sequence/Visual-Basic-.NET/{integer-sequence.visual => integer-sequence-1.visual} (100%) create mode 100644 Task/Integer-sequence/Visual-Basic-.NET/integer-sequence-2.visual rename Task/Interactive-programming/Smalltalk/{interactive-programming.st => interactive-programming-1.st} (100%) create mode 100644 Task/Interactive-programming/Smalltalk/interactive-programming-2.st create mode 100644 Task/Introspection/Phix/introspection-1.phix create mode 100644 Task/Introspection/Phix/introspection-2.phix create mode 100644 Task/Introspection/Phix/introspection-3.phix create mode 100644 Task/Introspection/Phix/introspection-4.phix create mode 100644 Task/Inverted-index/Julia/inverted-index.julia create mode 100644 Task/Inverted-syntax/00META.yaml create mode 100644 Task/Inverted-syntax/Nim/inverted-syntax.nim create mode 100644 Task/Inverted-syntax/Phix/inverted-syntax.phix create mode 100644 Task/Inverted-syntax/Prolog/inverted-syntax.pro create mode 100644 Task/Iterated-digits-squaring/00META.yaml create mode 100644 Task/Iterated-digits-squaring/AWK/iterated-digits-squaring.awk rename Task/Iterated-digits-squaring/C-sharp/{iterated-digits-squaring.cs => iterated-digits-squaring-1.cs} (100%) create mode 100644 Task/Iterated-digits-squaring/C-sharp/iterated-digits-squaring-2.cs create mode 100644 Task/Iterated-digits-squaring/Objeck/iterated-digits-squaring.objeck create mode 100644 Task/Iterated-digits-squaring/Sidef/iterated-digits-squaring.sidef create mode 100644 Task/Iterated-digits-squaring/Swift/iterated-digits-squaring.swift create mode 100644 Task/JSON/00META.yaml create mode 100644 Task/Jensens-Device/ARM-Assembly/jensens-device.arm create mode 100644 Task/Jensens-Device/Factor/jensens-device-1.factor create mode 100644 Task/Jensens-Device/Factor/jensens-device-2.factor create mode 100644 Task/Jensens-Device/VBA/jensens-device.vba create mode 100644 Task/Jensens-Device/ZX-Spectrum-Basic/jensens-device.zx create mode 100644 Task/Josephus-problem/BASIC/josephus-problem-3.basic create mode 100644 Task/Josephus-problem/Crystal/josephus-problem.crystal create mode 100644 Task/Josephus-problem/FreeBASIC/josephus-problem.freebasic create mode 100644 Task/Josephus-problem/Processing/josephus-problem create mode 100644 Task/Josephus-problem/Rust/josephus-problem.rust create mode 100644 Task/Josephus-problem/Visual-Basic-.NET/josephus-problem.visual create mode 100644 Task/Josephus-problem/ZX-Spectrum-Basic/josephus-problem.zx create mode 100644 Task/Joystick-position/Go/joystick-position.go create mode 100644 Task/Joystick-position/Julia/joystick-position.julia create mode 100644 Task/Jump-anywhere/BASIC/jump-anywhere-6.basic rename Task/Jump-anywhere/COBOL/{jump-anywhere.cobol => jump-anywhere-1.cobol} (100%) create mode 100644 Task/Jump-anywhere/COBOL/jump-anywhere-2.cobol create mode 100644 Task/Jump-anywhere/Neko/jump-anywhere.neko create mode 100644 Task/Jump-anywhere/Ol/jump-anywhere.ol create mode 100644 Task/Jump-anywhere/VBA/jump-anywhere.vba create mode 100644 Task/K-d-tree/00META.yaml create mode 100644 Task/K-d-tree/Julia/k-d-tree.julia create mode 100644 Task/K-d-tree/Phix/k-d-tree.phix create mode 100644 Task/K-means++-clustering/Julia/k-means++-clustering.julia create mode 100644 Task/K-means++-clustering/Lua/k-means++-clustering.lua create mode 100644 Task/K-means++-clustering/Phix/k-means++-clustering.phix create mode 100644 Task/Kaprekar-numbers/00META.yaml create mode 100644 Task/Kaprekar-numbers/Maple/kaprekar-numbers.maple create mode 100644 Task/Kaprekar-numbers/Visual-Basic-.NET/kaprekar-numbers.visual create mode 100644 Task/Keyboard-input-Flush-the-keyboard-buffer/Haskell/keyboard-input-flush-the-keyboard-buffer.hs create mode 100644 Task/Keyboard-input-Flush-the-keyboard-buffer/Perl-6/keyboard-input-flush-the-keyboard-buffer.pl6 create mode 100644 Task/Keyboard-input-Keypress-check/ARM-Assembly/keyboard-input-keypress-check.arm create mode 100644 Task/Keyboard-input-Keypress-check/BASIC/keyboard-input-keypress-check-4.basic create mode 100644 Task/Keyboard-input-Keypress-check/BASIC/keyboard-input-keypress-check-5.basic create mode 100644 Task/Keyboard-input-Keypress-check/BASIC/keyboard-input-keypress-check-6.basic create mode 100644 Task/Keyboard-input-Keypress-check/BASIC/keyboard-input-keypress-check-7.basic create mode 100644 Task/Keyboard-input-Keypress-check/Julia/keyboard-input-keypress-check.julia create mode 100644 Task/Keyboard-input-Keypress-check/Perl-6/keyboard-input-keypress-check.pl6 create mode 100644 Task/Keyboard-input-Obtain-a-Y-or-N-response/BASIC/keyboard-input-obtain-a-y-or-n-response-6.basic create mode 100644 Task/Keyboard-input-Obtain-a-Y-or-N-response/BASIC/keyboard-input-obtain-a-y-or-n-response-7.basic create mode 100644 Task/Keyboard-input-Obtain-a-Y-or-N-response/JavaScript/keyboard-input-obtain-a-y-or-n-response-3.js create mode 100644 Task/Keyboard-input-Obtain-a-Y-or-N-response/MUMPS/keyboard-input-obtain-a-y-or-n-response.mumps create mode 100644 Task/Keyboard-input-Obtain-a-Y-or-N-response/Mathematica/keyboard-input-obtain-a-y-or-n-response.math create mode 100644 Task/Keyboard-macros/Go/keyboard-macros.go create mode 100644 Task/Keyboard-macros/Julia/keyboard-macros.julia create mode 100644 Task/Keyboard-macros/Perl/keyboard-macros.pl create mode 100644 Task/Knapsack-problem-0-1/Crystal/knapsack-problem-0-1.crystal rename Task/Knapsack-problem-0-1/Perl-6/{knapsack-problem-0-1.pl6 => knapsack-problem-0-1-1.pl6} (100%) create mode 100644 Task/Knapsack-problem-0-1/Perl-6/knapsack-problem-0-1-2.pl6 create mode 100644 Task/Knapsack-problem-0-1/Swift/knapsack-problem-0-1.swift create mode 100644 Task/Knapsack-problem-Bounded/Crystal/knapsack-problem-bounded-1.crystal create mode 100644 Task/Knapsack-problem-Bounded/Crystal/knapsack-problem-bounded-2.crystal rename Task/Knapsack-problem-Bounded/Perl-6/{knapsack-problem-bounded.pl6 => knapsack-problem-bounded-1.pl6} (100%) create mode 100644 Task/Knapsack-problem-Bounded/Perl-6/knapsack-problem-bounded-2.pl6 create mode 100644 Task/Knapsack-problem-Continuous/Rust/knapsack-problem-continuous.rust create mode 100644 Task/Knights-tour/00META.yaml create mode 100644 Task/Knights-tour/FreeBASIC/knights-tour.freebasic create mode 100644 Task/Knights-tour/Julia/knights-tour.julia create mode 100644 Task/Knuth-shuffle/ARM-Assembly/knuth-shuffle.arm create mode 100644 Task/Knuth-shuffle/Haskell/knuth-shuffle-4.hs create mode 100644 Task/Knuth-shuffle/Ol/knuth-shuffle-1.ol create mode 100644 Task/Knuth-shuffle/Ol/knuth-shuffle-2.ol rename Task/Knuth-shuffle/Python/{knuth-shuffle.py => knuth-shuffle-1.py} (100%) create mode 100644 Task/Knuth-shuffle/Python/knuth-shuffle-2.py create mode 100644 Task/Knuth-shuffle/VBA/knuth-shuffle.vba create mode 100644 Task/Knuths-algorithm-S/00META.yaml create mode 100644 Task/Knuths-algorithm-S/Haskell/knuths-algorithm-s.hs create mode 100644 Task/LU-decomposition/Haskell/lu-decomposition.hs create mode 100644 Task/LU-decomposition/Perl/lu-decomposition.pl create mode 100644 Task/LU-decomposition/Rust/lu-decomposition.rust create mode 100644 Task/LU-decomposition/VBA/lu-decomposition.vba create mode 100644 Task/LZW-compression/FreeBASIC/lzw-compression.freebasic create mode 100644 Task/LZW-compression/Haskell/lzw-compression.hs create mode 100644 Task/LZW-compression/Ol/lzw-compression-1.ol create mode 100644 Task/LZW-compression/Ol/lzw-compression-2.ol create mode 100644 Task/LZW-compression/Xojo/lzw-compression.xojo create mode 100644 Task/Langtons-ant/Forth/langtons-ant.fth create mode 100644 Task/Langtons-ant/Julia/langtons-ant.julia create mode 100644 Task/Langtons-ant/Octave/langtons-ant.octave create mode 100644 Task/Largest-int-from-concatenated-ints/00META.yaml create mode 100644 Task/Largest-int-from-concatenated-ints/Rust/largest-int-from-concatenated-ints.rust create mode 100644 Task/Last-Friday-of-each-month/K/last-friday-of-each-month.k create mode 100644 Task/Last-letter-first-letter/00META.yaml create mode 100644 Task/Last-letter-first-letter/JavaScript/last-letter-first-letter.js create mode 100644 Task/Last-letter-first-letter/VBScript/last-letter-first-letter.vb create mode 100644 Task/Leap-year/68000-Assembly/leap-year.68000 create mode 100644 Task/Leap-year/Arc/leap-year-1.arc create mode 100644 Task/Leap-year/Arc/leap-year-2.arc create mode 100644 Task/Leap-year/BASIC/leap-year-7.basic create mode 100644 Task/Leap-year/Emacs-Lisp/leap-year.l create mode 100644 Task/Leap-year/LLVM/leap-year.llvm create mode 100644 Task/Leap-year/Neko/leap-year.neko create mode 100644 Task/Leap-year/Q/leap-year.q create mode 100644 Task/Leap-year/RPG/leap-year.rpg create mode 100644 Task/Leap-year/VBA/leap-year.vba create mode 100644 Task/Leap-year/Visual-Basic-.NET/leap-year.visual create mode 100644 Task/Least-common-multiple/00META.yaml create mode 100644 Task/Least-common-multiple/360-Assembly/least-common-multiple.360 create mode 100644 Task/Least-common-multiple/BASIC/least-common-multiple-3.basic create mode 100644 Task/Least-common-multiple/Python/least-common-multiple-5.py create mode 100644 Task/Least-common-multiple/VBA/least-common-multiple.vba rename Task/Left-factorials/Python/{left-factorials.py => left-factorials-1.py} (100%) create mode 100644 Task/Left-factorials/Python/left-factorials-2.py create mode 100644 Task/Letter-frequency/Python/letter-frequency-5.py create mode 100644 Task/Letter-frequency/Swift/letter-frequency.swift create mode 100644 Task/Levenshtein-distance/00META.yaml rename Task/Levenshtein-distance/Crystal/{levenshtein-distance.crystal => levenshtein-distance-1.crystal} (100%) create mode 100644 Task/Levenshtein-distance/Crystal/levenshtein-distance-2.crystal create mode 100644 Task/Levenshtein-distance/Crystal/levenshtein-distance-3.crystal create mode 100644 Task/Levenshtein-distance/Java/levenshtein-distance-3.java create mode 100644 Task/Levenshtein-distance/Nim/levenshtein-distance-1.nim rename Task/Levenshtein-distance/Nim/{levenshtein-distance.nim => levenshtein-distance-2.nim} (100%) create mode 100644 Task/Levenshtein-distance/Processing/levenshtein-distance create mode 100644 Task/Levenshtein-distance/Python/levenshtein-distance-4.py create mode 100644 Task/Levenshtein-distance/Python/levenshtein-distance-5.py create mode 100644 Task/Levenshtein-distance/VBA/levenshtein-distance.vba create mode 100644 Task/Levenshtein-distance/Visual-Basic/levenshtein-distance.vb create mode 100644 Task/Linear-congruential-generator/VBA/linear-congruential-generator.vba create mode 100644 Task/List-comprehensions/Factor/list-comprehensions.factor create mode 100644 Task/List-comprehensions/Go/list-comprehensions.go create mode 100644 Task/List-comprehensions/Python/list-comprehensions-8.py create mode 100644 Task/Literals-Floating-point/Factor/literals-floating-point.factor create mode 100644 Task/Literals-Floating-point/Visual-Basic/literals-floating-point-1.vb create mode 100644 Task/Literals-Floating-point/Visual-Basic/literals-floating-point-2.vb create mode 100644 Task/Literals-Integer/ARM-Assembly/literals-integer.arm create mode 100644 Task/Literals-Integer/BASIC/literals-integer-3.basic create mode 100644 Task/Literals-Integer/BASIC/literals-integer-4.basic create mode 100644 Task/Literals-Integer/Neko/literals-integer.neko create mode 100644 Task/Literals-Integer/Visual-Basic/literals-integer.vb create mode 100644 Task/Literals-String/ARM-Assembly/literals-string.arm create mode 100644 Task/Literals-String/BASIC/literals-string-5.basic create mode 100644 Task/Literals-String/BASIC/literals-string-6.basic create mode 100644 Task/Literals-String/Factor/literals-string-1.factor create mode 100644 Task/Literals-String/Factor/literals-string-10.factor create mode 100644 Task/Literals-String/Factor/literals-string-11.factor create mode 100644 Task/Literals-String/Factor/literals-string-2.factor create mode 100644 Task/Literals-String/Factor/literals-string-3.factor create mode 100644 Task/Literals-String/Factor/literals-string-4.factor create mode 100644 Task/Literals-String/Factor/literals-string-5.factor create mode 100644 Task/Literals-String/Factor/literals-string-6.factor create mode 100644 Task/Literals-String/Factor/literals-string-7.factor create mode 100644 Task/Literals-String/Factor/literals-string-8.factor create mode 100644 Task/Literals-String/Factor/literals-string-9.factor create mode 100644 Task/Literals-String/FreeBASIC/literals-string.freebasic create mode 100644 Task/Literals-String/Julia/literals-string-1.julia create mode 100644 Task/Literals-String/Julia/literals-string-2.julia create mode 100644 Task/Literals-String/Julia/literals-string-3.julia create mode 100644 Task/Literals-String/Julia/literals-string-4.julia create mode 100644 Task/Literals-String/Julia/literals-string-5.julia create mode 100644 Task/Literals-String/OCaml/literals-string-5.ocaml create mode 100644 Task/Literals-String/Visual-Basic/literals-string.vb create mode 100644 Task/Literals-String/Xojo/literals-string.xojo create mode 100644 Task/Logical-operations/ARM-Assembly/logical-operations.arm create mode 100644 Task/Logical-operations/Dc/logical-operations.dc create mode 100644 Task/Logical-operations/LLVM/logical-operations.llvm create mode 100644 Task/Logical-operations/Neko/logical-operations.neko create mode 100644 Task/Logical-operations/Stata/logical-operations-1.stata create mode 100644 Task/Logical-operations/Stata/logical-operations-2.stata create mode 100644 Task/Long-multiplication/ALGOL-W/long-multiplication.alg create mode 100644 Task/Long-multiplication/Ol/long-multiplication.ol create mode 100644 Task/Longest-common-subsequence/Factor/longest-common-subsequence.factor create mode 100644 Task/Longest-common-subsequence/Scala/longest-common-subsequence-3.scala create mode 100644 Task/Longest-common-subsequence/Scala/longest-common-subsequence-4.scala create mode 100644 Task/Longest-increasing-subsequence/00META.yaml create mode 100644 Task/Longest-increasing-subsequence/REXX/longest-increasing-subsequence.rexx create mode 100644 Task/Longest-increasing-subsequence/Swift/longest-increasing-subsequence.swift create mode 100644 Task/Longest-string-challenge/Rust/longest-string-challenge.rust create mode 100644 Task/Look-and-say-sequence/FreeBASIC/look-and-say-sequence.freebasic create mode 100644 Task/Look-and-say-sequence/Swift/look-and-say-sequence.swift create mode 100644 Task/Loop-over-multiple-arrays-simultaneously/Harbour/loop-over-multiple-arrays-simultaneously.harbour create mode 100644 Task/Loop-over-multiple-arrays-simultaneously/Visual-Basic-.NET/loop-over-multiple-arrays-simultaneously.visual create mode 100644 Task/Loops-Break/ARM-Assembly/loops-break.arm create mode 100644 Task/Loops-Break/BASIC/loops-break-6.basic create mode 100644 Task/Loops-Break/Befunge/loops-break.bf create mode 100644 Task/Loops-Break/Neko/loops-break.neko create mode 100644 Task/Loops-Break/Ol/loops-break.ol create mode 100644 Task/Loops-Break/Spin/loops-break.spin create mode 100644 Task/Loops-Break/VBA/loops-break.vba create mode 100644 Task/Loops-Break/Visual-Basic-.NET/loops-break.visual create mode 100644 Task/Loops-Continue/Befunge/loops-continue-1.bf create mode 100644 Task/Loops-Continue/Befunge/loops-continue-2.bf create mode 100644 Task/Loops-Continue/Neko/loops-continue.neko create mode 100644 Task/Loops-Continue/Objeck/loops-continue.objeck create mode 100644 Task/Loops-Continue/Smalltalk/loops-continue.st create mode 100644 Task/Loops-Continue/Spin/loops-continue.spin create mode 100644 Task/Loops-Continue/VBA/loops-continue.vba create mode 100644 Task/Loops-Do-while/ARM-Assembly/loops-do-while.arm create mode 100644 Task/Loops-Do-while/BASIC/loops-do-while-4.basic create mode 100644 Task/Loops-Do-while/MUMPS/loops-do-while.mumps create mode 100644 Task/Loops-Do-while/Mathematica/loops-do-while.math create mode 100644 Task/Loops-Do-while/Neko/loops-do-while.neko create mode 100644 Task/Loops-Do-while/Spin/loops-do-while.spin create mode 100644 Task/Loops-Do-while/VBA/loops-do-while.vba create mode 100644 Task/Loops-Downward-for/ARM-Assembly/loops-downward-for.arm create mode 100644 Task/Loops-Downward-for/BASIC/loops-downward-for-5.basic create mode 100644 Task/Loops-Downward-for/Prolog/loops-downward-for.pro create mode 100644 Task/Loops-Downward-for/Spin/loops-downward-for.spin create mode 100644 Task/Loops-Downward-for/VBA/loops-downward-for.vba create mode 100644 Task/Loops-For-with-a-specified-step/ARM-Assembly/loops-for-with-a-specified-step.arm create mode 100644 Task/Loops-For-with-a-specified-step/BASIC/loops-for-with-a-specified-step-6.basic create mode 100644 Task/Loops-For-with-a-specified-step/Prolog/loops-for-with-a-specified-step-1.pro create mode 100644 Task/Loops-For-with-a-specified-step/Prolog/loops-for-with-a-specified-step-2.pro create mode 100644 Task/Loops-For-with-a-specified-step/Spin/loops-for-with-a-specified-step.spin create mode 100644 Task/Loops-For/BASIC/loops-for-18.basic create mode 100644 Task/Loops-For/GW-BASIC/loops-for.gw-basic create mode 100644 Task/Loops-For/Prolog/loops-for.pro create mode 100644 Task/Loops-For/Spin/loops-for.spin create mode 100644 Task/Loops-For/Swift/loops-for.swift create mode 100644 Task/Loops-Foreach/BASIC/loops-foreach-13.basic create mode 100644 Task/Loops-Foreach/BASIC/loops-foreach-14.basic create mode 100644 Task/Loops-Foreach/BASIC/loops-foreach-15.basic create mode 100644 Task/Loops-Foreach/BASIC/loops-foreach-16.basic create mode 100644 Task/Loops-Foreach/BASIC/loops-foreach-17.basic rename Task/Loops-Foreach/Java/{loops-foreach.java => loops-foreach-1.java} (100%) create mode 100644 Task/Loops-Foreach/Java/loops-foreach-2.java create mode 100644 Task/Loops-Foreach/Rust/loops-foreach-3.rust create mode 100644 Task/Loops-Infinite/BASIC/loops-infinite-5.basic rename Task/Loops-Infinite/Brainf---/{loops-infinite.bf => loops-infinite-1.bf} (100%) create mode 100644 Task/Loops-Infinite/Brainf---/loops-infinite-2.bf create mode 100644 Task/Loops-Infinite/Factor/loops-infinite-3.factor create mode 100644 Task/Loops-Infinite/Fish/loops-infinite.fish create mode 100644 Task/Loops-Infinite/OPL/loops-infinite.opl create mode 100644 Task/Loops-Infinite/Ol/loops-infinite.ol rename Task/Loops-Infinite/Python/{loops-infinite.py => loops-infinite-1.py} (100%) create mode 100644 Task/Loops-Infinite/Python/loops-infinite-2.py create mode 100644 Task/Loops-Infinite/Spin/loops-infinite.spin create mode 100644 Task/Loops-N-plus-one-half/ARM-Assembly/loops-n-plus-one-half.arm create mode 100644 Task/Loops-N-plus-one-half/BASIC/loops-n-plus-one-half-6.basic create mode 100644 Task/Loops-N-plus-one-half/Prolog/loops-n-plus-one-half.pro create mode 100644 Task/Loops-N-plus-one-half/Rust/loops-n-plus-one-half-1.rust create mode 100644 Task/Loops-N-plus-one-half/Rust/loops-n-plus-one-half-2.rust create mode 100644 Task/Loops-N-plus-one-half/Rust/loops-n-plus-one-half-3.rust delete mode 100644 Task/Loops-N-plus-one-half/Rust/loops-n-plus-one-half.rust create mode 100644 Task/Loops-N-plus-one-half/Spin/loops-n-plus-one-half.spin create mode 100644 Task/Loops-N-plus-one-half/VBA/loops-n-plus-one-half.vba create mode 100644 Task/Loops-Nested/ARM-Assembly/loops-nested.arm create mode 100644 Task/Loops-Nested/Neko/loops-nested.neko create mode 100644 Task/Loops-Nested/VBA/loops-nested.vba create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-1.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-2.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-3.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-4.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-5.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-6.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-7.visual create mode 100644 Task/Loops-Nested/Visual-Basic-.NET/loops-nested-8.visual create mode 100644 Task/Loops-While/ARM-Assembly/loops-while.arm create mode 100644 Task/Loops-While/BASIC/loops-while-4.basic create mode 100644 Task/Loops-While/BASIC/loops-while-5.basic create mode 100644 Task/Loops-While/Cache-ObjectScript/loops-while.cos create mode 100644 Task/Loops-While/Spin/loops-while.spin create mode 100644 Task/Loops-While/VBA/loops-while.vba create mode 100644 Task/Lucas-Lehmer-test/ARM-Assembly/lucas-lehmer-test.arm create mode 100644 Task/Lucas-Lehmer-test/Factor/lucas-lehmer-test.factor create mode 100644 Task/Lucas-Lehmer-test/Swift/lucas-lehmer-test.swift create mode 100644 Task/Ludic-numbers/Factor/ludic-numbers.factor create mode 100644 Task/Ludic-numbers/Objeck/ludic-numbers.objeck create mode 100644 Task/Ludic-numbers/Scala/ludic-numbers.scala create mode 100644 Task/Luhn-test-of-credit-card-numbers/Emacs-Lisp/luhn-test-of-credit-card-numbers.l create mode 100644 Task/Luhn-test-of-credit-card-numbers/PowerBASIC/luhn-test-of-credit-card-numbers.powerbasic rename Task/Luhn-test-of-credit-card-numbers/Python/{luhn-test-of-credit-card-numbers.py => luhn-test-of-credit-card-numbers-1.py} (100%) create mode 100644 Task/Luhn-test-of-credit-card-numbers/Python/luhn-test-of-credit-card-numbers-2.py create mode 100644 Task/Luhn-test-of-credit-card-numbers/Q/luhn-test-of-credit-card-numbers.q create mode 100644 Task/Luhn-test-of-credit-card-numbers/Visual-Basic/luhn-test-of-credit-card-numbers-1.vb create mode 100644 Task/Luhn-test-of-credit-card-numbers/Visual-Basic/luhn-test-of-credit-card-numbers-2.vb create mode 100644 Task/MD4/JavaScript/md4.js create mode 100644 Task/MD5-Implementation/Groovy/md5-implementation.groovy create mode 100644 Task/MD5-Implementation/Julia/md5-implementation.julia create mode 100644 Task/MD5-Implementation/Rust/md5-implementation.rust create mode 100644 Task/MD5/Neko/md5.neko create mode 100644 Task/Machine-code/00META.yaml create mode 100644 Task/Machine-code/COBOL/machine-code-1.cobol create mode 100644 Task/Machine-code/COBOL/machine-code-2.cobol create mode 100644 Task/Machine-code/Go/machine-code.go create mode 100644 Task/Machine-code/Julia/machine-code.julia create mode 100644 Task/Machine-code/Rust/machine-code.rust create mode 100644 Task/Machine-code/Swift/machine-code.swift create mode 100644 Task/Mad-Libs/00META.yaml create mode 100644 Task/Mad-Libs/AWK/mad-libs.awk create mode 100644 Task/Mad-Libs/BASIC256/mad-libs-1.basic256 create mode 100644 Task/Mad-Libs/BASIC256/mad-libs-2.basic256 create mode 100644 Task/Mad-Libs/BASIC256/mad-libs-3.basic256 create mode 100644 Task/Mad-Libs/Factor/mad-libs.factor create mode 100644 Task/Mad-Libs/FreeBASIC/mad-libs.freebasic create mode 100644 Task/Mad-Libs/Phix/mad-libs.phix create mode 100644 Task/Mad-Libs/Rust/mad-libs.rust create mode 100644 Task/Mad-Libs/Visual-Basic-.NET/mad-libs.visual create mode 100644 Task/Magic-squares-of-odd-order/00META.yaml rename Task/Magic-squares-of-odd-order/BASIC/{magic-squares-of-odd-order.basic => magic-squares-of-odd-order-1.basic} (100%) create mode 100644 Task/Magic-squares-of-odd-order/BASIC/magic-squares-of-odd-order-2.basic create mode 100644 Task/Magic-squares-of-odd-order/Factor/magic-squares-of-odd-order.factor create mode 100644 Task/Magic-squares-of-odd-order/Phix/magic-squares-of-odd-order.phix rename Task/Magic-squares-of-odd-order/Python/{magic-squares-of-odd-order.py => magic-squares-of-odd-order-1.py} (100%) create mode 100644 Task/Magic-squares-of-odd-order/Python/magic-squares-of-odd-order-2.py create mode 100644 Task/Magic-squares-of-odd-order/Swift/magic-squares-of-odd-order.swift create mode 100644 Task/Main-step-of-GOST-28147-89/Perl/main-step-of-gost-28147-89.pl create mode 100644 Task/Main-step-of-GOST-28147-89/Rust/main-step-of-gost-28147-89.rust create mode 100644 Task/Make-directory-path/Factor/make-directory-path-1.factor create mode 100644 Task/Make-directory-path/Factor/make-directory-path-2.factor create mode 100644 Task/Make-directory-path/Visual-Basic-.NET/make-directory-path.visual create mode 100644 Task/Man-or-boy-test/Forth/man-or-boy-test.fth create mode 100644 Task/Man-or-boy-test/Ol/man-or-boy-test.ol rename Task/Man-or-boy-test/Rust/{man-or-boy-test.rust => man-or-boy-test-1.rust} (100%) create mode 100644 Task/Man-or-boy-test/Rust/man-or-boy-test-2.rust create mode 100644 Task/Man-or-boy-test/Rust/man-or-boy-test-3.rust create mode 100644 Task/Mandelbrot-set/ALGOL-W/mandelbrot-set.alg create mode 100644 Task/Mandelbrot-set/B/mandelbrot-set.b create mode 100644 Task/Mandelbrot-set/Dc/mandelbrot-set-1.dc create mode 100644 Task/Mandelbrot-set/Dc/mandelbrot-set-2.dc create mode 100644 Task/Mandelbrot-set/Ol/mandelbrot-set.ol create mode 100644 Task/Mandelbrot-set/Python/mandelbrot-set-4.py create mode 100644 Task/Mandelbrot-set/Spin/mandelbrot-set.spin create mode 100644 Task/Map-range/00META.yaml create mode 100644 Task/Map-range/AppleScript/map-range.applescript create mode 100644 Task/Map-range/BASIC/map-range-3.basic create mode 100644 Task/Map-range/JavaScript/map-range-3.js create mode 100644 Task/Map-range/Swift/map-range.swift create mode 100644 Task/Matrix-exponentiation-operator/Burlesque/matrix-exponentiation-operator.blq create mode 100644 Task/Matrix-exponentiation-operator/C-sharp/matrix-exponentiation-operator.cs create mode 100644 Task/Matrix-exponentiation-operator/Go/matrix-exponentiation-operator.go create mode 100644 Task/Matrix-exponentiation-operator/K/matrix-exponentiation-operator.k rename Task/Matrix-exponentiation-operator/Python/{matrix-exponentiation-operator.py => matrix-exponentiation-operator-1.py} (100%) create mode 100644 Task/Matrix-exponentiation-operator/Python/matrix-exponentiation-operator-2.py create mode 100644 Task/Matrix-exponentiation-operator/VBA/matrix-exponentiation-operator.vba create mode 100644 Task/Matrix-multiplication/AWK/matrix-multiplication.awk rename Task/Matrix-multiplication/BASIC/{matrix-multiplication.basic => matrix-multiplication-1.basic} (100%) create mode 100644 Task/Matrix-multiplication/BASIC/matrix-multiplication-2.basic create mode 100644 Task/Matrix-multiplication/Ceylon/matrix-multiplication.ceylon create mode 100644 Task/Matrix-multiplication/Standard-ML/matrix-multiplication-1.ml create mode 100644 Task/Matrix-multiplication/Standard-ML/matrix-multiplication-2.ml create mode 100644 Task/Matrix-multiplication/VBA/matrix-multiplication.vba rename Task/Matrix-transposition/AWK/{matrix-transposition.awk => matrix-transposition-1.awk} (68%) create mode 100644 Task/Matrix-transposition/AWK/matrix-transposition-2.awk create mode 100644 Task/Matrix-transposition/Emacs-Lisp/matrix-transposition.l create mode 100644 Task/Matrix-transposition/Erlang/matrix-transposition.erl rename Task/Matrix-transposition/PHP/{matrix-transposition.php => matrix-transposition-1.php} (100%) create mode 100644 Task/Matrix-transposition/PHP/matrix-transposition-2.php create mode 100644 Task/Matrix-transposition/PowerBASIC/matrix-transposition.powerbasic rename Task/Matrix-transposition/Python/{matrix-transposition.py => matrix-transposition-1.py} (100%) create mode 100644 Task/Matrix-transposition/Python/matrix-transposition-2.py create mode 100644 Task/Matrix-transposition/Python/matrix-transposition-3.py create mode 100644 Task/Matrix-transposition/Python/matrix-transposition-4.py rename Task/Matrix-transposition/Rust/{matrix-transposition.rust => matrix-transposition-1.rust} (100%) create mode 100644 Task/Matrix-transposition/Rust/matrix-transposition-2.rust create mode 100644 Task/Matrix-transposition/VBA/matrix-transposition.vba create mode 100644 Task/Matrix-transposition/Visual-Basic/matrix-transposition.vb create mode 100644 Task/Maximum-triangle-path-sum/00META.yaml create mode 100644 Task/Maximum-triangle-path-sum/Factor/maximum-triangle-path-sum.factor create mode 100644 Task/Maximum-triangle-path-sum/Python/maximum-triangle-path-sum-3.py create mode 100644 Task/Maze-generation/Commodore-BASIC/maze-generation.commodore create mode 100644 Task/Maze-generation/Ol/maze-generation-1.ol create mode 100644 Task/Maze-generation/Ol/maze-generation-2.ol create mode 100644 Task/Maze-generation/PHP/maze-generation.php create mode 100644 Task/Maze-generation/Rust/maze-generation.rust create mode 100644 Task/Maze-solving/Rust/maze-solving.rust create mode 100644 Task/Median-filter/Perl-6/median-filter.pl6 create mode 100644 Task/Median-filter/Phix/median-filter.phix create mode 100644 Task/Memory-allocation/Rust/memory-allocation.rust create mode 100644 Task/Memory-layout-of-a-data-structure/00META.yaml create mode 100644 Task/Memory-layout-of-a-data-structure/Free-Pascal/memory-layout-of-a-data-structure.free rename Task/Menu/BASIC/{menu.basic => menu-1.basic} (100%) create mode 100644 Task/Menu/BASIC/menu-2.basic create mode 100644 Task/Menu/Forth/menu-1.fth create mode 100644 Task/Menu/Forth/menu-2.fth create mode 100644 Task/Menu/J/menu.j create mode 100644 Task/Metaprogramming/00META.yaml create mode 100644 Task/Metaprogramming/Go/metaprogramming.go create mode 100644 Task/Metaprogramming/Julia/metaprogramming.julia create mode 100644 Task/Metaprogramming/Phix/metaprogramming.phix create mode 100644 Task/Metaprogramming/Prolog/metaprogramming-1.pro create mode 100644 Task/Metaprogramming/Prolog/metaprogramming-2.pro create mode 100644 Task/Metered-concurrency/Julia/metered-concurrency.julia create mode 100644 Task/Metronome/00META.yaml create mode 100644 Task/Metronome/AWK/metronome.awk create mode 100644 Task/Metronome/Ada/metronome.ada create mode 100644 Task/Metronome/Perl/metronome.pl create mode 100644 Task/Metronome/Sidef/metronome.sidef create mode 100644 Task/Middle-three-digits/00META.yaml create mode 100644 Task/Middle-three-digits/BASIC/middle-three-digits-6.basic rename Task/Middle-three-digits/JavaScript/{middle-three-digits.js => middle-three-digits-1.js} (100%) create mode 100644 Task/Middle-three-digits/JavaScript/middle-three-digits-2.js create mode 100644 Task/Middle-three-digits/K/middle-three-digits.k rename Task/Middle-three-digits/Python/{middle-three-digits.py => middle-three-digits-1.py} (100%) create mode 100644 Task/Middle-three-digits/Python/middle-three-digits-2.py create mode 100644 Task/Minesweeper-game/Go/minesweeper-game.go create mode 100644 Task/Minesweeper-game/Prolog/minesweeper-game.pro create mode 100644 Task/Modular-exponentiation/00META.yaml create mode 100644 Task/Modular-exponentiation/C-sharp/modular-exponentiation.cs create mode 100644 Task/Modular-exponentiation/FreeBASIC/modular-exponentiation.freebasic create mode 100644 Task/Modular-exponentiation/Phix/modular-exponentiation.phix create mode 100644 Task/Modular-exponentiation/Ruby/modular-exponentiation-3.rb create mode 100644 Task/Modular-exponentiation/Rust/modular-exponentiation-1.rust create mode 100644 Task/Modular-exponentiation/Rust/modular-exponentiation-2.rust create mode 100644 Task/Modular-exponentiation/Visual-Basic-.NET/modular-exponentiation.visual create mode 100644 Task/Modular-inverse/00META.yaml rename Task/Modular-inverse/Forth/{modular-inverse.fth => modular-inverse-1.fth} (100%) create mode 100644 Task/Modular-inverse/Forth/modular-inverse-2.fth create mode 100644 Task/Modular-inverse/Phix/modular-inverse.phix rename Task/Modular-inverse/Python/{modular-inverse.py => modular-inverse-1.py} (100%) create mode 100644 Task/Modular-inverse/Python/modular-inverse-2.py rename Task/Modular-inverse/Ruby/{modular-inverse.rb => modular-inverse-1.rb} (100%) create mode 100644 Task/Modular-inverse/Ruby/modular-inverse-2.rb rename Task/Modular-inverse/Rust/{modular-inverse.rust => modular-inverse-1.rust} (100%) create mode 100644 Task/Modular-inverse/Rust/modular-inverse-2.rust create mode 100644 Task/Modular-inverse/VBA/modular-inverse.vba rename Task/Monte-Carlo-methods/Clojure/{monte-carlo-methods.clj => monte-carlo-methods-1.clj} (100%) create mode 100644 Task/Monte-Carlo-methods/Clojure/monte-carlo-methods-2.clj create mode 100644 Task/Monte-Carlo-methods/Erlang/monte-carlo-methods-1.erl create mode 100644 Task/Monte-Carlo-methods/Erlang/monte-carlo-methods-2.erl create mode 100644 Task/Monty-Hall-problem/BASIC/monty-hall-problem-3.basic create mode 100644 Task/Monty-Hall-problem/Forth/monty-hall-problem-3.fth create mode 100644 Task/Monty-Hall-problem/FreeBASIC/monty-hall-problem.freebasic create mode 100644 Task/Monty-Hall-problem/Stata/monty-hall-problem.stata create mode 100644 Task/Monty-Hall-problem/Swift/monty-hall-problem.swift rename Task/Morse-code/BASIC/{morse-code.basic => morse-code-1.basic} (100%) create mode 100644 Task/Morse-code/BASIC/morse-code-2.basic create mode 100644 Task/Morse-code/BASIC/morse-code-3.basic create mode 100644 Task/Morse-code/CoffeeScript/morse-code.coffee create mode 100644 Task/Morse-code/Factor/morse-code.factor create mode 100644 Task/Morse-code/Julia/morse-code.julia create mode 100644 Task/Morse-code/Rust/morse-code-1.rust create mode 100644 Task/Morse-code/Rust/morse-code-2.rust create mode 100644 Task/Morse-code/Scala/morse-code.scala create mode 100644 Task/Mouse-position/AppleScript/mouse-position-1.applescript create mode 100644 Task/Mouse-position/AppleScript/mouse-position-2.applescript create mode 100644 Task/Mouse-position/Common-Lisp/mouse-position.lisp create mode 100644 Task/Mouse-position/Go/mouse-position.go create mode 100644 Task/Mouse-position/Julia/mouse-position.julia rename Task/Mouse-position/Perl-6/{mouse-position.pl6 => mouse-position-1.pl6} (100%) create mode 100644 Task/Mouse-position/Perl-6/mouse-position-2.pl6 create mode 100644 Task/Move-to-front-algorithm/00META.yaml create mode 100644 Task/Move-to-front-algorithm/Factor/move-to-front-algorithm.factor create mode 100644 Task/Move-to-front-algorithm/Rust/move-to-front-algorithm.rust create mode 100644 Task/Multifactorial/00META.yaml create mode 100644 Task/Multifactorial/AWK/multifactorial.awk create mode 100644 Task/Multifactorial/Swift/multifactorial.swift create mode 100644 Task/Multiple-distinct-objects/00META.yaml create mode 100644 Task/Multiple-distinct-objects/ALGOL-W/multiple-distinct-objects.alg create mode 100644 Task/Multiple-distinct-objects/Modula-3/multiple-distinct-objects-1.mod3 create mode 100644 Task/Multiple-distinct-objects/Modula-3/multiple-distinct-objects-2.mod3 delete mode 100644 Task/Multiple-distinct-objects/Modula-3/multiple-distinct-objects.mod3 create mode 100644 Task/Multiple-distinct-objects/Rust/multiple-distinct-objects.rust create mode 100644 Task/Multiple-regression/Phix/multiple-regression.phix create mode 100644 Task/Multiplication-tables/ARM-Assembly/multiplication-tables.arm create mode 100644 Task/Multiplication-tables/BASIC/multiplication-tables-3.basic create mode 100644 Task/Multiplication-tables/Haskell/multiplication-tables-1.hs create mode 100644 Task/Multiplication-tables/Haskell/multiplication-tables-2.hs delete mode 100644 Task/Multiplication-tables/Haskell/multiplication-tables.hs create mode 100644 Task/Multiplication-tables/Neko/multiplication-tables.neko rename Task/Multiplication-tables/Python/{multiplication-tables.py => multiplication-tables-1.py} (100%) create mode 100644 Task/Multiplication-tables/Python/multiplication-tables-2.py create mode 100644 Task/Multiplication-tables/Python/multiplication-tables-3.py create mode 100644 Task/Multiplication-tables/Scala/multiplication-tables-1.scala create mode 100644 Task/Multiplication-tables/Scala/multiplication-tables-2.scala delete mode 100644 Task/Multiplication-tables/Scala/multiplication-tables.scala create mode 100644 Task/Multiplicative-order/C++/multiplicative-order.cpp create mode 100644 Task/Multiplicative-order/D/multiplicative-order.d create mode 100644 Task/Multiplicative-order/Phix/multiplicative-order.phix create mode 100644 Task/Multiplicative-order/Sidef/multiplicative-order-1.sidef rename Task/Multiplicative-order/Sidef/{multiplicative-order.sidef => multiplicative-order-2.sidef} (100%) create mode 100644 Task/Multisplit/Julia/multisplit.julia create mode 100644 Task/Munching-squares/Julia/munching-squares.julia create mode 100644 Task/Munching-squares/Phix/munching-squares.phix create mode 100644 Task/Mutual-recursion/ABAP/mutual-recursion.abap rename Task/Mutual-recursion/BASIC/{mutual-recursion.basic => mutual-recursion-1.basic} (100%) create mode 100644 Task/Mutual-recursion/BASIC/mutual-recursion-2.basic create mode 100644 Task/Mutual-recursion/BASIC/mutual-recursion-3.basic create mode 100644 Task/Mutual-recursion/Ol/mutual-recursion.ol create mode 100644 Task/Mutual-recursion/Phix/mutual-recursion.phix create mode 100644 Task/Mutual-recursion/VBA/mutual-recursion.vba create mode 100644 Task/N-queens-problem/00META.yaml rename Task/N-queens-problem/FreeBASIC/{n-queens-problem.freebasic => n-queens-problem-1.freebasic} (100%) create mode 100644 Task/N-queens-problem/FreeBASIC/n-queens-problem-2.freebasic create mode 100644 Task/N-queens-problem/FreeBASIC/n-queens-problem-3.freebasic create mode 100644 Task/N-queens-problem/Go/n-queens-problem-3.go create mode 100644 Task/N-queens-problem/Haskell/n-queens-problem-5.hs create mode 100644 Task/N-queens-problem/PDP-11-Assembly/n-queens-problem.pdp-11 create mode 100644 Task/N-queens-problem/Picat/n-queens-problem.picat create mode 100644 Task/N-queens-problem/PowerBASIC/n-queens-problem-1.powerbasic create mode 100644 Task/N-queens-problem/PowerBASIC/n-queens-problem-2.powerbasic delete mode 100644 Task/N-queens-problem/PowerBASIC/n-queens-problem.powerbasic create mode 100644 Task/N-queens-problem/Python/n-queens-problem-7.py create mode 100644 Task/N-queens-problem/Python/n-queens-problem-8.py create mode 100644 Task/N-queens-problem/Scala/n-queens-problem.scala create mode 100644 Task/N-queens-problem/Swift/n-queens-problem.swift create mode 100644 Task/N-queens-problem/UNIX-Shell/n-queens-problem.sh create mode 100644 Task/Named-parameters/Prolog/named-parameters.pro create mode 100644 Task/Named-parameters/Swift/named-parameters-3.swift create mode 100644 Task/Named-parameters/Swift/named-parameters-4.swift create mode 100644 Task/Named-parameters/VBA/named-parameters.vba create mode 100644 Task/Narcissist/00META.yaml create mode 100644 Task/Narcissist/Java/narcissist.java create mode 100644 Task/Narcissist/Phix/narcissist.phix create mode 100644 Task/Narcissist/VBA/narcissist.vba create mode 100644 Task/Narcissistic-decimal-number/00META.yaml create mode 100644 Task/Narcissistic-decimal-number/Forth/narcissistic-decimal-number.fth create mode 100644 Task/Narcissistic-decimal-number/VBA/narcissistic-decimal-number.vba create mode 100644 Task/Natural-sorting/Julia/natural-sorting.julia create mode 100644 Task/Nautical-bell/00META.yaml create mode 100644 Task/Nautical-bell/AutoHotkey/nautical-bell-1.ahk create mode 100644 Task/Nautical-bell/AutoHotkey/nautical-bell-2.ahk create mode 100644 Task/Nautical-bell/Go/nautical-bell.go create mode 100644 Task/Nautical-bell/Julia/nautical-bell.julia create mode 100644 Task/Nautical-bell/Perl/nautical-bell.pl create mode 100644 Task/Non-continuous-subsequences/C-sharp/non-continuous-subsequences.cs create mode 100644 Task/Non-decimal-radices-Convert/Common-Lisp/non-decimal-radices-convert-3.lisp create mode 100644 Task/Non-decimal-radices-Convert/VBA/non-decimal-radices-convert.vba create mode 100644 Task/Nth-root/ALGOL-W/nth-root.alg create mode 100644 Task/Nth-root/ARM-Assembly/nth-root.arm create mode 100644 Task/Nth-root/Factor/nth-root.factor create mode 100644 Task/Nth-root/FreeBASIC/nth-root.freebasic rename Task/Nth-root/Haskell/{nth-root.hs => nth-root-1.hs} (100%) create mode 100644 Task/Nth-root/Haskell/nth-root-2.hs create mode 100644 Task/Nth-root/Scala/nth-root-1.scala create mode 100644 Task/Nth-root/Scala/nth-root-2.scala delete mode 100644 Task/Nth-root/Scala/nth-root.scala create mode 100644 Task/Nth-root/VBA/nth-root.vba create mode 100644 Task/Nth/Crystal/nth.crystal create mode 100644 Task/Nth/Liberty-BASIC/nth.liberty create mode 100644 Task/Nth/VBA/nth.vba create mode 100644 Task/Null-object/ARM-Assembly/null-object.arm create mode 100644 Task/Null-object/Neko/null-object.neko create mode 100644 Task/Null-object/Swift/null-object-3.swift create mode 100644 Task/Null-object/VBA/null-object.vba create mode 100644 Task/Number-names/Maple/number-names.maple create mode 100644 Task/Number-names/Rust/number-names.rust create mode 100644 Task/Number-names/Swift/number-names.swift create mode 100644 Task/Number-names/VBA/number-names.vba create mode 100644 Task/Number-reversal-game/BASIC256/number-reversal-game.basic256 create mode 100644 Task/Number-reversal-game/VBA/number-reversal-game.vba create mode 100644 Task/Numeric-error-propagation/00META.yaml create mode 100644 Task/Numeric-error-propagation/Phix/numeric-error-propagation.phix create mode 100644 Task/Numerical-integration-Gauss-Legendre-Quadrature/Perl/numerical-integration-gauss-legendre-quadrature.pl create mode 100644 Task/Numerical-integration-Gauss-Legendre-Quadrature/Phix/numerical-integration-gauss-legendre-quadrature.phix create mode 100644 Task/Numerical-integration-Gauss-Legendre-Quadrature/REXX/numerical-integration-gauss-legendre-quadrature-3.rexx create mode 100644 Task/Numerical-integration-Gauss-Legendre-Quadrature/Scala/numerical-integration-gauss-legendre-quadrature.scala create mode 100644 Task/Numerical-integration/Comal/numerical-integration.comal create mode 100644 Task/Numerical-integration/Perl-6/numerical-integration.pl6 create mode 100644 Task/Numerical-integration/Perl/numerical-integration.pl create mode 100644 Task/Numerical-integration/Swift/numerical-integration.swift create mode 100644 Task/OLE-Automation/Go/ole-automation.go create mode 100644 Task/Object-serialization/Neko/object-serialization.neko create mode 100644 Task/Object-serialization/Ol/object-serialization.ol create mode 100644 Task/Object-serialization/Perl-6/object-serialization.pl6 create mode 100644 Task/Object-serialization/Phix/object-serialization.phix create mode 100644 Task/Object-serialization/Rust/object-serialization-1.rust create mode 100644 Task/Object-serialization/Rust/object-serialization-2.rust create mode 100644 Task/Object-serialization/Rust/object-serialization-3.rust create mode 100644 Task/Object-serialization/Rust/object-serialization-4.rust create mode 100644 Task/Odd-word-problem/00META.yaml create mode 100644 Task/Odd-word-problem/Ol/odd-word-problem.ol create mode 100644 Task/Old-lady-swallowed-a-fly/00META.yaml create mode 100644 Task/Old-lady-swallowed-a-fly/C++/old-lady-swallowed-a-fly.cpp create mode 100644 Task/Old-lady-swallowed-a-fly/Haskell/old-lady-swallowed-a-fly-1.hs create mode 100644 Task/Old-lady-swallowed-a-fly/Haskell/old-lady-swallowed-a-fly-2.hs delete mode 100644 Task/Old-lady-swallowed-a-fly/Haskell/old-lady-swallowed-a-fly.hs create mode 100644 Task/Old-lady-swallowed-a-fly/Lua/old-lady-swallowed-a-fly.lua create mode 100644 Task/Old-lady-swallowed-a-fly/Mercury/old-lady-swallowed-a-fly.mercury create mode 100644 Task/One-dimensional-cellular-automata/Python/one-dimensional-cellular-automata-4.py create mode 100644 Task/One-dimensional-cellular-automata/Rust/one-dimensional-cellular-automata.rust create mode 100644 Task/One-of-n-lines-in-a-file/00META.yaml create mode 100644 Task/One-of-n-lines-in-a-file/Aime/one-of-n-lines-in-a-file.aime create mode 100644 Task/One-of-n-lines-in-a-file/Batch-File/one-of-n-lines-in-a-file-1.bat create mode 100644 Task/One-of-n-lines-in-a-file/Batch-File/one-of-n-lines-in-a-file-2.bat create mode 100644 Task/One-of-n-lines-in-a-file/Maple/one-of-n-lines-in-a-file.maple rename Task/One-of-n-lines-in-a-file/PowerShell/{one-of-n-lines-in-a-file.psh => one-of-n-lines-in-a-file-1.psh} (100%) create mode 100644 Task/One-of-n-lines-in-a-file/PowerShell/one-of-n-lines-in-a-file-2.psh create mode 100644 Task/OpenGL/Julia/opengl.julia create mode 100644 Task/OpenGL/Ol/opengl.ol create mode 100644 Task/Operator-precedence/Q/operator-precedence.q create mode 100644 Task/Optional-parameters/VBA/optional-parameters.vba create mode 100644 Task/Order-disjoint-list-items/00META.yaml create mode 100644 Task/Order-disjoint-list-items/Factor/order-disjoint-list-items-1.factor create mode 100644 Task/Order-disjoint-list-items/Factor/order-disjoint-list-items-2.factor create mode 100644 Task/Order-disjoint-list-items/Swift/order-disjoint-list-items.swift create mode 100644 Task/Order-two-numerical-lists/ARM-Assembly/order-two-numerical-lists.arm create mode 100644 Task/Order-two-numerical-lists/Ol/order-two-numerical-lists.ol create mode 100644 Task/Order-two-numerical-lists/Rust/order-two-numerical-lists.rust create mode 100644 Task/Order-two-numerical-lists/VBA/order-two-numerical-lists.vba create mode 100644 Task/Ordered-Partitions/C-sharp/ordered-partitions.cs create mode 100644 Task/Ordered-Partitions/Python/ordered-partitions-3.py create mode 100644 Task/Ordered-words/APL/ordered-words.apl create mode 100644 Task/Ordered-words/Python/ordered-words-3.py create mode 100644 Task/Palindrome-detection/APL/palindrome-detection-1.apl create mode 100644 Task/Palindrome-detection/APL/palindrome-detection-2.apl create mode 100644 Task/Palindrome-detection/APL/palindrome-detection-3.apl create mode 100644 Task/Palindrome-detection/BASIC/palindrome-detection-4.basic create mode 100644 Task/Palindrome-detection/BASIC/palindrome-detection-5.basic create mode 100644 Task/Palindrome-detection/Ol/palindrome-detection.ol create mode 100644 Task/Palindrome-detection/PowerShell/palindrome-detection-6.psh create mode 100644 Task/Palindrome-detection/Python/palindrome-detection-6.py create mode 100644 Task/Palindrome-detection/TypeScript/palindrome-detection.type create mode 100644 Task/Palindrome-detection/Visual-Basic-.NET/palindrome-detection.visual create mode 100644 Task/Pangram-checker/Ada/pangram-checker-1.ada create mode 100644 Task/Pangram-checker/Ada/pangram-checker-2.ada delete mode 100644 Task/Pangram-checker/Ada/pangram-checker.ada rename Task/Pangram-checker/PHP/{pangram-checker.php => pangram-checker-1.php} (100%) create mode 100644 Task/Pangram-checker/PHP/pangram-checker-2.php create mode 100644 Task/Paraffins/00META.yaml create mode 100644 Task/Paraffins/Julia/paraffins.julia create mode 100644 Task/Paraffins/Phix/paraffins.phix create mode 100644 Task/Paraffins/Python/paraffins-3.py create mode 100644 Task/Parallel-calculations/Phix/parallel-calculations.phix create mode 100644 Task/Parse-an-IP-Address/00META.yaml create mode 100644 Task/Parse-an-IP-Address/Phix/parse-an-ip-address.phix create mode 100644 Task/Parsing-RPN-calculator-algorithm/00META.yaml create mode 100644 Task/Parsing-RPN-calculator-algorithm/360-Assembly/parsing-rpn-calculator-algorithm.360 create mode 100644 Task/Parsing-RPN-calculator-algorithm/Bracmat/parsing-rpn-calculator-algorithm.bracmat create mode 100644 Task/Parsing-RPN-to-infix-conversion/00META.yaml create mode 100644 Task/Parsing-RPN-to-infix-conversion/Groovy/parsing-rpn-to-infix-conversion.groovy create mode 100644 Task/Parsing-RPN-to-infix-conversion/Visual-Basic-.NET/parsing-rpn-to-infix-conversion.visual create mode 100644 Task/Parsing-Shunting-yard-algorithm/00META.yaml create mode 100644 Task/Parsing-Shunting-yard-algorithm/C++/parsing-shunting-yard-algorithm.cpp create mode 100644 Task/Parsing-Shunting-yard-algorithm/Nim/parsing-shunting-yard-algorithm.nim create mode 100644 Task/Parsing-Shunting-yard-algorithm/Visual-Basic-.NET/parsing-shunting-yard-algorithm.visual rename Task/Partial-function-application/C-sharp/{partial-function-application.cs => partial-function-application-1.cs} (100%) create mode 100644 Task/Partial-function-application/C-sharp/partial-function-application-2.cs create mode 100644 Task/Partial-function-application/Visual-Basic-.NET/partial-function-application-1.visual create mode 100644 Task/Partial-function-application/Visual-Basic-.NET/partial-function-application-2.visual create mode 100644 Task/Partial-function-application/Visual-Basic-.NET/partial-function-application-3.visual create mode 100644 Task/Pascals-triangle-Puzzle/00META.yaml create mode 100644 Task/Pascals-triangle-Puzzle/Factor/pascals-triangle-puzzle.factor create mode 100644 Task/Pascals-triangle/Haskell/pascals-triangle-8.hs create mode 100644 Task/Pascals-triangle/Haskell/pascals-triangle-9.hs create mode 100644 Task/Pascals-triangle/Prolog/pascals-triangle-3.pro create mode 100644 Task/Pascals-triangle/Prolog/pascals-triangle-4.pro create mode 100644 Task/Pascals-triangle/Python/pascals-triangle-3.py create mode 100644 Task/Pascals-triangle/VBA/pascals-triangle.vba create mode 100644 Task/Pascals-triangle/Visual-Basic-.NET/pascals-triangle.visual create mode 100644 Task/Pattern-matching/Emacs-Lisp/pattern-matching.l create mode 100644 Task/Pattern-matching/Go/pattern-matching.go create mode 100644 Task/Pattern-matching/Julia/pattern-matching.julia create mode 100644 Task/Pattern-matching/Phix/pattern-matching-1.phix create mode 100644 Task/Pattern-matching/Phix/pattern-matching-2.phix create mode 100644 Task/Penneys-game/C-sharp/penneys-game.cs create mode 100644 Task/Penneys-game/Pascal/penneys-game.pascal create mode 100644 Task/Penneys-game/Phix/penneys-game.phix create mode 100644 Task/Penneys-game/Prolog/penneys-game.pro create mode 100644 Task/Percentage-difference-between-images/MATLAB/percentage-difference-between-images.m create mode 100644 Task/Percentage-difference-between-images/Perl-6/percentage-difference-between-images.pl6 create mode 100644 Task/Percentage-difference-between-images/Perl/percentage-difference-between-images-1.pl create mode 100644 Task/Percentage-difference-between-images/Perl/percentage-difference-between-images-2.pl create mode 100644 Task/Percentage-difference-between-images/Phix/percentage-difference-between-images.phix create mode 100644 Task/Percentage-difference-between-images/Rust/percentage-difference-between-images.rust create mode 100644 Task/Percolation-Bond-percolation/Perl/percolation-bond-percolation.pl create mode 100644 Task/Percolation-Bond-percolation/Phix/percolation-bond-percolation.phix create mode 100644 Task/Percolation-Bond-percolation/Swift/percolation-bond-percolation.swift create mode 100644 Task/Percolation-Mean-cluster-density/Factor/percolation-mean-cluster-density.factor create mode 100644 Task/Percolation-Mean-cluster-density/Perl/percolation-mean-cluster-density.pl create mode 100644 Task/Percolation-Mean-cluster-density/Phix/percolation-mean-cluster-density.phix create mode 100644 Task/Percolation-Mean-run-density/Factor/percolation-mean-run-density.factor create mode 100644 Task/Percolation-Mean-run-density/Phix/percolation-mean-run-density.phix rename Task/Percolation-Mean-run-density/Racket/{percolation-mean-run-density.rkt => percolation-mean-run-density-1.rkt} (100%) create mode 100644 Task/Percolation-Mean-run-density/Racket/percolation-mean-run-density-2.rkt create mode 100644 Task/Percolation-Site-percolation/Factor/percolation-site-percolation.factor create mode 100644 Task/Percolation-Site-percolation/Perl/percolation-site-percolation.pl create mode 100644 Task/Percolation-Site-percolation/Phix/percolation-site-percolation.phix create mode 100644 Task/Percolation-Site-percolation/Sidef/percolation-site-percolation.sidef create mode 100644 Task/Perfect-numbers/ALGOL-W/perfect-numbers.alg create mode 100644 Task/Perfect-numbers/BASIC/perfect-numbers-3.basic create mode 100644 Task/Perfect-numbers/Haskell/perfect-numbers-3.hs create mode 100644 Task/Perfect-numbers/Maple/perfect-numbers.maple rename Task/Perfect-numbers/Perl-6/{perfect-numbers.pl6 => perfect-numbers-1.pl6} (61%) create mode 100644 Task/Perfect-numbers/Perl-6/perfect-numbers-2.pl6 rename Task/Perfect-numbers/Phix/{perfect-numbers.phix => perfect-numbers-1.phix} (100%) create mode 100644 Task/Perfect-numbers/Phix/perfect-numbers-2.phix create mode 100644 Task/Perfect-numbers/Prolog/perfect-numbers-3.pro create mode 100644 Task/Perfect-numbers/Python/perfect-numbers-3.py create mode 100644 Task/Perfect-numbers/Simula/perfect-numbers.simula create mode 100644 Task/Perfect-numbers/VBA/perfect-numbers.vba create mode 100644 Task/Permutations-Derangements/00META.yaml create mode 100644 Task/Permutations-Derangements/Clojure/permutations-derangements.clj create mode 100644 Task/Permutations-Derangements/Factor/permutations-derangements.factor rename Task/Permutations-Derangements/Phix/{permutations-derangements.phix => permutations-derangements-1.phix} (53%) create mode 100644 Task/Permutations-Derangements/Phix/permutations-derangements-2.phix create mode 100644 Task/Permutations-Rank-of-a-permutation/00META.yaml create mode 100644 Task/Permutations-Rank-of-a-permutation/Phix/permutations-rank-of-a-permutation.phix create mode 100644 Task/Permutations-by-swapping/00META.yaml create mode 100644 Task/Permutations/Aime/permutations.aime create mode 100644 Task/Permutations/AppleScript/permutations-3.applescript create mode 100644 Task/Permutations/Crystal/permutations.crystal create mode 100644 Task/Permutations/Curry/permutations.curry rename Task/Permutations/Go/{permutations.go => permutations-1.go} (100%) create mode 100644 Task/Permutations/Go/permutations-2.go create mode 100644 Task/Permutations/Haskell/permutations-5.hs create mode 100644 Task/Permutations/JavaScript/permutations-8.js rename Task/Permutations/Julia/{permutations.julia => permutations-1.julia} (95%) create mode 100644 Task/Permutations/Julia/permutations-2.julia create mode 100644 Task/Permutations/Mathematica/permutations-1.math rename Task/Permutations/Mathematica/{permutations.math => permutations-2.math} (100%) create mode 100644 Task/Permutations/Mercury/permutations.mercury create mode 100644 Task/Permutations/Modula-3/permutations-1.mod3 create mode 100644 Task/Permutations/Modula-3/permutations-2.mod3 create mode 100644 Task/Permutations/Modula-3/permutations-3.mod3 create mode 100644 Task/Permutations/Modula-3/permutations-4.mod3 rename Task/Permutations/Nim/{permutations.nim => permutations-1.nim} (100%) create mode 100644 Task/Permutations/Nim/permutations-2.nim create mode 100644 Task/Permutations/OpenEdge-Progress/permutations.openedge create mode 100644 Task/Permutations/Python/permutations-5.py create mode 100644 Task/Permutations/Python/permutations-6.py create mode 100644 Task/Permutations/R/permutations-4.r create mode 100644 Task/Pernicious-numbers/Maple/pernicious-numbers.maple create mode 100644 Task/Pernicious-numbers/Seed7/pernicious-numbers.seed7 create mode 100644 Task/Pernicious-numbers/VBA/pernicious-numbers.vba create mode 100644 Task/Pernicious-numbers/Visual-Basic-.NET/pernicious-numbers.visual create mode 100644 Task/Phrase-reversals/00META.yaml create mode 100644 Task/Phrase-reversals/K/phrase-reversals.k create mode 100644 Task/Phrase-reversals/MUMPS/phrase-reversals.mumps rename Task/Phrase-reversals/Python/{phrase-reversals.py => phrase-reversals-1.py} (100%) create mode 100644 Task/Phrase-reversals/Python/phrase-reversals-2.py create mode 100644 Task/Phrase-reversals/Seed7/phrase-reversals.seed7 create mode 100644 Task/Pi/BASIC/pi-3.basic create mode 100644 Task/Pi/Factor/pi.factor create mode 100644 Task/Pi/Ol/pi.ol create mode 100644 Task/Pi/Phix/pi-1.phix create mode 100644 Task/Pi/Phix/pi-2.phix delete mode 100644 Task/Pi/Phix/pi.phix create mode 100644 Task/Pi/R/pi.r create mode 100644 Task/Pi/Rust/pi.rust create mode 100644 Task/Pi/Scheme/pi.ss create mode 100644 Task/Pi/Simula/pi-1.simula create mode 100644 Task/Pi/Simula/pi-2.simula create mode 100644 Task/Pi/TypeScript/pi-1.type create mode 100644 Task/Pi/TypeScript/pi-2.type create mode 100644 Task/Pi/Visual-Basic-.NET/pi-1.visual create mode 100644 Task/Pi/Visual-Basic-.NET/pi-2.visual create mode 100644 Task/Pi/Visual-Basic/pi.vb create mode 100644 Task/Pick-random-element/AppleScript/pick-random-element.applescript create mode 100644 Task/Pick-random-element/Emacs-Lisp/pick-random-element.l create mode 100644 Task/Pick-random-element/Ol/pick-random-element.ol create mode 100644 Task/Pick-random-element/Visual-Basic-.NET/pick-random-element.visual create mode 100644 Task/Pig-the-dice-game-Player/00META.yaml create mode 100644 Task/Pig-the-dice-game-Player/Julia/pig-the-dice-game-player.julia create mode 100644 Task/Pig-the-dice-game-Player/Perl/pig-the-dice-game-player.pl create mode 100644 Task/Pig-the-dice-game-Player/Phix/pig-the-dice-game-player.phix create mode 100644 Task/Pig-the-dice-game/00META.yaml create mode 100644 Task/Pig-the-dice-game/BASIC256/pig-the-dice-game.basic256 create mode 100644 Task/Pig-the-dice-game/FreeBASIC/pig-the-dice-game.freebasic create mode 100644 Task/Pig-the-dice-game/Phix/pig-the-dice-game.phix create mode 100644 Task/Pig-the-dice-game/Scala/pig-the-dice-game.scala create mode 100644 Task/Pinstripe-Display/Go/pinstripe-display.go create mode 100644 Task/Pinstripe-Display/Perl/pinstripe-display.pl create mode 100644 Task/Pinstripe-Printer/Go/pinstripe-printer.go create mode 100644 Task/Play-recorded-sounds/Go/play-recorded-sounds.go create mode 100644 Task/Play-recorded-sounds/Phix/play-recorded-sounds.phix create mode 100644 Task/Playing-cards/Hy/playing-cards.hy create mode 100644 Task/Plot-coordinate-pairs/00META.yaml create mode 100644 Task/Plot-coordinate-pairs/Ol/plot-coordinate-pairs.ol create mode 100644 Task/Plot-coordinate-pairs/VBA/plot-coordinate-pairs.vba create mode 100644 Task/Pointers-and-references/Julia/pointers-and-references.julia create mode 100644 Task/Pointers-and-references/VBA/pointers-and-references.vba create mode 100644 Task/Polymorphic-copy/Julia/polymorphic-copy.julia create mode 100644 Task/Polymorphic-copy/REXX/polymorphic-copy.rexx create mode 100644 Task/Polymorphism/Golo/polymorphism.golo create mode 100644 Task/Polynomial-long-division/C++/polynomial-long-division.cpp create mode 100644 Task/Polynomial-long-division/Factor/polynomial-long-division.factor create mode 100644 Task/Polynomial-long-division/Phix/polynomial-long-division.phix create mode 100644 Task/Polynomial-long-division/VBA/polynomial-long-division.vba create mode 100644 Task/Polynomial-regression/C++/polynomial-regression.cpp create mode 100644 Task/Polynomial-regression/Lua/polynomial-regression.lua create mode 100644 Task/Polynomial-regression/Maple/polynomial-regression.maple create mode 100644 Task/Polynomial-regression/Scala/polynomial-regression.scala create mode 100644 Task/Polynomial-regression/VBA/polynomial-regression.vba create mode 100644 Task/Power-set/ABAP/power-set.abap create mode 100644 Task/Power-set/VBA/power-set.vba create mode 100644 Task/Pragmatic-directives/Julia/pragmatic-directives.julia create mode 100644 Task/Price-fraction/Objeck/price-fraction.objeck create mode 100644 Task/Primality-by-trial-division/B/primality-by-trial-division.b create mode 100644 Task/Primality-by-trial-division/BASIC/primality-by-trial-division-3.basic rename Task/Prime-decomposition/Pascal/{prime-decomposition.pascal => prime-decomposition-1.pascal} (100%) create mode 100644 Task/Prime-decomposition/Pascal/prime-decomposition-2.pascal create mode 100644 Task/Prime-decomposition/Phix/prime-decomposition-1.phix create mode 100644 Task/Prime-decomposition/Phix/prime-decomposition-2.phix create mode 100644 Task/Prime-decomposition/Phix/prime-decomposition-3.phix delete mode 100644 Task/Prime-decomposition/Phix/prime-decomposition.phix create mode 100644 Task/Prime-decomposition/R/prime-decomposition-1.r create mode 100644 Task/Prime-decomposition/R/prime-decomposition-2.r delete mode 100644 Task/Prime-decomposition/R/prime-decomposition.r create mode 100644 Task/Prime-decomposition/Scala/prime-decomposition-4.scala create mode 100644 Task/Prime-decomposition/Simula/prime-decomposition.simula create mode 100644 Task/Prime-decomposition/Swift/prime-decomposition.swift create mode 100644 Task/Priority-queue/00META.yaml create mode 100644 Task/Priority-queue/ARM-Assembly/priority-queue.arm rename Task/Priority-queue/Phix/{priority-queue.phix => priority-queue-1.phix} (100%) create mode 100644 Task/Priority-queue/Phix/priority-queue-2.phix create mode 100644 Task/Priority-queue/VBA/priority-queue.vba create mode 100644 Task/Problem-of-Apollonius/Perl/problem-of-apollonius.pl create mode 100644 Task/Problem-of-Apollonius/Phix/problem-of-apollonius.phix create mode 100644 Task/Program-name/BASIC/program-name-3.basic create mode 100644 Task/Program-name/BASIC/program-name-4.basic create mode 100644 Task/Program-name/COBOL/program-name.cobol create mode 100644 Task/Program-name/Ol/program-name.ol create mode 100644 Task/Program-name/Prolog/program-name-1.pro create mode 100644 Task/Program-name/Prolog/program-name-2.pro create mode 100644 Task/Program-termination/ARM-Assembly/program-termination.arm create mode 100644 Task/Program-termination/BASIC/program-termination-6.basic create mode 100644 Task/Program-termination/Neko/program-termination.neko create mode 100644 Task/Program-termination/Ol/program-termination.ol create mode 100644 Task/Program-termination/VBA/program-termination.vba create mode 100644 Task/Pythagorean-triples/00META.yaml create mode 100644 Task/Pythagorean-triples/Crystal/pythagorean-triples.crystal create mode 100644 Task/Pythagorean-triples/Mercury/pythagorean-triples.mercury create mode 100644 Task/Pythagorean-triples/Ol/pythagorean-triples.ol create mode 100644 Task/Pythagorean-triples/VBA/pythagorean-triples.vba create mode 100644 Task/Pythagorean-triples/Visual-Basic/pythagorean-triples.vb create mode 100644 Task/QR-decomposition/Futhark/qr-decomposition.futhark create mode 100644 Task/QR-decomposition/Haskell/qr-decomposition.hs create mode 100644 Task/QR-decomposition/Perl-6/qr-decomposition.pl6 create mode 100644 Task/QR-decomposition/Phix/qr-decomposition-1.phix create mode 100644 Task/QR-decomposition/Phix/qr-decomposition-2.phix create mode 100644 Task/QR-decomposition/Standard-ML/qr-decomposition-1.ml create mode 100644 Task/QR-decomposition/Standard-ML/qr-decomposition-2.ml create mode 100644 Task/QR-decomposition/VBA/qr-decomposition-1.vba create mode 100644 Task/QR-decomposition/VBA/qr-decomposition-2.vba create mode 100644 Task/Quaternion-type/00META.yaml create mode 100644 Task/Quaternion-type/FreeBASIC/quaternion-type.freebasic create mode 100644 Task/Quaternion-type/Swift/quaternion-type.swift create mode 100644 Task/Quaternion-type/VBA/quaternion-type.vba create mode 100644 Task/Quaternion-type/Visual-Basic-.NET/quaternion-type-1.visual create mode 100644 Task/Quaternion-type/Visual-Basic-.NET/quaternion-type-2.visual create mode 100644 Task/Queue-Definition/ARM-Assembly/queue-definition.arm create mode 100644 Task/Queue-Definition/Free-Pascal/queue-definition.free create mode 100644 Task/Queue-Definition/VBA/queue-definition.vba create mode 100644 Task/Queue-Definition/VBScript/queue-definition.vb create mode 100644 Task/Queue-Usage/VBA/queue-usage.vba create mode 100644 Task/Quickselect-algorithm/00META.yaml create mode 100644 Task/Quickselect-algorithm/Crystal/quickselect-algorithm.crystal create mode 100644 Task/Quickselect-algorithm/Factor/quickselect-algorithm.factor create mode 100644 Task/Quickselect-algorithm/PureBasic/quickselect-algorithm.purebasic rename Task/Quickselect-algorithm/Python/{quickselect-algorithm.py => quickselect-algorithm-1.py} (100%) create mode 100644 Task/Quickselect-algorithm/Python/quickselect-algorithm-2.py create mode 100644 Task/Quickselect-algorithm/VBA/quickselect-algorithm.vba create mode 100644 Task/Quine/00META.yaml create mode 100644 Task/Quine/COBOL/quine-4.cobol rename Task/Quine/Clojure/{quine.clj => quine-1.clj} (100%) create mode 100644 Task/Quine/Clojure/quine-2.clj create mode 100644 Task/Quine/Common-Lisp/quine-7.lisp create mode 100644 Task/Quine/FreeBASIC/quine-1.freebasic create mode 100644 Task/Quine/FreeBASIC/quine-2.freebasic create mode 100644 Task/Quine/GAP/quine.gap create mode 100644 Task/Quine/Mathematica/quine-6.math create mode 100644 Task/Quine/Modula-2/quine.mod2 create mode 100644 Task/Quine/Racket/quine-3.rkt create mode 100644 Task/Quine/SmileBASIC/quine.smilebasic create mode 100644 Task/Quine/VBA/quine.vba create mode 100644 Task/Quine/Visual-Basic-.NET/quine-1.visual create mode 100644 Task/Quine/Visual-Basic-.NET/quine-2.visual create mode 100644 Task/RIPEMD-160/Factor/ripemd-160.factor create mode 100644 Task/RIPEMD-160/Nim/ripemd-160.nim create mode 100644 Task/RIPEMD-160/Seed7/ripemd-160.seed7 create mode 100644 Task/RSA-code/Ada/rsa-code.ada create mode 100644 Task/RSA-code/Perl/rsa-code.pl create mode 100644 Task/RSA-code/Phix/rsa-code.phix create mode 100644 Task/RSA-code/Python/rsa-code.py create mode 100644 Task/RSA-code/Visual-Basic-.NET/rsa-code.visual create mode 100644 Task/Random-number-generator--device-/ARM-Assembly/random-number-generator--device-.arm create mode 100644 Task/Random-number-generator--device-/Factor/random-number-generator--device-.factor create mode 100644 Task/Random-number-generator--included-/00META.yaml create mode 100644 Task/Random-number-generator--included-/Delphi/random-number-generator--included-.delphi create mode 100644 Task/Random-number-generator--included-/Free-Pascal/random-number-generator--included-.free create mode 100644 Task/Range-expansion/00META.yaml create mode 100644 Task/Range-expansion/Aime/range-expansion-1.aime create mode 100644 Task/Range-expansion/Aime/range-expansion-2.aime create mode 100644 Task/Range-expansion/Factor/range-expansion.factor create mode 100644 Task/Range-expansion/Python/range-expansion-3.py create mode 100644 Task/Range-extraction/00META.yaml create mode 100644 Task/Range-extraction/Mercury/range-extraction.mercury rename Task/Range-extraction/Python/{range-extraction.py => range-extraction-1.py} (100%) create mode 100644 Task/Range-extraction/Python/range-extraction-2.py create mode 100644 Task/Range-extraction/Python/range-extraction-3.py create mode 100644 Task/Range-extraction/Python/range-extraction-4.py create mode 100644 Task/Ranking-methods/00META.yaml create mode 100644 Task/Ranking-methods/C++/ranking-methods.cpp create mode 100644 Task/Ranking-methods/Modula-2/ranking-methods.mod2 create mode 100644 Task/Ranking-methods/Perl/ranking-methods.pl create mode 100644 Task/Ranking-methods/Phix/ranking-methods.phix create mode 100644 Task/Rate-counter/00META.yaml create mode 100644 Task/Rate-counter/Julia/rate-counter.julia create mode 100644 Task/Rate-counter/Phix/rate-counter.phix create mode 100644 Task/Read-a-file-line-by-line/ARM-Assembly/read-a-file-line-by-line.arm create mode 100644 Task/Read-a-file-line-by-line/BASIC/read-a-file-line-by-line-4.basic create mode 100644 Task/Read-a-file-line-by-line/C++/read-a-file-line-by-line-3.cpp create mode 100644 Task/Read-a-file-line-by-line/Neko/read-a-file-line-by-line.neko create mode 100644 Task/Read-a-specific-line-from-a-file/00META.yaml create mode 100644 Task/Read-a-specific-line-from-a-file/Factor/read-a-specific-line-from-a-file.factor create mode 100644 Task/Read-entire-file/Neko/read-entire-file.neko create mode 100644 Task/Read-entire-file/OCaml/read-entire-file-5.ocaml create mode 100644 Task/Read-entire-file/Ol/read-entire-file.ol rename Task/Read-entire-file/PHP/{read-entire-file.php => read-entire-file-1.php} (100%) create mode 100644 Task/Read-entire-file/PHP/read-entire-file-2.php create mode 100644 Task/Read-entire-file/Visual-Basic/read-entire-file.vb create mode 100644 Task/Real-constants-and-functions/ARM-Assembly/real-constants-and-functions.arm create mode 100644 Task/Real-constants-and-functions/BASIC/real-constants-and-functions-10.basic create mode 100644 Task/Real-constants-and-functions/BASIC/real-constants-and-functions-11.basic create mode 100644 Task/Real-constants-and-functions/Neko/real-constants-and-functions.neko create mode 100644 Task/Record-sound/Go/record-sound.go create mode 100644 Task/Reduced-row-echelon-form/Factor/reduced-row-echelon-form.factor create mode 100644 Task/Reduced-row-echelon-form/TI-83-BASIC/reduced-row-echelon-form.ti-83 create mode 100644 Task/Reduced-row-echelon-form/VBA/reduced-row-echelon-form.vba create mode 100644 Task/Regular-expressions/NewLISP/regular-expressions.newlisp create mode 100644 Task/Regular-expressions/Ol/regular-expressions.ol create mode 100644 Task/Regular-expressions/Rust/regular-expressions.rust rename Task/Regular-expressions/Smalltalk/{regular-expressions.st => regular-expressions-1.st} (100%) create mode 100644 Task/Regular-expressions/Smalltalk/regular-expressions-2.st create mode 100644 Task/Remove-duplicate-elements/00META.yaml create mode 100644 Task/Remove-duplicate-elements/Neko/remove-duplicate-elements.neko create mode 100644 Task/Remove-duplicate-elements/Python/remove-duplicate-elements-6.py create mode 100644 Task/Remove-duplicate-elements/Python/remove-duplicate-elements-7.py create mode 100644 Task/Remove-duplicate-elements/Python/remove-duplicate-elements-8.py create mode 100644 Task/Remove-duplicate-elements/R/remove-duplicate-elements.r rename Task/Remove-lines-from-a-file/BASIC/{remove-lines-from-a-file.basic => remove-lines-from-a-file-1.basic} (100%) create mode 100644 Task/Remove-lines-from-a-file/BASIC/remove-lines-from-a-file-2.basic create mode 100644 Task/Rename-a-file/Processing/rename-a-file create mode 100644 Task/Rename-a-file/Smalltalk/rename-a-file-3.st create mode 100644 Task/Rendezvous/Julia/rendezvous.julia create mode 100644 Task/Rendezvous/Phix/rendezvous.phix create mode 100644 Task/Rep-string/00META.yaml rename Task/Rep-string/C/{rep-string.c => rep-string-1.c} (100%) create mode 100644 Task/Rep-string/C/rep-string-2.c create mode 100644 Task/Rep-string/Python/rep-string-4.py create mode 100644 Task/Rep-string/Swift/rep-string.swift create mode 100644 Task/Repeat-a-string/ABAP/repeat-a-string.abap create mode 100644 Task/Repeat-a-string/Free-Pascal/repeat-a-string-1.free create mode 100644 Task/Repeat-a-string/Free-Pascal/repeat-a-string-2.free create mode 100644 Task/Repeat-a-string/Free-Pascal/repeat-a-string-3.free create mode 100644 Task/Repeat-a-string/Neko/repeat-a-string.neko create mode 100644 Task/Repeat-a-string/Processing/repeat-a-string create mode 100644 Task/Repeat-a-string/VBA/repeat-a-string-3.vba create mode 100644 Task/Repeat-a-string/Visual-Basic/repeat-a-string-1.vb create mode 100644 Task/Repeat-a-string/Visual-Basic/repeat-a-string-2.vb create mode 100644 Task/Repeat-a-string/Visual-Basic/repeat-a-string-3.vb create mode 100644 Task/Resistor-mesh/C++/resistor-mesh.cpp create mode 100644 Task/Resistor-mesh/Phix/resistor-mesh.phix rename Task/Return-multiple-values/BASIC/{return-multiple-values.basic => return-multiple-values-1.basic} (100%) create mode 100644 Task/Return-multiple-values/BASIC/return-multiple-values-2.basic create mode 100644 Task/Return-multiple-values/BASIC/return-multiple-values-3.basic create mode 100644 Task/Return-multiple-values/Dc/return-multiple-values.dc create mode 100644 Task/Return-multiple-values/Groovy/return-multiple-values-3.groovy create mode 100644 Task/Reverse-a-string/BASIC/reverse-a-string-3.basic create mode 100644 Task/Reverse-a-string/C-sharp/reverse-a-string-1.cs create mode 100644 Task/Reverse-a-string/C-sharp/reverse-a-string-2.cs create mode 100644 Task/Reverse-a-string/C-sharp/reverse-a-string-3.cs create mode 100644 Task/Reverse-a-string/Ceylon/reverse-a-string.ceylon create mode 100644 Task/Reverse-a-string/Dc/reverse-a-string.dc create mode 100644 Task/Reverse-a-string/Haskell/reverse-a-string-3.hs create mode 100644 Task/Reverse-a-string/LLVM/reverse-a-string.llvm create mode 100644 Task/Reverse-a-string/Neko/reverse-a-string.neko create mode 100644 Task/Reverse-a-string/Ol/reverse-a-string.ol create mode 100644 Task/Reverse-a-string/Perl/reverse-a-string.pl create mode 100644 Task/Reverse-a-string/PowerBASIC/reverse-a-string.powerbasic create mode 100644 Task/Reverse-a-string/Python/reverse-a-string-5.py create mode 100644 Task/Reverse-a-string/Python/reverse-a-string-6.py create mode 100644 Task/Reverse-a-string/Robotic/reverse-a-string.robotic create mode 100644 Task/Reverse-a-string/Simula/reverse-a-string.simula create mode 100644 Task/Reverse-a-string/Visual-Basic/reverse-a-string.vb create mode 100644 Task/Reverse-words-in-a-string/00META.yaml create mode 100644 Task/Reverse-words-in-a-string/MAXScript/reverse-words-in-a-string.max create mode 100644 Task/Rock-paper-scissors/Crystal/rock-paper-scissors.crystal create mode 100644 Task/Rock-paper-scissors/Factor/rock-paper-scissors.factor create mode 100644 Task/Rock-paper-scissors/JavaScript/rock-paper-scissors.js create mode 100644 Task/Rock-paper-scissors/Mercury/rock-paper-scissors.mercury create mode 100644 Task/Rock-paper-scissors/Prolog/rock-paper-scissors.pro create mode 100644 Task/Rock-paper-scissors/Swift/rock-paper-scissors.swift create mode 100644 Task/Roman-numerals-Decode/00META.yaml create mode 100644 Task/Roman-numerals-Decode/360-Assembly/roman-numerals-decode.360 create mode 100644 Task/Roman-numerals-Decode/Factor/roman-numerals-decode-1.factor create mode 100644 Task/Roman-numerals-Decode/Factor/roman-numerals-decode-2.factor create mode 100644 Task/Roman-numerals-Decode/Golo/roman-numerals-decode.golo create mode 100644 Task/Roman-numerals-Decode/Haskell/roman-numerals-decode-7.hs create mode 100644 Task/Roman-numerals-Decode/Haskell/roman-numerals-decode-8.hs rename Task/Roman-numerals-Decode/Perl/{roman-numerals-decode.pl => roman-numerals-decode-1.pl} (100%) create mode 100644 Task/Roman-numerals-Decode/Perl/roman-numerals-decode-2.pl create mode 100644 Task/Roman-numerals-Decode/Perl/roman-numerals-decode-3.pl create mode 100644 Task/Roman-numerals-Decode/Python/roman-numerals-decode-4.py create mode 100644 Task/Roman-numerals-Decode/VBScript/roman-numerals-decode.vb create mode 100644 Task/Roman-numerals-Encode/BASIC/roman-numerals-encode-3.basic rename Task/Roman-numerals-Encode/C++/{roman-numerals-encode.cpp => roman-numerals-encode-1.cpp} (100%) create mode 100644 Task/Roman-numerals-Encode/C++/roman-numerals-encode-2.cpp create mode 100644 Task/Roman-numerals-Encode/Golo/roman-numerals-encode.golo create mode 100644 Task/Roman-numerals-Encode/Haskell/roman-numerals-encode-3.hs create mode 100644 Task/Roman-numerals-Encode/JavaScript/roman-numerals-encode-6.js create mode 100644 Task/Roman-numerals-Encode/JavaScript/roman-numerals-encode-7.js create mode 100644 Task/Roman-numerals-Encode/Python/roman-numerals-encode-6.py create mode 100644 Task/Roman-numerals-Encode/VBA/roman-numerals-encode.vba create mode 100644 Task/Roots-of-a-function/Dart/roots-of-a-function.dart create mode 100644 Task/Roots-of-unity/Crystal/roots-of-unity-1.crystal create mode 100644 Task/Roots-of-unity/Crystal/roots-of-unity-2.crystal create mode 100644 Task/Roots-of-unity/Rust/roots-of-unity.rust create mode 100644 Task/Roots-of-unity/VBA/roots-of-unity.vba create mode 100644 Task/Rot-13/360-Assembly/rot-13.360 create mode 100644 Task/Rot-13/BASIC256/rot-13.basic256 create mode 100644 Task/Rot-13/Golo/rot-13.golo create mode 100644 Task/Rot-13/Haskell/rot-13-4.hs create mode 100644 Task/Rot-13/Julia/rot-13-1.julia create mode 100644 Task/Rot-13/Julia/rot-13-2.julia delete mode 100644 Task/Rot-13/Julia/rot-13.julia create mode 100644 Task/Rot-13/Neko/rot-13.neko create mode 100644 Task/Run-length-encoding/BASIC256/run-length-encoding.basic256 create mode 100644 Task/Run-length-encoding/Emacs-Lisp/run-length-encoding.l create mode 100644 Task/Run-length-encoding/FreeBASIC/run-length-encoding.freebasic create mode 100644 Task/Run-length-encoding/Smalltalk/run-length-encoding-1.st create mode 100644 Task/Run-length-encoding/Smalltalk/run-length-encoding-2.st create mode 100644 Task/Run-length-encoding/Smalltalk/run-length-encoding-3.st create mode 100644 Task/Runge-Kutta-method/00META.yaml rename Task/Runge-Kutta-method/BASIC/{runge-kutta-method.basic => runge-kutta-method-1.basic} (100%) create mode 100644 Task/Runge-Kutta-method/BASIC/runge-kutta-method-2.basic create mode 100644 Task/Runge-Kutta-method/Crystal/runge-kutta-method.crystal create mode 100644 Task/Runge-Kutta-method/Haskell/runge-kutta-method-3.hs rename Task/Runge-Kutta-method/JavaScript/{runge-kutta-method.js => runge-kutta-method-1.js} (100%) create mode 100644 Task/Runge-Kutta-method/JavaScript/runge-kutta-method-2.js create mode 100644 Task/Runtime-evaluation-In-an-environment/00META.yaml create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-1.factor create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-2.factor create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-3.factor create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-4.factor create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-5.factor create mode 100644 Task/Runtime-evaluation-In-an-environment/Factor/runtime-evaluation-in-an-environment-6.factor create mode 100644 Task/Runtime-evaluation/00META.yaml create mode 100644 Task/S-Expressions/Factor/s-expressions.factor create mode 100644 Task/S-Expressions/Nim/s-expressions.nim create mode 100644 Task/SEDOLs/Factor/sedols.factor rename Task/SEDOLs/JavaScript/{sedols.js => sedols-1.js} (100%) create mode 100644 Task/SEDOLs/JavaScript/sedols-2.js rename Task/SEDOLs/Python/{sedols.py => sedols-1.py} (100%) create mode 100644 Task/SEDOLs/Python/sedols-2.py create mode 100644 Task/SEDOLs/Q/sedols.q rename Task/SHA-1/D/{sha-1.d => sha-1-1.d} (100%) create mode 100644 Task/SHA-1/D/sha-1-2.d create mode 100644 Task/SHA-1/R/sha-1.r create mode 100644 Task/SHA-256/AWK/sha-256.awk create mode 100644 Task/SHA-256/Free-Pascal/sha-256.free create mode 100644 Task/SHA-256/R/sha-256.r create mode 100644 Task/SOAP/Go/soap-1.go create mode 100644 Task/SOAP/Go/soap-2.go create mode 100644 Task/SOAP/Go/soap-3.go create mode 100644 Task/SOAP/Perl-6/soap.pl6 create mode 100644 Task/SQL-based-authentication/Perl-6/sql-based-authentication.pl6 create mode 100644 Task/SQL-based-authentication/Ruby/sql-based-authentication.rb create mode 100644 Task/Safe-addition/C++/safe-addition.cpp create mode 100644 Task/Safe-addition/Perl-6/safe-addition.pl6 create mode 100644 Task/Safe-addition/Perl/safe-addition.pl create mode 100644 Task/Same-Fringe/00META.yaml create mode 100644 Task/Scope-Function-names-and-labels/Perl/scope-function-names-and-labels.pl create mode 100644 Task/Scope-modifiers/Julia/scope-modifiers.julia create mode 100644 Task/Scope-modifiers/Pascal/scope-modifiers.pascal rename Task/Search-a-list/BASIC/{search-a-list.basic => search-a-list-1.basic} (100%) create mode 100644 Task/Search-a-list/BASIC/search-a-list-2.basic create mode 100644 Task/Search-a-list/VBA/search-a-list.vba create mode 100644 Task/Secure-temporary-file/Phix/secure-temporary-file.phix create mode 100644 Task/Self-describing-numbers/00META.yaml create mode 100644 Task/Self-referential-sequence/00META.yaml create mode 100644 Task/Self-referential-sequence/Julia/self-referential-sequence.julia create mode 100644 Task/Self-referential-sequence/Scala/self-referential-sequence.scala create mode 100644 Task/Semiprime/AWK/semiprime.awk create mode 100644 Task/Semordnilap/00META.yaml create mode 100644 Task/Semordnilap/Factor/semordnilap.factor create mode 100644 Task/Semordnilap/JavaScript/semordnilap-3.js create mode 100644 Task/Semordnilap/Python/semordnilap-3.py create mode 100644 Task/Semordnilap/Python/semordnilap-4.py create mode 100644 Task/Send-an-unknown-method-call/Factor/send-an-unknown-method-call.factor create mode 100644 Task/Send-email/Perl-6/send-email.pl6 create mode 100644 Task/Sequence-of-non-squares/ALGOL-W/sequence-of-non-squares.alg create mode 100644 Task/Sequence-of-non-squares/Ol/sequence-of-non-squares.ol create mode 100644 Task/Set-consolidation/00META.yaml create mode 100644 Task/Set-consolidation/JavaScript/set-consolidation.js create mode 100644 Task/Set-consolidation/Phix/set-consolidation.phix create mode 100644 Task/Set-consolidation/Python/set-consolidation-4.py create mode 100644 Task/Set-consolidation/VBA/set-consolidation.vba create mode 100644 Task/Set-of-real-numbers/00META.yaml create mode 100644 Task/Set-of-real-numbers/C++/set-of-real-numbers.cpp create mode 100644 Task/Set-of-real-numbers/C/set-of-real-numbers.c create mode 100644 Task/Set-of-real-numbers/Haskell/set-of-real-numbers-1.hs create mode 100644 Task/Set-of-real-numbers/Haskell/set-of-real-numbers-2.hs create mode 100644 Task/Set-of-real-numbers/Lua/set-of-real-numbers.lua create mode 100644 Task/Set-of-real-numbers/Phix/set-of-real-numbers-1.phix create mode 100644 Task/Set-of-real-numbers/Phix/set-of-real-numbers-2.phix create mode 100644 Task/Set-puzzle/Julia/set-puzzle.julia create mode 100644 Task/Set/Ol/set.ol create mode 100644 Task/Set/VBA/set.vba create mode 100644 Task/Seven-sided-dice-from-five-sided-dice/Phix/seven-sided-dice-from-five-sided-dice.phix create mode 100644 Task/Seven-sided-dice-from-five-sided-dice/VBA/seven-sided-dice-from-five-sided-dice.vba create mode 100644 Task/Shell-one-liner/Free-Pascal/shell-one-liner.free create mode 100644 Task/Short-circuit-evaluation/VBA/short-circuit-evaluation.vba create mode 100644 Task/Short-circuit-evaluation/Visual-Basic-.NET/short-circuit-evaluation.visual create mode 100644 Task/Show-the-epoch/00META.yaml rename Task/Sierpinski-carpet/AppleScript/{sierpinski-carpet.applescript => sierpinski-carpet-1.applescript} (100%) create mode 100644 Task/Sierpinski-carpet/AppleScript/sierpinski-carpet-2.applescript create mode 100644 Task/Sierpinski-carpet/Crystal/sierpinski-carpet.crystal create mode 100644 Task/Sierpinski-carpet/Haskell/sierpinski-carpet-5.hs create mode 100644 Task/Sierpinski-carpet/JavaScript/sierpinski-carpet-4.js create mode 100644 Task/Sierpinski-carpet/Python/sierpinski-carpet-3.py create mode 100644 Task/Sierpinski-carpet/Rust/sierpinski-carpet.rust create mode 100644 Task/Sierpinski-carpet/VBA/sierpinski-carpet.vba create mode 100644 Task/Sierpinski-triangle-Graphical/00META.yaml create mode 100644 Task/Sierpinski-triangle-Graphical/Factor/sierpinski-triangle-graphical.factor create mode 100644 Task/Sierpinski-triangle-Graphical/Objeck/sierpinski-triangle-graphical.objeck rename Task/Sierpinski-triangle/BASIC/{sierpinski-triangle.basic => sierpinski-triangle-1.basic} (100%) create mode 100644 Task/Sierpinski-triangle/BASIC/sierpinski-triangle-2.basic create mode 100644 Task/Sierpinski-triangle/BASIC/sierpinski-triangle-3.basic create mode 100644 Task/Sierpinski-triangle/Python/sierpinski-triangle-4.py create mode 100644 Task/Sierpinski-triangle/VBA/sierpinski-triangle.vba create mode 100644 Task/Sieve-of-Eratosthenes/ALGOL-M/sieve-of-eratosthenes.algol-m create mode 100644 Task/Sieve-of-Eratosthenes/Agda/sieve-of-eratosthenes.agda create mode 100644 Task/Sieve-of-Eratosthenes/AppleScript/sieve-of-eratosthenes.applescript create mode 100644 Task/Sieve-of-Eratosthenes/BASIC/sieve-of-eratosthenes-7.basic create mode 100644 Task/Sieve-of-Eratosthenes/Dart/sieve-of-eratosthenes-4.dart create mode 100644 Task/Sieve-of-Eratosthenes/Elixir/sieve-of-eratosthenes-3.elixir create mode 100644 Task/Sieve-of-Eratosthenes/Elixir/sieve-of-eratosthenes-4.elixir create mode 100644 Task/Sieve-of-Eratosthenes/Factor/sieve-of-eratosthenes.factor create mode 100644 Task/Sieve-of-Eratosthenes/Free-Pascal/sieve-of-eratosthenes-1.free create mode 100644 Task/Sieve-of-Eratosthenes/Free-Pascal/sieve-of-eratosthenes-2.free create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-10.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-3.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-4.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-5.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-6.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-7.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-8.julia create mode 100644 Task/Sieve-of-Eratosthenes/Julia/sieve-of-eratosthenes-9.julia create mode 100644 Task/Sieve-of-Eratosthenes/Kotlin/sieve-of-eratosthenes-5.kotlin create mode 100644 Task/Sieve-of-Eratosthenes/Kotlin/sieve-of-eratosthenes-6.kotlin create mode 100644 Task/Sieve-of-Eratosthenes/Kotlin/sieve-of-eratosthenes-7.kotlin create mode 100644 Task/Sieve-of-Eratosthenes/Kotlin/sieve-of-eratosthenes-8.kotlin create mode 100644 Task/Sieve-of-Eratosthenes/Maple/sieve-of-eratosthenes.maple create mode 100644 Task/Sieve-of-Eratosthenes/Mercury/sieve-of-eratosthenes.mercury create mode 100644 Task/Sieve-of-Eratosthenes/Nim/sieve-of-eratosthenes-3.nim create mode 100644 Task/Sieve-of-Eratosthenes/Nim/sieve-of-eratosthenes-4.nim create mode 100644 Task/Sieve-of-Eratosthenes/Nim/sieve-of-eratosthenes-5.nim create mode 100644 Task/Sieve-of-Eratosthenes/Ol/sieve-of-eratosthenes.ol create mode 100644 Task/Sieve-of-Eratosthenes/Perl-6/sieve-of-eratosthenes-3.pl6 create mode 100644 Task/Sieve-of-Eratosthenes/Pony/sieve-of-eratosthenes-1.pony create mode 100644 Task/Sieve-of-Eratosthenes/Pony/sieve-of-eratosthenes-2.pony create mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes-1.swift create mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes-2.swift create mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes-3.swift create mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes-4.swift create mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes-5.swift delete mode 100644 Task/Sieve-of-Eratosthenes/Swift/sieve-of-eratosthenes.swift create mode 100644 Task/Sieve-of-Eratosthenes/UNIX-Shell/sieve-of-eratosthenes-6.sh create mode 100644 Task/Sieve-of-Eratosthenes/VBA/sieve-of-eratosthenes.vba rename Task/Sieve-of-Eratosthenes/Visual-Basic-.NET/{sieve-of-eratosthenes.visual => sieve-of-eratosthenes-1.visual} (100%) create mode 100644 Task/Sieve-of-Eratosthenes/Visual-Basic-.NET/sieve-of-eratosthenes-2.visual create mode 100644 Task/Sieve-of-Eratosthenes/Xojo/sieve-of-eratosthenes-1.xojo create mode 100644 Task/Sieve-of-Eratosthenes/Xojo/sieve-of-eratosthenes-2.xojo create mode 100644 Task/Simple-database/Julia/simple-database.julia create mode 100644 Task/Simple-windowed-application/APL/simple-windowed-application.apl create mode 100644 Task/Simulate-input-Keyboard/Go/simulate-input-keyboard.go create mode 100644 Task/Simulate-input-Keyboard/Perl-6/simulate-input-keyboard.pl6 create mode 100644 Task/Simulate-input-Mouse/Go/simulate-input-mouse.go create mode 100644 Task/Simulate-input-Mouse/Perl-6/simulate-input-mouse.pl6 create mode 100644 Task/Singly-linked-list-Element-definition/ARM-Assembly/singly-linked-list-element-definition.arm rename Task/Singly-linked-list-Element-definition/Perl-6/{singly-linked-list-element-definition.pl6 => singly-linked-list-element-definition-1.pl6} (100%) create mode 100644 Task/Singly-linked-list-Element-definition/Perl-6/singly-linked-list-element-definition-2.pl6 create mode 100644 Task/Singly-linked-list-Element-insertion/ARM-Assembly/singly-linked-list-element-insertion.arm create mode 100644 Task/Singly-linked-list-Traversal/ARM-Assembly/singly-linked-list-traversal.arm create mode 100644 Task/Singly-linked-list-Traversal/Perl-6/singly-linked-list-traversal-3.pl6 create mode 100644 Task/Singly-linked-list-Traversal/Perl-6/singly-linked-list-traversal-4.pl6 create mode 100644 Task/Sleep/ARM-Assembly/sleep.arm create mode 100644 Task/Sleep/Cache-ObjectScript/sleep.cos create mode 100644 Task/Sleep/Visual-Basic-.NET/sleep.visual create mode 100644 Task/Sockets/Aime/sockets.aime create mode 100644 Task/Sockets/Neko/sockets.neko create mode 100644 Task/Sokoban/Julia/sokoban.julia create mode 100644 Task/Sokoban/Phix/sokoban-1.phix create mode 100644 Task/Sokoban/Phix/sokoban-2.phix create mode 100644 Task/Sokoban/Phix/sokoban-3.phix create mode 100644 Task/Sokoban/Phix/sokoban-4.phix create mode 100644 Task/Sokoban/Phix/sokoban-5.phix create mode 100644 Task/Sokoban/Ring/sokoban.ring create mode 100644 Task/Solve-a-Hidato-puzzle/00META.yaml create mode 100644 Task/Solve-a-Hidato-puzzle/C-sharp/solve-a-hidato-puzzle.cs create mode 100644 Task/Solve-a-Hidato-puzzle/Julia/solve-a-hidato-puzzle-1.julia create mode 100644 Task/Solve-a-Hidato-puzzle/Julia/solve-a-hidato-puzzle-2.julia create mode 100644 Task/Solve-a-Holy-Knights-tour/00META.yaml create mode 100644 Task/Solve-a-Holy-Knights-tour/C-sharp/solve-a-holy-knights-tour.cs create mode 100644 Task/Solve-a-Holy-Knights-tour/Julia/solve-a-holy-knights-tour.julia create mode 100644 Task/Solve-a-Hopido-puzzle/00META.yaml create mode 100644 Task/Solve-a-Hopido-puzzle/C-sharp/solve-a-hopido-puzzle.cs create mode 100644 Task/Solve-a-Hopido-puzzle/Julia/solve-a-hopido-puzzle.julia create mode 100644 Task/Solve-a-Hopido-puzzle/Perl/solve-a-hopido-puzzle.pl create mode 100644 Task/Solve-a-Numbrix-puzzle/00META.yaml create mode 100644 Task/Solve-a-Numbrix-puzzle/C-sharp/solve-a-numbrix-puzzle.cs create mode 100644 Task/Solve-a-Numbrix-puzzle/Julia/solve-a-numbrix-puzzle.julia create mode 100644 Task/Solve-the-no-connection-puzzle/APL/solve-the-no-connection-puzzle.apl create mode 100644 Task/Solve-the-no-connection-puzzle/ARM-Assembly/solve-the-no-connection-puzzle.arm create mode 100644 Task/Solve-the-no-connection-puzzle/Factor/solve-the-no-connection-puzzle.factor create mode 100644 Task/Solve-the-no-connection-puzzle/Julia/solve-the-no-connection-puzzle.julia create mode 100644 Task/Solve-the-no-connection-puzzle/Picat/solve-the-no-connection-puzzle.picat create mode 100644 Task/Solve-the-no-connection-puzzle/Scala/solve-the-no-connection-puzzle.scala create mode 100644 Task/Sort-an-array-of-composite-structures/AWK/sort-an-array-of-composite-structures.awk create mode 100644 Task/Sort-an-array-of-composite-structures/Rust/sort-an-array-of-composite-structures.rust create mode 100644 Task/Sort-an-array-of-composite-structures/SQL/sort-an-array-of-composite-structures.sql create mode 100644 Task/Sort-an-integer-array/ALGOL-W/sort-an-integer-array.alg create mode 100644 Task/Sort-an-integer-array/Neko/sort-an-integer-array.neko create mode 100644 Task/Sort-disjoint-sublist/00META.yaml create mode 100644 Task/Sort-disjoint-sublist/Factor/sort-disjoint-sublist-1.factor create mode 100644 Task/Sort-disjoint-sublist/Factor/sort-disjoint-sublist-2.factor rename Task/Sort-disjoint-sublist/Python/{sort-disjoint-sublist.py => sort-disjoint-sublist-1.py} (100%) create mode 100644 Task/Sort-disjoint-sublist/Python/sort-disjoint-sublist-2.py create mode 100644 Task/Sort-using-a-custom-comparator/ALGOL-68/sort-using-a-custom-comparator.alg create mode 100644 Task/Sort-using-a-custom-comparator/Haskell/sort-using-a-custom-comparator.hs create mode 100644 Task/Sorting-algorithms-Bead-sort/VBA/sorting-algorithms-bead-sort.vba create mode 100644 Task/Sorting-algorithms-Bogosort/ARM-Assembly/sorting-algorithms-bogosort.arm create mode 100644 Task/Sorting-algorithms-Bogosort/VBA/sorting-algorithms-bogosort.vba create mode 100644 Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-4.basic create mode 100644 Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-5.basic create mode 100644 Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-6.basic create mode 100644 Task/Sorting-algorithms-Bubble-sort/REXX/sorting-algorithms-bubble-sort-4.rexx create mode 100644 Task/Sorting-algorithms-Bubble-sort/SPARK/sorting-algorithms-bubble-sort-4.spark create mode 100644 Task/Sorting-algorithms-Bubble-sort/SPARK/sorting-algorithms-bubble-sort-5.spark create mode 100644 Task/Sorting-algorithms-Bubble-sort/SPARK/sorting-algorithms-bubble-sort-6.spark create mode 100644 Task/Sorting-algorithms-Bubble-sort/SPARK/sorting-algorithms-bubble-sort-7.spark create mode 100644 Task/Sorting-algorithms-Bubble-sort/Stata/sorting-algorithms-bubble-sort.stata create mode 100644 Task/Sorting-algorithms-Bubble-sort/VBA/sorting-algorithms-bubble-sort.vba create mode 100644 Task/Sorting-algorithms-Bubble-sort/Xojo/sorting-algorithms-bubble-sort.xojo create mode 100644 Task/Sorting-algorithms-Bubble-sort/ZX-Spectrum-Basic/sorting-algorithms-bubble-sort-1.zx create mode 100644 Task/Sorting-algorithms-Bubble-sort/ZX-Spectrum-Basic/sorting-algorithms-bubble-sort-2.zx create mode 100644 Task/Sorting-algorithms-Cocktail-sort/Swift/sorting-algorithms-cocktail-sort.swift create mode 100644 Task/Sorting-algorithms-Cocktail-sort/VBA/sorting-algorithms-cocktail-sort.vba create mode 100644 Task/Sorting-algorithms-Cocktail-sort/ZX-Spectrum-Basic/sorting-algorithms-cocktail-sort-1.zx create mode 100644 Task/Sorting-algorithms-Cocktail-sort/ZX-Spectrum-Basic/sorting-algorithms-cocktail-sort-2.zx rename Task/Sorting-algorithms-Comb-sort/Forth/{sorting-algorithms-comb-sort.fth => sorting-algorithms-comb-sort-1.fth} (100%) create mode 100644 Task/Sorting-algorithms-Comb-sort/Forth/sorting-algorithms-comb-sort-2.fth create mode 100644 Task/Sorting-algorithms-Comb-sort/VBA/sorting-algorithms-comb-sort.vba create mode 100644 Task/Sorting-algorithms-Counting-sort/VBA/sorting-algorithms-counting-sort.vba create mode 100644 Task/Sorting-algorithms-Gnome-sort/VBA/sorting-algorithms-gnome-sort.vba create mode 100644 Task/Sorting-algorithms-Heapsort/ARM-Assembly/sorting-algorithms-heapsort.arm create mode 100644 Task/Sorting-algorithms-Heapsort/Julia/sorting-algorithms-heapsort.julia create mode 100644 Task/Sorting-algorithms-Heapsort/Stata/sorting-algorithms-heapsort.stata create mode 100644 Task/Sorting-algorithms-Insertion-sort/ARM-Assembly/sorting-algorithms-insertion-sort.arm rename Task/Sorting-algorithms-Insertion-sort/BASIC/{sorting-algorithms-insertion-sort.basic => sorting-algorithms-insertion-sort-1.basic} (100%) create mode 100644 Task/Sorting-algorithms-Insertion-sort/BASIC/sorting-algorithms-insertion-sort-2.basic create mode 100644 Task/Sorting-algorithms-Insertion-sort/BASIC/sorting-algorithms-insertion-sort-3.basic create mode 100644 Task/Sorting-algorithms-Insertion-sort/BASIC/sorting-algorithms-insertion-sort-4.basic create mode 100644 Task/Sorting-algorithms-Insertion-sort/Python/sorting-algorithms-insertion-sort-4.py rename Task/Sorting-algorithms-Insertion-sort/Scala/{sorting-algorithms-insertion-sort.scala => sorting-algorithms-insertion-sort-1.scala} (100%) create mode 100644 Task/Sorting-algorithms-Insertion-sort/Scala/sorting-algorithms-insertion-sort-2.scala create mode 100644 Task/Sorting-algorithms-Insertion-sort/VBA/sorting-algorithms-insertion-sort.vba create mode 100644 Task/Sorting-algorithms-Quicksort/ABAP/sorting-algorithms-quicksort.abap create mode 100644 Task/Sorting-algorithms-Quicksort/ARM-Assembly/sorting-algorithms-quicksort.arm rename Task/Sorting-algorithms-Quicksort/BASIC/{sorting-algorithms-quicksort.basic => sorting-algorithms-quicksort-1.basic} (100%) create mode 100644 Task/Sorting-algorithms-Quicksort/BASIC/sorting-algorithms-quicksort-2.basic create mode 100644 Task/Sorting-algorithms-Quicksort/BASIC/sorting-algorithms-quicksort-3.basic create mode 100644 Task/Sorting-algorithms-Quicksort/Common-Lisp/sorting-algorithms-quicksort-4.lisp create mode 100644 Task/Sorting-algorithms-Quicksort/MUMPS/sorting-algorithms-quicksort-1.mumps create mode 100644 Task/Sorting-algorithms-Quicksort/MUMPS/sorting-algorithms-quicksort-2.mumps create mode 100644 Task/Sorting-algorithms-Quicksort/Red/sorting-algorithms-quicksort.red create mode 100644 Task/Sorting-algorithms-Radix-sort/Julia/sorting-algorithms-radix-sort.julia rename Task/Sorting-algorithms-Radix-sort/Python/{sorting-algorithms-radix-sort.py => sorting-algorithms-radix-sort-1.py} (100%) create mode 100644 Task/Sorting-algorithms-Radix-sort/Python/sorting-algorithms-radix-sort-2.py create mode 100644 Task/Sorting-algorithms-Radix-sort/Python/sorting-algorithms-radix-sort-3.py create mode 100644 Task/Sorting-algorithms-Selection-sort/ARM-Assembly/sorting-algorithms-selection-sort.arm create mode 100644 Task/Sorting-algorithms-Shell-sort/ARM-Assembly/sorting-algorithms-shell-sort.arm rename Task/Sorting-algorithms-Sleep-sort/Python/{sorting-algorithms-sleep-sort.py => sorting-algorithms-sleep-sort-1.py} (100%) create mode 100644 Task/Sorting-algorithms-Sleep-sort/Python/sorting-algorithms-sleep-sort-2.py rename Task/Sorting-algorithms-Sleep-sort/Tcl/{sorting-algorithms-sleep-sort.tcl => sorting-algorithms-sleep-sort-1.tcl} (100%) create mode 100644 Task/Sorting-algorithms-Sleep-sort/Tcl/sorting-algorithms-sleep-sort-2.tcl create mode 100644 Task/Sorting-algorithms-Stooge-sort/00META.yaml create mode 100644 Task/Sorting-algorithms-Stooge-sort/Factor/sorting-algorithms-stooge-sort.factor create mode 100644 Task/Sorting-algorithms-Strand-sort/Julia/sorting-algorithms-strand-sort.julia create mode 100644 Task/Soundex/Factor/soundex.factor create mode 100644 Task/Soundex/Objeck/soundex.objeck create mode 100644 Task/Soundex/Phix/soundex.phix create mode 100644 Task/Sparkline-in-unicode/00META.yaml create mode 100644 Task/Sparkline-in-unicode/Phix/sparkline-in-unicode.phix create mode 100644 Task/Sparkline-in-unicode/Python/sparkline-in-unicode-1.py create mode 100644 Task/Sparkline-in-unicode/Python/sparkline-in-unicode-2.py delete mode 100644 Task/Sparkline-in-unicode/Python/sparkline-in-unicode.py create mode 100644 Task/Speech-synthesis/Julia/speech-synthesis.julia create mode 100644 Task/Spiral-matrix/Factor/spiral-matrix.factor create mode 100644 Task/Spiral-matrix/Python/spiral-matrix-8.py create mode 100644 Task/Stack-traces/Factor/stack-traces.factor create mode 100644 Task/Stack/ABAP/stack.abap create mode 100644 Task/Stack/Free-Pascal/stack.free create mode 100644 Task/Stack/Ruby/stack-4.rb rename Task/Stack/VBScript/{stack.vb => stack-1.vb} (100%) create mode 100644 Task/Stack/VBScript/stack-2.vb create mode 100644 Task/Stair-climbing-puzzle/00META.yaml create mode 100644 Task/Stair-climbing-puzzle/Factor/stair-climbing-puzzle.factor create mode 100644 Task/Stair-climbing-puzzle/SAS/stair-climbing-puzzle-1.sas rename Task/Stair-climbing-puzzle/SAS/{stair-climbing-puzzle.sas => stair-climbing-puzzle-2.sas} (68%) create mode 100644 Task/Stair-climbing-puzzle/SAS/stair-climbing-puzzle-3.sas create mode 100644 Task/Start-from-a-main-routine/00META.yaml create mode 100644 Task/Start-from-a-main-routine/ALGOL-68/start-from-a-main-routine.alg create mode 100644 Task/Start-from-a-main-routine/Go/start-from-a-main-routine.go create mode 100644 Task/Start-from-a-main-routine/Seed7/start-from-a-main-routine-1.seed7 create mode 100644 Task/Start-from-a-main-routine/Seed7/start-from-a-main-routine-2.seed7 create mode 100644 Task/Start-from-a-main-routine/Visual-Basic-.NET/start-from-a-main-routine-1.visual create mode 100644 Task/Start-from-a-main-routine/Visual-Basic-.NET/start-from-a-main-routine-2.visual create mode 100644 Task/Statistics-Basic/VBA/statistics-basic.vba create mode 100644 Task/Stem-and-leaf-plot/Clojure/stem-and-leaf-plot.clj create mode 100644 Task/Stem-and-leaf-plot/Factor/stem-and-leaf-plot.factor create mode 100644 Task/Stem-and-leaf-plot/Nim/stem-and-leaf-plot.nim create mode 100644 Task/Stem-and-leaf-plot/Python/stem-and-leaf-plot-3.py create mode 100644 Task/Stern-Brocot-sequence/00META.yaml create mode 100644 Task/Stern-Brocot-sequence/360-Assembly/stern-brocot-sequence-1.360 create mode 100644 Task/Stern-Brocot-sequence/360-Assembly/stern-brocot-sequence-2.360 create mode 100644 Task/Stern-Brocot-sequence/360-Assembly/stern-brocot-sequence-3.360 create mode 100644 Task/Stern-Brocot-sequence/AppleScript/stern-brocot-sequence.applescript create mode 100644 Task/Stern-Brocot-sequence/Fortran/stern-brocot-sequence-1.f create mode 100644 Task/Stern-Brocot-sequence/Fortran/stern-brocot-sequence-2.f create mode 100644 Task/Stern-Brocot-sequence/FreeBASIC/stern-brocot-sequence.freebasic rename Task/Stern-Brocot-sequence/Haskell/{stern-brocot-sequence.hs => stern-brocot-sequence-1.hs} (100%) create mode 100644 Task/Stern-Brocot-sequence/Haskell/stern-brocot-sequence-2.hs create mode 100644 Task/Stern-Brocot-sequence/JavaScript/stern-brocot-sequence.js create mode 100644 Task/Stern-Brocot-sequence/Python/stern-brocot-sequence-3.py create mode 100644 Task/Stern-Brocot-sequence/Swift/stern-brocot-sequence.swift create mode 100644 Task/Stern-Brocot-sequence/Visual-Basic-.NET/stern-brocot-sequence.visual create mode 100644 Task/String-append/ARM-Assembly/string-append.arm create mode 100644 Task/String-append/BASIC/string-append-3.basic create mode 100644 Task/String-append/Neko/string-append.neko rename Task/String-case/APL/{string-case.apl => string-case-1.apl} (100%) create mode 100644 Task/String-case/APL/string-case-2.apl rename Task/String-case/SNOBOL4/{string-case.sno => string-case-1.sno} (100%) create mode 100644 Task/String-case/SNOBOL4/string-case-2.sno create mode 100644 Task/String-case/Visual-Basic/string-case.vb create mode 100644 Task/String-concatenation/ARM-Assembly/string-concatenation.arm create mode 100644 Task/String-concatenation/BASIC/string-concatenation-5.basic create mode 100644 Task/String-concatenation/Neko/string-concatenation.neko create mode 100644 Task/String-interpolation--included-/Neko/string-interpolation--included-.neko create mode 100644 Task/String-length/BASIC/string-length-4.basic create mode 100644 Task/String-length/Bracmat/string-length-4.bracmat create mode 100644 Task/String-length/Dc/string-length-1.dc rename Task/String-length/Dc/{string-length.dc => string-length-2.dc} (100%) create mode 100644 Task/String-length/Robotic/string-length.robotic create mode 100644 Task/String-length/Visual-Basic-.NET/string-length-1.visual create mode 100644 Task/String-length/Visual-Basic-.NET/string-length-2.visual create mode 100644 Task/String-length/Visual-Basic-.NET/string-length-3.visual create mode 100644 Task/String-length/Visual-Basic-.NET/string-length-4.visual create mode 100644 Task/String-matching/ARM-Assembly/string-matching.arm create mode 100644 Task/String-matching/AppleScript/string-matching-1.applescript create mode 100644 Task/String-matching/AppleScript/string-matching-2.applescript create mode 100644 Task/String-matching/AppleScript/string-matching-3.applescript create mode 100644 Task/String-matching/Factor/string-matching-1.factor create mode 100644 Task/String-matching/Factor/string-matching-2.factor create mode 100644 Task/String-matching/Factor/string-matching-3.factor create mode 100644 Task/String-matching/Factor/string-matching-4.factor create mode 100644 Task/String-matching/Factor/string-matching-5.factor create mode 100644 Task/String-matching/VBA/string-matching.vba rename Task/String-prepend/BASIC/{string-prepend.basic => string-prepend-1.basic} (100%) create mode 100644 Task/String-prepend/BASIC/string-prepend-2.basic create mode 100644 Task/String-prepend/Neko/string-prepend.neko create mode 100644 Task/String-prepend/Xojo/string-prepend.xojo create mode 100644 Task/Strip-a-set-of-characters-from-a-string/ALGOL-W/strip-a-set-of-characters-from-a-string.alg create mode 100644 Task/Strip-a-set-of-characters-from-a-string/BASIC/strip-a-set-of-characters-from-a-string-3.basic create mode 100644 Task/Strip-a-set-of-characters-from-a-string/Factor/strip-a-set-of-characters-from-a-string-1.factor create mode 100644 Task/Strip-a-set-of-characters-from-a-string/Factor/strip-a-set-of-characters-from-a-string-2.factor delete mode 100644 Task/Strip-a-set-of-characters-from-a-string/Factor/strip-a-set-of-characters-from-a-string.factor create mode 100644 Task/Strip-block-comments/ALGOL-W/strip-block-comments.alg create mode 100644 Task/Strip-block-comments/VBA/strip-block-comments.vba create mode 100644 Task/Strip-comments-from-a-string/Aime/strip-comments-from-a-string.aime create mode 100644 Task/Strip-comments-from-a-string/Rust/strip-comments-from-a-string.rust create mode 100644 Task/Strip-control-codes-and-extended-characters-from-a-string/00META.yaml create mode 100644 Task/Strip-whitespace-from-a-string-Top-and-tail/VBA/strip-whitespace-from-a-string-top-and-tail.vba create mode 100644 Task/Substring-Top-and-tail/BASIC/substring-top-and-tail-3.basic create mode 100644 Task/Substring-Top-and-tail/COBOL/substring-top-and-tail.cobol create mode 100644 Task/Substring-Top-and-tail/Neko/substring-top-and-tail.neko rename Task/Substring-Top-and-tail/Python/{substring-top-and-tail.py => substring-top-and-tail-1.py} (100%) create mode 100644 Task/Substring-Top-and-tail/Python/substring-top-and-tail-2.py create mode 100644 Task/Substring-Top-and-tail/UNIX-Shell/substring-top-and-tail-1.sh create mode 100644 Task/Substring-Top-and-tail/UNIX-Shell/substring-top-and-tail-2.sh create mode 100644 Task/Substring-Top-and-tail/UNIX-Shell/substring-top-and-tail-3.sh create mode 100644 Task/Substring-Top-and-tail/UNIX-Shell/substring-top-and-tail-4.sh delete mode 100644 Task/Substring-Top-and-tail/UNIX-Shell/substring-top-and-tail.sh create mode 100644 Task/Substring/ARM-Assembly/substring.arm create mode 100644 Task/Substring/BASIC/substring-5.basic create mode 100644 Task/Substring/BASIC/substring-6.basic create mode 100644 Task/Substring/Free-Pascal/substring.free create mode 100644 Task/Substring/VBA/substring.vba create mode 100644 Task/Subtractive-generator/Julia/subtractive-generator.julia create mode 100644 Task/Subtractive-generator/Phix/subtractive-generator.phix create mode 100644 Task/Sudoku/Nim/sudoku.nim create mode 100644 Task/Sudoku/Rust/sudoku.rust create mode 100644 Task/Sudoku/SQL/sudoku.sql create mode 100644 Task/Sum-and-product-of-an-array/BASIC/sum-and-product-of-an-array-3.basic create mode 100644 Task/Sum-and-product-of-an-array/BASIC/sum-and-product-of-an-array-4.basic create mode 100644 Task/Sum-and-product-of-an-array/Ol/sum-and-product-of-an-array.ol create mode 100644 Task/Sum-and-product-of-an-array/VBA/sum-and-product-of-an-array.vba create mode 100644 Task/Sum-and-product-of-an-array/Visual-Basic-.NET/sum-and-product-of-an-array.visual create mode 100644 Task/Sum-digits-of-an-integer/00META.yaml create mode 100644 Task/Sum-digits-of-an-integer/Dc/sum-digits-of-an-integer.dc create mode 100644 Task/Sum-digits-of-an-integer/Ol/sum-digits-of-an-integer.ol create mode 100644 Task/Sum-digits-of-an-integer/Python/sum-digits-of-an-integer-3.py create mode 100644 Task/Sum-digits-of-an-integer/Ruby/sum-digits-of-an-integer.rb create mode 100644 Task/Sum-multiples-of-3-and-5/00META.yaml create mode 100644 Task/Sum-multiples-of-3-and-5/AWK/sum-multiples-of-3-and-5-4.awk create mode 100644 Task/Sum-multiples-of-3-and-5/Crystal/sum-multiples-of-3-and-5-1.crystal create mode 100644 Task/Sum-multiples-of-3-and-5/Crystal/sum-multiples-of-3-and-5-2.crystal create mode 100644 Task/Sum-multiples-of-3-and-5/Crystal/sum-multiples-of-3-and-5-3.crystal delete mode 100644 Task/Sum-multiples-of-3-and-5/Crystal/sum-multiples-of-3-and-5.crystal create mode 100644 Task/Sum-multiples-of-3-and-5/Ol/sum-multiples-of-3-and-5.ol rename Task/Sum-multiples-of-3-and-5/Python/{sum-multiples-of-3-and-5.py => sum-multiples-of-3-and-5-1.py} (100%) create mode 100644 Task/Sum-multiples-of-3-and-5/Python/sum-multiples-of-3-and-5-2.py create mode 100644 Task/Sum-multiples-of-3-and-5/Q/sum-multiples-of-3-and-5-1.q create mode 100644 Task/Sum-multiples-of-3-and-5/Q/sum-multiples-of-3-and-5-2.q create mode 100644 Task/Sum-of-a-series/Crystal/sum-of-a-series.crystal create mode 100644 Task/Sum-of-a-series/Dart/sum-of-a-series-1.dart create mode 100644 Task/Sum-of-a-series/Dart/sum-of-a-series-2.dart create mode 100644 Task/Sum-of-a-series/Fish/sum-of-a-series.fish rename Task/Sum-of-a-series/Python/{sum-of-a-series.py => sum-of-a-series-1.py} (100%) create mode 100644 Task/Sum-of-a-series/Python/sum-of-a-series-2.py create mode 100644 Task/Sum-of-a-series/Q/sum-of-a-series.q create mode 100644 Task/Sum-of-a-series/VBA/sum-of-a-series.vba create mode 100644 Task/Sum-of-squares/BASIC/sum-of-squares-3.basic create mode 100644 Task/Sum-of-squares/BASIC/sum-of-squares-4.basic create mode 100644 Task/Sum-of-squares/Ol/sum-of-squares.ol rename Task/Sum-of-squares/PARI-GP/{sum-of-squares.pari => sum-of-squares-1.pari} (100%) create mode 100644 Task/Sum-of-squares/PARI-GP/sum-of-squares-2.pari create mode 100644 Task/Sum-of-squares/Q/sum-of-squares.q create mode 100644 Task/Sum-of-squares/VBA/sum-of-squares.vba create mode 100644 Task/Sutherland-Hodgman-polygon-clipping/C++/sutherland-hodgman-polygon-clipping.cpp create mode 100644 Task/Sutherland-Hodgman-polygon-clipping/Julia/sutherland-hodgman-polygon-clipping.julia rename Task/Synchronous-concurrency/Kotlin/{synchronous-concurrency.kotlin => synchronous-concurrency-1.kotlin} (100%) create mode 100644 Task/Synchronous-concurrency/Kotlin/synchronous-concurrency-2.kotlin create mode 100644 Task/Synchronous-concurrency/Racket/synchronous-concurrency-1.rkt create mode 100644 Task/Synchronous-concurrency/Racket/synchronous-concurrency-2.rkt delete mode 100644 Task/Synchronous-concurrency/Racket/synchronous-concurrency.rkt create mode 100644 Task/System-time/Neko/system-time.neko create mode 100644 Task/Take-notes-on-the-command-line/Julia/take-notes-on-the-command-line.julia rename Task/Take-notes-on-the-command-line/Lasso/{take-notes-on-the-command-line.lasso => take-notes-on-the-command-line-1.lasso} (79%) create mode 100644 Task/Take-notes-on-the-command-line/Lasso/take-notes-on-the-command-line-2.lasso create mode 100644 Task/Temperature-conversion/00META.yaml create mode 100644 Task/Temperature-conversion/BASIC/temperature-conversion-3.basic create mode 100644 Task/Terminal-control-Clear-the-screen/ARM-Assembly/terminal-control-clear-the-screen.arm create mode 100644 Task/Terminal-control-Clear-the-screen/BASIC/terminal-control-clear-the-screen-8.basic create mode 100644 Task/Terminal-control-Clear-the-screen/Dc/terminal-control-clear-the-screen-1.dc create mode 100644 Task/Terminal-control-Clear-the-screen/Dc/terminal-control-clear-the-screen-2.dc create mode 100644 Task/Terminal-control-Clear-the-screen/Dc/terminal-control-clear-the-screen-3.dc create mode 100644 Task/Terminal-control-Clear-the-screen/Rust/terminal-control-clear-the-screen-1.rust create mode 100644 Task/Terminal-control-Clear-the-screen/Rust/terminal-control-clear-the-screen-2.rust create mode 100644 Task/Terminal-control-Clear-the-screen/SmileBASIC/terminal-control-clear-the-screen-1.smilebasic create mode 100644 Task/Terminal-control-Clear-the-screen/SmileBASIC/terminal-control-clear-the-screen-2.smilebasic create mode 100644 Task/Terminal-control-Clear-the-screen/Visual-Basic-.NET/terminal-control-clear-the-screen.visual create mode 100644 Task/Terminal-control-Coloured-text/ARM-Assembly/terminal-control-coloured-text.arm create mode 100644 Task/Terminal-control-Coloured-text/Golo/terminal-control-coloured-text.golo create mode 100644 Task/Terminal-control-Coloured-text/Pascal/terminal-control-coloured-text.pascal create mode 100644 Task/Terminal-control-Coloured-text/Perl/terminal-control-coloured-text.pl create mode 100644 Task/Terminal-control-Cursor-movement/ARM-Assembly/terminal-control-cursor-movement.arm create mode 100644 Task/Terminal-control-Cursor-movement/Julia/terminal-control-cursor-movement.julia create mode 100644 Task/Terminal-control-Cursor-movement/Perl/terminal-control-cursor-movement.pl create mode 100644 Task/Terminal-control-Cursor-positioning/ARM-Assembly/terminal-control-cursor-positioning.arm create mode 100644 Task/Terminal-control-Cursor-positioning/BASIC/terminal-control-cursor-positioning-6.basic create mode 100644 Task/Terminal-control-Cursor-positioning/Julia/terminal-control-cursor-positioning.julia create mode 100644 Task/Terminal-control-Dimensions/Julia/terminal-control-dimensions.julia create mode 100644 Task/Terminal-control-Dimensions/Nim/terminal-control-dimensions.nim create mode 100644 Task/Terminal-control-Display-an-extended-character/BASIC/terminal-control-display-an-extended-character-3.basic create mode 100644 Task/Terminal-control-Display-an-extended-character/BASIC/terminal-control-display-an-extended-character-4.basic create mode 100644 Task/Terminal-control-Display-an-extended-character/Dc/terminal-control-display-an-extended-character.dc create mode 100644 Task/Terminal-control-Display-an-extended-character/Julia/terminal-control-display-an-extended-character.julia create mode 100644 Task/Terminal-control-Display-an-extended-character/Objeck/terminal-control-display-an-extended-character.objeck create mode 100644 Task/Terminal-control-Display-an-extended-character/Perl/terminal-control-display-an-extended-character.pl create mode 100644 Task/Terminal-control-Hiding-the-cursor/Julia/terminal-control-hiding-the-cursor.julia create mode 100644 Task/Terminal-control-Hiding-the-cursor/Nim/terminal-control-hiding-the-cursor.nim create mode 100644 Task/Terminal-control-Hiding-the-cursor/Perl/terminal-control-hiding-the-cursor.pl create mode 100644 Task/Terminal-control-Inverse-video/Julia/terminal-control-inverse-video.julia create mode 100644 Task/Terminal-control-Inverse-video/Perl/terminal-control-inverse-video.pl create mode 100644 Task/Terminal-control-Positional-read/Go/terminal-control-positional-read.go create mode 100644 Task/Terminal-control-Positional-read/Julia/terminal-control-positional-read.julia create mode 100644 Task/Terminal-control-Positional-read/Perl-6/terminal-control-positional-read.pl6 create mode 100644 Task/Terminal-control-Preserve-screen/Emacs-Lisp/terminal-control-preserve-screen.l create mode 100644 Task/Terminal-control-Preserve-screen/Julia/terminal-control-preserve-screen.julia create mode 100644 Task/Terminal-control-Ringing-the-terminal-bell/BASIC/terminal-control-ringing-the-terminal-bell-5.basic create mode 100644 Task/Terminal-control-Ringing-the-terminal-bell/MUMPS/terminal-control-ringing-the-terminal-bell.mumps rename Task/Terminal-control-Ringing-the-terminal-bell/Python/{terminal-control-ringing-the-terminal-bell.py => terminal-control-ringing-the-terminal-bell-1.py} (100%) create mode 100644 Task/Terminal-control-Ringing-the-terminal-bell/Python/terminal-control-ringing-the-terminal-bell-2.py create mode 100644 Task/Terminal-control-Unicode-output/Perl/terminal-control-unicode-output.pl create mode 100644 Task/Terminal-control-Unicode-output/Seed7/terminal-control-unicode-output.seed7 create mode 100644 Task/Ternary-logic/Free-Pascal/ternary-logic-1.free create mode 100644 Task/Ternary-logic/Free-Pascal/ternary-logic-2.free rename Task/Ternary-logic/Julia/{ternary-logic.julia => ternary-logic-1.julia} (100%) create mode 100644 Task/Ternary-logic/Julia/ternary-logic-2.julia create mode 100644 Task/Ternary-logic/Rust/ternary-logic.rust create mode 100644 Task/Text-processing-2/Phix/text-processing-2.phix create mode 100644 Task/Textonyms/00META.yaml create mode 100644 Task/The-ISAAC-Cipher/C++/the-isaac-cipher.cpp create mode 100644 Task/The-ISAAC-Cipher/Perl-6/the-isaac-cipher.pl6 create mode 100644 Task/The-ISAAC-Cipher/Phix/the-isaac-cipher.phix create mode 100644 Task/The-Twelve-Days-of-Christmas/00META.yaml create mode 100644 Task/The-Twelve-Days-of-Christmas/Crystal/the-twelve-days-of-christmas.crystal rename Task/The-Twelve-Days-of-Christmas/PHP/{the-twelve-days-of-christmas.php => the-twelve-days-of-christmas-1.php} (100%) create mode 100644 Task/The-Twelve-Days-of-Christmas/PHP/the-twelve-days-of-christmas-2.php create mode 100644 Task/The-Twelve-Days-of-Christmas/Visual-Basic-.NET/the-twelve-days-of-christmas.visual create mode 100644 Task/Thieles-interpolation-formula/Julia/thieles-interpolation-formula.julia create mode 100644 Task/Thieles-interpolation-formula/Phix/thieles-interpolation-formula.phix create mode 100644 Task/Tic-tac-toe/Julia/tic-tac-toe.julia create mode 100644 Task/Tic-tac-toe/Objeck/tic-tac-toe.objeck create mode 100644 Task/Time-a-function/ARM-Assembly/time-a-function.arm create mode 100644 Task/Time-a-function/VBA/time-a-function.vba create mode 100644 Task/Tokenize-a-string/ARM-Assembly/tokenize-a-string.arm create mode 100644 Task/Tokenize-a-string/XPath-2.0/tokenize-a-string.xpath create mode 100644 Task/Top-rank-per-group/00META.yaml create mode 100644 Task/Top-rank-per-group/SQL/top-rank-per-group-3.sql create mode 100644 Task/Top-rank-per-group/Swift/top-rank-per-group.swift create mode 100644 Task/Top-rank-per-group/VBA/top-rank-per-group.vba create mode 100644 Task/Topic-variable/00META.yaml create mode 100644 Task/Topic-variable/Phix/topic-variable.phix create mode 100644 Task/Topological-sort/00META.yaml rename Task/Topological-sort/Kotlin/{topological-sort.kotlin => topological-sort-1.kotlin} (100%) create mode 100644 Task/Topological-sort/Kotlin/topological-sort-2.kotlin create mode 100644 Task/Topological-sort/Mercury/topological-sort.mercury create mode 100644 Task/Topological-sort/Phix/topological-sort.phix create mode 100644 Task/Topswops/00META.yaml create mode 100644 Task/Topswops/R/topswops.r create mode 100644 Task/Total-circles-area/00META.yaml create mode 100644 Task/Total-circles-area/Perl/total-circles-area.pl create mode 100644 Task/Total-circles-area/Phix/total-circles-area.phix create mode 100644 Task/Total-circles-area/VBA/total-circles-area.vba create mode 100644 Task/Towers-of-Hanoi/AppleScript/towers-of-hanoi.applescript create mode 100644 Task/Towers-of-Hanoi/COBOL/towers-of-hanoi-3.cobol create mode 100644 Task/Towers-of-Hanoi/Haskell/towers-of-hanoi-5.hs rename Task/Towers-of-Hanoi/Python/{towers-of-hanoi.py => towers-of-hanoi-1.py} (100%) create mode 100644 Task/Towers-of-Hanoi/Python/towers-of-hanoi-2.py create mode 100644 Task/Towers-of-Hanoi/Python/towers-of-hanoi-3.py create mode 100644 Task/Trabb-Pardo-Knuth-algorithm/00META.yaml create mode 100644 Task/Trabb-Pardo-Knuth-algorithm/Rust/trabb-pardo-knuth-algorithm.rust create mode 100644 Task/Tree-traversal/ARM-Assembly/tree-traversal.arm create mode 100644 Task/Tree-traversal/Crystal/tree-traversal.crystal rename Task/Tree-traversal/Haskell/{tree-traversal.hs => tree-traversal-1.hs} (100%) create mode 100644 Task/Tree-traversal/Haskell/tree-traversal-2.hs create mode 100644 Task/Tree-traversal/Lua/tree-traversal.lua create mode 100644 Task/Tree-traversal/Python/tree-traversal-3.py create mode 100644 Task/Tree-traversal/VBA/tree-traversal-1.vba create mode 100644 Task/Tree-traversal/VBA/tree-traversal-2.vba rename Task/Trigonometric-functions/BASIC/{trigonometric-functions.basic => trigonometric-functions-1.basic} (100%) create mode 100644 Task/Trigonometric-functions/BASIC/trigonometric-functions-2.basic create mode 100644 Task/Trigonometric-functions/BASIC/trigonometric-functions-3.basic create mode 100644 Task/Trigonometric-functions/Factor/trigonometric-functions.factor create mode 100644 Task/Trigonometric-functions/VBA/trigonometric-functions.vba create mode 100644 Task/Trigonometric-functions/Visual-Basic-.NET/trigonometric-functions.visual create mode 100644 Task/Truncatable-primes/AWK/truncatable-primes.awk create mode 100644 Task/Truncatable-primes/Scala/truncatable-primes.scala create mode 100644 Task/Truncate-a-file/Phix/truncate-a-file.phix create mode 100644 Task/Twelve-statements/VBA/twelve-statements.vba create mode 100644 Task/URL-decoding/Free-Pascal/url-decoding.free create mode 100644 Task/URL-decoding/Rust/url-decoding.rust create mode 100644 Task/URL-encoding/Factor/url-encoding.factor create mode 100644 Task/URL-encoding/Free-Pascal/url-encoding.free create mode 100644 Task/URL-encoding/Rust/url-encoding.rust create mode 100644 Task/Ulam-spiral--for-primes-/00META.yaml create mode 100644 Task/Ulam-spiral--for-primes-/Common-Lisp/ulam-spiral--for-primes-.lisp create mode 100644 Task/Ulam-spiral--for-primes-/Factor/ulam-spiral--for-primes-.factor create mode 100644 Task/Ulam-spiral--for-primes-/Forth/ulam-spiral--for-primes-.fth create mode 100644 Task/Ulam-spiral--for-primes-/Phix/ulam-spiral--for-primes--1.phix create mode 100644 Task/Ulam-spiral--for-primes-/Phix/ulam-spiral--for-primes--2.phix create mode 100644 Task/Unbias-a-random-generator/00META.yaml create mode 100644 Task/Unbias-a-random-generator/Factor/unbias-a-random-generator.factor create mode 100644 Task/Undefined-values/Julia/undefined-values.julia create mode 100644 Task/Unicode-strings/00META.yaml create mode 100644 Task/Unicode-strings/Visual-Basic-.NET/unicode-strings.visual create mode 100644 Task/Unicode-variable-names/Factor/unicode-variable-names.factor create mode 100644 Task/Universal-Turing-machine/00META.yaml create mode 100644 Task/Universal-Turing-machine/Julia/universal-turing-machine.julia create mode 100644 Task/Universal-Turing-machine/Scala/universal-turing-machine.scala create mode 100644 Task/Universal-Turing-machine/VBA/universal-turing-machine.vba create mode 100644 Task/Unix-ls/00META.yaml create mode 100644 Task/Unix-ls/Aime/unix-ls.aime create mode 100644 Task/Unix-ls/PowerShell/unix-ls.psh create mode 100644 Task/Unix-ls/Seed7/unix-ls.seed7 create mode 100644 Task/Update-a-configuration-file/Julia/update-a-configuration-file.julia create mode 100644 Task/Use-another-language-to-call-a-function/Mercury/use-another-language-to-call-a-function.mercury create mode 100644 Task/User-input-Graphical/Go/user-input-graphical.go create mode 100644 Task/User-input-Graphical/Groovy/user-input-graphical.groovy create mode 100644 Task/User-input-Graphical/Julia/user-input-graphical.julia create mode 100644 Task/User-input-Graphical/Perl/user-input-graphical.pl create mode 100644 Task/User-input-Graphical/REXX/user-input-graphical.rexx create mode 100644 Task/User-input-Text/BASIC/user-input-text-4.basic create mode 100644 Task/User-input-Text/Neko/user-input-text.neko create mode 100644 Task/User-input-Text/Robotic/user-input-text-1.robotic create mode 100644 Task/User-input-Text/Robotic/user-input-text-2.robotic create mode 100644 Task/User-input-Text/VBA/user-input-text.vba create mode 100644 Task/Vampire-number/Phix/vampire-number.phix create mode 100644 Task/Vampire-number/Swift/vampire-number.swift create mode 100644 Task/Van-der-Corput-sequence/00META.yaml create mode 100644 Task/Van-der-Corput-sequence/Factor/van-der-corput-sequence.factor create mode 100644 Task/Van-der-Corput-sequence/Swift/van-der-corput-sequence.swift create mode 100644 Task/Van-der-Corput-sequence/VBA/van-der-corput-sequence.vba create mode 100644 Task/Van-der-Corput-sequence/Visual-Basic-.NET/van-der-corput-sequence.visual create mode 100644 Task/Variable-size-Get/Forth/variable-size-get-1.fth create mode 100644 Task/Variable-size-Get/Forth/variable-size-get-2.fth create mode 100644 Task/Variable-size-Get/Rust/variable-size-get.rust create mode 100644 Task/Variable-size-Set/Free-Pascal/variable-size-set.free create mode 100644 Task/Variable-size-Set/Julia/variable-size-set.julia create mode 100644 Task/Variable-size-Set/Phix/variable-size-set.phix create mode 100644 Task/Variables/ARM-Assembly/variables.arm create mode 100644 Task/Variables/Common-Lisp/variables-10.lisp create mode 100644 Task/Variables/Common-Lisp/variables-8.lisp create mode 100644 Task/Variables/Common-Lisp/variables-9.lisp create mode 100644 Task/Variables/Mercury/variables-1.mercury create mode 100644 Task/Variables/Mercury/variables-2.mercury create mode 100644 Task/Variables/Mercury/variables-3.mercury create mode 100644 Task/Variables/Mercury/variables-4.mercury create mode 100644 Task/Variables/Mercury/variables-5.mercury create mode 100644 Task/Variables/Mercury/variables-6.mercury create mode 100644 Task/Variables/Mercury/variables-7.mercury create mode 100644 Task/Variables/Mercury/variables-8.mercury create mode 100644 Task/Variables/Visual-Basic-.NET/variables-1.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-2.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-3.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-4.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-5.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-6.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-7.visual create mode 100644 Task/Variables/Visual-Basic-.NET/variables-8.visual delete mode 100644 Task/Variables/Visual-Basic-.NET/variables.visual create mode 100644 Task/Variadic-function/Free-Pascal/variadic-function-1.free create mode 100644 Task/Variadic-function/Free-Pascal/variadic-function-2.free create mode 100644 Task/Variadic-function/Golo/variadic-function.golo rename Task/Variadic-function/Haskell/{variadic-function.hs => variadic-function-1.hs} (100%) create mode 100644 Task/Variadic-function/Haskell/variadic-function-2.hs create mode 100644 Task/Vector-products/00META.yaml create mode 100644 Task/Vector-products/Ceylon/vector-products.ceylon create mode 100644 Task/Vector-products/GLSL/vector-products.glsl create mode 100644 Task/Vector-products/VBA/vector-products.vba create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/Perl/verify-distribution-uniformity-chi-squared-test.pl create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/Phix/verify-distribution-uniformity-chi-squared-test.phix create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/REXX/verify-distribution-uniformity-chi-squared-test.rexx create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/Scala/verify-distribution-uniformity-chi-squared-test.scala create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/Sidef/verify-distribution-uniformity-chi-squared-test.sidef create mode 100644 Task/Verify-distribution-uniformity-Chi-squared-test/VBA/verify-distribution-uniformity-chi-squared-test.vba create mode 100644 Task/Verify-distribution-uniformity-Naive/Perl/verify-distribution-uniformity-naive.pl create mode 100644 Task/Verify-distribution-uniformity-Naive/Phix/verify-distribution-uniformity-naive.phix create mode 100644 Task/Video-display-modes/Groovy/video-display-modes.groovy create mode 100644 Task/Video-display-modes/Julia/video-display-modes.julia create mode 100644 Task/Video-display-modes/Perl/video-display-modes.pl create mode 100644 Task/Video-display-modes/Python/video-display-modes.py create mode 100644 Task/Vigen-re-cipher/Ceylon/vigen-re-cipher.ceylon create mode 100644 Task/Vigen-re-cipher/Python/vigen-re-cipher.py create mode 100644 Task/Visualize-a-tree/00META.yaml create mode 100644 Task/Visualize-a-tree/AppleScript/visualize-a-tree.applescript create mode 100644 Task/Visualize-a-tree/Factor/visualize-a-tree-1.factor create mode 100644 Task/Visualize-a-tree/Factor/visualize-a-tree-2.factor rename Task/Visualize-a-tree/Haskell/{visualize-a-tree.hs => visualize-a-tree-1.hs} (100%) create mode 100644 Task/Visualize-a-tree/Haskell/visualize-a-tree-2.hs rename Task/Visualize-a-tree/JavaScript/{visualize-a-tree.js => visualize-a-tree-1.js} (100%) create mode 100644 Task/Visualize-a-tree/JavaScript/visualize-a-tree-2.js create mode 100644 Task/Visualize-a-tree/JavaScript/visualize-a-tree-3.js create mode 100644 Task/Visualize-a-tree/Julia/visualize-a-tree.julia create mode 100644 Task/Visualize-a-tree/Python/visualize-a-tree-5.py create mode 100644 Task/Visualize-a-tree/Python/visualize-a-tree-6.py create mode 100644 Task/Vogels-approximation-method/00META.yaml rename Task/Vogels-approximation-method/C/{vogels-approximation-method.c => vogels-approximation-method-1.c} (98%) create mode 100644 Task/Vogels-approximation-method/C/vogels-approximation-method-2.c rename Task/Vogels-approximation-method/Go/{vogels-approximation-method.go => vogels-approximation-method-1.go} (100%) create mode 100644 Task/Vogels-approximation-method/Go/vogels-approximation-method-2.go create mode 100644 Task/Vogels-approximation-method/Perl-6/vogels-approximation-method.pl6 create mode 100644 Task/Vogels-approximation-method/Phix/vogels-approximation-method-1.phix create mode 100644 Task/Vogels-approximation-method/Phix/vogels-approximation-method-2.phix create mode 100644 Task/Voronoi-diagram/00META.yaml create mode 100644 Task/Voronoi-diagram/Nim/voronoi-diagram.nim create mode 100644 Task/Voronoi-diagram/Perl/voronoi-diagram.pl create mode 100644 Task/Voronoi-diagram/Scala/voronoi-diagram.scala create mode 100644 Task/Walk-a-directory-Non-recursively/BaCon/walk-a-directory-non-recursively.bacon rename Task/Walk-a-directory-Non-recursively/C++/{walk-a-directory-non-recursively.cpp => walk-a-directory-non-recursively-1.cpp} (100%) create mode 100644 Task/Walk-a-directory-Non-recursively/C++/walk-a-directory-non-recursively-2.cpp create mode 100644 Task/Walk-a-directory-Non-recursively/Elena/walk-a-directory-non-recursively.elena rename Task/Walk-a-directory-Non-recursively/Lua/{walk-a-directory-non-recursively.lua => walk-a-directory-non-recursively-1.lua} (100%) create mode 100644 Task/Walk-a-directory-Non-recursively/Lua/walk-a-directory-non-recursively-2.lua create mode 100644 Task/Walk-a-directory-Recursively/BaCon/walk-a-directory-recursively.bacon rename Task/Walk-a-directory-Recursively/C++/{walk-a-directory-recursively.cpp => walk-a-directory-recursively-1.cpp} (100%) create mode 100644 Task/Walk-a-directory-Recursively/C++/walk-a-directory-recursively-2.cpp create mode 100644 Task/Walk-a-directory-Recursively/Lua/walk-a-directory-recursively.lua create mode 100644 Task/Walk-a-directory-Recursively/Objeck/walk-a-directory-recursively.objeck create mode 100644 Task/Web-scraping/Phix/web-scraping.phix create mode 100644 Task/Window-creation-X11/ARM-Assembly/window-creation-x11.arm create mode 100644 Task/Window-creation/OCaml/window-creation-7.ocaml create mode 100644 Task/Window-management/C/window-management.c create mode 100644 Task/Window-management/Go/window-management.go create mode 100644 Task/Window-management/Julia/window-management.julia create mode 100644 Task/Window-management/Perl-6/window-management.pl6 create mode 100644 Task/Wireworld/Julia/wireworld.julia create mode 100644 Task/Word-wrap/PHP/word-wrap.php rename Task/Word-wrap/R/{word-wrap.r => word-wrap-1.r} (100%) create mode 100644 Task/Word-wrap/R/word-wrap-2.r create mode 100644 Task/World-Cup-group-stage/00META.yaml create mode 100644 Task/World-Cup-group-stage/Common-Lisp/world-cup-group-stage.lisp create mode 100644 Task/World-Cup-group-stage/Go/world-cup-group-stage.go create mode 100644 Task/World-Cup-group-stage/Julia/world-cup-group-stage.julia create mode 100644 Task/World-Cup-group-stage/Perl/world-cup-group-stage.pl create mode 100644 Task/World-Cup-group-stage/Phix/world-cup-group-stage.phix create mode 100644 Task/World-Cup-group-stage/REXX/world-cup-group-stage-1.rexx create mode 100644 Task/World-Cup-group-stage/REXX/world-cup-group-stage-2.rexx create mode 100644 Task/Write-float-arrays-to-a-text-file/VBA/write-float-arrays-to-a-text-file.vba create mode 100644 Task/Write-language-name-in-3D-ASCII/00META.yaml create mode 100644 Task/Write-language-name-in-3D-ASCII/Julia/write-language-name-in-3d-ascii.julia create mode 100644 Task/Write-language-name-in-3D-ASCII/Lua/write-language-name-in-3d-ascii.lua create mode 100644 Task/Write-language-name-in-3D-ASCII/Phix/write-language-name-in-3d-ascii-1.phix create mode 100644 Task/Write-language-name-in-3D-ASCII/Phix/write-language-name-in-3d-ascii-2.phix create mode 100644 Task/Write-language-name-in-3D-ASCII/Phix/write-language-name-in-3d-ascii-3.phix delete mode 100644 Task/Write-language-name-in-3D-ASCII/Phix/write-language-name-in-3d-ascii.phix create mode 100644 Task/Write-language-name-in-3D-ASCII/Python/write-language-name-in-3d-ascii-3.py create mode 100644 Task/Write-language-name-in-3D-ASCII/Rust/write-language-name-in-3d-ascii.rust create mode 100644 Task/Write-language-name-in-3D-ASCII/Visual-Basic-.NET/write-language-name-in-3d-ascii.visual create mode 100644 Task/Write-to-Windows-event-log/00META.yaml create mode 100644 Task/Write-to-Windows-event-log/AWK/write-to-windows-event-log.awk create mode 100644 Task/Write-to-Windows-event-log/C++/write-to-windows-event-log.cpp create mode 100644 Task/Write-to-Windows-event-log/Go/write-to-windows-event-log.go create mode 100644 Task/Write-to-Windows-event-log/Java/write-to-windows-event-log.java create mode 100644 Task/Write-to-Windows-event-log/Julia/write-to-windows-event-log.julia create mode 100644 Task/Write-to-Windows-event-log/Phix/write-to-windows-event-log.phix create mode 100644 Task/XML-DOM-serialization/ARM-Assembly/xml-dom-serialization.arm create mode 100644 Task/XML-DOM-serialization/Julia/xml-dom-serialization.julia create mode 100644 Task/XML-DOM-serialization/Phix/xml-dom-serialization.phix create mode 100644 Task/XML-Input/ARM-Assembly/xml-input.arm create mode 100644 Task/XML-Input/Neko/xml-input-1.neko create mode 100644 Task/XML-Input/Neko/xml-input-2.neko create mode 100644 Task/XML-Output/ARM-Assembly/xml-output.arm create mode 100644 Task/XML-Output/Julia/xml-output.julia create mode 100644 Task/XML-Output/Rust/xml-output.rust create mode 100644 Task/XML-XPath/ARM-Assembly/xml-xpath.arm create mode 100644 Task/XML-XPath/Julia/xml-xpath.julia create mode 100644 Task/Xiaolin-Wus-line-algorithm/ARM-Assembly/xiaolin-wus-line-algorithm.arm create mode 100644 Task/Xiaolin-Wus-line-algorithm/C/xiaolin-wus-line-algorithm-4.c create mode 100644 Task/Xiaolin-Wus-line-algorithm/Haskell/xiaolin-wus-line-algorithm.hs create mode 100644 Task/Y-combinator/ARM-Assembly/y-combinator.arm create mode 100644 Task/Y-combinator/J/y-combinator-10.j create mode 100644 Task/Y-combinator/J/y-combinator-11.j create mode 100644 Task/Y-combinator/J/y-combinator-12.j create mode 100644 Task/Y-combinator/J/y-combinator-13.j create mode 100644 Task/Y-combinator/J/y-combinator-14.j create mode 100644 Task/Y-combinator/J/y-combinator-7.j create mode 100644 Task/Y-combinator/J/y-combinator-8.j create mode 100644 Task/Y-combinator/J/y-combinator-9.j create mode 100644 Task/Y-combinator/Phix/y-combinator.phix create mode 100644 Task/Y-combinator/Scheme/y-combinator-3.ss create mode 100644 Task/Y-combinator/Scheme/y-combinator-4.ss create mode 100644 Task/Y-combinator/VBA/y-combinator.vba create mode 100644 Task/Yin-and-yang/AWK/yin-and-yang.awk create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-1.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-10.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-11.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-12.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-13.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-14.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-15.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-16.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-17.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-18.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-2.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-3.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-4.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-5.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-6.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-7.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-8.basic create mode 100644 Task/Yin-and-yang/BASIC/yin-and-yang-9.basic create mode 100644 Task/Yin-and-yang/Maple/yin-and-yang.maple create mode 100644 Task/Yin-and-yang/PARI-GP/yin-and-yang.pari create mode 100644 Task/Yin-and-yang/Pascal/yin-and-yang.pascal create mode 100644 Task/Zebra-puzzle/Crystal/zebra-puzzle.crystal create mode 100644 Task/Zebra-puzzle/GAP/zebra-puzzle.gap create mode 100644 Task/Zebra-puzzle/Perl-6/zebra-puzzle.pl6 create mode 100644 Task/Zebra-puzzle/VBA/zebra-puzzle.vba create mode 100644 Task/Zeckendorf-arithmetic/Go/zeckendorf-arithmetic.go create mode 100644 Task/Zeckendorf-arithmetic/Julia/zeckendorf-arithmetic.julia create mode 100644 Task/Zeckendorf-arithmetic/Phix/zeckendorf-arithmetic.phix create mode 100644 Task/Zeckendorf-arithmetic/Python/zeckendorf-arithmetic.py create mode 100644 Task/Zeckendorf-number-representation/00META.yaml create mode 100644 Task/Zeckendorf-number-representation/Factor/zeckendorf-number-representation.factor create mode 100644 Task/Zeckendorf-number-representation/Scheme/zeckendorf-number-representation.ss create mode 100644 Task/Zeckendorf-number-representation/Simula/zeckendorf-number-representation.simula create mode 100644 Task/Zeckendorf-number-representation/VBA/zeckendorf-number-representation.vba create mode 100644 Task/Zero-to-the-zero-power/Cache-ObjectScript/zero-to-the-zero-power.cos create mode 100644 Task/Zero-to-the-zero-power/K/zero-to-the-zero-power.k create mode 100644 Task/Zero-to-the-zero-power/Neko/zero-to-the-zero-power.neko create mode 100644 Task/Zero-to-the-zero-power/Ol/zero-to-the-zero-power.ol create mode 100644 Task/Zero-to-the-zero-power/VBA/zero-to-the-zero-power.vba create mode 100644 Task/Zero-to-the-zero-power/Visual-Basic-.NET/zero-to-the-zero-power.visual create mode 100644 Task/Zhang-Suen-thinning-algorithm/00META.yaml create mode 100644 Task/Zhang-Suen-thinning-algorithm/Perl/zhang-suen-thinning-algorithm.pl create mode 100644 Task/Zhang-Suen-thinning-algorithm/VBA/zhang-suen-thinning-algorithm.vba create mode 100644 Task/Zig-zag-matrix/Ceylon/zig-zag-matrix.ceylon create mode 100644 Task/Zig-zag-matrix/Crystal/zig-zag-matrix.crystal create mode 100644 Task/Zig-zag-matrix/Factor/zig-zag-matrix.factor diff --git a/Lang/360-Assembly/Align-columns b/Lang/360-Assembly/Align-columns new file mode 120000 index 0000000000..46e36fab0e --- /dev/null +++ b/Lang/360-Assembly/Align-columns @@ -0,0 +1 @@ +../../Task/Align-columns/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Bitmap-Bresenhams-line-algorithm b/Lang/360-Assembly/Bitmap-Bresenhams-line-algorithm new file mode 120000 index 0000000000..8e1599624c --- /dev/null +++ b/Lang/360-Assembly/Bitmap-Bresenhams-line-algorithm @@ -0,0 +1 @@ +../../Task/Bitmap-Bresenhams-line-algorithm/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Caesar-cipher b/Lang/360-Assembly/Caesar-cipher new file mode 120000 index 0000000000..f21fbfff13 --- /dev/null +++ b/Lang/360-Assembly/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Fractran b/Lang/360-Assembly/Fractran new file mode 120000 index 0000000000..e9eef11199 --- /dev/null +++ b/Lang/360-Assembly/Fractran @@ -0,0 +1 @@ +../../Task/Fractran/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Gaussian-elimination b/Lang/360-Assembly/Gaussian-elimination new file mode 120000 index 0000000000..d50821163f --- /dev/null +++ b/Lang/360-Assembly/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Harshad-or-Niven-series b/Lang/360-Assembly/Harshad-or-Niven-series new file mode 120000 index 0000000000..0bda3be2ad --- /dev/null +++ b/Lang/360-Assembly/Harshad-or-Niven-series @@ -0,0 +1 @@ +../../Task/Harshad-or-Niven-series/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Least-common-multiple b/Lang/360-Assembly/Least-common-multiple new file mode 120000 index 0000000000..123bcb0b0b --- /dev/null +++ b/Lang/360-Assembly/Least-common-multiple @@ -0,0 +1 @@ +../../Task/Least-common-multiple/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Parsing-RPN-calculator-algorithm b/Lang/360-Assembly/Parsing-RPN-calculator-algorithm new file mode 120000 index 0000000000..dec4a05f75 --- /dev/null +++ b/Lang/360-Assembly/Parsing-RPN-calculator-algorithm @@ -0,0 +1 @@ +../../Task/Parsing-RPN-calculator-algorithm/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Roman-numerals-Decode b/Lang/360-Assembly/Roman-numerals-Decode new file mode 120000 index 0000000000..a95f756919 --- /dev/null +++ b/Lang/360-Assembly/Roman-numerals-Decode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Decode/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Rot-13 b/Lang/360-Assembly/Rot-13 new file mode 120000 index 0000000000..77c8e2246b --- /dev/null +++ b/Lang/360-Assembly/Rot-13 @@ -0,0 +1 @@ +../../Task/Rot-13/360-Assembly \ No newline at end of file diff --git a/Lang/360-Assembly/Stern-Brocot-sequence b/Lang/360-Assembly/Stern-Brocot-sequence new file mode 120000 index 0000000000..52361b34a8 --- /dev/null +++ b/Lang/360-Assembly/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/360-Assembly \ No newline at end of file diff --git a/Lang/68000-Assembly/Leap-year b/Lang/68000-Assembly/Leap-year new file mode 120000 index 0000000000..3d07488ad9 --- /dev/null +++ b/Lang/68000-Assembly/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/68000-Assembly \ No newline at end of file diff --git a/Lang/ABAP/Array-concatenation b/Lang/ABAP/Array-concatenation new file mode 120000 index 0000000000..43001b6cfb --- /dev/null +++ b/Lang/ABAP/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Bitwise-operations b/Lang/ABAP/Bitwise-operations new file mode 120000 index 0000000000..9bcbf43828 --- /dev/null +++ b/Lang/ABAP/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Catalan-numbers b/Lang/ABAP/Catalan-numbers new file mode 120000 index 0000000000..45a2bc7ffe --- /dev/null +++ b/Lang/ABAP/Catalan-numbers @@ -0,0 +1 @@ +../../Task/Catalan-numbers/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Catamorphism b/Lang/ABAP/Catamorphism new file mode 120000 index 0000000000..f27284b3dc --- /dev/null +++ b/Lang/ABAP/Catamorphism @@ -0,0 +1 @@ +../../Task/Catamorphism/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Dutch-national-flag-problem b/Lang/ABAP/Dutch-national-flag-problem new file mode 120000 index 0000000000..a72ef71804 --- /dev/null +++ b/Lang/ABAP/Dutch-national-flag-problem @@ -0,0 +1 @@ +../../Task/Dutch-national-flag-problem/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Empty-program b/Lang/ABAP/Empty-program new file mode 120000 index 0000000000..13c90b736b --- /dev/null +++ b/Lang/ABAP/Empty-program @@ -0,0 +1 @@ +../../Task/Empty-program/ABAP \ No newline at end of file diff --git a/Lang/ABAP/HTTP b/Lang/ABAP/HTTP new file mode 120000 index 0000000000..f731382977 --- /dev/null +++ b/Lang/ABAP/HTTP @@ -0,0 +1 @@ +../../Task/HTTP/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Integer-comparison b/Lang/ABAP/Integer-comparison new file mode 120000 index 0000000000..dd8cda68d7 --- /dev/null +++ b/Lang/ABAP/Integer-comparison @@ -0,0 +1 @@ +../../Task/Integer-comparison/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Mutual-recursion b/Lang/ABAP/Mutual-recursion new file mode 120000 index 0000000000..62f15c3f35 --- /dev/null +++ b/Lang/ABAP/Mutual-recursion @@ -0,0 +1 @@ +../../Task/Mutual-recursion/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Power-set b/Lang/ABAP/Power-set new file mode 120000 index 0000000000..73dafd0dca --- /dev/null +++ b/Lang/ABAP/Power-set @@ -0,0 +1 @@ +../../Task/Power-set/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Repeat-a-string b/Lang/ABAP/Repeat-a-string new file mode 120000 index 0000000000..c6e067f0e3 --- /dev/null +++ b/Lang/ABAP/Repeat-a-string @@ -0,0 +1 @@ +../../Task/Repeat-a-string/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Sorting-algorithms-Quicksort b/Lang/ABAP/Sorting-algorithms-Quicksort new file mode 120000 index 0000000000..f564bb3a4e --- /dev/null +++ b/Lang/ABAP/Sorting-algorithms-Quicksort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Quicksort/ABAP \ No newline at end of file diff --git a/Lang/ABAP/Stack b/Lang/ABAP/Stack new file mode 120000 index 0000000000..2e399e8665 --- /dev/null +++ b/Lang/ABAP/Stack @@ -0,0 +1 @@ +../../Task/Stack/ABAP \ No newline at end of file diff --git a/Lang/ACL2/00DESCRIPTION b/Lang/ACL2/00DESCRIPTION index 8e8ab10d72..5a979e168b 100644 --- a/Lang/ACL2/00DESCRIPTION +++ b/Lang/ACL2/00DESCRIPTION @@ -8,4 +8,6 @@ |LCT=yes}} {{language programming paradigm|Functional}} {{implementation|Lisp}} -ACL2 is both a programming language in which you can model computer systems and a tool to help you prove properties of those models. \ No newline at end of file +[http://www.cs.utexas.edu/users/moore/acl2/ From the University of Texas at Austin, late 2018:] + +ACL2 is a logic and programming language in which you can model computer systems, together with a tool to help you prove properties of those models. "ACL2" denotes "'''A''' '''C'''omputational '''L'''ogic for '''A'''pplicative '''C'''ommon '''L'''isp". \ No newline at end of file diff --git a/Lang/ALGOL-68/Sort-using-a-custom-comparator b/Lang/ALGOL-68/Sort-using-a-custom-comparator new file mode 120000 index 0000000000..d13e08efac --- /dev/null +++ b/Lang/ALGOL-68/Sort-using-a-custom-comparator @@ -0,0 +1 @@ +../../Task/Sort-using-a-custom-comparator/ALGOL-68 \ No newline at end of file diff --git a/Lang/ALGOL-68/Start-from-a-main-routine b/Lang/ALGOL-68/Start-from-a-main-routine new file mode 120000 index 0000000000..a99355eec3 --- /dev/null +++ b/Lang/ALGOL-68/Start-from-a-main-routine @@ -0,0 +1 @@ +../../Task/Start-from-a-main-routine/ALGOL-68 \ No newline at end of file diff --git a/Lang/ALGOL-M/99-Bottles-of-Beer b/Lang/ALGOL-M/99-Bottles-of-Beer new file mode 120000 index 0000000000..26a28f619f --- /dev/null +++ b/Lang/ALGOL-M/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/ALGOL-M \ No newline at end of file diff --git a/Lang/ALGOL-M/Day-of-the-week b/Lang/ALGOL-M/Day-of-the-week new file mode 120000 index 0000000000..eb5a4b64d6 --- /dev/null +++ b/Lang/ALGOL-M/Day-of-the-week @@ -0,0 +1 @@ +../../Task/Day-of-the-week/ALGOL-M \ No newline at end of file diff --git a/Lang/ALGOL-M/Factors-of-an-integer b/Lang/ALGOL-M/Factors-of-an-integer new file mode 120000 index 0000000000..ced2101db4 --- /dev/null +++ b/Lang/ALGOL-M/Factors-of-an-integer @@ -0,0 +1 @@ +../../Task/Factors-of-an-integer/ALGOL-M \ No newline at end of file diff --git a/Lang/ALGOL-M/Sieve-of-Eratosthenes b/Lang/ALGOL-M/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..75f17414ae --- /dev/null +++ b/Lang/ALGOL-M/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/ALGOL-M \ No newline at end of file diff --git a/Lang/ALGOL-W/Arithmetic-Complex b/Lang/ALGOL-W/Arithmetic-Complex new file mode 120000 index 0000000000..a6b31394b3 --- /dev/null +++ b/Lang/ALGOL-W/Arithmetic-Complex @@ -0,0 +1 @@ +../../Task/Arithmetic-Complex/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Calendar b/Lang/ALGOL-W/Calendar new file mode 120000 index 0000000000..8b7c5e7890 --- /dev/null +++ b/Lang/ALGOL-W/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Forward-difference b/Lang/ALGOL-W/Forward-difference new file mode 120000 index 0000000000..aa91f293bc --- /dev/null +++ b/Lang/ALGOL-W/Forward-difference @@ -0,0 +1 @@ +../../Task/Forward-difference/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Generate-lower-case-ASCII-alphabet b/Lang/ALGOL-W/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..0bb09f4d74 --- /dev/null +++ b/Lang/ALGOL-W/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Hailstone-sequence b/Lang/ALGOL-W/Hailstone-sequence new file mode 120000 index 0000000000..1fe8ff75cd --- /dev/null +++ b/Lang/ALGOL-W/Hailstone-sequence @@ -0,0 +1 @@ +../../Task/Hailstone-sequence/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Happy-numbers b/Lang/ALGOL-W/Happy-numbers new file mode 120000 index 0000000000..999c5ca8d6 --- /dev/null +++ b/Lang/ALGOL-W/Happy-numbers @@ -0,0 +1 @@ +../../Task/Happy-numbers/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/History-variables b/Lang/ALGOL-W/History-variables new file mode 120000 index 0000000000..b91ffa59d2 --- /dev/null +++ b/Lang/ALGOL-W/History-variables @@ -0,0 +1 @@ +../../Task/History-variables/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Long-multiplication b/Lang/ALGOL-W/Long-multiplication new file mode 120000 index 0000000000..4fb006095f --- /dev/null +++ b/Lang/ALGOL-W/Long-multiplication @@ -0,0 +1 @@ +../../Task/Long-multiplication/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Mandelbrot-set b/Lang/ALGOL-W/Mandelbrot-set new file mode 120000 index 0000000000..df59b7f841 --- /dev/null +++ b/Lang/ALGOL-W/Mandelbrot-set @@ -0,0 +1 @@ +../../Task/Mandelbrot-set/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Multiple-distinct-objects b/Lang/ALGOL-W/Multiple-distinct-objects new file mode 120000 index 0000000000..775a03062a --- /dev/null +++ b/Lang/ALGOL-W/Multiple-distinct-objects @@ -0,0 +1 @@ +../../Task/Multiple-distinct-objects/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Nth-root b/Lang/ALGOL-W/Nth-root new file mode 120000 index 0000000000..69f86a2104 --- /dev/null +++ b/Lang/ALGOL-W/Nth-root @@ -0,0 +1 @@ +../../Task/Nth-root/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Perfect-numbers b/Lang/ALGOL-W/Perfect-numbers new file mode 120000 index 0000000000..eb3a3ada3a --- /dev/null +++ b/Lang/ALGOL-W/Perfect-numbers @@ -0,0 +1 @@ +../../Task/Perfect-numbers/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Sequence-of-non-squares b/Lang/ALGOL-W/Sequence-of-non-squares new file mode 120000 index 0000000000..b3d3df2869 --- /dev/null +++ b/Lang/ALGOL-W/Sequence-of-non-squares @@ -0,0 +1 @@ +../../Task/Sequence-of-non-squares/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Sort-an-integer-array b/Lang/ALGOL-W/Sort-an-integer-array new file mode 120000 index 0000000000..0762ebad2a --- /dev/null +++ b/Lang/ALGOL-W/Sort-an-integer-array @@ -0,0 +1 @@ +../../Task/Sort-an-integer-array/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Strip-a-set-of-characters-from-a-string b/Lang/ALGOL-W/Strip-a-set-of-characters-from-a-string new file mode 120000 index 0000000000..615fe63450 --- /dev/null +++ b/Lang/ALGOL-W/Strip-a-set-of-characters-from-a-string @@ -0,0 +1 @@ +../../Task/Strip-a-set-of-characters-from-a-string/ALGOL-W \ No newline at end of file diff --git a/Lang/ALGOL-W/Strip-block-comments b/Lang/ALGOL-W/Strip-block-comments new file mode 120000 index 0000000000..958c66b253 --- /dev/null +++ b/Lang/ALGOL-W/Strip-block-comments @@ -0,0 +1 @@ +../../Task/Strip-block-comments/ALGOL-W \ No newline at end of file diff --git a/Lang/APL/Dynamic-variable-names b/Lang/APL/Dynamic-variable-names new file mode 120000 index 0000000000..c81a111e7c --- /dev/null +++ b/Lang/APL/Dynamic-variable-names @@ -0,0 +1 @@ +../../Task/Dynamic-variable-names/APL \ No newline at end of file diff --git a/Lang/APL/Hofstadter-Q-sequence b/Lang/APL/Hofstadter-Q-sequence new file mode 120000 index 0000000000..87869a715e --- /dev/null +++ b/Lang/APL/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/APL \ No newline at end of file diff --git a/Lang/APL/Ordered-words b/Lang/APL/Ordered-words new file mode 120000 index 0000000000..aa5f3564bb --- /dev/null +++ b/Lang/APL/Ordered-words @@ -0,0 +1 @@ +../../Task/Ordered-words/APL \ No newline at end of file diff --git a/Lang/APL/Palindrome-detection b/Lang/APL/Palindrome-detection new file mode 120000 index 0000000000..0ee1ffb3a2 --- /dev/null +++ b/Lang/APL/Palindrome-detection @@ -0,0 +1 @@ +../../Task/Palindrome-detection/APL \ No newline at end of file diff --git a/Lang/APL/Simple-windowed-application b/Lang/APL/Simple-windowed-application new file mode 120000 index 0000000000..c8ae0ea4f3 --- /dev/null +++ b/Lang/APL/Simple-windowed-application @@ -0,0 +1 @@ +../../Task/Simple-windowed-application/APL \ No newline at end of file diff --git a/Lang/APL/Solve-the-no-connection-puzzle b/Lang/APL/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..86fec7a5b9 --- /dev/null +++ b/Lang/APL/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/APL \ No newline at end of file diff --git a/Lang/ARM-Assembly/100-doors b/Lang/ARM-Assembly/100-doors new file mode 120000 index 0000000000..96efada9f0 --- /dev/null +++ b/Lang/ARM-Assembly/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Almost-prime b/Lang/ARM-Assembly/Almost-prime new file mode 120000 index 0000000000..85b0fecbc2 --- /dev/null +++ b/Lang/ARM-Assembly/Almost-prime @@ -0,0 +1 @@ +../../Task/Almost-prime/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Array-concatenation b/Lang/ARM-Assembly/Array-concatenation new file mode 120000 index 0000000000..537a3180e5 --- /dev/null +++ b/Lang/ARM-Assembly/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Arrays b/Lang/ARM-Assembly/Arrays new file mode 120000 index 0000000000..37f176e8c2 --- /dev/null +++ b/Lang/ARM-Assembly/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Binary-search b/Lang/ARM-Assembly/Binary-search new file mode 120000 index 0000000000..da01a546a2 --- /dev/null +++ b/Lang/ARM-Assembly/Binary-search @@ -0,0 +1 @@ +../../Task/Binary-search/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Boolean-values b/Lang/ARM-Assembly/Boolean-values new file mode 120000 index 0000000000..f82f65eaca --- /dev/null +++ b/Lang/ARM-Assembly/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Caesar-cipher b/Lang/ARM-Assembly/Caesar-cipher new file mode 120000 index 0000000000..1d0b196770 --- /dev/null +++ b/Lang/ARM-Assembly/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Call-a-foreign-language-function b/Lang/ARM-Assembly/Call-a-foreign-language-function new file mode 120000 index 0000000000..718ac2a097 --- /dev/null +++ b/Lang/ARM-Assembly/Call-a-foreign-language-function @@ -0,0 +1 @@ +../../Task/Call-a-foreign-language-function/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Character-codes b/Lang/ARM-Assembly/Character-codes new file mode 120000 index 0000000000..8a4732f392 --- /dev/null +++ b/Lang/ARM-Assembly/Character-codes @@ -0,0 +1 @@ +../../Task/Character-codes/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Check-that-file-exists b/Lang/ARM-Assembly/Check-that-file-exists new file mode 120000 index 0000000000..62f2079f08 --- /dev/null +++ b/Lang/ARM-Assembly/Check-that-file-exists @@ -0,0 +1 @@ +../../Task/Check-that-file-exists/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Command-line-arguments b/Lang/ARM-Assembly/Command-line-arguments new file mode 120000 index 0000000000..b80353ea88 --- /dev/null +++ b/Lang/ARM-Assembly/Command-line-arguments @@ -0,0 +1 @@ +../../Task/Command-line-arguments/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Compound-data-type b/Lang/ARM-Assembly/Compound-data-type new file mode 120000 index 0000000000..1d338a7d55 --- /dev/null +++ b/Lang/ARM-Assembly/Compound-data-type @@ -0,0 +1 @@ +../../Task/Compound-data-type/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Conditional-structures b/Lang/ARM-Assembly/Conditional-structures new file mode 120000 index 0000000000..b22af53010 --- /dev/null +++ b/Lang/ARM-Assembly/Conditional-structures @@ -0,0 +1 @@ +../../Task/Conditional-structures/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Copy-a-string b/Lang/ARM-Assembly/Copy-a-string new file mode 120000 index 0000000000..3619ab2f78 --- /dev/null +++ b/Lang/ARM-Assembly/Copy-a-string @@ -0,0 +1 @@ +../../Task/Copy-a-string/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Count-in-octal b/Lang/ARM-Assembly/Count-in-octal new file mode 120000 index 0000000000..963cf3571e --- /dev/null +++ b/Lang/ARM-Assembly/Count-in-octal @@ -0,0 +1 @@ +../../Task/Count-in-octal/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Create-a-file b/Lang/ARM-Assembly/Create-a-file new file mode 120000 index 0000000000..0563ea9f18 --- /dev/null +++ b/Lang/ARM-Assembly/Create-a-file @@ -0,0 +1 @@ +../../Task/Create-a-file/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/DNS-query b/Lang/ARM-Assembly/DNS-query new file mode 120000 index 0000000000..fb899a8202 --- /dev/null +++ b/Lang/ARM-Assembly/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Determine-if-a-string-is-numeric b/Lang/ARM-Assembly/Determine-if-a-string-is-numeric new file mode 120000 index 0000000000..84ad6c0f9c --- /dev/null +++ b/Lang/ARM-Assembly/Determine-if-a-string-is-numeric @@ -0,0 +1 @@ +../../Task/Determine-if-a-string-is-numeric/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Doubly-linked-list-Definition b/Lang/ARM-Assembly/Doubly-linked-list-Definition new file mode 120000 index 0000000000..c015c5c8e9 --- /dev/null +++ b/Lang/ARM-Assembly/Doubly-linked-list-Definition @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Definition/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Doubly-linked-list-Element-definition b/Lang/ARM-Assembly/Doubly-linked-list-Element-definition new file mode 120000 index 0000000000..c345ea0ee8 --- /dev/null +++ b/Lang/ARM-Assembly/Doubly-linked-list-Element-definition @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Element-definition/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Doubly-linked-list-Traversal b/Lang/ARM-Assembly/Doubly-linked-list-Traversal new file mode 120000 index 0000000000..2c879556e7 --- /dev/null +++ b/Lang/ARM-Assembly/Doubly-linked-list-Traversal @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Traversal/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Empty-string b/Lang/ARM-Assembly/Empty-string new file mode 120000 index 0000000000..905c2520fe --- /dev/null +++ b/Lang/ARM-Assembly/Empty-string @@ -0,0 +1 @@ +../../Task/Empty-string/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Factorial b/Lang/ARM-Assembly/Factorial new file mode 120000 index 0000000000..694c5deb43 --- /dev/null +++ b/Lang/ARM-Assembly/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/File-input-output b/Lang/ARM-Assembly/File-input-output new file mode 120000 index 0000000000..4c8381cec6 --- /dev/null +++ b/Lang/ARM-Assembly/File-input-output @@ -0,0 +1 @@ +../../Task/File-input-output/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Formatted-numeric-output b/Lang/ARM-Assembly/Formatted-numeric-output new file mode 120000 index 0000000000..cb42d84b07 --- /dev/null +++ b/Lang/ARM-Assembly/Formatted-numeric-output @@ -0,0 +1 @@ +../../Task/Formatted-numeric-output/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Greatest-element-of-a-list b/Lang/ARM-Assembly/Greatest-element-of-a-list new file mode 120000 index 0000000000..32ca05ebda --- /dev/null +++ b/Lang/ARM-Assembly/Greatest-element-of-a-list @@ -0,0 +1 @@ +../../Task/Greatest-element-of-a-list/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Here-document b/Lang/ARM-Assembly/Here-document new file mode 120000 index 0000000000..770bff46dd --- /dev/null +++ b/Lang/ARM-Assembly/Here-document @@ -0,0 +1 @@ +../../Task/Here-document/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Include-a-file b/Lang/ARM-Assembly/Include-a-file new file mode 120000 index 0000000000..02ca9da1c6 --- /dev/null +++ b/Lang/ARM-Assembly/Include-a-file @@ -0,0 +1 @@ +../../Task/Include-a-file/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Increment-a-numerical-string b/Lang/ARM-Assembly/Increment-a-numerical-string new file mode 120000 index 0000000000..6305cba762 --- /dev/null +++ b/Lang/ARM-Assembly/Increment-a-numerical-string @@ -0,0 +1 @@ +../../Task/Increment-a-numerical-string/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Jensens-Device b/Lang/ARM-Assembly/Jensens-Device new file mode 120000 index 0000000000..8e41aafac6 --- /dev/null +++ b/Lang/ARM-Assembly/Jensens-Device @@ -0,0 +1 @@ +../../Task/Jensens-Device/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Keyboard-input-Keypress-check b/Lang/ARM-Assembly/Keyboard-input-Keypress-check new file mode 120000 index 0000000000..3c76f03c9a --- /dev/null +++ b/Lang/ARM-Assembly/Keyboard-input-Keypress-check @@ -0,0 +1 @@ +../../Task/Keyboard-input-Keypress-check/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Knuth-shuffle b/Lang/ARM-Assembly/Knuth-shuffle new file mode 120000 index 0000000000..9a5bd1ce33 --- /dev/null +++ b/Lang/ARM-Assembly/Knuth-shuffle @@ -0,0 +1 @@ +../../Task/Knuth-shuffle/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Literals-Integer b/Lang/ARM-Assembly/Literals-Integer new file mode 120000 index 0000000000..f7df9f4b48 --- /dev/null +++ b/Lang/ARM-Assembly/Literals-Integer @@ -0,0 +1 @@ +../../Task/Literals-Integer/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Literals-String b/Lang/ARM-Assembly/Literals-String new file mode 120000 index 0000000000..f239e110a7 --- /dev/null +++ b/Lang/ARM-Assembly/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Logical-operations b/Lang/ARM-Assembly/Logical-operations new file mode 120000 index 0000000000..db339018f7 --- /dev/null +++ b/Lang/ARM-Assembly/Logical-operations @@ -0,0 +1 @@ +../../Task/Logical-operations/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-Break b/Lang/ARM-Assembly/Loops-Break new file mode 120000 index 0000000000..0856ef9faf --- /dev/null +++ b/Lang/ARM-Assembly/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-Do-while b/Lang/ARM-Assembly/Loops-Do-while new file mode 120000 index 0000000000..0fbb2465fd --- /dev/null +++ b/Lang/ARM-Assembly/Loops-Do-while @@ -0,0 +1 @@ +../../Task/Loops-Do-while/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-Downward-for b/Lang/ARM-Assembly/Loops-Downward-for new file mode 120000 index 0000000000..296cbddb12 --- /dev/null +++ b/Lang/ARM-Assembly/Loops-Downward-for @@ -0,0 +1 @@ +../../Task/Loops-Downward-for/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-For-with-a-specified-step b/Lang/ARM-Assembly/Loops-For-with-a-specified-step new file mode 120000 index 0000000000..e0d7284900 --- /dev/null +++ b/Lang/ARM-Assembly/Loops-For-with-a-specified-step @@ -0,0 +1 @@ +../../Task/Loops-For-with-a-specified-step/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-N-plus-one-half b/Lang/ARM-Assembly/Loops-N-plus-one-half new file mode 120000 index 0000000000..e51725818e --- /dev/null +++ b/Lang/ARM-Assembly/Loops-N-plus-one-half @@ -0,0 +1 @@ +../../Task/Loops-N-plus-one-half/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-Nested b/Lang/ARM-Assembly/Loops-Nested new file mode 120000 index 0000000000..fc5f83dadc --- /dev/null +++ b/Lang/ARM-Assembly/Loops-Nested @@ -0,0 +1 @@ +../../Task/Loops-Nested/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Loops-While b/Lang/ARM-Assembly/Loops-While new file mode 120000 index 0000000000..de7175ff6a --- /dev/null +++ b/Lang/ARM-Assembly/Loops-While @@ -0,0 +1 @@ +../../Task/Loops-While/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Lucas-Lehmer-test b/Lang/ARM-Assembly/Lucas-Lehmer-test new file mode 120000 index 0000000000..89acd9f5b9 --- /dev/null +++ b/Lang/ARM-Assembly/Lucas-Lehmer-test @@ -0,0 +1 @@ +../../Task/Lucas-Lehmer-test/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Multiplication-tables b/Lang/ARM-Assembly/Multiplication-tables new file mode 120000 index 0000000000..c1529eb2a2 --- /dev/null +++ b/Lang/ARM-Assembly/Multiplication-tables @@ -0,0 +1 @@ +../../Task/Multiplication-tables/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Nth-root b/Lang/ARM-Assembly/Nth-root new file mode 120000 index 0000000000..5900028fb6 --- /dev/null +++ b/Lang/ARM-Assembly/Nth-root @@ -0,0 +1 @@ +../../Task/Nth-root/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Null-object b/Lang/ARM-Assembly/Null-object new file mode 120000 index 0000000000..fafeaa774a --- /dev/null +++ b/Lang/ARM-Assembly/Null-object @@ -0,0 +1 @@ +../../Task/Null-object/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Order-two-numerical-lists b/Lang/ARM-Assembly/Order-two-numerical-lists new file mode 120000 index 0000000000..bcebe5fbbe --- /dev/null +++ b/Lang/ARM-Assembly/Order-two-numerical-lists @@ -0,0 +1 @@ +../../Task/Order-two-numerical-lists/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Priority-queue b/Lang/ARM-Assembly/Priority-queue new file mode 120000 index 0000000000..e2b2c28918 --- /dev/null +++ b/Lang/ARM-Assembly/Priority-queue @@ -0,0 +1 @@ +../../Task/Priority-queue/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Program-termination b/Lang/ARM-Assembly/Program-termination new file mode 120000 index 0000000000..5b4a0c6fb5 --- /dev/null +++ b/Lang/ARM-Assembly/Program-termination @@ -0,0 +1 @@ +../../Task/Program-termination/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Queue-Definition b/Lang/ARM-Assembly/Queue-Definition new file mode 120000 index 0000000000..e0bb7017c1 --- /dev/null +++ b/Lang/ARM-Assembly/Queue-Definition @@ -0,0 +1 @@ +../../Task/Queue-Definition/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Random-number-generator--device- b/Lang/ARM-Assembly/Random-number-generator--device- new file mode 120000 index 0000000000..c958b1c040 --- /dev/null +++ b/Lang/ARM-Assembly/Random-number-generator--device- @@ -0,0 +1 @@ +../../Task/Random-number-generator--device-/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Read-a-file-line-by-line b/Lang/ARM-Assembly/Read-a-file-line-by-line new file mode 120000 index 0000000000..29755989dc --- /dev/null +++ b/Lang/ARM-Assembly/Read-a-file-line-by-line @@ -0,0 +1 @@ +../../Task/Read-a-file-line-by-line/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Real-constants-and-functions b/Lang/ARM-Assembly/Real-constants-and-functions new file mode 120000 index 0000000000..330a816452 --- /dev/null +++ b/Lang/ARM-Assembly/Real-constants-and-functions @@ -0,0 +1 @@ +../../Task/Real-constants-and-functions/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Singly-linked-list-Element-definition b/Lang/ARM-Assembly/Singly-linked-list-Element-definition new file mode 120000 index 0000000000..e72f238115 --- /dev/null +++ b/Lang/ARM-Assembly/Singly-linked-list-Element-definition @@ -0,0 +1 @@ +../../Task/Singly-linked-list-Element-definition/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Singly-linked-list-Element-insertion b/Lang/ARM-Assembly/Singly-linked-list-Element-insertion new file mode 120000 index 0000000000..2c1613cd3b --- /dev/null +++ b/Lang/ARM-Assembly/Singly-linked-list-Element-insertion @@ -0,0 +1 @@ +../../Task/Singly-linked-list-Element-insertion/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Singly-linked-list-Traversal b/Lang/ARM-Assembly/Singly-linked-list-Traversal new file mode 120000 index 0000000000..a354a0f18b --- /dev/null +++ b/Lang/ARM-Assembly/Singly-linked-list-Traversal @@ -0,0 +1 @@ +../../Task/Singly-linked-list-Traversal/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sleep b/Lang/ARM-Assembly/Sleep new file mode 120000 index 0000000000..dfce145761 --- /dev/null +++ b/Lang/ARM-Assembly/Sleep @@ -0,0 +1 @@ +../../Task/Sleep/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Solve-the-no-connection-puzzle b/Lang/ARM-Assembly/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..ef1788899f --- /dev/null +++ b/Lang/ARM-Assembly/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Bogosort b/Lang/ARM-Assembly/Sorting-algorithms-Bogosort new file mode 120000 index 0000000000..6fa830d0fa --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Bogosort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bogosort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Heapsort b/Lang/ARM-Assembly/Sorting-algorithms-Heapsort new file mode 120000 index 0000000000..218a0dcb43 --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Heapsort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Heapsort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Insertion-sort b/Lang/ARM-Assembly/Sorting-algorithms-Insertion-sort new file mode 120000 index 0000000000..6bb5f30197 --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Insertion-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Insertion-sort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Quicksort b/Lang/ARM-Assembly/Sorting-algorithms-Quicksort new file mode 120000 index 0000000000..e236a7317a --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Quicksort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Quicksort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Selection-sort b/Lang/ARM-Assembly/Sorting-algorithms-Selection-sort new file mode 120000 index 0000000000..4d76a91289 --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Selection-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Selection-sort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Sorting-algorithms-Shell-sort b/Lang/ARM-Assembly/Sorting-algorithms-Shell-sort new file mode 120000 index 0000000000..4df7298385 --- /dev/null +++ b/Lang/ARM-Assembly/Sorting-algorithms-Shell-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Shell-sort/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/String-append b/Lang/ARM-Assembly/String-append new file mode 120000 index 0000000000..25d1335e68 --- /dev/null +++ b/Lang/ARM-Assembly/String-append @@ -0,0 +1 @@ +../../Task/String-append/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/String-concatenation b/Lang/ARM-Assembly/String-concatenation new file mode 120000 index 0000000000..3b15c90e7c --- /dev/null +++ b/Lang/ARM-Assembly/String-concatenation @@ -0,0 +1 @@ +../../Task/String-concatenation/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/String-matching b/Lang/ARM-Assembly/String-matching new file mode 120000 index 0000000000..2b0c4c7672 --- /dev/null +++ b/Lang/ARM-Assembly/String-matching @@ -0,0 +1 @@ +../../Task/String-matching/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Substring b/Lang/ARM-Assembly/Substring new file mode 120000 index 0000000000..1a8a2604b2 --- /dev/null +++ b/Lang/ARM-Assembly/Substring @@ -0,0 +1 @@ +../../Task/Substring/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Terminal-control-Clear-the-screen b/Lang/ARM-Assembly/Terminal-control-Clear-the-screen new file mode 120000 index 0000000000..4bebf0a382 --- /dev/null +++ b/Lang/ARM-Assembly/Terminal-control-Clear-the-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Clear-the-screen/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Terminal-control-Coloured-text b/Lang/ARM-Assembly/Terminal-control-Coloured-text new file mode 120000 index 0000000000..999ad88a58 --- /dev/null +++ b/Lang/ARM-Assembly/Terminal-control-Coloured-text @@ -0,0 +1 @@ +../../Task/Terminal-control-Coloured-text/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Terminal-control-Cursor-movement b/Lang/ARM-Assembly/Terminal-control-Cursor-movement new file mode 120000 index 0000000000..72d097a0e3 --- /dev/null +++ b/Lang/ARM-Assembly/Terminal-control-Cursor-movement @@ -0,0 +1 @@ +../../Task/Terminal-control-Cursor-movement/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Terminal-control-Cursor-positioning b/Lang/ARM-Assembly/Terminal-control-Cursor-positioning new file mode 120000 index 0000000000..14d2d66064 --- /dev/null +++ b/Lang/ARM-Assembly/Terminal-control-Cursor-positioning @@ -0,0 +1 @@ +../../Task/Terminal-control-Cursor-positioning/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Time-a-function b/Lang/ARM-Assembly/Time-a-function new file mode 120000 index 0000000000..08957cce7c --- /dev/null +++ b/Lang/ARM-Assembly/Time-a-function @@ -0,0 +1 @@ +../../Task/Time-a-function/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Tokenize-a-string b/Lang/ARM-Assembly/Tokenize-a-string new file mode 120000 index 0000000000..7046c9dac6 --- /dev/null +++ b/Lang/ARM-Assembly/Tokenize-a-string @@ -0,0 +1 @@ +../../Task/Tokenize-a-string/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Tree-traversal b/Lang/ARM-Assembly/Tree-traversal new file mode 120000 index 0000000000..166ef4191e --- /dev/null +++ b/Lang/ARM-Assembly/Tree-traversal @@ -0,0 +1 @@ +../../Task/Tree-traversal/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Variables b/Lang/ARM-Assembly/Variables new file mode 120000 index 0000000000..8e1cea0f61 --- /dev/null +++ b/Lang/ARM-Assembly/Variables @@ -0,0 +1 @@ +../../Task/Variables/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Window-creation-X11 b/Lang/ARM-Assembly/Window-creation-X11 new file mode 120000 index 0000000000..12d861ddab --- /dev/null +++ b/Lang/ARM-Assembly/Window-creation-X11 @@ -0,0 +1 @@ +../../Task/Window-creation-X11/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/XML-DOM-serialization b/Lang/ARM-Assembly/XML-DOM-serialization new file mode 120000 index 0000000000..bdadbed5e0 --- /dev/null +++ b/Lang/ARM-Assembly/XML-DOM-serialization @@ -0,0 +1 @@ +../../Task/XML-DOM-serialization/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/XML-Input b/Lang/ARM-Assembly/XML-Input new file mode 120000 index 0000000000..d2e7f1f7bc --- /dev/null +++ b/Lang/ARM-Assembly/XML-Input @@ -0,0 +1 @@ +../../Task/XML-Input/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/XML-Output b/Lang/ARM-Assembly/XML-Output new file mode 120000 index 0000000000..979db7837a --- /dev/null +++ b/Lang/ARM-Assembly/XML-Output @@ -0,0 +1 @@ +../../Task/XML-Output/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/XML-XPath b/Lang/ARM-Assembly/XML-XPath new file mode 120000 index 0000000000..c9248c5d28 --- /dev/null +++ b/Lang/ARM-Assembly/XML-XPath @@ -0,0 +1 @@ +../../Task/XML-XPath/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Xiaolin-Wus-line-algorithm b/Lang/ARM-Assembly/Xiaolin-Wus-line-algorithm new file mode 120000 index 0000000000..1b7626691c --- /dev/null +++ b/Lang/ARM-Assembly/Xiaolin-Wus-line-algorithm @@ -0,0 +1 @@ +../../Task/Xiaolin-Wus-line-algorithm/ARM-Assembly \ No newline at end of file diff --git a/Lang/ARM-Assembly/Y-combinator b/Lang/ARM-Assembly/Y-combinator new file mode 120000 index 0000000000..90504fd828 --- /dev/null +++ b/Lang/ARM-Assembly/Y-combinator @@ -0,0 +1 @@ +../../Task/Y-combinator/ARM-Assembly \ No newline at end of file diff --git a/Lang/AWK/Bulls-and-cows b/Lang/AWK/Bulls-and-cows new file mode 120000 index 0000000000..692a8a202e --- /dev/null +++ b/Lang/AWK/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/AWK \ No newline at end of file diff --git a/Lang/AWK/Catalan-numbers-Pascals-triangle b/Lang/AWK/Catalan-numbers-Pascals-triangle new file mode 120000 index 0000000000..1cdf1ac3b1 --- /dev/null +++ b/Lang/AWK/Catalan-numbers-Pascals-triangle @@ -0,0 +1 @@ +../../Task/Catalan-numbers-Pascals-triangle/AWK \ No newline at end of file diff --git a/Lang/AWK/Chinese-remainder-theorem b/Lang/AWK/Chinese-remainder-theorem new file mode 120000 index 0000000000..e02307a478 --- /dev/null +++ b/Lang/AWK/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/AWK \ No newline at end of file diff --git a/Lang/AWK/Draw-a-cuboid b/Lang/AWK/Draw-a-cuboid new file mode 120000 index 0000000000..440ca552f9 --- /dev/null +++ b/Lang/AWK/Draw-a-cuboid @@ -0,0 +1 @@ +../../Task/Draw-a-cuboid/AWK \ No newline at end of file diff --git a/Lang/AWK/Draw-a-sphere b/Lang/AWK/Draw-a-sphere new file mode 120000 index 0000000000..2f385f34ed --- /dev/null +++ b/Lang/AWK/Draw-a-sphere @@ -0,0 +1 @@ +../../Task/Draw-a-sphere/AWK \ No newline at end of file diff --git a/Lang/AWK/Fibonacci-n-step-number-sequences b/Lang/AWK/Fibonacci-n-step-number-sequences new file mode 120000 index 0000000000..d37a937d14 --- /dev/null +++ b/Lang/AWK/Fibonacci-n-step-number-sequences @@ -0,0 +1 @@ +../../Task/Fibonacci-n-step-number-sequences/AWK \ No newline at end of file diff --git a/Lang/AWK/Iterated-digits-squaring b/Lang/AWK/Iterated-digits-squaring new file mode 120000 index 0000000000..850d0f1ee1 --- /dev/null +++ b/Lang/AWK/Iterated-digits-squaring @@ -0,0 +1 @@ +../../Task/Iterated-digits-squaring/AWK \ No newline at end of file diff --git a/Lang/AWK/Matrix-multiplication b/Lang/AWK/Matrix-multiplication new file mode 120000 index 0000000000..bd9bd60c4f --- /dev/null +++ b/Lang/AWK/Matrix-multiplication @@ -0,0 +1 @@ +../../Task/Matrix-multiplication/AWK \ No newline at end of file diff --git a/Lang/AWK/Metronome b/Lang/AWK/Metronome new file mode 120000 index 0000000000..c110ca5ade --- /dev/null +++ b/Lang/AWK/Metronome @@ -0,0 +1 @@ +../../Task/Metronome/AWK \ No newline at end of file diff --git a/Lang/AWK/Multifactorial b/Lang/AWK/Multifactorial new file mode 120000 index 0000000000..f587557ad7 --- /dev/null +++ b/Lang/AWK/Multifactorial @@ -0,0 +1 @@ +../../Task/Multifactorial/AWK \ No newline at end of file diff --git a/Lang/AWK/SHA-256 b/Lang/AWK/SHA-256 new file mode 120000 index 0000000000..6653c80a41 --- /dev/null +++ b/Lang/AWK/SHA-256 @@ -0,0 +1 @@ +../../Task/SHA-256/AWK \ No newline at end of file diff --git a/Lang/AWK/Semiprime b/Lang/AWK/Semiprime new file mode 120000 index 0000000000..06b3945ca3 --- /dev/null +++ b/Lang/AWK/Semiprime @@ -0,0 +1 @@ +../../Task/Semiprime/AWK \ No newline at end of file diff --git a/Lang/AWK/Sort-an-array-of-composite-structures b/Lang/AWK/Sort-an-array-of-composite-structures new file mode 120000 index 0000000000..f570e1e9cf --- /dev/null +++ b/Lang/AWK/Sort-an-array-of-composite-structures @@ -0,0 +1 @@ +../../Task/Sort-an-array-of-composite-structures/AWK \ No newline at end of file diff --git a/Lang/AWK/Truncatable-primes b/Lang/AWK/Truncatable-primes new file mode 120000 index 0000000000..e612355289 --- /dev/null +++ b/Lang/AWK/Truncatable-primes @@ -0,0 +1 @@ +../../Task/Truncatable-primes/AWK \ No newline at end of file diff --git a/Lang/AWK/Write-to-Windows-event-log b/Lang/AWK/Write-to-Windows-event-log new file mode 120000 index 0000000000..e50b964ecc --- /dev/null +++ b/Lang/AWK/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/AWK \ No newline at end of file diff --git a/Lang/AWK/Yin-and-yang b/Lang/AWK/Yin-and-yang new file mode 120000 index 0000000000..35f48100f9 --- /dev/null +++ b/Lang/AWK/Yin-and-yang @@ -0,0 +1 @@ +../../Task/Yin-and-yang/AWK \ No newline at end of file diff --git a/Lang/Ada/Abundant,-deficient-and-perfect-number-classifications b/Lang/Ada/Abundant,-deficient-and-perfect-number-classifications new file mode 120000 index 0000000000..8b9dbace9e --- /dev/null +++ b/Lang/Ada/Abundant,-deficient-and-perfect-number-classifications @@ -0,0 +1 @@ +../../Task/Abundant,-deficient-and-perfect-number-classifications/Ada \ No newline at end of file diff --git a/Lang/Ada/Bernoulli-numbers b/Lang/Ada/Bernoulli-numbers new file mode 120000 index 0000000000..07337c6c53 --- /dev/null +++ b/Lang/Ada/Bernoulli-numbers @@ -0,0 +1 @@ +../../Task/Bernoulli-numbers/Ada \ No newline at end of file diff --git a/Lang/Ada/Heronian-triangles b/Lang/Ada/Heronian-triangles new file mode 120000 index 0000000000..b97ea2e189 --- /dev/null +++ b/Lang/Ada/Heronian-triangles @@ -0,0 +1 @@ +../../Task/Heronian-triangles/Ada \ No newline at end of file diff --git a/Lang/Ada/Metronome b/Lang/Ada/Metronome new file mode 120000 index 0000000000..d21b8c1d99 --- /dev/null +++ b/Lang/Ada/Metronome @@ -0,0 +1 @@ +../../Task/Metronome/Ada \ No newline at end of file diff --git a/Lang/Ada/RSA-code b/Lang/Ada/RSA-code new file mode 120000 index 0000000000..2efc210440 --- /dev/null +++ b/Lang/Ada/RSA-code @@ -0,0 +1 @@ +../../Task/RSA-code/Ada \ No newline at end of file diff --git a/Lang/Agda/Even-or-odd b/Lang/Agda/Even-or-odd new file mode 120000 index 0000000000..de6a8f2398 --- /dev/null +++ b/Lang/Agda/Even-or-odd @@ -0,0 +1 @@ +../../Task/Even-or-odd/Agda \ No newline at end of file diff --git a/Lang/Agda/Factorial b/Lang/Agda/Factorial new file mode 120000 index 0000000000..a5162a9b80 --- /dev/null +++ b/Lang/Agda/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Agda \ No newline at end of file diff --git a/Lang/Agda/Function-composition b/Lang/Agda/Function-composition new file mode 120000 index 0000000000..768b4e5d9b --- /dev/null +++ b/Lang/Agda/Function-composition @@ -0,0 +1 @@ +../../Task/Function-composition/Agda \ No newline at end of file diff --git a/Lang/Agda/Sieve-of-Eratosthenes b/Lang/Agda/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..c90c9336ff --- /dev/null +++ b/Lang/Agda/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Agda \ No newline at end of file diff --git a/Lang/Aime/Accumulator-factory b/Lang/Aime/Accumulator-factory new file mode 120000 index 0000000000..11d6328a26 --- /dev/null +++ b/Lang/Aime/Accumulator-factory @@ -0,0 +1 @@ +../../Task/Accumulator-factory/Aime \ No newline at end of file diff --git a/Lang/Aime/Bitmap-Write-a-PPM-file b/Lang/Aime/Bitmap-Write-a-PPM-file new file mode 120000 index 0000000000..5cb4732fd2 --- /dev/null +++ b/Lang/Aime/Bitmap-Write-a-PPM-file @@ -0,0 +1 @@ +../../Task/Bitmap-Write-a-PPM-file/Aime \ No newline at end of file diff --git a/Lang/Aime/Catamorphism b/Lang/Aime/Catamorphism new file mode 120000 index 0000000000..9eaf6ee52f --- /dev/null +++ b/Lang/Aime/Catamorphism @@ -0,0 +1 @@ +../../Task/Catamorphism/Aime \ No newline at end of file diff --git a/Lang/Aime/Currying b/Lang/Aime/Currying new file mode 120000 index 0000000000..067416d0cd --- /dev/null +++ b/Lang/Aime/Currying @@ -0,0 +1 @@ +../../Task/Currying/Aime \ No newline at end of file diff --git a/Lang/Aime/Delete-a-file b/Lang/Aime/Delete-a-file new file mode 120000 index 0000000000..2afbe2249d --- /dev/null +++ b/Lang/Aime/Delete-a-file @@ -0,0 +1 @@ +../../Task/Delete-a-file/Aime \ No newline at end of file diff --git a/Lang/Aime/File-size b/Lang/Aime/File-size new file mode 120000 index 0000000000..dea020829f --- /dev/null +++ b/Lang/Aime/File-size @@ -0,0 +1 @@ +../../Task/File-size/Aime \ No newline at end of file diff --git a/Lang/Aime/Formatted-numeric-output b/Lang/Aime/Formatted-numeric-output new file mode 120000 index 0000000000..a2b5f9557e --- /dev/null +++ b/Lang/Aime/Formatted-numeric-output @@ -0,0 +1 @@ +../../Task/Formatted-numeric-output/Aime \ No newline at end of file diff --git a/Lang/Aime/Function-composition b/Lang/Aime/Function-composition new file mode 120000 index 0000000000..a2533e8283 --- /dev/null +++ b/Lang/Aime/Function-composition @@ -0,0 +1 @@ +../../Task/Function-composition/Aime \ No newline at end of file diff --git a/Lang/Aime/Greatest-subsequential-sum b/Lang/Aime/Greatest-subsequential-sum new file mode 120000 index 0000000000..48a1f722a9 --- /dev/null +++ b/Lang/Aime/Greatest-subsequential-sum @@ -0,0 +1 @@ +../../Task/Greatest-subsequential-sum/Aime \ No newline at end of file diff --git a/Lang/Aime/One-of-n-lines-in-a-file b/Lang/Aime/One-of-n-lines-in-a-file new file mode 120000 index 0000000000..f575be1479 --- /dev/null +++ b/Lang/Aime/One-of-n-lines-in-a-file @@ -0,0 +1 @@ +../../Task/One-of-n-lines-in-a-file/Aime \ No newline at end of file diff --git a/Lang/Aime/Permutations b/Lang/Aime/Permutations new file mode 120000 index 0000000000..8249d1b7fe --- /dev/null +++ b/Lang/Aime/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/Aime \ No newline at end of file diff --git a/Lang/Aime/Range-expansion b/Lang/Aime/Range-expansion new file mode 120000 index 0000000000..9997d43776 --- /dev/null +++ b/Lang/Aime/Range-expansion @@ -0,0 +1 @@ +../../Task/Range-expansion/Aime \ No newline at end of file diff --git a/Lang/Aime/Sockets b/Lang/Aime/Sockets new file mode 120000 index 0000000000..acbde5a91a --- /dev/null +++ b/Lang/Aime/Sockets @@ -0,0 +1 @@ +../../Task/Sockets/Aime \ No newline at end of file diff --git a/Lang/Aime/Strip-comments-from-a-string b/Lang/Aime/Strip-comments-from-a-string new file mode 120000 index 0000000000..5a6305d60f --- /dev/null +++ b/Lang/Aime/Strip-comments-from-a-string @@ -0,0 +1 @@ +../../Task/Strip-comments-from-a-string/Aime \ No newline at end of file diff --git a/Lang/Aime/Unix-ls b/Lang/Aime/Unix-ls new file mode 120000 index 0000000000..899b1fdae5 --- /dev/null +++ b/Lang/Aime/Unix-ls @@ -0,0 +1 @@ +../../Task/Unix-ls/Aime \ No newline at end of file diff --git a/Lang/AntLang/00DESCRIPTION b/Lang/AntLang/00DESCRIPTION index 2bc3d5cadf..e69de29bb2 100644 --- a/Lang/AntLang/00DESCRIPTION +++ b/Lang/AntLang/00DESCRIPTION @@ -1,56 +0,0 @@ -{{language|AntLang}} -'''AntLang''' is a functional scripting language named after its creator Anthony Cipriano. Its main distinctive feature is short syntax oriented towards mathematical equations. - -It is a combination of APL and M-Expressions, which main strength is its short and concise syntax. - -The first implementation of AntLang was written in [[Haskell]], another one called OpenCally is a [[C]] framework and can be used as a software library to write AntLang compilers. - -This framework is in use for writing the AntLang-to-[[JavaScript]]-compiler antlang-js and the command run-antlang. - -== Code examples == - -=== Simple math === - 5*1+2 /=> 15 - -AntLang uses right-to-left evaluation, so 1+2 gets executed before 5*3. - -Even though AntLang evaluates right-to-left, it is recommended to read left-to-right in a top-down manner. - -=== Hello World === - echo["helloworld"] - -The echo function is called with the string ''helloworld'', prints it and returns it. - -=== Factorial === - factorial:{1 */ 1+range[x]} - -The times-reduction (*/) with the accumulator value 1 over the list 1+range[x]. - -=== Fibonacci sequence === - fib:{<0;1>{x,<+|-2#x>}/range[x]} - -== Implementations == -=== hsAntLang === -hsAntLang was the first AntLang implementation, which is still used by most of AntLang users. - -It fully implements the language standard plus several extensions, like multithreading, file Input/output and exception handling. - -It is hosted on GitHub. - -=== OpenCally === -OpenCally is an AntLang compiler by AntLang Software. - -It is under active development and doesn't support all the standard functions and syntax yet. - -OpenCally adds interfaces to all its target languages (currently [[JavaScript]]): - / load the standard library - :"?/lib/stdlib.a" - / make a JavaScript function available to AntLang (prefix: v_) - js)v_console_log = console.log; - / call that function from within AntLang - console_log each <"APL"; "Haskell"; "Erlang"> - -To execute the code above on a machine with OpenCally installed, run: - $ run-antlang file.ant - -It is also hosted on GitHub. \ No newline at end of file diff --git a/Lang/AppleScript/Bitwise-operations b/Lang/AppleScript/Bitwise-operations new file mode 120000 index 0000000000..ce038cbc95 --- /dev/null +++ b/Lang/AppleScript/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Boolean-values b/Lang/AppleScript/Boolean-values new file mode 120000 index 0000000000..83d4858e89 --- /dev/null +++ b/Lang/AppleScript/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Combinations-with-repetitions b/Lang/AppleScript/Combinations-with-repetitions new file mode 120000 index 0000000000..80d92afd43 --- /dev/null +++ b/Lang/AppleScript/Combinations-with-repetitions @@ -0,0 +1 @@ +../../Task/Combinations-with-repetitions/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Convert-decimal-number-to-rational b/Lang/AppleScript/Convert-decimal-number-to-rational new file mode 120000 index 0000000000..c18b51db13 --- /dev/null +++ b/Lang/AppleScript/Convert-decimal-number-to-rational @@ -0,0 +1 @@ +../../Task/Convert-decimal-number-to-rational/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Date-format b/Lang/AppleScript/Date-format new file mode 120000 index 0000000000..ccbb876b9f --- /dev/null +++ b/Lang/AppleScript/Date-format @@ -0,0 +1 @@ +../../Task/Date-format/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Digital-root b/Lang/AppleScript/Digital-root new file mode 120000 index 0000000000..fb04c18a18 --- /dev/null +++ b/Lang/AppleScript/Digital-root @@ -0,0 +1 @@ +../../Task/Digital-root/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Fibonacci-n-step-number-sequences b/Lang/AppleScript/Fibonacci-n-step-number-sequences new file mode 120000 index 0000000000..34abc23fec --- /dev/null +++ b/Lang/AppleScript/Fibonacci-n-step-number-sequences @@ -0,0 +1 @@ +../../Task/Fibonacci-n-step-number-sequences/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Find-limit-of-recursion b/Lang/AppleScript/Find-limit-of-recursion new file mode 120000 index 0000000000..1a55d08a5e --- /dev/null +++ b/Lang/AppleScript/Find-limit-of-recursion @@ -0,0 +1 @@ +../../Task/Find-limit-of-recursion/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Generator-Exponential b/Lang/AppleScript/Generator-Exponential new file mode 120000 index 0000000000..b4a60c1064 --- /dev/null +++ b/Lang/AppleScript/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Greatest-subsequential-sum b/Lang/AppleScript/Greatest-subsequential-sum new file mode 120000 index 0000000000..b878b9f34b --- /dev/null +++ b/Lang/AppleScript/Greatest-subsequential-sum @@ -0,0 +1 @@ +../../Task/Greatest-subsequential-sum/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Increment-a-numerical-string b/Lang/AppleScript/Increment-a-numerical-string new file mode 120000 index 0000000000..2c85732a9d --- /dev/null +++ b/Lang/AppleScript/Increment-a-numerical-string @@ -0,0 +1 @@ +../../Task/Increment-a-numerical-string/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Map-range b/Lang/AppleScript/Map-range new file mode 120000 index 0000000000..7f511bac88 --- /dev/null +++ b/Lang/AppleScript/Map-range @@ -0,0 +1 @@ +../../Task/Map-range/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Mouse-position b/Lang/AppleScript/Mouse-position new file mode 120000 index 0000000000..27559da33a --- /dev/null +++ b/Lang/AppleScript/Mouse-position @@ -0,0 +1 @@ +../../Task/Mouse-position/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Pick-random-element b/Lang/AppleScript/Pick-random-element new file mode 120000 index 0000000000..3fda0568bd --- /dev/null +++ b/Lang/AppleScript/Pick-random-element @@ -0,0 +1 @@ +../../Task/Pick-random-element/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Sieve-of-Eratosthenes b/Lang/AppleScript/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..0551978186 --- /dev/null +++ b/Lang/AppleScript/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Stern-Brocot-sequence b/Lang/AppleScript/Stern-Brocot-sequence new file mode 120000 index 0000000000..6cb882aff7 --- /dev/null +++ b/Lang/AppleScript/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/String-matching b/Lang/AppleScript/String-matching new file mode 120000 index 0000000000..0d66d02fc1 --- /dev/null +++ b/Lang/AppleScript/String-matching @@ -0,0 +1 @@ +../../Task/String-matching/AppleScript \ No newline at end of file diff --git a/Lang/AppleScript/Visualize-a-tree b/Lang/AppleScript/Visualize-a-tree new file mode 120000 index 0000000000..6f70eba2ca --- /dev/null +++ b/Lang/AppleScript/Visualize-a-tree @@ -0,0 +1 @@ +../../Task/Visualize-a-tree/AppleScript \ No newline at end of file diff --git a/Lang/Applesoft-BASIC/Address-of-a-variable b/Lang/Applesoft-BASIC/Address-of-a-variable new file mode 120000 index 0000000000..7418bff069 --- /dev/null +++ b/Lang/Applesoft-BASIC/Address-of-a-variable @@ -0,0 +1 @@ +../../Task/Address-of-a-variable/Applesoft-BASIC \ No newline at end of file diff --git a/Lang/Applesoft-BASIC/Brownian-tree b/Lang/Applesoft-BASIC/Brownian-tree new file mode 120000 index 0000000000..ba977c6752 --- /dev/null +++ b/Lang/Applesoft-BASIC/Brownian-tree @@ -0,0 +1 @@ +../../Task/Brownian-tree/Applesoft-BASIC \ No newline at end of file diff --git a/Lang/Arc/Caesar-cipher b/Lang/Arc/Caesar-cipher new file mode 120000 index 0000000000..5035699397 --- /dev/null +++ b/Lang/Arc/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/Arc \ No newline at end of file diff --git a/Lang/Arc/Day-of-the-week b/Lang/Arc/Day-of-the-week new file mode 120000 index 0000000000..32cf2f2e8b --- /dev/null +++ b/Lang/Arc/Day-of-the-week @@ -0,0 +1 @@ +../../Task/Day-of-the-week/Arc \ No newline at end of file diff --git a/Lang/Arc/Factors-of-an-integer b/Lang/Arc/Factors-of-an-integer new file mode 120000 index 0000000000..4982742a5d --- /dev/null +++ b/Lang/Arc/Factors-of-an-integer @@ -0,0 +1 @@ +../../Task/Factors-of-an-integer/Arc \ No newline at end of file diff --git a/Lang/Arc/Hello-world-Text b/Lang/Arc/Hello-world-Text new file mode 120000 index 0000000000..ff085b4b3e --- /dev/null +++ b/Lang/Arc/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/Arc \ No newline at end of file diff --git a/Lang/Arc/Leap-year b/Lang/Arc/Leap-year new file mode 120000 index 0000000000..1992fe311c --- /dev/null +++ b/Lang/Arc/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/Arc \ No newline at end of file diff --git a/Lang/AutoHotkey/Nautical-bell b/Lang/AutoHotkey/Nautical-bell new file mode 120000 index 0000000000..a30bace817 --- /dev/null +++ b/Lang/AutoHotkey/Nautical-bell @@ -0,0 +1 @@ +../../Task/Nautical-bell/AutoHotkey \ No newline at end of file diff --git a/Lang/B/100-doors b/Lang/B/100-doors new file mode 120000 index 0000000000..841532e8b4 --- /dev/null +++ b/Lang/B/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/B \ No newline at end of file diff --git a/Lang/B/Hello-world-Newline-omission b/Lang/B/Hello-world-Newline-omission new file mode 120000 index 0000000000..08065be963 --- /dev/null +++ b/Lang/B/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/B \ No newline at end of file diff --git a/Lang/B/Hello-world-Text b/Lang/B/Hello-world-Text new file mode 120000 index 0000000000..e166e9f723 --- /dev/null +++ b/Lang/B/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/B \ No newline at end of file diff --git a/Lang/B/Mandelbrot-set b/Lang/B/Mandelbrot-set new file mode 120000 index 0000000000..b35568f551 --- /dev/null +++ b/Lang/B/Mandelbrot-set @@ -0,0 +1 @@ +../../Task/Mandelbrot-set/B \ No newline at end of file diff --git a/Lang/B/Primality-by-trial-division b/Lang/B/Primality-by-trial-division new file mode 120000 index 0000000000..408ffa78f2 --- /dev/null +++ b/Lang/B/Primality-by-trial-division @@ -0,0 +1 @@ +../../Task/Primality-by-trial-division/B \ No newline at end of file diff --git a/Lang/BASIC/Four-bit-adder b/Lang/BASIC/Four-bit-adder new file mode 120000 index 0000000000..9c65a16d87 --- /dev/null +++ b/Lang/BASIC/Four-bit-adder @@ -0,0 +1 @@ +../../Task/Four-bit-adder/BASIC \ No newline at end of file diff --git a/Lang/BASIC/Yin-and-yang b/Lang/BASIC/Yin-and-yang new file mode 120000 index 0000000000..08d88f3b72 --- /dev/null +++ b/Lang/BASIC/Yin-and-yang @@ -0,0 +1 @@ +../../Task/Yin-and-yang/BASIC \ No newline at end of file diff --git a/Lang/BASIC256/Caesar-cipher b/Lang/BASIC256/Caesar-cipher new file mode 120000 index 0000000000..f6c64866f5 --- /dev/null +++ b/Lang/BASIC256/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Closest-pair-problem b/Lang/BASIC256/Closest-pair-problem new file mode 120000 index 0000000000..d8e2801388 --- /dev/null +++ b/Lang/BASIC256/Closest-pair-problem @@ -0,0 +1 @@ +../../Task/Closest-pair-problem/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Execute-HQ9+ b/Lang/BASIC256/Execute-HQ9+ new file mode 120000 index 0000000000..25a0bb7105 --- /dev/null +++ b/Lang/BASIC256/Execute-HQ9+ @@ -0,0 +1 @@ +../../Task/Execute-HQ9+/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Hofstadter-Q-sequence b/Lang/BASIC256/Hofstadter-Q-sequence new file mode 120000 index 0000000000..e801098908 --- /dev/null +++ b/Lang/BASIC256/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Mad-Libs b/Lang/BASIC256/Mad-Libs new file mode 120000 index 0000000000..37d537f0b4 --- /dev/null +++ b/Lang/BASIC256/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Number-reversal-game b/Lang/BASIC256/Number-reversal-game new file mode 120000 index 0000000000..bad6db51d4 --- /dev/null +++ b/Lang/BASIC256/Number-reversal-game @@ -0,0 +1 @@ +../../Task/Number-reversal-game/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Pig-the-dice-game b/Lang/BASIC256/Pig-the-dice-game new file mode 120000 index 0000000000..e1c2c2a916 --- /dev/null +++ b/Lang/BASIC256/Pig-the-dice-game @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Rot-13 b/Lang/BASIC256/Rot-13 new file mode 120000 index 0000000000..61795f066d --- /dev/null +++ b/Lang/BASIC256/Rot-13 @@ -0,0 +1 @@ +../../Task/Rot-13/BASIC256 \ No newline at end of file diff --git a/Lang/BASIC256/Run-length-encoding b/Lang/BASIC256/Run-length-encoding new file mode 120000 index 0000000000..b5e5fe36a5 --- /dev/null +++ b/Lang/BASIC256/Run-length-encoding @@ -0,0 +1 @@ +../../Task/Run-length-encoding/BASIC256 \ No newline at end of file diff --git a/Lang/BaCon/00DESCRIPTION b/Lang/BaCon/00DESCRIPTION index 4dfa92e58e..e87f72ee0a 100644 --- a/Lang/BaCon/00DESCRIPTION +++ b/Lang/BaCon/00DESCRIPTION @@ -16,11 +16,11 @@ BaCon is a free BASIC to C translator for Unix-based systems, which runs on most Unix/Linux/BSD platforms, including MacOSX. It intends to be a programming aid in creating tools which can be compiled on different platforms (including 64bit environments), while trying to revive the days of the good old BASIC. -BaCon can be described as a translator, a converter, a source-to-source compiler, a transcompiler or a transpiler. It also can be described as a very elaborate preprocessor to C. BaCon is implemented in generic shell script and in itself. Therefore, to start using Bacon, the target system must have either Korn Shell, or ZShell, or Bourne Again Shell (BASH) available. If none of these shells are available, then the free Public Domain Korn Shell can be installed, which can execute BaCon also. Furthermore, BaCon also works with a newer Kornshell implementation like the MirBSD Korn Shell. +BaCon can be described as a translator, a converter, a source-to-source compiler, a transcompiler or a transpiler. It also can be described as a very elaborate preprocessor to C. BaCon is implemented in generic shell script and in itself. Therefore, to start using Bacon, the target system must have either Korn Shell, or ZShell, or Bourne Again Shell (BASH) available. Furthermore, BaCon also works with a newer Kornshell implementation like the MirBSD Korn Shell. The shell script implementation can convert and compile the BaCon version of BaCon. This will deliver the binary version of BaCon which has an extremely high conversion performance. On newer systems, the average conversion rate usually lies above 10.000 lines per second. -Code converted by BaCon can be compiled by GCC, the Compaq C Compiler, TCC, the clang/LLVM compiler and possibly also by other C compilers. +Code converted by BaCon can be compiled by GCC, the Compaq C Compiler, TCC, the clang/LLVM compiler (and possibly by other C compilers), but also by C++ compilers like g++ or clang++. ==See Also== * http://basic-converter.org/ diff --git a/Lang/BaCon/Walk-a-directory-Non-recursively b/Lang/BaCon/Walk-a-directory-Non-recursively new file mode 120000 index 0000000000..b338770790 --- /dev/null +++ b/Lang/BaCon/Walk-a-directory-Non-recursively @@ -0,0 +1 @@ +../../Task/Walk-a-directory-Non-recursively/BaCon \ No newline at end of file diff --git a/Lang/BaCon/Walk-a-directory-Recursively b/Lang/BaCon/Walk-a-directory-Recursively new file mode 120000 index 0000000000..1aa9081449 --- /dev/null +++ b/Lang/BaCon/Walk-a-directory-Recursively @@ -0,0 +1 @@ +../../Task/Walk-a-directory-Recursively/BaCon \ No newline at end of file diff --git a/Lang/Batch-File/Boolean-values b/Lang/Batch-File/Boolean-values new file mode 120000 index 0000000000..9e0affbaa2 --- /dev/null +++ b/Lang/Batch-File/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/Batch-File \ No newline at end of file diff --git a/Lang/Batch-File/Evaluate-binomial-coefficients b/Lang/Batch-File/Evaluate-binomial-coefficients new file mode 120000 index 0000000000..e591ca5776 --- /dev/null +++ b/Lang/Batch-File/Evaluate-binomial-coefficients @@ -0,0 +1 @@ +../../Task/Evaluate-binomial-coefficients/Batch-File \ No newline at end of file diff --git a/Lang/Batch-File/Fork b/Lang/Batch-File/Fork new file mode 120000 index 0000000000..ee2602e3b4 --- /dev/null +++ b/Lang/Batch-File/Fork @@ -0,0 +1 @@ +../../Task/Fork/Batch-File \ No newline at end of file diff --git a/Lang/Batch-File/One-of-n-lines-in-a-file b/Lang/Batch-File/One-of-n-lines-in-a-file new file mode 120000 index 0000000000..46a3a5fea0 --- /dev/null +++ b/Lang/Batch-File/One-of-n-lines-in-a-file @@ -0,0 +1 @@ +../../Task/One-of-n-lines-in-a-file/Batch-File \ No newline at end of file diff --git a/Lang/Bc/Hello-world-Newline-omission b/Lang/Bc/Hello-world-Newline-omission new file mode 120000 index 0000000000..8a6723906c --- /dev/null +++ b/Lang/Bc/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/Bc \ No newline at end of file diff --git a/Lang/Befunge/Loops-Break b/Lang/Befunge/Loops-Break new file mode 120000 index 0000000000..d50b952834 --- /dev/null +++ b/Lang/Befunge/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/Befunge \ No newline at end of file diff --git a/Lang/Befunge/Loops-Continue b/Lang/Befunge/Loops-Continue new file mode 120000 index 0000000000..de73723271 --- /dev/null +++ b/Lang/Befunge/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/Befunge \ No newline at end of file diff --git a/Lang/Bracmat/Bernoulli-numbers b/Lang/Bracmat/Bernoulli-numbers new file mode 120000 index 0000000000..7dc8e94cc1 --- /dev/null +++ b/Lang/Bracmat/Bernoulli-numbers @@ -0,0 +1 @@ +../../Task/Bernoulli-numbers/Bracmat \ No newline at end of file diff --git a/Lang/Bracmat/Parsing-RPN-calculator-algorithm b/Lang/Bracmat/Parsing-RPN-calculator-algorithm new file mode 120000 index 0000000000..b013f4672f --- /dev/null +++ b/Lang/Bracmat/Parsing-RPN-calculator-algorithm @@ -0,0 +1 @@ +../../Task/Parsing-RPN-calculator-algorithm/Bracmat \ No newline at end of file diff --git a/Lang/Brainf---/Caesar-cipher b/Lang/Brainf---/Caesar-cipher new file mode 120000 index 0000000000..1da4ee1e43 --- /dev/null +++ b/Lang/Brainf---/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/Brainf--- \ No newline at end of file diff --git a/Lang/Brainf---/Execute-Brain---- b/Lang/Brainf---/Execute-Brain---- new file mode 120000 index 0000000000..bf266ba216 --- /dev/null +++ b/Lang/Brainf---/Execute-Brain---- @@ -0,0 +1 @@ +../../Task/Execute-Brain----/Brainf--- \ No newline at end of file diff --git a/Lang/Burlesque/Factors-of-an-integer b/Lang/Burlesque/Factors-of-an-integer new file mode 120000 index 0000000000..3a3daba578 --- /dev/null +++ b/Lang/Burlesque/Factors-of-an-integer @@ -0,0 +1 @@ +../../Task/Factors-of-an-integer/Burlesque \ No newline at end of file diff --git a/Lang/Burlesque/Generate-lower-case-ASCII-alphabet b/Lang/Burlesque/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..fb0f8a06dc --- /dev/null +++ b/Lang/Burlesque/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/Burlesque \ No newline at end of file diff --git a/Lang/Burlesque/Matrix-exponentiation-operator b/Lang/Burlesque/Matrix-exponentiation-operator new file mode 120000 index 0000000000..5dbb99c66e --- /dev/null +++ b/Lang/Burlesque/Matrix-exponentiation-operator @@ -0,0 +1 @@ +../../Task/Matrix-exponentiation-operator/Burlesque \ No newline at end of file diff --git a/Lang/C++/AKS-test-for-primes b/Lang/C++/AKS-test-for-primes new file mode 120000 index 0000000000..fb2b1526c7 --- /dev/null +++ b/Lang/C++/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/C++ \ No newline at end of file diff --git a/Lang/C++/Append-a-record-to-the-end-of-a-text-file b/Lang/C++/Append-a-record-to-the-end-of-a-text-file new file mode 120000 index 0000000000..dbbf13e9fb --- /dev/null +++ b/Lang/C++/Append-a-record-to-the-end-of-a-text-file @@ -0,0 +1 @@ +../../Task/Append-a-record-to-the-end-of-a-text-file/C++ \ No newline at end of file diff --git a/Lang/C++/Averages-Mean-angle b/Lang/C++/Averages-Mean-angle new file mode 120000 index 0000000000..007b504f20 --- /dev/null +++ b/Lang/C++/Averages-Mean-angle @@ -0,0 +1 @@ +../../Task/Averages-Mean-angle/C++ \ No newline at end of file diff --git a/Lang/C++/Chinese-remainder-theorem b/Lang/C++/Chinese-remainder-theorem new file mode 120000 index 0000000000..4420853344 --- /dev/null +++ b/Lang/C++/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/C++ \ No newline at end of file diff --git a/Lang/C++/Create-a-file-on-magnetic-tape b/Lang/C++/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..2192903455 --- /dev/null +++ b/Lang/C++/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/C++ \ No newline at end of file diff --git a/Lang/C++/Handle-a-signal b/Lang/C++/Handle-a-signal new file mode 120000 index 0000000000..f768c12283 --- /dev/null +++ b/Lang/C++/Handle-a-signal @@ -0,0 +1 @@ +../../Task/Handle-a-signal/C++ \ No newline at end of file diff --git a/Lang/C++/Multiplicative-order b/Lang/C++/Multiplicative-order new file mode 120000 index 0000000000..b9c2613563 --- /dev/null +++ b/Lang/C++/Multiplicative-order @@ -0,0 +1 @@ +../../Task/Multiplicative-order/C++ \ No newline at end of file diff --git a/Lang/C++/Old-lady-swallowed-a-fly b/Lang/C++/Old-lady-swallowed-a-fly new file mode 120000 index 0000000000..9ef68ef9f0 --- /dev/null +++ b/Lang/C++/Old-lady-swallowed-a-fly @@ -0,0 +1 @@ +../../Task/Old-lady-swallowed-a-fly/C++ \ No newline at end of file diff --git a/Lang/C++/Parsing-Shunting-yard-algorithm b/Lang/C++/Parsing-Shunting-yard-algorithm new file mode 120000 index 0000000000..ceb0888efc --- /dev/null +++ b/Lang/C++/Parsing-Shunting-yard-algorithm @@ -0,0 +1 @@ +../../Task/Parsing-Shunting-yard-algorithm/C++ \ No newline at end of file diff --git a/Lang/C++/Polynomial-regression b/Lang/C++/Polynomial-regression new file mode 120000 index 0000000000..3e3254507d --- /dev/null +++ b/Lang/C++/Polynomial-regression @@ -0,0 +1 @@ +../../Task/Polynomial-regression/C++ \ No newline at end of file diff --git a/Lang/C++/Ranking-methods b/Lang/C++/Ranking-methods new file mode 120000 index 0000000000..24810a58c9 --- /dev/null +++ b/Lang/C++/Ranking-methods @@ -0,0 +1 @@ +../../Task/Ranking-methods/C++ \ No newline at end of file diff --git a/Lang/C++/Resistor-mesh b/Lang/C++/Resistor-mesh new file mode 120000 index 0000000000..e49f938e56 --- /dev/null +++ b/Lang/C++/Resistor-mesh @@ -0,0 +1 @@ +../../Task/Resistor-mesh/C++ \ No newline at end of file diff --git a/Lang/C++/Safe-addition b/Lang/C++/Safe-addition new file mode 120000 index 0000000000..ca7d9b3dbc --- /dev/null +++ b/Lang/C++/Safe-addition @@ -0,0 +1 @@ +../../Task/Safe-addition/C++ \ No newline at end of file diff --git a/Lang/C++/Set-of-real-numbers b/Lang/C++/Set-of-real-numbers new file mode 120000 index 0000000000..68b2e1e52e --- /dev/null +++ b/Lang/C++/Set-of-real-numbers @@ -0,0 +1 @@ +../../Task/Set-of-real-numbers/C++ \ No newline at end of file diff --git a/Lang/C++/Sutherland-Hodgman-polygon-clipping b/Lang/C++/Sutherland-Hodgman-polygon-clipping new file mode 120000 index 0000000000..88d3ac5384 --- /dev/null +++ b/Lang/C++/Sutherland-Hodgman-polygon-clipping @@ -0,0 +1 @@ +../../Task/Sutherland-Hodgman-polygon-clipping/C++ \ No newline at end of file diff --git a/Lang/C++/The-ISAAC-Cipher b/Lang/C++/The-ISAAC-Cipher new file mode 120000 index 0000000000..18be56236d --- /dev/null +++ b/Lang/C++/The-ISAAC-Cipher @@ -0,0 +1 @@ +../../Task/The-ISAAC-Cipher/C++ \ No newline at end of file diff --git a/Lang/C++/Write-to-Windows-event-log b/Lang/C++/Write-to-Windows-event-log new file mode 120000 index 0000000000..e14450bf5b --- /dev/null +++ b/Lang/C++/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/C++ \ No newline at end of file diff --git a/Lang/C-sharp/Compile-time-calculation b/Lang/C-sharp/Compile-time-calculation new file mode 120000 index 0000000000..97bea861b4 --- /dev/null +++ b/Lang/C-sharp/Compile-time-calculation @@ -0,0 +1 @@ +../../Task/Compile-time-calculation/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Discordian-date b/Lang/C-sharp/Discordian-date new file mode 120000 index 0000000000..dada184690 --- /dev/null +++ b/Lang/C-sharp/Discordian-date @@ -0,0 +1 @@ +../../Task/Discordian-date/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Flow-control-structures b/Lang/C-sharp/Flow-control-structures new file mode 120000 index 0000000000..f1605b9d21 --- /dev/null +++ b/Lang/C-sharp/Flow-control-structures @@ -0,0 +1 @@ +../../Task/Flow-control-structures/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/GUI-Maximum-window-dimensions b/Lang/C-sharp/GUI-Maximum-window-dimensions new file mode 120000 index 0000000000..7c3ddc2eb3 --- /dev/null +++ b/Lang/C-sharp/GUI-Maximum-window-dimensions @@ -0,0 +1 @@ +../../Task/GUI-Maximum-window-dimensions/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/GUI-enabling-disabling-of-controls b/Lang/C-sharp/GUI-enabling-disabling-of-controls new file mode 120000 index 0000000000..9161264390 --- /dev/null +++ b/Lang/C-sharp/GUI-enabling-disabling-of-controls @@ -0,0 +1 @@ +../../Task/GUI-enabling-disabling-of-controls/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Matrix-exponentiation-operator b/Lang/C-sharp/Matrix-exponentiation-operator new file mode 120000 index 0000000000..144e703683 --- /dev/null +++ b/Lang/C-sharp/Matrix-exponentiation-operator @@ -0,0 +1 @@ +../../Task/Matrix-exponentiation-operator/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Modular-exponentiation b/Lang/C-sharp/Modular-exponentiation new file mode 120000 index 0000000000..205b0000fb --- /dev/null +++ b/Lang/C-sharp/Modular-exponentiation @@ -0,0 +1 @@ +../../Task/Modular-exponentiation/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Non-continuous-subsequences b/Lang/C-sharp/Non-continuous-subsequences new file mode 120000 index 0000000000..a2567c1ca2 --- /dev/null +++ b/Lang/C-sharp/Non-continuous-subsequences @@ -0,0 +1 @@ +../../Task/Non-continuous-subsequences/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Ordered-Partitions b/Lang/C-sharp/Ordered-Partitions new file mode 120000 index 0000000000..0170dfe065 --- /dev/null +++ b/Lang/C-sharp/Ordered-Partitions @@ -0,0 +1 @@ +../../Task/Ordered-Partitions/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Penneys-game b/Lang/C-sharp/Penneys-game new file mode 120000 index 0000000000..9c56c2b921 --- /dev/null +++ b/Lang/C-sharp/Penneys-game @@ -0,0 +1 @@ +../../Task/Penneys-game/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Reverse-a-string b/Lang/C-sharp/Reverse-a-string new file mode 120000 index 0000000000..8a88a5e903 --- /dev/null +++ b/Lang/C-sharp/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Solve-a-Hidato-puzzle b/Lang/C-sharp/Solve-a-Hidato-puzzle new file mode 120000 index 0000000000..7a7d602049 --- /dev/null +++ b/Lang/C-sharp/Solve-a-Hidato-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Hidato-puzzle/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Solve-a-Holy-Knights-tour b/Lang/C-sharp/Solve-a-Holy-Knights-tour new file mode 120000 index 0000000000..fc6f532ef3 --- /dev/null +++ b/Lang/C-sharp/Solve-a-Holy-Knights-tour @@ -0,0 +1 @@ +../../Task/Solve-a-Holy-Knights-tour/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Solve-a-Hopido-puzzle b/Lang/C-sharp/Solve-a-Hopido-puzzle new file mode 120000 index 0000000000..56c702bc09 --- /dev/null +++ b/Lang/C-sharp/Solve-a-Hopido-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Hopido-puzzle/C-sharp \ No newline at end of file diff --git a/Lang/C-sharp/Solve-a-Numbrix-puzzle b/Lang/C-sharp/Solve-a-Numbrix-puzzle new file mode 120000 index 0000000000..4d148170c0 --- /dev/null +++ b/Lang/C-sharp/Solve-a-Numbrix-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Numbrix-puzzle/C-sharp \ No newline at end of file diff --git a/Lang/C/Calendar---for-REAL-programmers b/Lang/C/Calendar---for-REAL-programmers new file mode 120000 index 0000000000..016041b575 --- /dev/null +++ b/Lang/C/Calendar---for-REAL-programmers @@ -0,0 +1 @@ +../../Task/Calendar---for-REAL-programmers/C \ No newline at end of file diff --git a/Lang/C/Set-of-real-numbers b/Lang/C/Set-of-real-numbers new file mode 120000 index 0000000000..b55b3c59f4 --- /dev/null +++ b/Lang/C/Set-of-real-numbers @@ -0,0 +1 @@ +../../Task/Set-of-real-numbers/C \ No newline at end of file diff --git a/Lang/C/Window-management b/Lang/C/Window-management new file mode 120000 index 0000000000..786ca54963 --- /dev/null +++ b/Lang/C/Window-management @@ -0,0 +1 @@ +../../Task/Window-management/C \ No newline at end of file diff --git a/Lang/COBOL/00DESCRIPTION b/Lang/COBOL/00DESCRIPTION index b556a11377..b08d403c2d 100644 --- a/Lang/COBOL/00DESCRIPTION +++ b/Lang/COBOL/00DESCRIPTION @@ -16,7 +16,7 @@ COBOL, an acronym for 'COmmon Business Oriented Language', is one of the oldest * '''ANS COBOL 1968''' is the first COBOL standard and was published by [[ANSI]]. It was created to improve compatibility between the different versions of the language. * '''COBOL 1974''' added a few more features to the language, including the ability to ACCEPT the date, day and time, and the file organization clause. * '''COBOL 1985''' added many new features to COBOL, notably including: scope terminators (END-IF, END-READ, etc.), the EVALUATE verb, the CONTINUE verb, inline PERFORM statements, the ability to pass arguments by content, and the deprecation of the infamous ALTER verb. This standard was followed by the intrinsic functions amendment and a clarifications amendment in 1989 and 1991, respectively. -* '''COBOL 2002''' is the current version of COBOL and was published by [[ISO]] as ISO/IEC 1989. It included a host of new features, most notably including object-oriented programming. However, there were also other features, including: floating-point support, portable arithmetic results, pointers, calling conventions to other languages, function prototypes, [[XML]] facilities and support for execution within framework environments. This standard has suffered from poor vendor support, due to little commercial demand for the new features.John Billman & Huib Klink, 'Thoughts on the Future of COBOL Standardization', [https://www.cobolstandard.info/j4/files/08-0034.pdf] +* '''COBOL 2002''' was published by [[ISO]] as ISO/IEC 1989. It included a host of new features, most notably including object-oriented programming. However, there were also other features, including: floating-point support, portable arithmetic results, pointers, calling conventions to other languages, function prototypes, [[XML]] facilities and support for execution within framework environments. This standard has suffered from poor vendor support, due to little commercial demand for the new features.John Billman & Huib Klink, 'Thoughts on the Future of COBOL Standardization', [https://www.cobolstandard.info/j4/files/08-0034.pdf] * '''COBOL 2014''' is the latest version of the standard, published on July 8th, 2014 and accepted by [[ISO]] early that summer, and then adopted by [[ANSI]] on Oct 31st, 2014. ISO/IEC 1989:2014 Information technology – Programming languages, their environments and system software interfaces – Programming language COBOL', [https://www.iso.org/iso/home/store/catalogue_tc/catalogue_detail.htm?csnumber=51416] It includes numeric definitions following the [[IEEE]] 754 standard. ===References=== diff --git a/Lang/COBOL/Align-columns b/Lang/COBOL/Align-columns new file mode 120000 index 0000000000..1c31a73a2b --- /dev/null +++ b/Lang/COBOL/Align-columns @@ -0,0 +1 @@ +../../Task/Align-columns/COBOL \ No newline at end of file diff --git a/Lang/COBOL/Compound-data-type b/Lang/COBOL/Compound-data-type new file mode 120000 index 0000000000..78ff009d90 --- /dev/null +++ b/Lang/COBOL/Compound-data-type @@ -0,0 +1 @@ +../../Task/Compound-data-type/COBOL \ No newline at end of file diff --git a/Lang/COBOL/File-size b/Lang/COBOL/File-size new file mode 120000 index 0000000000..4b28c7d558 --- /dev/null +++ b/Lang/COBOL/File-size @@ -0,0 +1 @@ +../../Task/File-size/COBOL \ No newline at end of file diff --git a/Lang/COBOL/Machine-code b/Lang/COBOL/Machine-code new file mode 120000 index 0000000000..6d4950f1dd --- /dev/null +++ b/Lang/COBOL/Machine-code @@ -0,0 +1 @@ +../../Task/Machine-code/COBOL \ No newline at end of file diff --git a/Lang/COBOL/Program-name b/Lang/COBOL/Program-name new file mode 120000 index 0000000000..0fb7739c81 --- /dev/null +++ b/Lang/COBOL/Program-name @@ -0,0 +1 @@ +../../Task/Program-name/COBOL \ No newline at end of file diff --git a/Lang/COBOL/Substring-Top-and-tail b/Lang/COBOL/Substring-Top-and-tail new file mode 120000 index 0000000000..5d2b56e688 --- /dev/null +++ b/Lang/COBOL/Substring-Top-and-tail @@ -0,0 +1 @@ +../../Task/Substring-Top-and-tail/COBOL \ No newline at end of file diff --git a/Lang/Cache-ObjectScript/Guess-the-number-With-feedback b/Lang/Cache-ObjectScript/Guess-the-number-With-feedback new file mode 120000 index 0000000000..7b721bde24 --- /dev/null +++ b/Lang/Cache-ObjectScript/Guess-the-number-With-feedback @@ -0,0 +1 @@ +../../Task/Guess-the-number-With-feedback/Cache-ObjectScript \ No newline at end of file diff --git a/Lang/Cache-ObjectScript/Loops-While b/Lang/Cache-ObjectScript/Loops-While new file mode 120000 index 0000000000..9d0d37ecc5 --- /dev/null +++ b/Lang/Cache-ObjectScript/Loops-While @@ -0,0 +1 @@ +../../Task/Loops-While/Cache-ObjectScript \ No newline at end of file diff --git a/Lang/Cache-ObjectScript/Sleep b/Lang/Cache-ObjectScript/Sleep new file mode 120000 index 0000000000..e06b8b2fe2 --- /dev/null +++ b/Lang/Cache-ObjectScript/Sleep @@ -0,0 +1 @@ +../../Task/Sleep/Cache-ObjectScript \ No newline at end of file diff --git a/Lang/Cache-ObjectScript/Zero-to-the-zero-power b/Lang/Cache-ObjectScript/Zero-to-the-zero-power new file mode 120000 index 0000000000..91721c68e2 --- /dev/null +++ b/Lang/Cache-ObjectScript/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/Cache-ObjectScript \ No newline at end of file diff --git a/Lang/Ceylon/24-game-Solve b/Lang/Ceylon/24-game-Solve new file mode 120000 index 0000000000..4e7b9bf54a --- /dev/null +++ b/Lang/Ceylon/24-game-Solve @@ -0,0 +1 @@ +../../Task/24-game-Solve/Ceylon \ No newline at end of file diff --git a/Lang/Ceylon/Matrix-multiplication b/Lang/Ceylon/Matrix-multiplication new file mode 120000 index 0000000000..409afcd2c3 --- /dev/null +++ b/Lang/Ceylon/Matrix-multiplication @@ -0,0 +1 @@ +../../Task/Matrix-multiplication/Ceylon \ No newline at end of file diff --git a/Lang/Ceylon/Reverse-a-string b/Lang/Ceylon/Reverse-a-string new file mode 120000 index 0000000000..9efc3806fc --- /dev/null +++ b/Lang/Ceylon/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Ceylon \ No newline at end of file diff --git a/Lang/Ceylon/Vector-products b/Lang/Ceylon/Vector-products new file mode 120000 index 0000000000..4120f3e162 --- /dev/null +++ b/Lang/Ceylon/Vector-products @@ -0,0 +1 @@ +../../Task/Vector-products/Ceylon \ No newline at end of file diff --git a/Lang/Ceylon/Vigen-re-cipher b/Lang/Ceylon/Vigen-re-cipher new file mode 120000 index 0000000000..eca2a05bd5 --- /dev/null +++ b/Lang/Ceylon/Vigen-re-cipher @@ -0,0 +1 @@ +../../Task/Vigen-re-cipher/Ceylon \ No newline at end of file diff --git a/Lang/Ceylon/Zig-zag-matrix b/Lang/Ceylon/Zig-zag-matrix new file mode 120000 index 0000000000..0fa1c739b5 --- /dev/null +++ b/Lang/Ceylon/Zig-zag-matrix @@ -0,0 +1 @@ +../../Task/Zig-zag-matrix/Ceylon \ No newline at end of file diff --git a/Lang/Clojure/Infinity b/Lang/Clojure/Infinity new file mode 120000 index 0000000000..0d90aaf419 --- /dev/null +++ b/Lang/Clojure/Infinity @@ -0,0 +1 @@ +../../Task/Infinity/Clojure \ No newline at end of file diff --git a/Lang/Clojure/Permutations-Derangements b/Lang/Clojure/Permutations-Derangements new file mode 120000 index 0000000000..b724aaa4f0 --- /dev/null +++ b/Lang/Clojure/Permutations-Derangements @@ -0,0 +1 @@ +../../Task/Permutations-Derangements/Clojure \ No newline at end of file diff --git a/Lang/Clojure/Stem-and-leaf-plot b/Lang/Clojure/Stem-and-leaf-plot new file mode 120000 index 0000000000..442b3923d6 --- /dev/null +++ b/Lang/Clojure/Stem-and-leaf-plot @@ -0,0 +1 @@ +../../Task/Stem-and-leaf-plot/Clojure \ No newline at end of file diff --git a/Lang/CoffeeScript/Morse-code b/Lang/CoffeeScript/Morse-code new file mode 120000 index 0000000000..832e1c57ba --- /dev/null +++ b/Lang/CoffeeScript/Morse-code @@ -0,0 +1 @@ +../../Task/Morse-code/CoffeeScript \ No newline at end of file diff --git a/Lang/Comal/Numerical-integration b/Lang/Comal/Numerical-integration new file mode 120000 index 0000000000..3e4dcd9523 --- /dev/null +++ b/Lang/Comal/Numerical-integration @@ -0,0 +1 @@ +../../Task/Numerical-integration/Comal \ No newline at end of file diff --git a/Lang/Commodore-BASIC/Hello-world-Text b/Lang/Commodore-BASIC/Hello-world-Text new file mode 120000 index 0000000000..79999f781e --- /dev/null +++ b/Lang/Commodore-BASIC/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/Commodore-BASIC \ No newline at end of file diff --git a/Lang/Commodore-BASIC/Maze-generation b/Lang/Commodore-BASIC/Maze-generation new file mode 120000 index 0000000000..44171206f4 --- /dev/null +++ b/Lang/Commodore-BASIC/Maze-generation @@ -0,0 +1 @@ +../../Task/Maze-generation/Commodore-BASIC \ No newline at end of file diff --git a/Lang/Common-Lisp/Brownian-tree b/Lang/Common-Lisp/Brownian-tree new file mode 120000 index 0000000000..3ff5ef3832 --- /dev/null +++ b/Lang/Common-Lisp/Brownian-tree @@ -0,0 +1 @@ +../../Task/Brownian-tree/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/Catalan-numbers-Pascals-triangle b/Lang/Common-Lisp/Catalan-numbers-Pascals-triangle new file mode 120000 index 0000000000..400db0cc54 --- /dev/null +++ b/Lang/Common-Lisp/Catalan-numbers-Pascals-triangle @@ -0,0 +1 @@ +../../Task/Catalan-numbers-Pascals-triangle/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/Here-document b/Lang/Common-Lisp/Here-document new file mode 120000 index 0000000000..1ac81f30ee --- /dev/null +++ b/Lang/Common-Lisp/Here-document @@ -0,0 +1 @@ +../../Task/Here-document/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/Image-convolution b/Lang/Common-Lisp/Image-convolution new file mode 120000 index 0000000000..2219988407 --- /dev/null +++ b/Lang/Common-Lisp/Image-convolution @@ -0,0 +1 @@ +../../Task/Image-convolution/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/Mouse-position b/Lang/Common-Lisp/Mouse-position new file mode 120000 index 0000000000..e70a2f0945 --- /dev/null +++ b/Lang/Common-Lisp/Mouse-position @@ -0,0 +1 @@ +../../Task/Mouse-position/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/Ulam-spiral--for-primes- b/Lang/Common-Lisp/Ulam-spiral--for-primes- new file mode 120000 index 0000000000..76d4dce7b8 --- /dev/null +++ b/Lang/Common-Lisp/Ulam-spiral--for-primes- @@ -0,0 +1 @@ +../../Task/Ulam-spiral--for-primes-/Common-Lisp \ No newline at end of file diff --git a/Lang/Common-Lisp/World-Cup-group-stage b/Lang/Common-Lisp/World-Cup-group-stage new file mode 120000 index 0000000000..d28423201c --- /dev/null +++ b/Lang/Common-Lisp/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/Common-Lisp \ No newline at end of file diff --git a/Lang/Coq/Extend-your-language b/Lang/Coq/Extend-your-language new file mode 120000 index 0000000000..2e717c1027 --- /dev/null +++ b/Lang/Coq/Extend-your-language @@ -0,0 +1 @@ +../../Task/Extend-your-language/Coq \ No newline at end of file diff --git a/Lang/Crystal/9-billion-names-of-God-the-integer b/Lang/Crystal/9-billion-names-of-God-the-integer new file mode 120000 index 0000000000..18461ec843 --- /dev/null +++ b/Lang/Crystal/9-billion-names-of-God-the-integer @@ -0,0 +1 @@ +../../Task/9-billion-names-of-God-the-integer/Crystal \ No newline at end of file diff --git a/Lang/Crystal/AKS-test-for-primes b/Lang/Crystal/AKS-test-for-primes new file mode 120000 index 0000000000..51c79dcd84 --- /dev/null +++ b/Lang/Crystal/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Abstract-type b/Lang/Crystal/Abstract-type new file mode 120000 index 0000000000..add741b356 --- /dev/null +++ b/Lang/Crystal/Abstract-type @@ -0,0 +1 @@ +../../Task/Abstract-type/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Ackermann-function b/Lang/Crystal/Ackermann-function new file mode 120000 index 0000000000..a62338f753 --- /dev/null +++ b/Lang/Crystal/Ackermann-function @@ -0,0 +1 @@ +../../Task/Ackermann-function/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Averages-Root-mean-square b/Lang/Crystal/Averages-Root-mean-square new file mode 120000 index 0000000000..f6c299ba32 --- /dev/null +++ b/Lang/Crystal/Averages-Root-mean-square @@ -0,0 +1 @@ +../../Task/Averages-Root-mean-square/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Binary-digits b/Lang/Crystal/Binary-digits new file mode 120000 index 0000000000..8bf7ca2926 --- /dev/null +++ b/Lang/Crystal/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Binary-search b/Lang/Crystal/Binary-search new file mode 120000 index 0000000000..f28aba90cc --- /dev/null +++ b/Lang/Crystal/Binary-search @@ -0,0 +1 @@ +../../Task/Binary-search/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Bulls-and-cows b/Lang/Crystal/Bulls-and-cows new file mode 120000 index 0000000000..5dec27f558 --- /dev/null +++ b/Lang/Crystal/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Bulls-and-cows-Player b/Lang/Crystal/Bulls-and-cows-Player new file mode 120000 index 0000000000..4dd71602c8 --- /dev/null +++ b/Lang/Crystal/Bulls-and-cows-Player @@ -0,0 +1 @@ +../../Task/Bulls-and-cows-Player/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Call-a-foreign-language-function b/Lang/Crystal/Call-a-foreign-language-function new file mode 120000 index 0000000000..9a10f013a8 --- /dev/null +++ b/Lang/Crystal/Call-a-foreign-language-function @@ -0,0 +1 @@ +../../Task/Call-a-foreign-language-function/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Combinations-and-permutations b/Lang/Crystal/Combinations-and-permutations new file mode 120000 index 0000000000..1e6766f889 --- /dev/null +++ b/Lang/Crystal/Combinations-and-permutations @@ -0,0 +1 @@ +../../Task/Combinations-and-permutations/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Combinations-with-repetitions b/Lang/Crystal/Combinations-with-repetitions new file mode 120000 index 0000000000..1c11a4cac0 --- /dev/null +++ b/Lang/Crystal/Combinations-with-repetitions @@ -0,0 +1 @@ +../../Task/Combinations-with-repetitions/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Constrained-genericity b/Lang/Crystal/Constrained-genericity new file mode 120000 index 0000000000..f31529af1c --- /dev/null +++ b/Lang/Crystal/Constrained-genericity @@ -0,0 +1 @@ +../../Task/Constrained-genericity/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Dinesmans-multiple-dwelling-problem b/Lang/Crystal/Dinesmans-multiple-dwelling-problem new file mode 120000 index 0000000000..cb3308d477 --- /dev/null +++ b/Lang/Crystal/Dinesmans-multiple-dwelling-problem @@ -0,0 +1 @@ +../../Task/Dinesmans-multiple-dwelling-problem/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Gamma-function b/Lang/Crystal/Gamma-function new file mode 120000 index 0000000000..ff4146a2ad --- /dev/null +++ b/Lang/Crystal/Gamma-function @@ -0,0 +1 @@ +../../Task/Gamma-function/Crystal \ No newline at end of file diff --git a/Lang/Crystal/HTTP b/Lang/Crystal/HTTP new file mode 120000 index 0000000000..9de2ccee5e --- /dev/null +++ b/Lang/Crystal/HTTP @@ -0,0 +1 @@ +../../Task/HTTP/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Harshad-or-Niven-series b/Lang/Crystal/Harshad-or-Niven-series new file mode 120000 index 0000000000..dc05609cd3 --- /dev/null +++ b/Lang/Crystal/Harshad-or-Niven-series @@ -0,0 +1 @@ +../../Task/Harshad-or-Niven-series/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Haversine-formula b/Lang/Crystal/Haversine-formula new file mode 120000 index 0000000000..db2dd58e33 --- /dev/null +++ b/Lang/Crystal/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Hickerson-series-of-almost-integers b/Lang/Crystal/Hickerson-series-of-almost-integers new file mode 120000 index 0000000000..80b4bda98a --- /dev/null +++ b/Lang/Crystal/Hickerson-series-of-almost-integers @@ -0,0 +1 @@ +../../Task/Hickerson-series-of-almost-integers/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Josephus-problem b/Lang/Crystal/Josephus-problem new file mode 120000 index 0000000000..18cfca4724 --- /dev/null +++ b/Lang/Crystal/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Knapsack-problem-0-1 b/Lang/Crystal/Knapsack-problem-0-1 new file mode 120000 index 0000000000..dbf7ccbe89 --- /dev/null +++ b/Lang/Crystal/Knapsack-problem-0-1 @@ -0,0 +1 @@ +../../Task/Knapsack-problem-0-1/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Knapsack-problem-Bounded b/Lang/Crystal/Knapsack-problem-Bounded new file mode 120000 index 0000000000..2e0df1dbcd --- /dev/null +++ b/Lang/Crystal/Knapsack-problem-Bounded @@ -0,0 +1 @@ +../../Task/Knapsack-problem-Bounded/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Nth b/Lang/Crystal/Nth new file mode 120000 index 0000000000..33be98e647 --- /dev/null +++ b/Lang/Crystal/Nth @@ -0,0 +1 @@ +../../Task/Nth/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Permutations b/Lang/Crystal/Permutations new file mode 120000 index 0000000000..280394d2af --- /dev/null +++ b/Lang/Crystal/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Pythagorean-triples b/Lang/Crystal/Pythagorean-triples new file mode 120000 index 0000000000..19c29741dc --- /dev/null +++ b/Lang/Crystal/Pythagorean-triples @@ -0,0 +1 @@ +../../Task/Pythagorean-triples/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Quickselect-algorithm b/Lang/Crystal/Quickselect-algorithm new file mode 120000 index 0000000000..a92ef7344b --- /dev/null +++ b/Lang/Crystal/Quickselect-algorithm @@ -0,0 +1 @@ +../../Task/Quickselect-algorithm/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Rock-paper-scissors b/Lang/Crystal/Rock-paper-scissors new file mode 120000 index 0000000000..3de83e59b6 --- /dev/null +++ b/Lang/Crystal/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Roots-of-unity b/Lang/Crystal/Roots-of-unity new file mode 120000 index 0000000000..fe4a8f49b7 --- /dev/null +++ b/Lang/Crystal/Roots-of-unity @@ -0,0 +1 @@ +../../Task/Roots-of-unity/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Runge-Kutta-method b/Lang/Crystal/Runge-Kutta-method new file mode 120000 index 0000000000..67eca473f0 --- /dev/null +++ b/Lang/Crystal/Runge-Kutta-method @@ -0,0 +1 @@ +../../Task/Runge-Kutta-method/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Sierpinski-carpet b/Lang/Crystal/Sierpinski-carpet new file mode 120000 index 0000000000..77e41d384e --- /dev/null +++ b/Lang/Crystal/Sierpinski-carpet @@ -0,0 +1 @@ +../../Task/Sierpinski-carpet/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Sum-of-a-series b/Lang/Crystal/Sum-of-a-series new file mode 120000 index 0000000000..8cb9abbe9f --- /dev/null +++ b/Lang/Crystal/Sum-of-a-series @@ -0,0 +1 @@ +../../Task/Sum-of-a-series/Crystal \ No newline at end of file diff --git a/Lang/Crystal/The-Twelve-Days-of-Christmas b/Lang/Crystal/The-Twelve-Days-of-Christmas new file mode 120000 index 0000000000..bdec5052ab --- /dev/null +++ b/Lang/Crystal/The-Twelve-Days-of-Christmas @@ -0,0 +1 @@ +../../Task/The-Twelve-Days-of-Christmas/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Tree-traversal b/Lang/Crystal/Tree-traversal new file mode 120000 index 0000000000..4d629689b5 --- /dev/null +++ b/Lang/Crystal/Tree-traversal @@ -0,0 +1 @@ +../../Task/Tree-traversal/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Zebra-puzzle b/Lang/Crystal/Zebra-puzzle new file mode 120000 index 0000000000..e50e83ad2d --- /dev/null +++ b/Lang/Crystal/Zebra-puzzle @@ -0,0 +1 @@ +../../Task/Zebra-puzzle/Crystal \ No newline at end of file diff --git a/Lang/Crystal/Zig-zag-matrix b/Lang/Crystal/Zig-zag-matrix new file mode 120000 index 0000000000..fe223ee12b --- /dev/null +++ b/Lang/Crystal/Zig-zag-matrix @@ -0,0 +1 @@ +../../Task/Zig-zag-matrix/Crystal \ No newline at end of file diff --git a/Lang/Curry/Permutations b/Lang/Curry/Permutations new file mode 120000 index 0000000000..3889ba6ef4 --- /dev/null +++ b/Lang/Curry/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/Curry \ No newline at end of file diff --git a/Lang/D/Arithmetic-geometric-mean-Calculate-Pi b/Lang/D/Arithmetic-geometric-mean-Calculate-Pi new file mode 120000 index 0000000000..6aeff1f402 --- /dev/null +++ b/Lang/D/Arithmetic-geometric-mean-Calculate-Pi @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean-Calculate-Pi/D \ No newline at end of file diff --git a/Lang/D/Multiplicative-order b/Lang/D/Multiplicative-order new file mode 120000 index 0000000000..8c33e58725 --- /dev/null +++ b/Lang/D/Multiplicative-order @@ -0,0 +1 @@ +../../Task/Multiplicative-order/D \ No newline at end of file diff --git a/Lang/Dart/Extensible-prime-generator b/Lang/Dart/Extensible-prime-generator new file mode 120000 index 0000000000..5355d40ddf --- /dev/null +++ b/Lang/Dart/Extensible-prime-generator @@ -0,0 +1 @@ +../../Task/Extensible-prime-generator/Dart \ No newline at end of file diff --git a/Lang/Dart/Forward-difference b/Lang/Dart/Forward-difference new file mode 120000 index 0000000000..43fbd76f0f --- /dev/null +++ b/Lang/Dart/Forward-difference @@ -0,0 +1 @@ +../../Task/Forward-difference/Dart \ No newline at end of file diff --git a/Lang/Dart/Hamming-numbers b/Lang/Dart/Hamming-numbers new file mode 120000 index 0000000000..7b221e0dff --- /dev/null +++ b/Lang/Dart/Hamming-numbers @@ -0,0 +1 @@ +../../Task/Hamming-numbers/Dart \ No newline at end of file diff --git a/Lang/Dart/Haversine-formula b/Lang/Dart/Haversine-formula new file mode 120000 index 0000000000..8cca8cad80 --- /dev/null +++ b/Lang/Dart/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/Dart \ No newline at end of file diff --git a/Lang/Dart/Roots-of-a-function b/Lang/Dart/Roots-of-a-function new file mode 120000 index 0000000000..601a118abf --- /dev/null +++ b/Lang/Dart/Roots-of-a-function @@ -0,0 +1 @@ +../../Task/Roots-of-a-function/Dart \ No newline at end of file diff --git a/Lang/Dart/Sum-of-a-series b/Lang/Dart/Sum-of-a-series new file mode 120000 index 0000000000..5e67bf6b7e --- /dev/null +++ b/Lang/Dart/Sum-of-a-series @@ -0,0 +1 @@ +../../Task/Sum-of-a-series/Dart \ No newline at end of file diff --git a/Lang/Dc/Ackermann-function b/Lang/Dc/Ackermann-function new file mode 120000 index 0000000000..6c2869af25 --- /dev/null +++ b/Lang/Dc/Ackermann-function @@ -0,0 +1 @@ +../../Task/Ackermann-function/Dc \ No newline at end of file diff --git a/Lang/Dc/Fibonacci-sequence b/Lang/Dc/Fibonacci-sequence new file mode 120000 index 0000000000..b61f1712eb --- /dev/null +++ b/Lang/Dc/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/Dc \ No newline at end of file diff --git a/Lang/Dc/Generate-lower-case-ASCII-alphabet b/Lang/Dc/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..dddda525f5 --- /dev/null +++ b/Lang/Dc/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/Dc \ No newline at end of file diff --git a/Lang/Dc/Hello-world-Newline-omission b/Lang/Dc/Hello-world-Newline-omission new file mode 120000 index 0000000000..e43aa4936b --- /dev/null +++ b/Lang/Dc/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/Dc \ No newline at end of file diff --git a/Lang/Dc/Logical-operations b/Lang/Dc/Logical-operations new file mode 120000 index 0000000000..9c623dc34c --- /dev/null +++ b/Lang/Dc/Logical-operations @@ -0,0 +1 @@ +../../Task/Logical-operations/Dc \ No newline at end of file diff --git a/Lang/Dc/Mandelbrot-set b/Lang/Dc/Mandelbrot-set new file mode 120000 index 0000000000..ec520f0bcf --- /dev/null +++ b/Lang/Dc/Mandelbrot-set @@ -0,0 +1 @@ +../../Task/Mandelbrot-set/Dc \ No newline at end of file diff --git a/Lang/Dc/Return-multiple-values b/Lang/Dc/Return-multiple-values new file mode 120000 index 0000000000..78af843851 --- /dev/null +++ b/Lang/Dc/Return-multiple-values @@ -0,0 +1 @@ +../../Task/Return-multiple-values/Dc \ No newline at end of file diff --git a/Lang/Dc/Reverse-a-string b/Lang/Dc/Reverse-a-string new file mode 120000 index 0000000000..a4a7193268 --- /dev/null +++ b/Lang/Dc/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Dc \ No newline at end of file diff --git a/Lang/Dc/Sum-digits-of-an-integer b/Lang/Dc/Sum-digits-of-an-integer new file mode 120000 index 0000000000..181a268b19 --- /dev/null +++ b/Lang/Dc/Sum-digits-of-an-integer @@ -0,0 +1 @@ +../../Task/Sum-digits-of-an-integer/Dc \ No newline at end of file diff --git a/Lang/Dc/Terminal-control-Clear-the-screen b/Lang/Dc/Terminal-control-Clear-the-screen new file mode 120000 index 0000000000..61a30b2ddb --- /dev/null +++ b/Lang/Dc/Terminal-control-Clear-the-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Clear-the-screen/Dc \ No newline at end of file diff --git a/Lang/Dc/Terminal-control-Display-an-extended-character b/Lang/Dc/Terminal-control-Display-an-extended-character new file mode 120000 index 0000000000..9a76e5bad3 --- /dev/null +++ b/Lang/Dc/Terminal-control-Display-an-extended-character @@ -0,0 +1 @@ +../../Task/Terminal-control-Display-an-extended-character/Dc \ No newline at end of file diff --git a/Lang/Delphi/Address-of-a-variable b/Lang/Delphi/Address-of-a-variable new file mode 120000 index 0000000000..78b7c5b35b --- /dev/null +++ b/Lang/Delphi/Address-of-a-variable @@ -0,0 +1 @@ +../../Task/Address-of-a-variable/Delphi \ No newline at end of file diff --git a/Lang/Delphi/Random-number-generator--included- b/Lang/Delphi/Random-number-generator--included- new file mode 120000 index 0000000000..e53c1ae551 --- /dev/null +++ b/Lang/Delphi/Random-number-generator--included- @@ -0,0 +1 @@ +../../Task/Random-number-generator--included-/Delphi \ No newline at end of file diff --git a/Lang/ECL/00DESCRIPTION b/Lang/ECL/00DESCRIPTION index ac3c1a3215..fe67ddf03e 100644 --- a/Lang/ECL/00DESCRIPTION +++ b/Lang/ECL/00DESCRIPTION @@ -3,7 +3,7 @@ }} The Enterprise Control Language (ECL) is an advanced programming language supporting both query and ETL -(Extract, Transform, and Load) operations. ECL is designed and used with HPCC Systems. http://www.lexisnexis.com/risk/newsevents/press-release.aspx?Id=1308140007126875 It is specifically designed for data management and query processing. ECL code is written using the ECL IDE programming development tool. ECL is compiled into optimized C++ which is then compiled into DLLs for execution on the Thor and Roxie platforms. ECL can include inline C++ code encapsulated in functions. External services can be written in any language and compiled into shared libraries of functions callable from ECL. A pipe interface allows execution of external programs written in any language to be incorporated into jobs. ECL's design allows the leverage of created code for re-use in subsequent queries, the language extends itself as it is used. http://hpccsystems.com/download/docs/programmers-guidehttp://hpccsystems.com/download/docs/ecl-language-reference +(Extract, Transform, and Load) operations. ECL is designed and used with HPCC Systems(r). http://www.lexisnexis.com/risk/newsevents/press-release.aspx?Id=1308140007126875 It is specifically designed for data management and query processing. ECL code is written using the ECL IDE programming development tool. ECL is compiled into optimized C++ which is then compiled into DLLs for execution on the Thor and Roxie platforms. ECL can include inline C++ code encapsulated in functions. External services can be written in any language and compiled into shared libraries of functions callable from ECL. A pipe interface allows execution of external programs written in any language to be incorporated into jobs. ECL's design allows the leverage of created code for re-use in subsequent queries, the language extends itself as it is used. http://hpccsystems.com/download/docs/programmers-guidehttp://hpccsystems.com/download/docs/ecl-language-reference ==See Also== * [[wp:ECL_%28data-centric_programming_language%29|Wikipedia:ECL (data-centric programming language)]] diff --git a/Lang/Eiffel/Classes b/Lang/Eiffel/Classes new file mode 120000 index 0000000000..d54a634c3c --- /dev/null +++ b/Lang/Eiffel/Classes @@ -0,0 +1 @@ +../../Task/Classes/Eiffel \ No newline at end of file diff --git a/Lang/Elena/00DESCRIPTION b/Lang/Elena/00DESCRIPTION index c6835bacac..671257e3ee 100644 --- a/Lang/Elena/00DESCRIPTION +++ b/Lang/Elena/00DESCRIPTION @@ -11,603 +11,5 @@ ELENA is a general-purpose, object-oriented, polymorphic language with late binding. It features message dispatching/manipulation, dynamic object mutation, a script engine / interpreter and mix-ins. -== The simplest program == - -To create a simple console program we have to declare the program symbol in the project root namespace: - - public program - [ - ] - -Everything in ELENA is an object. To interact with it we have to send a message. The simplest (generic, i.e. without an explicit signature) message consists of an action and a parameter list. - -The statement should be terminated by a dot (ELENA is inspired by Smalltalk and uses its syntax notations). - - public program - [ - console writeLine("Hello!") - ] - -In our example the action is writeLine and the parameter list consists of a single literal constant. The message target is console object (implementing input / output operations with a program console). - -Several message operations can be done in a single statement separated by a semicolon: - - public program - [ - console writeLine("Hello!"); writeLine("How are you?"). - ] - -The result will be: - - Hello! - How are you? - -We may read a user input by sending readLine message without parameters: - - public program - [ - console write("What is your name:"); writeLine("Hello " + console readLine). - ] - -The result will be: - - What is your name:Alex - Hello Alex - -Console::write method is similar to writeLine except that it writes to the output screen without a new line character. - -== Declaring a variable == - -A variable can be declared in an assignment statement starting with var attribute: - - var myVariable := "A text". - -where we declare a variable myVariable and initialize it with a literal constant value. - -The assigning value can be an expression itself: - - public program - [ - console writeLine("Hello!"); writeLine("How are you?"). - var s := console readLine. - ] - -ELENA is a dynamic language and in normal case we may not specify the variable type: - - public program - [ - var s := "Hello". - console writeLine(s). - - s := 2. - console writeLine(s). - ] - -The output will be: - - Hello - 2 - -But it is still possible to specify the variable expected type: - - T s := "Hello". - console writeLine(s). - -where system'LiteralValue is a class representing text as a sequence of UTF-8 characters. - -We may use a class alias to simplify the code: - - literal s := "Hello". // literal is a LiteralValue alias - console writeLine(s). - -Note that despite it we may still assign the objects of different types without a compile-time error: - - literal s := "Hello". - s := T(2). - -Why? ELENA is a dynamic language and in most cases resolves the types in run-time. So our code will be actually -compiled as follow: - - literal s := "Hello". - s := T(2) - -It is guaranteed that the result of the cast message is an instance of LiteralValue, so if the object supports the message the conversion will be done quietly. - -The output will be: - - system'RealNumber : Method $system'IntNumber not found - Call stack: - system'Exception#class.new$system'LiteralValue[1]:exceptions.l(125) - system'MethodNotFoundException#class.new$system'Object$system'Message[2]:exceptions.l(213) - system'#inline1BF.start[1]:win32_app.l(252) - mytest'program.#invoke[0]:test.l(5) - system'BaseFunction.eval[0]:control.l(172) - system'#inline1BF.start[1]:win32_app.l(37) - system'startUp(5) - -== Basic Types == - -=== The Boolean Type === - -Boolean type is used in conditional operations and may accept only two Boolean literals - true and false. - - import extensions. - - public program - [ - bool b1 := true. - bool b2 := false. - - console printLine(b1,"==",b1," is ",b1==b1). - console printLine(b2,"==",b2," is ",b2==b2). - console printLine(b1,"==",b2," is ",b1==b2). - console printLine(b2,"==",b1," is ",b1==b2). - ] - -Note that implicit extension method - extensions'outputOp.printLine[] - was used to simplify the output operations. - -The output is: - - true==true is true - false==false is true - true==false is false - false==true is false - -=== The Numeric types === - -The most used numeric types in ELENA are 32-bit signed integer number (represented by **IntNumber**), 64-bit signed integer number (represented by **LongNumber**) and 64-bit floating-point number (represented by **RealNumber**): - - import extensions. - - public rogram = - [ - int n := -234. - long l := 1235456765l. - real r := 2.3456r. - - console printLine("Integer number - ",n). - console printLine("Long integer number - ",l). - console printLine("Real number - ",r). - ]. - -The output is: - - Integer number - -234 - Long integer number - 1235456765 - Real number - 2.3456 - -=== The string type === - -LiteralValue is used to store the text encoded in UTF-8. LiteralValus is read-only collection of CharValue classes each representing UTF-32 symbol. Note that one character may be encoded with more than one byte! - - import extensions. - - public program = - [ - var s := "Hello". - - console printLine("The first character of ",s," is ", s[0]). - console printLine("The last character of ",s," is ", s[s length - 1]). - ]. - -The output is: - - The first character of Hello is H - The last character of Hello is o - -The same code for example with a Russian text will not work. Because every character is encoded with a two bytes and this should be taken into account. - - import extensions. - - public program = - [ - var s := "Привет". - - console printLine("The first character of ",s," is ", s[0]). - console printLine("The last character of ",s," is ", s[s length - 1]). - ]. - -The output is: - - The first character of Привет is П - An index is out of range - Call stack: - system'Exception#class.new$system'LiteralValue[1]:exceptions.l(125) - system'OutOfRangeException#class.new[0]:exceptions.l(149) - system'LiteralValue.getAt$system'IntNumber[1]:memory.l(1191) - mytest'program.#invoke[0]:test.l(8) - system'BaseFunction.eval[0]:control.l(172) - system'#inline1BF.start[1]:win32_app.l(37) - system'startUp(5) - -We may use another class representing UTF-16 text (WideLiteralValue) to solve this problem: - - import extensions. - - public program = - [ - var s := "Привет"w. // UTF-16 string - - console printLine("The first character of ",s," is ", s[0]). - console printLine("The last character of ",s," is ", s[s length - 1]). - ]. - -The output will be correct this time: - - The first character of Привет is П - The last character of Привет is т - -But this code will not work with Chinese text or any other requiring more than 2 bytes per symbol. So instead we may use enumerators: - - import system'routines. - import extensions. - - public program = - [ - var s := "Привет". - - console printLine("The first character of ",s," is ", s enumerator; firstMember). - console printLine("The last character of ",s," is ", s enumerator; lastMember). - ]. - -The output will be correct for any UTF-8 text: - - The first character of Привет is П - The last character of Привет is т - -=== Array type === - -It is possible to declare a dynamic or static array. - - import extensions. - - public program = - [ - var staticArray := (1,2,3). - var dynamicArray := Array new(3). - dynamicArray[0] := 1. - dynamicArray[1] := "b". - dynamicArray[2] := 2.3r. - - console printLine("static array ",staticArray). - console printLine("dynamic array ",dynamicArray). - ]. - -The output is: - - static array 1,2,3 - dynamic array 1,b,2.3 - -== Basic arithmetic operations == - -ELENA supports basic arithmetic operations with integer and floating-point numbers: - - import extensions. - - public program = - [ - var n1 := 12. - var n2 := 5. - var n3 := -3. - var r1 := 2.3r. - - console printLine(n1, " + ", n2, " = ", n1 + n2). - console printLine(n1, " - ", n2, " = ", n1 - n2). - console printLine(n1, " * ", n3, " = ", n1 * n3). - console printLine(n1, " / ", n2, " = ", n1 / n2). - - console printLine(n1, " + ", n2, " * ", r1 ," = ", n1 + n2 * r1). - ]. - -The result is: - - 12 + 5 = 17 - 12 - 5 = 7 - 12 * -3 = -36 - 12 / 5 = 2 - 12 + 5 * 2.3 = 23.5 - -== Conditions, Multi-select, Loops == - -Conditional statement in ELENA are defined as follows: - - if() - [ /* doSomething if TRUE*/ ]; - [ /*doSomehting if ELSE*/ ]. - -We could omit else part - - if() - [ /*doSomehting if TRUE*/ ]. - -Usually Boolean expression is a result of a comparison operation: - - public program = - [ - console writeLine("Hello!"); writeLine("How are you?"). - var s := console readLine. - if(s == "good") - [ console writeLine("Me too") ]; - [ console writeLine("What happends?") ] - ]. - -Several conditions can be checked: - - public program = - [ - console writeLine("Hello!"); writeLine("How are you?"). - var s := console readLine. - if((s == "good") || (s == "fine")) - [ console writeLine("Me too") ]; - [ console writeLine("What happens?") ] - ]. - -A switch statement can be implemented using => operator: - - public program = - [ - console writeLine("Hello!"); writeLine("How are you?"). - var s := console readLine. - s => - "good" [ console writeLine("Me too") ]; - "fine" [ console writeLine("Glad to hear") ]; - "bad" [ console writeLine("What's wrong?") ]; - "so so" [ console writeLine("It happens") ]; - ! [ console writeLine("What happens?") ]. - ]. - -We could declare *while* loop which will be repeated until the condition is true: - - public program = - [ - console writeLine("Hello!"); writeLine("Guess what?"). - var s := console readLine. - while (s != "nothing") - [ - console writeLine("Guess what?"). - s := console readLine - ] - ]. - -Alternatively *until* loop is executed until the condition is met : - - public program = - [ - console writeLine("Hello!"); writeLine("Guess what?"). - var s := console readLine. - until (s == "nothing") - [ - console writeLine("Guess what?"). - s := console readLine - ] - ]. - -== Classes, Fields Methods, Constructors == - -Everything in ELENA is a class. So to implement some tasks we will have to declare our own classes. - -=== Declaring a simple class === - -Let's create a simple class : - - import extensions. - - class MyClass - { - // a field - literal myString. - - // a constructor - constructor new(literal s) - [ - myString := s. - ] - - // a method - printString - [ - console printLine(myString). - ] - } - - public program = - [ - // creating a class instance by sending new message to the class - var myClass := MyClass new("This is printed by my class."). - - myClass printString. - ]. - -The output will be: - - This is printed by my class. - -Note that in ELENA a class is an object itself and can be used by like any other object. - -=== Class Inheritance === - -We may inherit our class. When the parent is not explicitly declared - the class inherits system'Object super class - - import extensions. - - class MyParent - { - constructor new - [ - console printLine("Parent Constructor.") - ] - - print - [ - console printLine("I'm a Parent Class.") - ] - } - - class MyChild :: MyParent - { - - constructor new - <= new; // calling the parent constructor - [ - console printLine("Child Constructor.") - ] - - print - [ - // calling the parent method - super print. - - console printLine("I'm a Child Class.") - ] - } - - public program = - [ - var myClass := MyChild new. - - myClass print. - ]. - -The output is: - - Parent Constructor. - Child Constructor. - I'm a Parent Class. - I'm a Child Class. - -=== Private methods === - -It is possible to declare the private methods which cannot be called outside the class. - - import extensions. - - class MyClass - { - private printPrivate - [ - console printLine("private print.") - ] - - printPublic - [ - console print("Calling from public print - "). - - // $self is a reference to the current object - self printPrivate. - ] - } - - program = - [ - // Note that if the constructor explicitly is not declared - // the system'Object one (without input parameters) is inherited - var myClass := MyClass new. - - myClass printPublic. - myClass printPrivate. - ]. - - The output is: - - Calling from public print - private print. - mytest'MyClass : Method mytest#printPrivate not found - Call stack: - system'Exception#class.new$system'LiteralValue[1]:exceptions.l(125) - system'MethodNotFoundException#class.new$system'Object$system'Message[2]:exceptions.l(213) - system'#inline1BF.start[1]:win32_app.l(252) - mytest'program.#invoke[0]:test.l(24) - system'BaseFunction.eval[0]:control.l(172) - system'#inline1BF.start[1]:win32_app.l(37) - system'startUp(5) - -=== Properties === - -In normal case the class fields cannot be accessed outside the class. That's why we may declare a special method to access it: - - import extensions. - - class MyClass - { - int _x. - - int x = _x. // get accessor - - set x(int o) // set accessor - [ - _x := o. - ] - } - - public program = - [ - var myClass := MyClass new. - - myClass x := 2. - - console printLine("MyClass.x=", myClass x). - ]. - -The output is: - - MyClass.x=2 - -We may simplify our code if we will use prop attribute: - - import extensions. - - class MyClass - { - int prop x :: _x. - } - - public program = - [ - var myClass := MyClass new. - - myClass x := 2. - - console printLine("MyClass.x=", myClass x). - ]. - -== Exception Handling == - -We may use try-catch statement to handle the possible exceptions: - - import extensions. - import system'io. - - public program = - [ - try(console printLine(File new("notexistingfile.txt"); content)) - { - on(Exception ex) - [ - console printLine("Unknown error - ",ex). - ] - - on(IOException ex) - [ - console printLine("I/O error - ",ex). - ] - } - ]. - -The output is : - - I/O error - Cannot open the file - Call stack: - system'Exception#class.new$system'LiteralValue[1]:exceptions.l(125) - system'io'IOException#class.new$system'LiteralValue[1]:io\ioexceptions.l(10)system'io'FileStream#class.new$system'WideLiteralValue$system'IntNumber$system'IntNumber$system'IntNumber$system'IntNmber[5]:io\win32_files.l(52) - system'io'FileStream#class.openForRead[1]:io\win32_files.l(29) - system'io'StreamReader#class.new[1]:io\win32_files.l(207) - system'io'fileControl.reader[1]:io\win32_files.l(269) - system'io'File.read$system'text'TextBuilder[1]:io\files.l(59) - system'io'File.content[0]:io\files.l(33) - mytest'program.#invoke[0]:test.l(6) - system'BaseFunction.eval[0]:control.l(172) - system'#inline1BF.start[1]:win32_app.l(37) - system'startUp(5) - -== See also == -* ELENA on [https://github.com/ELENA-LANG/elena-lang/ Github] +* ELENA on [https://github.com/ELENA-LANG/elena-lang/wiki/ Github] * ELENA on [https://www.reddit.com/r/elena_lang/ Reddit] \ No newline at end of file diff --git a/Lang/Elena/Walk-a-directory-Non-recursively b/Lang/Elena/Walk-a-directory-Non-recursively new file mode 120000 index 0000000000..531978d7e3 --- /dev/null +++ b/Lang/Elena/Walk-a-directory-Non-recursively @@ -0,0 +1 @@ +../../Task/Walk-a-directory-Non-recursively/Elena \ No newline at end of file diff --git a/Lang/Elixir/Dining-philosophers b/Lang/Elixir/Dining-philosophers new file mode 120000 index 0000000000..4d14832e09 --- /dev/null +++ b/Lang/Elixir/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/Elixir \ No newline at end of file diff --git a/Lang/Elixir/Extensible-prime-generator b/Lang/Elixir/Extensible-prime-generator new file mode 120000 index 0000000000..cc7f2bddf0 --- /dev/null +++ b/Lang/Elixir/Extensible-prime-generator @@ -0,0 +1 @@ +../../Task/Extensible-prime-generator/Elixir \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Ackermann-function b/Lang/Emacs-Lisp/Ackermann-function new file mode 120000 index 0000000000..939e359173 --- /dev/null +++ b/Lang/Emacs-Lisp/Ackermann-function @@ -0,0 +1 @@ +../../Task/Ackermann-function/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Binary-search b/Lang/Emacs-Lisp/Binary-search new file mode 120000 index 0000000000..93cbf06024 --- /dev/null +++ b/Lang/Emacs-Lisp/Binary-search @@ -0,0 +1 @@ +../../Task/Binary-search/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Generator-Exponential b/Lang/Emacs-Lisp/Generator-Exponential new file mode 120000 index 0000000000..b371f6d6bf --- /dev/null +++ b/Lang/Emacs-Lisp/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Leap-year b/Lang/Emacs-Lisp/Leap-year new file mode 120000 index 0000000000..8872444b44 --- /dev/null +++ b/Lang/Emacs-Lisp/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Luhn-test-of-credit-card-numbers b/Lang/Emacs-Lisp/Luhn-test-of-credit-card-numbers new file mode 120000 index 0000000000..f3e61f801e --- /dev/null +++ b/Lang/Emacs-Lisp/Luhn-test-of-credit-card-numbers @@ -0,0 +1 @@ +../../Task/Luhn-test-of-credit-card-numbers/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Matrix-transposition b/Lang/Emacs-Lisp/Matrix-transposition new file mode 120000 index 0000000000..075f7e2afa --- /dev/null +++ b/Lang/Emacs-Lisp/Matrix-transposition @@ -0,0 +1 @@ +../../Task/Matrix-transposition/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Pattern-matching b/Lang/Emacs-Lisp/Pattern-matching new file mode 120000 index 0000000000..5b659ba66c --- /dev/null +++ b/Lang/Emacs-Lisp/Pattern-matching @@ -0,0 +1 @@ +../../Task/Pattern-matching/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Pick-random-element b/Lang/Emacs-Lisp/Pick-random-element new file mode 120000 index 0000000000..617d1702c8 --- /dev/null +++ b/Lang/Emacs-Lisp/Pick-random-element @@ -0,0 +1 @@ +../../Task/Pick-random-element/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Run-length-encoding b/Lang/Emacs-Lisp/Run-length-encoding new file mode 120000 index 0000000000..49489ce7b0 --- /dev/null +++ b/Lang/Emacs-Lisp/Run-length-encoding @@ -0,0 +1 @@ +../../Task/Run-length-encoding/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Emacs-Lisp/Terminal-control-Preserve-screen b/Lang/Emacs-Lisp/Terminal-control-Preserve-screen new file mode 120000 index 0000000000..b06b7a33f4 --- /dev/null +++ b/Lang/Emacs-Lisp/Terminal-control-Preserve-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Preserve-screen/Emacs-Lisp \ No newline at end of file diff --git a/Lang/Erlang/Arithmetic-geometric-mean-Calculate-Pi b/Lang/Erlang/Arithmetic-geometric-mean-Calculate-Pi new file mode 120000 index 0000000000..a9194b59b5 --- /dev/null +++ b/Lang/Erlang/Arithmetic-geometric-mean-Calculate-Pi @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean-Calculate-Pi/Erlang \ No newline at end of file diff --git a/Lang/Erlang/Matrix-transposition b/Lang/Erlang/Matrix-transposition new file mode 120000 index 0000000000..66f4db9154 --- /dev/null +++ b/Lang/Erlang/Matrix-transposition @@ -0,0 +1 @@ +../../Task/Matrix-transposition/Erlang \ No newline at end of file diff --git a/Lang/Erlang/Monte-Carlo-methods b/Lang/Erlang/Monte-Carlo-methods new file mode 120000 index 0000000000..100969b8ac --- /dev/null +++ b/Lang/Erlang/Monte-Carlo-methods @@ -0,0 +1 @@ +../../Task/Monte-Carlo-methods/Erlang \ No newline at end of file diff --git a/Lang/Excel/Factorial b/Lang/Excel/Factorial new file mode 120000 index 0000000000..66553e5342 --- /dev/null +++ b/Lang/Excel/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Excel \ No newline at end of file diff --git a/Lang/FALSE/Generate-lower-case-ASCII-alphabet b/Lang/FALSE/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..0803ab24b7 --- /dev/null +++ b/Lang/FALSE/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/FALSE \ No newline at end of file diff --git a/Lang/Factor/00DESCRIPTION b/Lang/Factor/00DESCRIPTION index cf632a703e..ff28691089 100644 --- a/Lang/Factor/00DESCRIPTION +++ b/Lang/Factor/00DESCRIPTION @@ -1,4 +1,3 @@ -{{stub}} {{language |exec=machine |site=http://factorcode.org @@ -11,10 +10,30 @@ |checking=dynamic |tags=factor |LCT=yes}} -Factor is a stack language similar to, but of a higher level than, [[Forth]]. +Factor is a stack-based, concatenative, general-purpose programming language with a focus on practicality. + +Initially developed by Slava Pestov, Factor began life in 2003 as a scripting language written for a game. The implementation was originally an interpreter written in [[Java]], but has since gained an optimizing compiler and has been rewritten in Factor with a minimal [[C]] core. Read more about Factor's implementation history [http://concatenative.org/wiki/view/Factor/Implementation%20history here]. As of August 2019, Factor is still being developed by several contributors, with the latest [http://re-factor.blogspot.com/2018/07/factor-098-now-available.html stable release] in July 2018. + +Factor is a stack language similar to, but of a higher level than, [[Forth]]. Factor is a [http://concatenative.org/wiki/view/Concatenative%20language concatenative language], meaning that rather than applying functions to arguments (applicative languages) to evaluate things, we compose functions to evaluate a single piece of data — the entire program up until that particular point. In Factor, the basic structure of data flow is function composition. That is, foo bar baz is equivalent to baz(bar(foo())) in an applicative language. This offers a nice left-to-right style of reading and data flow. + +In Factor, we tend to name data flow operations rather than values. In an applicative language, you might write +var x = ...; +var y = foo(x); +var z = bar(x); +In Factor this is a data flow pattern called bi. +[ foo ] [ bar ] bi +This says, "apply foo to the object at the top of the data stack, and apply bar to it as well." Rather than naming the values x, y, and z, we named the data flow pattern. + +Factor comes with many practical features, including a REPL, a self-contained help browser, an object inspector, a debugger/code walker, a deployment tool, editor integration for most popular text editors and IDEs, and introspection capabilities useful for developers. Factor has a fully-featured library, including things such as an HTTP server/client, bindings to graphics libraries and databases, a C FFI, a cross-platform GUI framework, on down to niche things like polynomial arithmetic. Factor features an object system that takes inspiration from [[Common Lisp]] and [[Self]]. + +Most code tends to be expressed naturally in a functional manner. Factor comes with combinators (higher-order functions) typically seen in functional languages, such as map, filter, reduce, and many more. Although most things can be done efficiently without mutation, Factor doesn't shy away from it when it's useful. Mutating words end with exclamation points (by convention). Factor provides lexical and dynamic variables which can make writing imperative code more natural, or allows one to clean up code that performs a lot of stack shuffling. + +One of Factor's greatest strengths is its ability to factor words into smaller words. Due to the nature of concatenative programming, this is typically a cut and paste job that can be done almost anywhere there is whitespace. Factor also has impressive metaprogramming capabilities. Since Factor is almost entirely written in Factor, there is full introspection support, including seamless access to Factor's parser, allowing one to define new syntax. Factor also offers Lisp-style macros, and in general, Factor code can be treated like a collection ([https://en.wikipedia.org/wiki/Homoiconicity homoiconicity]). ==Links== *[http://factorcode.org Factor programming language] *[http://planet.factorcode.org Planet Factor] +*[http://concatenative.org/wiki/view/Factor Factor on concatenative.org] +*[https://en.wikipedia.org/wiki/Factor_(programming_language) Factor on Wikipedia] {{Language programming paradigm|Concatenative}} \ No newline at end of file diff --git a/Lang/Factor/ABC-Problem b/Lang/Factor/ABC-Problem new file mode 120000 index 0000000000..ac0d7f9fd4 --- /dev/null +++ b/Lang/Factor/ABC-Problem @@ -0,0 +1 @@ +../../Task/ABC-Problem/Factor \ No newline at end of file diff --git a/Lang/Factor/AKS-test-for-primes b/Lang/Factor/AKS-test-for-primes new file mode 120000 index 0000000000..bcdd8b4cd7 --- /dev/null +++ b/Lang/Factor/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/Factor \ No newline at end of file diff --git a/Lang/Factor/Averages-Mean-angle b/Lang/Factor/Averages-Mean-angle new file mode 120000 index 0000000000..1dbf76564e --- /dev/null +++ b/Lang/Factor/Averages-Mean-angle @@ -0,0 +1 @@ +../../Task/Averages-Mean-angle/Factor \ No newline at end of file diff --git a/Lang/Factor/Averages-Mean-time-of-day b/Lang/Factor/Averages-Mean-time-of-day new file mode 120000 index 0000000000..e682ad0f58 --- /dev/null +++ b/Lang/Factor/Averages-Mean-time-of-day @@ -0,0 +1 @@ +../../Task/Averages-Mean-time-of-day/Factor \ No newline at end of file diff --git a/Lang/Factor/Averages-Simple-moving-average b/Lang/Factor/Averages-Simple-moving-average new file mode 120000 index 0000000000..ef62b4eada --- /dev/null +++ b/Lang/Factor/Averages-Simple-moving-average @@ -0,0 +1 @@ +../../Task/Averages-Simple-moving-average/Factor \ No newline at end of file diff --git a/Lang/Factor/Brownian-tree b/Lang/Factor/Brownian-tree new file mode 120000 index 0000000000..a93650256d --- /dev/null +++ b/Lang/Factor/Brownian-tree @@ -0,0 +1 @@ +../../Task/Brownian-tree/Factor \ No newline at end of file diff --git a/Lang/Factor/Calendar b/Lang/Factor/Calendar new file mode 120000 index 0000000000..de5087e033 --- /dev/null +++ b/Lang/Factor/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Factor \ No newline at end of file diff --git a/Lang/Factor/Call-an-object-method b/Lang/Factor/Call-an-object-method new file mode 120000 index 0000000000..d7a259deac --- /dev/null +++ b/Lang/Factor/Call-an-object-method @@ -0,0 +1 @@ +../../Task/Call-an-object-method/Factor \ No newline at end of file diff --git a/Lang/Factor/Check-Machin-like-formulas b/Lang/Factor/Check-Machin-like-formulas new file mode 120000 index 0000000000..a4be484c48 --- /dev/null +++ b/Lang/Factor/Check-Machin-like-formulas @@ -0,0 +1 @@ +../../Task/Check-Machin-like-formulas/Factor \ No newline at end of file diff --git a/Lang/Factor/Circles-of-given-radius-through-two-points b/Lang/Factor/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..4ca3812c9b --- /dev/null +++ b/Lang/Factor/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/Factor \ No newline at end of file diff --git a/Lang/Factor/Collections b/Lang/Factor/Collections new file mode 120000 index 0000000000..459c1baf40 --- /dev/null +++ b/Lang/Factor/Collections @@ -0,0 +1 @@ +../../Task/Collections/Factor \ No newline at end of file diff --git a/Lang/Factor/Continued-fraction-Arithmetic-Construct-from-rational-number b/Lang/Factor/Continued-fraction-Arithmetic-Construct-from-rational-number new file mode 120000 index 0000000000..a12a518072 --- /dev/null +++ b/Lang/Factor/Continued-fraction-Arithmetic-Construct-from-rational-number @@ -0,0 +1 @@ +../../Task/Continued-fraction-Arithmetic-Construct-from-rational-number/Factor \ No newline at end of file diff --git a/Lang/Factor/DNS-query b/Lang/Factor/DNS-query new file mode 120000 index 0000000000..9f18c45e89 --- /dev/null +++ b/Lang/Factor/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/Factor \ No newline at end of file diff --git a/Lang/Factor/Date-manipulation b/Lang/Factor/Date-manipulation new file mode 120000 index 0000000000..6593da7ff6 --- /dev/null +++ b/Lang/Factor/Date-manipulation @@ -0,0 +1 @@ +../../Task/Date-manipulation/Factor \ No newline at end of file diff --git a/Lang/Factor/Deal-cards-for-FreeCell b/Lang/Factor/Deal-cards-for-FreeCell new file mode 120000 index 0000000000..209b61bb81 --- /dev/null +++ b/Lang/Factor/Deal-cards-for-FreeCell @@ -0,0 +1 @@ +../../Task/Deal-cards-for-FreeCell/Factor \ No newline at end of file diff --git a/Lang/Factor/Draw-a-cuboid b/Lang/Factor/Draw-a-cuboid new file mode 120000 index 0000000000..1a759d7d1b --- /dev/null +++ b/Lang/Factor/Draw-a-cuboid @@ -0,0 +1 @@ +../../Task/Draw-a-cuboid/Factor \ No newline at end of file diff --git a/Lang/Factor/Element-wise-operations b/Lang/Factor/Element-wise-operations new file mode 120000 index 0000000000..7d28b6a52e --- /dev/null +++ b/Lang/Factor/Element-wise-operations @@ -0,0 +1 @@ +../../Task/Element-wise-operations/Factor \ No newline at end of file diff --git a/Lang/Factor/Euler-method b/Lang/Factor/Euler-method new file mode 120000 index 0000000000..ca3bad159c --- /dev/null +++ b/Lang/Factor/Euler-method @@ -0,0 +1 @@ +../../Task/Euler-method/Factor \ No newline at end of file diff --git a/Lang/Factor/Exceptions-Catch-an-exception-thrown-in-a-nested-call b/Lang/Factor/Exceptions-Catch-an-exception-thrown-in-a-nested-call new file mode 120000 index 0000000000..80a826f94e --- /dev/null +++ b/Lang/Factor/Exceptions-Catch-an-exception-thrown-in-a-nested-call @@ -0,0 +1 @@ +../../Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Factor \ No newline at end of file diff --git a/Lang/Factor/Execute-HQ9+ b/Lang/Factor/Execute-HQ9+ new file mode 120000 index 0000000000..91c1d7ab56 --- /dev/null +++ b/Lang/Factor/Execute-HQ9+ @@ -0,0 +1 @@ +../../Task/Execute-HQ9+/Factor \ No newline at end of file diff --git a/Lang/Factor/Factors-of-a-Mersenne-number b/Lang/Factor/Factors-of-a-Mersenne-number new file mode 120000 index 0000000000..d71e544f92 --- /dev/null +++ b/Lang/Factor/Factors-of-a-Mersenne-number @@ -0,0 +1 @@ +../../Task/Factors-of-a-Mersenne-number/Factor \ No newline at end of file diff --git a/Lang/Factor/Fibonacci-n-step-number-sequences b/Lang/Factor/Fibonacci-n-step-number-sequences new file mode 120000 index 0000000000..1107e25d36 --- /dev/null +++ b/Lang/Factor/Fibonacci-n-step-number-sequences @@ -0,0 +1 @@ +../../Task/Fibonacci-n-step-number-sequences/Factor \ No newline at end of file diff --git a/Lang/Factor/Fibonacci-word-fractal b/Lang/Factor/Fibonacci-word-fractal new file mode 120000 index 0000000000..5d6dde0db5 --- /dev/null +++ b/Lang/Factor/Fibonacci-word-fractal @@ -0,0 +1 @@ +../../Task/Fibonacci-word-fractal/Factor \ No newline at end of file diff --git a/Lang/Factor/Find-limit-of-recursion b/Lang/Factor/Find-limit-of-recursion new file mode 120000 index 0000000000..6671ef4924 --- /dev/null +++ b/Lang/Factor/Find-limit-of-recursion @@ -0,0 +1 @@ +../../Task/Find-limit-of-recursion/Factor \ No newline at end of file diff --git a/Lang/Factor/Floyds-triangle b/Lang/Factor/Floyds-triangle new file mode 120000 index 0000000000..caea150fc0 --- /dev/null +++ b/Lang/Factor/Floyds-triangle @@ -0,0 +1 @@ +../../Task/Floyds-triangle/Factor \ No newline at end of file diff --git a/Lang/Factor/Forest-fire b/Lang/Factor/Forest-fire new file mode 120000 index 0000000000..60f83d6e19 --- /dev/null +++ b/Lang/Factor/Forest-fire @@ -0,0 +1 @@ +../../Task/Forest-fire/Factor \ No newline at end of file diff --git a/Lang/Factor/Fractran b/Lang/Factor/Fractran new file mode 120000 index 0000000000..31364e4e07 --- /dev/null +++ b/Lang/Factor/Fractran @@ -0,0 +1 @@ +../../Task/Fractran/Factor \ No newline at end of file diff --git a/Lang/Factor/Function-frequency b/Lang/Factor/Function-frequency new file mode 120000 index 0000000000..235a1c9413 --- /dev/null +++ b/Lang/Factor/Function-frequency @@ -0,0 +1 @@ +../../Task/Function-frequency/Factor \ No newline at end of file diff --git a/Lang/Factor/Galton-box-animation b/Lang/Factor/Galton-box-animation new file mode 120000 index 0000000000..27cb87567c --- /dev/null +++ b/Lang/Factor/Galton-box-animation @@ -0,0 +1 @@ +../../Task/Galton-box-animation/Factor \ No newline at end of file diff --git a/Lang/Factor/Gamma-function b/Lang/Factor/Gamma-function new file mode 120000 index 0000000000..4e0cc68e2b --- /dev/null +++ b/Lang/Factor/Gamma-function @@ -0,0 +1 @@ +../../Task/Gamma-function/Factor \ No newline at end of file diff --git a/Lang/Factor/Generator-Exponential b/Lang/Factor/Generator-Exponential new file mode 120000 index 0000000000..bd1b3ae2f4 --- /dev/null +++ b/Lang/Factor/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/Factor \ No newline at end of file diff --git a/Lang/Factor/Heronian-triangles b/Lang/Factor/Heronian-triangles new file mode 120000 index 0000000000..2eb6629b1e --- /dev/null +++ b/Lang/Factor/Heronian-triangles @@ -0,0 +1 @@ +../../Task/Heronian-triangles/Factor \ No newline at end of file diff --git a/Lang/Factor/Hickerson-series-of-almost-integers b/Lang/Factor/Hickerson-series-of-almost-integers new file mode 120000 index 0000000000..feeee72a6a --- /dev/null +++ b/Lang/Factor/Hickerson-series-of-almost-integers @@ -0,0 +1 @@ +../../Task/Hickerson-series-of-almost-integers/Factor \ No newline at end of file diff --git a/Lang/Factor/History-variables b/Lang/Factor/History-variables new file mode 120000 index 0000000000..0b63eebb86 --- /dev/null +++ b/Lang/Factor/History-variables @@ -0,0 +1 @@ +../../Task/History-variables/Factor \ No newline at end of file diff --git a/Lang/Factor/Horizontal-sundial-calculations b/Lang/Factor/Horizontal-sundial-calculations new file mode 120000 index 0000000000..59b5eb359a --- /dev/null +++ b/Lang/Factor/Horizontal-sundial-calculations @@ -0,0 +1 @@ +../../Task/Horizontal-sundial-calculations/Factor \ No newline at end of file diff --git a/Lang/Factor/IBAN b/Lang/Factor/IBAN new file mode 120000 index 0000000000..5156847ca5 --- /dev/null +++ b/Lang/Factor/IBAN @@ -0,0 +1 @@ +../../Task/IBAN/Factor \ No newline at end of file diff --git a/Lang/Factor/Inheritance-Multiple b/Lang/Factor/Inheritance-Multiple new file mode 120000 index 0000000000..aa7ef88940 --- /dev/null +++ b/Lang/Factor/Inheritance-Multiple @@ -0,0 +1 @@ +../../Task/Inheritance-Multiple/Factor \ No newline at end of file diff --git a/Lang/Factor/Jensens-Device b/Lang/Factor/Jensens-Device new file mode 120000 index 0000000000..9ad630ec0e --- /dev/null +++ b/Lang/Factor/Jensens-Device @@ -0,0 +1 @@ +../../Task/Jensens-Device/Factor \ No newline at end of file diff --git a/Lang/Factor/List-comprehensions b/Lang/Factor/List-comprehensions new file mode 120000 index 0000000000..b9a31484d1 --- /dev/null +++ b/Lang/Factor/List-comprehensions @@ -0,0 +1 @@ +../../Task/List-comprehensions/Factor \ No newline at end of file diff --git a/Lang/Factor/Literals-Floating-point b/Lang/Factor/Literals-Floating-point new file mode 120000 index 0000000000..fc93e80ae6 --- /dev/null +++ b/Lang/Factor/Literals-Floating-point @@ -0,0 +1 @@ +../../Task/Literals-Floating-point/Factor \ No newline at end of file diff --git a/Lang/Factor/Literals-String b/Lang/Factor/Literals-String new file mode 120000 index 0000000000..7871568df8 --- /dev/null +++ b/Lang/Factor/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/Factor \ No newline at end of file diff --git a/Lang/Factor/Longest-common-subsequence b/Lang/Factor/Longest-common-subsequence new file mode 120000 index 0000000000..9652ca9a55 --- /dev/null +++ b/Lang/Factor/Longest-common-subsequence @@ -0,0 +1 @@ +../../Task/Longest-common-subsequence/Factor \ No newline at end of file diff --git a/Lang/Factor/Lucas-Lehmer-test b/Lang/Factor/Lucas-Lehmer-test new file mode 120000 index 0000000000..5e401a0c6e --- /dev/null +++ b/Lang/Factor/Lucas-Lehmer-test @@ -0,0 +1 @@ +../../Task/Lucas-Lehmer-test/Factor \ No newline at end of file diff --git a/Lang/Factor/Ludic-numbers b/Lang/Factor/Ludic-numbers new file mode 120000 index 0000000000..40f9c0b574 --- /dev/null +++ b/Lang/Factor/Ludic-numbers @@ -0,0 +1 @@ +../../Task/Ludic-numbers/Factor \ No newline at end of file diff --git a/Lang/Factor/Mad-Libs b/Lang/Factor/Mad-Libs new file mode 120000 index 0000000000..cd22e37438 --- /dev/null +++ b/Lang/Factor/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/Factor \ No newline at end of file diff --git a/Lang/Factor/Magic-squares-of-odd-order b/Lang/Factor/Magic-squares-of-odd-order new file mode 120000 index 0000000000..2e2f5d799a --- /dev/null +++ b/Lang/Factor/Magic-squares-of-odd-order @@ -0,0 +1 @@ +../../Task/Magic-squares-of-odd-order/Factor \ No newline at end of file diff --git a/Lang/Factor/Make-directory-path b/Lang/Factor/Make-directory-path new file mode 120000 index 0000000000..4a1208e209 --- /dev/null +++ b/Lang/Factor/Make-directory-path @@ -0,0 +1 @@ +../../Task/Make-directory-path/Factor \ No newline at end of file diff --git a/Lang/Factor/Maximum-triangle-path-sum b/Lang/Factor/Maximum-triangle-path-sum new file mode 120000 index 0000000000..414f6dbcdf --- /dev/null +++ b/Lang/Factor/Maximum-triangle-path-sum @@ -0,0 +1 @@ +../../Task/Maximum-triangle-path-sum/Factor \ No newline at end of file diff --git a/Lang/Factor/Morse-code b/Lang/Factor/Morse-code new file mode 120000 index 0000000000..986fc32be4 --- /dev/null +++ b/Lang/Factor/Morse-code @@ -0,0 +1 @@ +../../Task/Morse-code/Factor \ No newline at end of file diff --git a/Lang/Factor/Move-to-front-algorithm b/Lang/Factor/Move-to-front-algorithm new file mode 120000 index 0000000000..7b2f43cf09 --- /dev/null +++ b/Lang/Factor/Move-to-front-algorithm @@ -0,0 +1 @@ +../../Task/Move-to-front-algorithm/Factor \ No newline at end of file diff --git a/Lang/Factor/Nth-root b/Lang/Factor/Nth-root new file mode 120000 index 0000000000..dab8357c87 --- /dev/null +++ b/Lang/Factor/Nth-root @@ -0,0 +1 @@ +../../Task/Nth-root/Factor \ No newline at end of file diff --git a/Lang/Factor/Order-disjoint-list-items b/Lang/Factor/Order-disjoint-list-items new file mode 120000 index 0000000000..0fb72cf4cb --- /dev/null +++ b/Lang/Factor/Order-disjoint-list-items @@ -0,0 +1 @@ +../../Task/Order-disjoint-list-items/Factor \ No newline at end of file diff --git a/Lang/Factor/Pascals-triangle-Puzzle b/Lang/Factor/Pascals-triangle-Puzzle new file mode 120000 index 0000000000..e9f8ced01b --- /dev/null +++ b/Lang/Factor/Pascals-triangle-Puzzle @@ -0,0 +1 @@ +../../Task/Pascals-triangle-Puzzle/Factor \ No newline at end of file diff --git a/Lang/Factor/Percolation-Mean-cluster-density b/Lang/Factor/Percolation-Mean-cluster-density new file mode 120000 index 0000000000..3b6472671d --- /dev/null +++ b/Lang/Factor/Percolation-Mean-cluster-density @@ -0,0 +1 @@ +../../Task/Percolation-Mean-cluster-density/Factor \ No newline at end of file diff --git a/Lang/Factor/Percolation-Mean-run-density b/Lang/Factor/Percolation-Mean-run-density new file mode 120000 index 0000000000..c604c4f0b9 --- /dev/null +++ b/Lang/Factor/Percolation-Mean-run-density @@ -0,0 +1 @@ +../../Task/Percolation-Mean-run-density/Factor \ No newline at end of file diff --git a/Lang/Factor/Percolation-Site-percolation b/Lang/Factor/Percolation-Site-percolation new file mode 120000 index 0000000000..1ea42e2ae0 --- /dev/null +++ b/Lang/Factor/Percolation-Site-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Site-percolation/Factor \ No newline at end of file diff --git a/Lang/Factor/Permutations-Derangements b/Lang/Factor/Permutations-Derangements new file mode 120000 index 0000000000..fb4ae210ad --- /dev/null +++ b/Lang/Factor/Permutations-Derangements @@ -0,0 +1 @@ +../../Task/Permutations-Derangements/Factor \ No newline at end of file diff --git a/Lang/Factor/Pi b/Lang/Factor/Pi new file mode 120000 index 0000000000..3c492ab567 --- /dev/null +++ b/Lang/Factor/Pi @@ -0,0 +1 @@ +../../Task/Pi/Factor \ No newline at end of file diff --git a/Lang/Factor/Polynomial-long-division b/Lang/Factor/Polynomial-long-division new file mode 120000 index 0000000000..3024f84f08 --- /dev/null +++ b/Lang/Factor/Polynomial-long-division @@ -0,0 +1 @@ +../../Task/Polynomial-long-division/Factor \ No newline at end of file diff --git a/Lang/Factor/Quickselect-algorithm b/Lang/Factor/Quickselect-algorithm new file mode 120000 index 0000000000..cc56215a38 --- /dev/null +++ b/Lang/Factor/Quickselect-algorithm @@ -0,0 +1 @@ +../../Task/Quickselect-algorithm/Factor \ No newline at end of file diff --git a/Lang/Factor/RIPEMD-160 b/Lang/Factor/RIPEMD-160 new file mode 120000 index 0000000000..042b695857 --- /dev/null +++ b/Lang/Factor/RIPEMD-160 @@ -0,0 +1 @@ +../../Task/RIPEMD-160/Factor \ No newline at end of file diff --git a/Lang/Factor/Random-number-generator--device- b/Lang/Factor/Random-number-generator--device- new file mode 120000 index 0000000000..c1dece75e9 --- /dev/null +++ b/Lang/Factor/Random-number-generator--device- @@ -0,0 +1 @@ +../../Task/Random-number-generator--device-/Factor \ No newline at end of file diff --git a/Lang/Factor/Range-expansion b/Lang/Factor/Range-expansion new file mode 120000 index 0000000000..79fae7034a --- /dev/null +++ b/Lang/Factor/Range-expansion @@ -0,0 +1 @@ +../../Task/Range-expansion/Factor \ No newline at end of file diff --git a/Lang/Factor/Read-a-specific-line-from-a-file b/Lang/Factor/Read-a-specific-line-from-a-file new file mode 120000 index 0000000000..1268ed55c5 --- /dev/null +++ b/Lang/Factor/Read-a-specific-line-from-a-file @@ -0,0 +1 @@ +../../Task/Read-a-specific-line-from-a-file/Factor \ No newline at end of file diff --git a/Lang/Factor/Reduced-row-echelon-form b/Lang/Factor/Reduced-row-echelon-form new file mode 120000 index 0000000000..556fd1f23d --- /dev/null +++ b/Lang/Factor/Reduced-row-echelon-form @@ -0,0 +1 @@ +../../Task/Reduced-row-echelon-form/Factor \ No newline at end of file diff --git a/Lang/Factor/Rock-paper-scissors b/Lang/Factor/Rock-paper-scissors new file mode 120000 index 0000000000..4d568c1410 --- /dev/null +++ b/Lang/Factor/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/Factor \ No newline at end of file diff --git a/Lang/Factor/Roman-numerals-Decode b/Lang/Factor/Roman-numerals-Decode new file mode 120000 index 0000000000..6d405b386b --- /dev/null +++ b/Lang/Factor/Roman-numerals-Decode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Decode/Factor \ No newline at end of file diff --git a/Lang/Factor/Runtime-evaluation-In-an-environment b/Lang/Factor/Runtime-evaluation-In-an-environment new file mode 120000 index 0000000000..5156097564 --- /dev/null +++ b/Lang/Factor/Runtime-evaluation-In-an-environment @@ -0,0 +1 @@ +../../Task/Runtime-evaluation-In-an-environment/Factor \ No newline at end of file diff --git a/Lang/Factor/S-Expressions b/Lang/Factor/S-Expressions new file mode 120000 index 0000000000..376e213fce --- /dev/null +++ b/Lang/Factor/S-Expressions @@ -0,0 +1 @@ +../../Task/S-Expressions/Factor \ No newline at end of file diff --git a/Lang/Factor/SEDOLs b/Lang/Factor/SEDOLs new file mode 120000 index 0000000000..4e8338af28 --- /dev/null +++ b/Lang/Factor/SEDOLs @@ -0,0 +1 @@ +../../Task/SEDOLs/Factor \ No newline at end of file diff --git a/Lang/Factor/Semordnilap b/Lang/Factor/Semordnilap new file mode 120000 index 0000000000..9ad2e2a2d1 --- /dev/null +++ b/Lang/Factor/Semordnilap @@ -0,0 +1 @@ +../../Task/Semordnilap/Factor \ No newline at end of file diff --git a/Lang/Factor/Send-an-unknown-method-call b/Lang/Factor/Send-an-unknown-method-call new file mode 120000 index 0000000000..fcb44018b2 --- /dev/null +++ b/Lang/Factor/Send-an-unknown-method-call @@ -0,0 +1 @@ +../../Task/Send-an-unknown-method-call/Factor \ No newline at end of file diff --git a/Lang/Factor/Sierpinski-triangle-Graphical b/Lang/Factor/Sierpinski-triangle-Graphical new file mode 120000 index 0000000000..86661ecd33 --- /dev/null +++ b/Lang/Factor/Sierpinski-triangle-Graphical @@ -0,0 +1 @@ +../../Task/Sierpinski-triangle-Graphical/Factor \ No newline at end of file diff --git a/Lang/Factor/Sieve-of-Eratosthenes b/Lang/Factor/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..9718cf7a83 --- /dev/null +++ b/Lang/Factor/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Factor \ No newline at end of file diff --git a/Lang/Factor/Solve-the-no-connection-puzzle b/Lang/Factor/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..a7a7f37f99 --- /dev/null +++ b/Lang/Factor/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/Factor \ No newline at end of file diff --git a/Lang/Factor/Sort-disjoint-sublist b/Lang/Factor/Sort-disjoint-sublist new file mode 120000 index 0000000000..746ca67a10 --- /dev/null +++ b/Lang/Factor/Sort-disjoint-sublist @@ -0,0 +1 @@ +../../Task/Sort-disjoint-sublist/Factor \ No newline at end of file diff --git a/Lang/Factor/Sorting-algorithms-Stooge-sort b/Lang/Factor/Sorting-algorithms-Stooge-sort new file mode 120000 index 0000000000..edf2dfd656 --- /dev/null +++ b/Lang/Factor/Sorting-algorithms-Stooge-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Stooge-sort/Factor \ No newline at end of file diff --git a/Lang/Factor/Soundex b/Lang/Factor/Soundex new file mode 120000 index 0000000000..1a030d9c6d --- /dev/null +++ b/Lang/Factor/Soundex @@ -0,0 +1 @@ +../../Task/Soundex/Factor \ No newline at end of file diff --git a/Lang/Factor/Spiral-matrix b/Lang/Factor/Spiral-matrix new file mode 120000 index 0000000000..26e92aa9cb --- /dev/null +++ b/Lang/Factor/Spiral-matrix @@ -0,0 +1 @@ +../../Task/Spiral-matrix/Factor \ No newline at end of file diff --git a/Lang/Factor/Stack-traces b/Lang/Factor/Stack-traces new file mode 120000 index 0000000000..732413cb77 --- /dev/null +++ b/Lang/Factor/Stack-traces @@ -0,0 +1 @@ +../../Task/Stack-traces/Factor \ No newline at end of file diff --git a/Lang/Factor/Stair-climbing-puzzle b/Lang/Factor/Stair-climbing-puzzle new file mode 120000 index 0000000000..a32033093c --- /dev/null +++ b/Lang/Factor/Stair-climbing-puzzle @@ -0,0 +1 @@ +../../Task/Stair-climbing-puzzle/Factor \ No newline at end of file diff --git a/Lang/Factor/Stem-and-leaf-plot b/Lang/Factor/Stem-and-leaf-plot new file mode 120000 index 0000000000..97a634c366 --- /dev/null +++ b/Lang/Factor/Stem-and-leaf-plot @@ -0,0 +1 @@ +../../Task/Stem-and-leaf-plot/Factor \ No newline at end of file diff --git a/Lang/Factor/String-matching b/Lang/Factor/String-matching new file mode 120000 index 0000000000..47a1600490 --- /dev/null +++ b/Lang/Factor/String-matching @@ -0,0 +1 @@ +../../Task/String-matching/Factor \ No newline at end of file diff --git a/Lang/Factor/Trigonometric-functions b/Lang/Factor/Trigonometric-functions new file mode 120000 index 0000000000..379e81764c --- /dev/null +++ b/Lang/Factor/Trigonometric-functions @@ -0,0 +1 @@ +../../Task/Trigonometric-functions/Factor \ No newline at end of file diff --git a/Lang/Factor/URL-encoding b/Lang/Factor/URL-encoding new file mode 120000 index 0000000000..843ecf1165 --- /dev/null +++ b/Lang/Factor/URL-encoding @@ -0,0 +1 @@ +../../Task/URL-encoding/Factor \ No newline at end of file diff --git a/Lang/Factor/Ulam-spiral--for-primes- b/Lang/Factor/Ulam-spiral--for-primes- new file mode 120000 index 0000000000..77bb779c0d --- /dev/null +++ b/Lang/Factor/Ulam-spiral--for-primes- @@ -0,0 +1 @@ +../../Task/Ulam-spiral--for-primes-/Factor \ No newline at end of file diff --git a/Lang/Factor/Unbias-a-random-generator b/Lang/Factor/Unbias-a-random-generator new file mode 120000 index 0000000000..7490f7c482 --- /dev/null +++ b/Lang/Factor/Unbias-a-random-generator @@ -0,0 +1 @@ +../../Task/Unbias-a-random-generator/Factor \ No newline at end of file diff --git a/Lang/Factor/Unicode-variable-names b/Lang/Factor/Unicode-variable-names new file mode 120000 index 0000000000..85ce12aadf --- /dev/null +++ b/Lang/Factor/Unicode-variable-names @@ -0,0 +1 @@ +../../Task/Unicode-variable-names/Factor \ No newline at end of file diff --git a/Lang/Factor/Van-der-Corput-sequence b/Lang/Factor/Van-der-Corput-sequence new file mode 120000 index 0000000000..258108006b --- /dev/null +++ b/Lang/Factor/Van-der-Corput-sequence @@ -0,0 +1 @@ +../../Task/Van-der-Corput-sequence/Factor \ No newline at end of file diff --git a/Lang/Factor/Visualize-a-tree b/Lang/Factor/Visualize-a-tree new file mode 120000 index 0000000000..0eb0aef4dd --- /dev/null +++ b/Lang/Factor/Visualize-a-tree @@ -0,0 +1 @@ +../../Task/Visualize-a-tree/Factor \ No newline at end of file diff --git a/Lang/Factor/Zeckendorf-number-representation b/Lang/Factor/Zeckendorf-number-representation new file mode 120000 index 0000000000..aa883fec38 --- /dev/null +++ b/Lang/Factor/Zeckendorf-number-representation @@ -0,0 +1 @@ +../../Task/Zeckendorf-number-representation/Factor \ No newline at end of file diff --git a/Lang/Factor/Zig-zag-matrix b/Lang/Factor/Zig-zag-matrix new file mode 120000 index 0000000000..9dafadb911 --- /dev/null +++ b/Lang/Factor/Zig-zag-matrix @@ -0,0 +1 @@ +../../Task/Zig-zag-matrix/Factor \ No newline at end of file diff --git a/Lang/Fish/100-doors b/Lang/Fish/100-doors new file mode 120000 index 0000000000..b86cdfba51 --- /dev/null +++ b/Lang/Fish/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Fish \ No newline at end of file diff --git a/Lang/Fish/Function-definition b/Lang/Fish/Function-definition new file mode 120000 index 0000000000..41c71ef7ac --- /dev/null +++ b/Lang/Fish/Function-definition @@ -0,0 +1 @@ +../../Task/Function-definition/Fish \ No newline at end of file diff --git a/Lang/Fish/Generic-swap b/Lang/Fish/Generic-swap new file mode 120000 index 0000000000..9066668ec1 --- /dev/null +++ b/Lang/Fish/Generic-swap @@ -0,0 +1 @@ +../../Task/Generic-swap/Fish \ No newline at end of file diff --git a/Lang/Fish/Loops-Infinite b/Lang/Fish/Loops-Infinite new file mode 120000 index 0000000000..1ed3f916a1 --- /dev/null +++ b/Lang/Fish/Loops-Infinite @@ -0,0 +1 @@ +../../Task/Loops-Infinite/Fish \ No newline at end of file diff --git a/Lang/Fish/Sum-of-a-series b/Lang/Fish/Sum-of-a-series new file mode 120000 index 0000000000..8a45ce7cee --- /dev/null +++ b/Lang/Fish/Sum-of-a-series @@ -0,0 +1 @@ +../../Task/Sum-of-a-series/Fish \ No newline at end of file diff --git a/Lang/Forth/Colour-bars-Display b/Lang/Forth/Colour-bars-Display new file mode 120000 index 0000000000..a7809bfcf1 --- /dev/null +++ b/Lang/Forth/Colour-bars-Display @@ -0,0 +1 @@ +../../Task/Colour-bars-Display/Forth \ No newline at end of file diff --git a/Lang/Forth/Draw-a-clock b/Lang/Forth/Draw-a-clock new file mode 120000 index 0000000000..9a04459959 --- /dev/null +++ b/Lang/Forth/Draw-a-clock @@ -0,0 +1 @@ +../../Task/Draw-a-clock/Forth \ No newline at end of file diff --git a/Lang/Forth/Langtons-ant b/Lang/Forth/Langtons-ant new file mode 120000 index 0000000000..a7825550e0 --- /dev/null +++ b/Lang/Forth/Langtons-ant @@ -0,0 +1 @@ +../../Task/Langtons-ant/Forth \ No newline at end of file diff --git a/Lang/Forth/Man-or-boy-test b/Lang/Forth/Man-or-boy-test new file mode 120000 index 0000000000..6ee2ec9283 --- /dev/null +++ b/Lang/Forth/Man-or-boy-test @@ -0,0 +1 @@ +../../Task/Man-or-boy-test/Forth \ No newline at end of file diff --git a/Lang/Forth/Menu b/Lang/Forth/Menu new file mode 120000 index 0000000000..9b6659f10e --- /dev/null +++ b/Lang/Forth/Menu @@ -0,0 +1 @@ +../../Task/Menu/Forth \ No newline at end of file diff --git a/Lang/Forth/Narcissistic-decimal-number b/Lang/Forth/Narcissistic-decimal-number new file mode 120000 index 0000000000..d49fa98d8e --- /dev/null +++ b/Lang/Forth/Narcissistic-decimal-number @@ -0,0 +1 @@ +../../Task/Narcissistic-decimal-number/Forth \ No newline at end of file diff --git a/Lang/Forth/Ulam-spiral--for-primes- b/Lang/Forth/Ulam-spiral--for-primes- new file mode 120000 index 0000000000..81f5015c79 --- /dev/null +++ b/Lang/Forth/Ulam-spiral--for-primes- @@ -0,0 +1 @@ +../../Task/Ulam-spiral--for-primes-/Forth \ No newline at end of file diff --git a/Lang/Forth/Variable-size-Get b/Lang/Forth/Variable-size-Get new file mode 120000 index 0000000000..c99a496ba4 --- /dev/null +++ b/Lang/Forth/Variable-size-Get @@ -0,0 +1 @@ +../../Task/Variable-size-Get/Forth \ No newline at end of file diff --git a/Lang/Fortran/00DESCRIPTION b/Lang/Fortran/00DESCRIPTION index fbd223967c..a84f69d474 100644 --- a/Lang/Fortran/00DESCRIPTION +++ b/Lang/Fortran/00DESCRIPTION @@ -7,7 +7,7 @@ |LCT=yes |tags=fortran |bnf=http://fortran.comsci.us/syntax/statement/index.html}}{{language programming paradigm|Imperative}}{{Language programming paradigm|Procedural}}{{Language programming paradigm|Object-oriented}}{{Language programming paradigm|Concurrent}} -Fortran is the oldest programming language still in widespread use. The language has evolved considerably since it was first released in 1957. Fortran was original developed for scientific and engineering applications, and remains especially suited to numeric computation and scientific computing. By convention, versions before Fortran 90 are spelled with all uppercase letters (e.g. FORTRAN IV, FORTRAN 66, FORTRAN 77), while starting with Fortran 90, the mixed case spelling is used (i.e. Fortran 90, Fortran 95, Fortran 2003 and [http://j3-fortran.org/doc/year/12/12-007.pdf Fortran 2008]). The most recent standard is Fortran 2008 (ISO/IEC 1539-1:2010). The next, informally known as [https://j3-fortran.org/doc/year/18/18-007.pdf Fortran 2018], is underway. +Fortran is the oldest programming language still in widespread use. The language has evolved considerably since it was first released in 1957. Fortran was original developed for scientific and engineering applications, and remains especially suited to numeric computation and scientific computing. By convention, versions before Fortran 90 are spelled with all uppercase letters (e.g. FORTRAN IV, FORTRAN 66, FORTRAN 77), while starting with Fortran 90, the mixed case spelling is used (i.e. Fortran 90, Fortran 95, Fortran 2003 and [http://j3-fortran.org/doc/year/12/12-007.pdf Fortran 2008]). The most recent standard is [https://j3-fortran.org/doc/year/18/18-007r1.pdf Fortran 2018] (ISO/IEC 1539-1:2018). FORTRAN 77, being quite old, lacks almost everything one expects from a modern programming language. It uses a fixed-length line and column oriented line format which was motivated by punch cards. Due to its age, and since FORTRAN compilers generally gave very good performance for numerical code, a lot of code, especially scientific code, was written in FORTRAN. Also, for quite a while there was no free Fortran 90 compiler, which also caused a lot of FORTRAN 77 code to be written even quite some time after Fortran 90 was standardized. Because of the large body of code written in FORTRAN 77 it remains relevant today. Indeed, every modern Fortran compiler still accepts FORTRAN 77 code. diff --git a/Lang/Fortran/Stern-Brocot-sequence b/Lang/Fortran/Stern-Brocot-sequence new file mode 120000 index 0000000000..60536997ac --- /dev/null +++ b/Lang/Fortran/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/Fortran \ No newline at end of file diff --git a/Lang/Free-Pascal/100-doors b/Lang/Free-Pascal/100-doors new file mode 120000 index 0000000000..db8350388a --- /dev/null +++ b/Lang/Free-Pascal/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Array-concatenation b/Lang/Free-Pascal/Array-concatenation new file mode 120000 index 0000000000..abd37a2995 --- /dev/null +++ b/Lang/Free-Pascal/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Associative-array-Creation b/Lang/Free-Pascal/Associative-array-Creation new file mode 120000 index 0000000000..b9b7bd71d4 --- /dev/null +++ b/Lang/Free-Pascal/Associative-array-Creation @@ -0,0 +1 @@ +../../Task/Associative-array-Creation/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Associative-array-Iteration b/Lang/Free-Pascal/Associative-array-Iteration new file mode 120000 index 0000000000..74c3ee20de --- /dev/null +++ b/Lang/Free-Pascal/Associative-array-Iteration @@ -0,0 +1 @@ +../../Task/Associative-array-Iteration/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Binary-digits b/Lang/Free-Pascal/Binary-digits new file mode 120000 index 0000000000..5bd65f191f --- /dev/null +++ b/Lang/Free-Pascal/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Bitwise-operations b/Lang/Free-Pascal/Bitwise-operations new file mode 120000 index 0000000000..ef50fbc623 --- /dev/null +++ b/Lang/Free-Pascal/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Casting-out-nines b/Lang/Free-Pascal/Casting-out-nines new file mode 120000 index 0000000000..ecff53bbea --- /dev/null +++ b/Lang/Free-Pascal/Casting-out-nines @@ -0,0 +1 @@ +../../Task/Casting-out-nines/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Define-a-primitive-data-type b/Lang/Free-Pascal/Define-a-primitive-data-type new file mode 120000 index 0000000000..58a82f46e3 --- /dev/null +++ b/Lang/Free-Pascal/Define-a-primitive-data-type @@ -0,0 +1 @@ +../../Task/Define-a-primitive-data-type/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Delete-a-file b/Lang/Free-Pascal/Delete-a-file new file mode 120000 index 0000000000..92b660ac07 --- /dev/null +++ b/Lang/Free-Pascal/Delete-a-file @@ -0,0 +1 @@ +../../Task/Delete-a-file/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Determine-if-a-string-is-numeric b/Lang/Free-Pascal/Determine-if-a-string-is-numeric new file mode 120000 index 0000000000..7ff025256c --- /dev/null +++ b/Lang/Free-Pascal/Determine-if-a-string-is-numeric @@ -0,0 +1 @@ +../../Task/Determine-if-a-string-is-numeric/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Empty-string b/Lang/Free-Pascal/Empty-string new file mode 120000 index 0000000000..a6f5937c48 --- /dev/null +++ b/Lang/Free-Pascal/Empty-string @@ -0,0 +1 @@ +../../Task/Empty-string/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Extend-your-language b/Lang/Free-Pascal/Extend-your-language new file mode 120000 index 0000000000..4b51955c28 --- /dev/null +++ b/Lang/Free-Pascal/Extend-your-language @@ -0,0 +1 @@ +../../Task/Extend-your-language/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Fibonacci-sequence b/Lang/Free-Pascal/Fibonacci-sequence new file mode 120000 index 0000000000..b3a6c2d9af --- /dev/null +++ b/Lang/Free-Pascal/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Generate-lower-case-ASCII-alphabet b/Lang/Free-Pascal/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..0f8434f8ea --- /dev/null +++ b/Lang/Free-Pascal/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Generic-swap b/Lang/Free-Pascal/Generic-swap new file mode 120000 index 0000000000..4e99f1ff9d --- /dev/null +++ b/Lang/Free-Pascal/Generic-swap @@ -0,0 +1 @@ +../../Task/Generic-swap/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Haversine-formula b/Lang/Free-Pascal/Haversine-formula new file mode 120000 index 0000000000..e1cebf3e07 --- /dev/null +++ b/Lang/Free-Pascal/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Hello-world-Web-server b/Lang/Free-Pascal/Hello-world-Web-server new file mode 120000 index 0000000000..8c119c6a91 --- /dev/null +++ b/Lang/Free-Pascal/Hello-world-Web-server @@ -0,0 +1 @@ +../../Task/Hello-world-Web-server/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Memory-layout-of-a-data-structure b/Lang/Free-Pascal/Memory-layout-of-a-data-structure new file mode 120000 index 0000000000..8ed508e29a --- /dev/null +++ b/Lang/Free-Pascal/Memory-layout-of-a-data-structure @@ -0,0 +1 @@ +../../Task/Memory-layout-of-a-data-structure/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Queue-Definition b/Lang/Free-Pascal/Queue-Definition new file mode 120000 index 0000000000..b647cdc227 --- /dev/null +++ b/Lang/Free-Pascal/Queue-Definition @@ -0,0 +1 @@ +../../Task/Queue-Definition/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Random-number-generator--included- b/Lang/Free-Pascal/Random-number-generator--included- new file mode 120000 index 0000000000..835d71d4ca --- /dev/null +++ b/Lang/Free-Pascal/Random-number-generator--included- @@ -0,0 +1 @@ +../../Task/Random-number-generator--included-/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Repeat-a-string b/Lang/Free-Pascal/Repeat-a-string new file mode 120000 index 0000000000..4c4f838c05 --- /dev/null +++ b/Lang/Free-Pascal/Repeat-a-string @@ -0,0 +1 @@ +../../Task/Repeat-a-string/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/SHA-256 b/Lang/Free-Pascal/SHA-256 new file mode 120000 index 0000000000..6719226606 --- /dev/null +++ b/Lang/Free-Pascal/SHA-256 @@ -0,0 +1 @@ +../../Task/SHA-256/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Shell-one-liner b/Lang/Free-Pascal/Shell-one-liner new file mode 120000 index 0000000000..91f1487912 --- /dev/null +++ b/Lang/Free-Pascal/Shell-one-liner @@ -0,0 +1 @@ +../../Task/Shell-one-liner/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Sieve-of-Eratosthenes b/Lang/Free-Pascal/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..33306d2151 --- /dev/null +++ b/Lang/Free-Pascal/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Stack b/Lang/Free-Pascal/Stack new file mode 120000 index 0000000000..f311a692c2 --- /dev/null +++ b/Lang/Free-Pascal/Stack @@ -0,0 +1 @@ +../../Task/Stack/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Substring b/Lang/Free-Pascal/Substring new file mode 120000 index 0000000000..3007e4622d --- /dev/null +++ b/Lang/Free-Pascal/Substring @@ -0,0 +1 @@ +../../Task/Substring/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Ternary-logic b/Lang/Free-Pascal/Ternary-logic new file mode 120000 index 0000000000..a85325d392 --- /dev/null +++ b/Lang/Free-Pascal/Ternary-logic @@ -0,0 +1 @@ +../../Task/Ternary-logic/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/URL-decoding b/Lang/Free-Pascal/URL-decoding new file mode 120000 index 0000000000..5d09877aa3 --- /dev/null +++ b/Lang/Free-Pascal/URL-decoding @@ -0,0 +1 @@ +../../Task/URL-decoding/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/URL-encoding b/Lang/Free-Pascal/URL-encoding new file mode 120000 index 0000000000..044f8a9bca --- /dev/null +++ b/Lang/Free-Pascal/URL-encoding @@ -0,0 +1 @@ +../../Task/URL-encoding/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Variable-size-Set b/Lang/Free-Pascal/Variable-size-Set new file mode 120000 index 0000000000..c8bacd653d --- /dev/null +++ b/Lang/Free-Pascal/Variable-size-Set @@ -0,0 +1 @@ +../../Task/Variable-size-Set/Free-Pascal \ No newline at end of file diff --git a/Lang/Free-Pascal/Variadic-function b/Lang/Free-Pascal/Variadic-function new file mode 120000 index 0000000000..44fe18ff12 --- /dev/null +++ b/Lang/Free-Pascal/Variadic-function @@ -0,0 +1 @@ +../../Task/Variadic-function/Free-Pascal \ No newline at end of file diff --git a/Lang/FreeBASIC/24-game b/Lang/FreeBASIC/24-game new file mode 120000 index 0000000000..dc8fd444d8 --- /dev/null +++ b/Lang/FreeBASIC/24-game @@ -0,0 +1 @@ +../../Task/24-game/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/ABC-Problem b/Lang/FreeBASIC/ABC-Problem new file mode 120000 index 0000000000..e4de9e92ea --- /dev/null +++ b/Lang/FreeBASIC/ABC-Problem @@ -0,0 +1 @@ +../../Task/ABC-Problem/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Closest-pair-problem b/Lang/FreeBASIC/Closest-pair-problem new file mode 120000 index 0000000000..7bc440e68d --- /dev/null +++ b/Lang/FreeBASIC/Closest-pair-problem @@ -0,0 +1 @@ +../../Task/Closest-pair-problem/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Dutch-national-flag-problem b/Lang/FreeBASIC/Dutch-national-flag-problem new file mode 120000 index 0000000000..100d7ccc8f --- /dev/null +++ b/Lang/FreeBASIC/Dutch-national-flag-problem @@ -0,0 +1 @@ +../../Task/Dutch-national-flag-problem/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Execute-Brain---- b/Lang/FreeBASIC/Execute-Brain---- new file mode 120000 index 0000000000..5e4b14a0ea --- /dev/null +++ b/Lang/FreeBASIC/Execute-Brain---- @@ -0,0 +1 @@ +../../Task/Execute-Brain----/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Execute-HQ9+ b/Lang/FreeBASIC/Execute-HQ9+ new file mode 120000 index 0000000000..b3162b0671 --- /dev/null +++ b/Lang/FreeBASIC/Execute-HQ9+ @@ -0,0 +1 @@ +../../Task/Execute-HQ9+/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Find-common-directory-path b/Lang/FreeBASIC/Find-common-directory-path new file mode 120000 index 0000000000..22cf4be7c5 --- /dev/null +++ b/Lang/FreeBASIC/Find-common-directory-path @@ -0,0 +1 @@ +../../Task/Find-common-directory-path/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Generate-Chess960-starting-position b/Lang/FreeBASIC/Generate-Chess960-starting-position new file mode 120000 index 0000000000..843fb2a3a4 --- /dev/null +++ b/Lang/FreeBASIC/Generate-Chess960-starting-position @@ -0,0 +1 @@ +../../Task/Generate-Chess960-starting-position/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Go-Fish b/Lang/FreeBASIC/Go-Fish new file mode 120000 index 0000000000..05ac1fde08 --- /dev/null +++ b/Lang/FreeBASIC/Go-Fish @@ -0,0 +1 @@ +../../Task/Go-Fish/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Hofstadter-Q-sequence b/Lang/FreeBASIC/Hofstadter-Q-sequence new file mode 120000 index 0000000000..efe46f76c5 --- /dev/null +++ b/Lang/FreeBASIC/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Horners-rule-for-polynomial-evaluation b/Lang/FreeBASIC/Horners-rule-for-polynomial-evaluation new file mode 120000 index 0000000000..060a1c4dd0 --- /dev/null +++ b/Lang/FreeBASIC/Horners-rule-for-polynomial-evaluation @@ -0,0 +1 @@ +../../Task/Horners-rule-for-polynomial-evaluation/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Josephus-problem b/Lang/FreeBASIC/Josephus-problem new file mode 120000 index 0000000000..dcd48a9ee5 --- /dev/null +++ b/Lang/FreeBASIC/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Knights-tour b/Lang/FreeBASIC/Knights-tour new file mode 120000 index 0000000000..362b4b5cb8 --- /dev/null +++ b/Lang/FreeBASIC/Knights-tour @@ -0,0 +1 @@ +../../Task/Knights-tour/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/LZW-compression b/Lang/FreeBASIC/LZW-compression new file mode 120000 index 0000000000..bda90e80d7 --- /dev/null +++ b/Lang/FreeBASIC/LZW-compression @@ -0,0 +1 @@ +../../Task/LZW-compression/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Literals-String b/Lang/FreeBASIC/Literals-String new file mode 120000 index 0000000000..57e8fd233f --- /dev/null +++ b/Lang/FreeBASIC/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Look-and-say-sequence b/Lang/FreeBASIC/Look-and-say-sequence new file mode 120000 index 0000000000..15da36ed2b --- /dev/null +++ b/Lang/FreeBASIC/Look-and-say-sequence @@ -0,0 +1 @@ +../../Task/Look-and-say-sequence/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Mad-Libs b/Lang/FreeBASIC/Mad-Libs new file mode 120000 index 0000000000..33e1bd2e83 --- /dev/null +++ b/Lang/FreeBASIC/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Modular-exponentiation b/Lang/FreeBASIC/Modular-exponentiation new file mode 120000 index 0000000000..5583f3383a --- /dev/null +++ b/Lang/FreeBASIC/Modular-exponentiation @@ -0,0 +1 @@ +../../Task/Modular-exponentiation/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Monty-Hall-problem b/Lang/FreeBASIC/Monty-Hall-problem new file mode 120000 index 0000000000..c0e6f1eb5d --- /dev/null +++ b/Lang/FreeBASIC/Monty-Hall-problem @@ -0,0 +1 @@ +../../Task/Monty-Hall-problem/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Nth-root b/Lang/FreeBASIC/Nth-root new file mode 120000 index 0000000000..f8dbaa26dc --- /dev/null +++ b/Lang/FreeBASIC/Nth-root @@ -0,0 +1 @@ +../../Task/Nth-root/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Pig-the-dice-game b/Lang/FreeBASIC/Pig-the-dice-game new file mode 120000 index 0000000000..a44ab82139 --- /dev/null +++ b/Lang/FreeBASIC/Pig-the-dice-game @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Quaternion-type b/Lang/FreeBASIC/Quaternion-type new file mode 120000 index 0000000000..f82c3a440e --- /dev/null +++ b/Lang/FreeBASIC/Quaternion-type @@ -0,0 +1 @@ +../../Task/Quaternion-type/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Quine b/Lang/FreeBASIC/Quine new file mode 120000 index 0000000000..27b90cefcd --- /dev/null +++ b/Lang/FreeBASIC/Quine @@ -0,0 +1 @@ +../../Task/Quine/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Run-length-encoding b/Lang/FreeBASIC/Run-length-encoding new file mode 120000 index 0000000000..d2bc1f6437 --- /dev/null +++ b/Lang/FreeBASIC/Run-length-encoding @@ -0,0 +1 @@ +../../Task/Run-length-encoding/FreeBASIC \ No newline at end of file diff --git a/Lang/FreeBASIC/Stern-Brocot-sequence b/Lang/FreeBASIC/Stern-Brocot-sequence new file mode 120000 index 0000000000..349555c759 --- /dev/null +++ b/Lang/FreeBASIC/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/FreeBASIC \ No newline at end of file diff --git a/Lang/Frink/Amicable-pairs b/Lang/Frink/Amicable-pairs new file mode 120000 index 0000000000..f5770d3195 --- /dev/null +++ b/Lang/Frink/Amicable-pairs @@ -0,0 +1 @@ +../../Task/Amicable-pairs/Frink \ No newline at end of file diff --git a/Lang/Futhark/Associative-array-Creation b/Lang/Futhark/Associative-array-Creation new file mode 120000 index 0000000000..ebbd3242ab --- /dev/null +++ b/Lang/Futhark/Associative-array-Creation @@ -0,0 +1 @@ +../../Task/Associative-array-Creation/Futhark \ No newline at end of file diff --git a/Lang/Futhark/QR-decomposition b/Lang/Futhark/QR-decomposition new file mode 120000 index 0000000000..6ab31d605f --- /dev/null +++ b/Lang/Futhark/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/Futhark \ No newline at end of file diff --git a/Lang/GAP/Quine b/Lang/GAP/Quine new file mode 120000 index 0000000000..15db795c53 --- /dev/null +++ b/Lang/GAP/Quine @@ -0,0 +1 @@ +../../Task/Quine/GAP \ No newline at end of file diff --git a/Lang/GAP/Zebra-puzzle b/Lang/GAP/Zebra-puzzle new file mode 120000 index 0000000000..0d9406e523 --- /dev/null +++ b/Lang/GAP/Zebra-puzzle @@ -0,0 +1 @@ +../../Task/Zebra-puzzle/GAP \ No newline at end of file diff --git a/Lang/GLSL/Classes b/Lang/GLSL/Classes new file mode 120000 index 0000000000..684cdf4c9f --- /dev/null +++ b/Lang/GLSL/Classes @@ -0,0 +1 @@ +../../Task/Classes/GLSL \ No newline at end of file diff --git a/Lang/GLSL/Dot-product b/Lang/GLSL/Dot-product new file mode 120000 index 0000000000..0d1ca3588a --- /dev/null +++ b/Lang/GLSL/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/GLSL \ No newline at end of file diff --git a/Lang/GLSL/Vector-products b/Lang/GLSL/Vector-products new file mode 120000 index 0000000000..88341f24e8 --- /dev/null +++ b/Lang/GLSL/Vector-products @@ -0,0 +1 @@ +../../Task/Vector-products/GLSL \ No newline at end of file diff --git a/Lang/GW-BASIC/Loops-For b/Lang/GW-BASIC/Loops-For new file mode 120000 index 0000000000..5767da5545 --- /dev/null +++ b/Lang/GW-BASIC/Loops-For @@ -0,0 +1 @@ +../../Task/Loops-For/GW-BASIC \ No newline at end of file diff --git a/Lang/Gambas/Factorial b/Lang/Gambas/Factorial new file mode 120000 index 0000000000..66c4f0c627 --- /dev/null +++ b/Lang/Gambas/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Gambas \ No newline at end of file diff --git a/Lang/Go/00DESCRIPTION b/Lang/Go/00DESCRIPTION index 81c0f9132c..5d3553ff07 100644 --- a/Lang/Go/00DESCRIPTION +++ b/Lang/Go/00DESCRIPTION @@ -23,7 +23,4 @@ Not to be confused with [[:Category:Go!|Go!]] * [http://tour.golang.org/ Go Tour and Tutorial] * [http://golang.org/ref/spec Go language specification] * [http://golang.org/pkg/ Go standard library documentation] -* [https://github.com/golang/go/wiki/ Community maintained Go wiki] - -==Todo== -[[Reports:Tasks_not_implemented_in_Go]] \ No newline at end of file +* [https://github.com/golang/go/wiki/ Community maintained Go wiki] \ No newline at end of file diff --git a/Lang/Go/Active-Directory-Connect b/Lang/Go/Active-Directory-Connect new file mode 120000 index 0000000000..d8f0d28417 --- /dev/null +++ b/Lang/Go/Active-Directory-Connect @@ -0,0 +1 @@ +../../Task/Active-Directory-Connect/Go \ No newline at end of file diff --git a/Lang/Go/Active-Directory-Search-for-a-user b/Lang/Go/Active-Directory-Search-for-a-user new file mode 120000 index 0000000000..473ba5dd77 --- /dev/null +++ b/Lang/Go/Active-Directory-Search-for-a-user @@ -0,0 +1 @@ +../../Task/Active-Directory-Search-for-a-user/Go \ No newline at end of file diff --git a/Lang/Go/Add-a-variable-to-a-class-instance-at-runtime b/Lang/Go/Add-a-variable-to-a-class-instance-at-runtime new file mode 120000 index 0000000000..0b3595bc51 --- /dev/null +++ b/Lang/Go/Add-a-variable-to-a-class-instance-at-runtime @@ -0,0 +1 @@ +../../Task/Add-a-variable-to-a-class-instance-at-runtime/Go \ No newline at end of file diff --git a/Lang/Go/Calendar---for-REAL-programmers b/Lang/Go/Calendar---for-REAL-programmers new file mode 120000 index 0000000000..91fefffacd --- /dev/null +++ b/Lang/Go/Calendar---for-REAL-programmers @@ -0,0 +1 @@ +../../Task/Calendar---for-REAL-programmers/Go \ No newline at end of file diff --git a/Lang/Go/Canny-edge-detector b/Lang/Go/Canny-edge-detector new file mode 120000 index 0000000000..133e0e26c4 --- /dev/null +++ b/Lang/Go/Canny-edge-detector @@ -0,0 +1 @@ +../../Task/Canny-edge-detector/Go \ No newline at end of file diff --git a/Lang/Go/Color-of-a-screen-pixel b/Lang/Go/Color-of-a-screen-pixel new file mode 120000 index 0000000000..327ee22a97 --- /dev/null +++ b/Lang/Go/Color-of-a-screen-pixel @@ -0,0 +1 @@ +../../Task/Color-of-a-screen-pixel/Go \ No newline at end of file diff --git a/Lang/Go/Colour-bars-Display b/Lang/Go/Colour-bars-Display new file mode 120000 index 0000000000..70ff2973ad --- /dev/null +++ b/Lang/Go/Colour-bars-Display @@ -0,0 +1 @@ +../../Task/Colour-bars-Display/Go \ No newline at end of file diff --git a/Lang/Go/Colour-pinstripe-Display b/Lang/Go/Colour-pinstripe-Display new file mode 120000 index 0000000000..e35899f3aa --- /dev/null +++ b/Lang/Go/Colour-pinstripe-Display @@ -0,0 +1 @@ +../../Task/Colour-pinstripe-Display/Go \ No newline at end of file diff --git a/Lang/Go/Colour-pinstripe-Printer b/Lang/Go/Colour-pinstripe-Printer new file mode 120000 index 0000000000..1d07412c75 --- /dev/null +++ b/Lang/Go/Colour-pinstripe-Printer @@ -0,0 +1 @@ +../../Task/Colour-pinstripe-Printer/Go \ No newline at end of file diff --git a/Lang/Go/Deconvolution-2D+ b/Lang/Go/Deconvolution-2D+ new file mode 120000 index 0000000000..7b2f06a5dc --- /dev/null +++ b/Lang/Go/Deconvolution-2D+ @@ -0,0 +1 @@ +../../Task/Deconvolution-2D+/Go \ No newline at end of file diff --git a/Lang/Go/Dynamic-variable-names b/Lang/Go/Dynamic-variable-names new file mode 120000 index 0000000000..9f16a42345 --- /dev/null +++ b/Lang/Go/Dynamic-variable-names @@ -0,0 +1 @@ +../../Task/Dynamic-variable-names/Go \ No newline at end of file diff --git a/Lang/Go/Fibonacci-word-fractal b/Lang/Go/Fibonacci-word-fractal new file mode 120000 index 0000000000..c45a352a34 --- /dev/null +++ b/Lang/Go/Fibonacci-word-fractal @@ -0,0 +1 @@ +../../Task/Fibonacci-word-fractal/Go \ No newline at end of file diff --git a/Lang/Go/GUI-Maximum-window-dimensions b/Lang/Go/GUI-Maximum-window-dimensions new file mode 120000 index 0000000000..dfd3056b76 --- /dev/null +++ b/Lang/Go/GUI-Maximum-window-dimensions @@ -0,0 +1 @@ +../../Task/GUI-Maximum-window-dimensions/Go \ No newline at end of file diff --git a/Lang/Go/GUI-component-interaction b/Lang/Go/GUI-component-interaction new file mode 120000 index 0000000000..2a1024973a --- /dev/null +++ b/Lang/Go/GUI-component-interaction @@ -0,0 +1 @@ +../../Task/GUI-component-interaction/Go \ No newline at end of file diff --git a/Lang/Go/GUI-enabling-disabling-of-controls b/Lang/Go/GUI-enabling-disabling-of-controls new file mode 120000 index 0000000000..6d301a4904 --- /dev/null +++ b/Lang/Go/GUI-enabling-disabling-of-controls @@ -0,0 +1 @@ +../../Task/GUI-enabling-disabling-of-controls/Go \ No newline at end of file diff --git a/Lang/Go/Greyscale-bars-Display b/Lang/Go/Greyscale-bars-Display new file mode 120000 index 0000000000..1bc2c6c6cc --- /dev/null +++ b/Lang/Go/Greyscale-bars-Display @@ -0,0 +1 @@ +../../Task/Greyscale-bars-Display/Go \ No newline at end of file diff --git a/Lang/Go/Honeycombs b/Lang/Go/Honeycombs new file mode 120000 index 0000000000..9f0f15179a --- /dev/null +++ b/Lang/Go/Honeycombs @@ -0,0 +1 @@ +../../Task/Honeycombs/Go \ No newline at end of file diff --git a/Lang/Go/Joystick-position b/Lang/Go/Joystick-position new file mode 120000 index 0000000000..9e58cd711c --- /dev/null +++ b/Lang/Go/Joystick-position @@ -0,0 +1 @@ +../../Task/Joystick-position/Go \ No newline at end of file diff --git a/Lang/Go/Keyboard-macros b/Lang/Go/Keyboard-macros new file mode 120000 index 0000000000..ae5c462c1d --- /dev/null +++ b/Lang/Go/Keyboard-macros @@ -0,0 +1 @@ +../../Task/Keyboard-macros/Go \ No newline at end of file diff --git a/Lang/Go/List-comprehensions b/Lang/Go/List-comprehensions new file mode 120000 index 0000000000..d7f8730e71 --- /dev/null +++ b/Lang/Go/List-comprehensions @@ -0,0 +1 @@ +../../Task/List-comprehensions/Go \ No newline at end of file diff --git a/Lang/Go/Machine-code b/Lang/Go/Machine-code new file mode 120000 index 0000000000..1dc501b6d6 --- /dev/null +++ b/Lang/Go/Machine-code @@ -0,0 +1 @@ +../../Task/Machine-code/Go \ No newline at end of file diff --git a/Lang/Go/Matrix-exponentiation-operator b/Lang/Go/Matrix-exponentiation-operator new file mode 120000 index 0000000000..3f60486391 --- /dev/null +++ b/Lang/Go/Matrix-exponentiation-operator @@ -0,0 +1 @@ +../../Task/Matrix-exponentiation-operator/Go \ No newline at end of file diff --git a/Lang/Go/Metaprogramming b/Lang/Go/Metaprogramming new file mode 120000 index 0000000000..8f21e249f5 --- /dev/null +++ b/Lang/Go/Metaprogramming @@ -0,0 +1 @@ +../../Task/Metaprogramming/Go \ No newline at end of file diff --git a/Lang/Go/Minesweeper-game b/Lang/Go/Minesweeper-game new file mode 120000 index 0000000000..c5195d20e9 --- /dev/null +++ b/Lang/Go/Minesweeper-game @@ -0,0 +1 @@ +../../Task/Minesweeper-game/Go \ No newline at end of file diff --git a/Lang/Go/Mouse-position b/Lang/Go/Mouse-position new file mode 120000 index 0000000000..e30e75e209 --- /dev/null +++ b/Lang/Go/Mouse-position @@ -0,0 +1 @@ +../../Task/Mouse-position/Go \ No newline at end of file diff --git a/Lang/Go/Nautical-bell b/Lang/Go/Nautical-bell new file mode 120000 index 0000000000..5b30558f52 --- /dev/null +++ b/Lang/Go/Nautical-bell @@ -0,0 +1 @@ +../../Task/Nautical-bell/Go \ No newline at end of file diff --git a/Lang/Go/OLE-Automation b/Lang/Go/OLE-Automation new file mode 120000 index 0000000000..0d33d0f5af --- /dev/null +++ b/Lang/Go/OLE-Automation @@ -0,0 +1 @@ +../../Task/OLE-Automation/Go \ No newline at end of file diff --git a/Lang/Go/Pattern-matching b/Lang/Go/Pattern-matching new file mode 120000 index 0000000000..33a5abe42b --- /dev/null +++ b/Lang/Go/Pattern-matching @@ -0,0 +1 @@ +../../Task/Pattern-matching/Go \ No newline at end of file diff --git a/Lang/Go/Pinstripe-Display b/Lang/Go/Pinstripe-Display new file mode 120000 index 0000000000..a176449e8a --- /dev/null +++ b/Lang/Go/Pinstripe-Display @@ -0,0 +1 @@ +../../Task/Pinstripe-Display/Go \ No newline at end of file diff --git a/Lang/Go/Pinstripe-Printer b/Lang/Go/Pinstripe-Printer new file mode 120000 index 0000000000..eb42885892 --- /dev/null +++ b/Lang/Go/Pinstripe-Printer @@ -0,0 +1 @@ +../../Task/Pinstripe-Printer/Go \ No newline at end of file diff --git a/Lang/Go/Play-recorded-sounds b/Lang/Go/Play-recorded-sounds new file mode 120000 index 0000000000..f51715bbf9 --- /dev/null +++ b/Lang/Go/Play-recorded-sounds @@ -0,0 +1 @@ +../../Task/Play-recorded-sounds/Go \ No newline at end of file diff --git a/Lang/Go/Record-sound b/Lang/Go/Record-sound new file mode 120000 index 0000000000..654046b6fe --- /dev/null +++ b/Lang/Go/Record-sound @@ -0,0 +1 @@ +../../Task/Record-sound/Go \ No newline at end of file diff --git a/Lang/Go/SOAP b/Lang/Go/SOAP new file mode 120000 index 0000000000..a238022b1b --- /dev/null +++ b/Lang/Go/SOAP @@ -0,0 +1 @@ +../../Task/SOAP/Go \ No newline at end of file diff --git a/Lang/Go/Simulate-input-Keyboard b/Lang/Go/Simulate-input-Keyboard new file mode 120000 index 0000000000..ceed5d3fcf --- /dev/null +++ b/Lang/Go/Simulate-input-Keyboard @@ -0,0 +1 @@ +../../Task/Simulate-input-Keyboard/Go \ No newline at end of file diff --git a/Lang/Go/Simulate-input-Mouse b/Lang/Go/Simulate-input-Mouse new file mode 120000 index 0000000000..2d9e5a90d0 --- /dev/null +++ b/Lang/Go/Simulate-input-Mouse @@ -0,0 +1 @@ +../../Task/Simulate-input-Mouse/Go \ No newline at end of file diff --git a/Lang/Go/Start-from-a-main-routine b/Lang/Go/Start-from-a-main-routine new file mode 120000 index 0000000000..594ec74300 --- /dev/null +++ b/Lang/Go/Start-from-a-main-routine @@ -0,0 +1 @@ +../../Task/Start-from-a-main-routine/Go \ No newline at end of file diff --git a/Lang/Go/Terminal-control-Positional-read b/Lang/Go/Terminal-control-Positional-read new file mode 120000 index 0000000000..f6406a558e --- /dev/null +++ b/Lang/Go/Terminal-control-Positional-read @@ -0,0 +1 @@ +../../Task/Terminal-control-Positional-read/Go \ No newline at end of file diff --git a/Lang/Go/User-input-Graphical b/Lang/Go/User-input-Graphical new file mode 120000 index 0000000000..93f3b88466 --- /dev/null +++ b/Lang/Go/User-input-Graphical @@ -0,0 +1 @@ +../../Task/User-input-Graphical/Go \ No newline at end of file diff --git a/Lang/Go/Window-management b/Lang/Go/Window-management new file mode 120000 index 0000000000..6c2433866c --- /dev/null +++ b/Lang/Go/Window-management @@ -0,0 +1 @@ +../../Task/Window-management/Go \ No newline at end of file diff --git a/Lang/Go/World-Cup-group-stage b/Lang/Go/World-Cup-group-stage new file mode 120000 index 0000000000..9a8003e3e9 --- /dev/null +++ b/Lang/Go/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/Go \ No newline at end of file diff --git a/Lang/Go/Write-to-Windows-event-log b/Lang/Go/Write-to-Windows-event-log new file mode 120000 index 0000000000..190334f78e --- /dev/null +++ b/Lang/Go/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/Go \ No newline at end of file diff --git a/Lang/Go/Zeckendorf-arithmetic b/Lang/Go/Zeckendorf-arithmetic new file mode 120000 index 0000000000..bf465dc63c --- /dev/null +++ b/Lang/Go/Zeckendorf-arithmetic @@ -0,0 +1 @@ +../../Task/Zeckendorf-arithmetic/Go \ No newline at end of file diff --git a/Lang/Golo/99-Bottles-of-Beer b/Lang/Golo/99-Bottles-of-Beer new file mode 120000 index 0000000000..bec7188a29 --- /dev/null +++ b/Lang/Golo/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/Golo \ No newline at end of file diff --git a/Lang/Golo/A+B b/Lang/Golo/A+B new file mode 120000 index 0000000000..8a8a284a93 --- /dev/null +++ b/Lang/Golo/A+B @@ -0,0 +1 @@ +../../Task/A+B/Golo \ No newline at end of file diff --git a/Lang/Golo/Bulls-and-cows b/Lang/Golo/Bulls-and-cows new file mode 120000 index 0000000000..1635169a3f --- /dev/null +++ b/Lang/Golo/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/Golo \ No newline at end of file diff --git a/Lang/Golo/Polymorphism b/Lang/Golo/Polymorphism new file mode 120000 index 0000000000..29696640d9 --- /dev/null +++ b/Lang/Golo/Polymorphism @@ -0,0 +1 @@ +../../Task/Polymorphism/Golo \ No newline at end of file diff --git a/Lang/Golo/Roman-numerals-Decode b/Lang/Golo/Roman-numerals-Decode new file mode 120000 index 0000000000..c045c87f1d --- /dev/null +++ b/Lang/Golo/Roman-numerals-Decode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Decode/Golo \ No newline at end of file diff --git a/Lang/Golo/Roman-numerals-Encode b/Lang/Golo/Roman-numerals-Encode new file mode 120000 index 0000000000..ded53d073e --- /dev/null +++ b/Lang/Golo/Roman-numerals-Encode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Encode/Golo \ No newline at end of file diff --git a/Lang/Golo/Rot-13 b/Lang/Golo/Rot-13 new file mode 120000 index 0000000000..b8de7dae83 --- /dev/null +++ b/Lang/Golo/Rot-13 @@ -0,0 +1 @@ +../../Task/Rot-13/Golo \ No newline at end of file diff --git a/Lang/Golo/Terminal-control-Coloured-text b/Lang/Golo/Terminal-control-Coloured-text new file mode 120000 index 0000000000..b61071df8f --- /dev/null +++ b/Lang/Golo/Terminal-control-Coloured-text @@ -0,0 +1 @@ +../../Task/Terminal-control-Coloured-text/Golo \ No newline at end of file diff --git a/Lang/Golo/Variadic-function b/Lang/Golo/Variadic-function new file mode 120000 index 0000000000..d6424b265a --- /dev/null +++ b/Lang/Golo/Variadic-function @@ -0,0 +1 @@ +../../Task/Variadic-function/Golo \ No newline at end of file diff --git a/Lang/Groovy/Active-object b/Lang/Groovy/Active-object new file mode 120000 index 0000000000..2a03734348 --- /dev/null +++ b/Lang/Groovy/Active-object @@ -0,0 +1 @@ +../../Task/Active-object/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Benfords-law b/Lang/Groovy/Benfords-law new file mode 120000 index 0000000000..bb8dda601d --- /dev/null +++ b/Lang/Groovy/Benfords-law @@ -0,0 +1 @@ +../../Task/Benfords-law/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Call-a-function b/Lang/Groovy/Call-a-function new file mode 120000 index 0000000000..90b05931a2 --- /dev/null +++ b/Lang/Groovy/Call-a-function @@ -0,0 +1 @@ +../../Task/Call-a-function/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Chat-server b/Lang/Groovy/Chat-server new file mode 120000 index 0000000000..8b7822d9ec --- /dev/null +++ b/Lang/Groovy/Chat-server @@ -0,0 +1 @@ +../../Task/Chat-server/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Convert-decimal-number-to-rational b/Lang/Groovy/Convert-decimal-number-to-rational new file mode 120000 index 0000000000..3e1f5db620 --- /dev/null +++ b/Lang/Groovy/Convert-decimal-number-to-rational @@ -0,0 +1 @@ +../../Task/Convert-decimal-number-to-rational/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Element-wise-operations b/Lang/Groovy/Element-wise-operations new file mode 120000 index 0000000000..be11cabb57 --- /dev/null +++ b/Lang/Groovy/Element-wise-operations @@ -0,0 +1 @@ +../../Task/Element-wise-operations/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Integer-overflow b/Lang/Groovy/Integer-overflow new file mode 120000 index 0000000000..5da18fc94c --- /dev/null +++ b/Lang/Groovy/Integer-overflow @@ -0,0 +1 @@ +../../Task/Integer-overflow/Groovy \ No newline at end of file diff --git a/Lang/Groovy/MD5-Implementation b/Lang/Groovy/MD5-Implementation new file mode 120000 index 0000000000..0287012965 --- /dev/null +++ b/Lang/Groovy/MD5-Implementation @@ -0,0 +1 @@ +../../Task/MD5-Implementation/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Parsing-RPN-to-infix-conversion b/Lang/Groovy/Parsing-RPN-to-infix-conversion new file mode 120000 index 0000000000..81d169706f --- /dev/null +++ b/Lang/Groovy/Parsing-RPN-to-infix-conversion @@ -0,0 +1 @@ +../../Task/Parsing-RPN-to-infix-conversion/Groovy \ No newline at end of file diff --git a/Lang/Groovy/User-input-Graphical b/Lang/Groovy/User-input-Graphical new file mode 120000 index 0000000000..a33de2f6cc --- /dev/null +++ b/Lang/Groovy/User-input-Graphical @@ -0,0 +1 @@ +../../Task/User-input-Graphical/Groovy \ No newline at end of file diff --git a/Lang/Groovy/Video-display-modes b/Lang/Groovy/Video-display-modes new file mode 120000 index 0000000000..273f7361be --- /dev/null +++ b/Lang/Groovy/Video-display-modes @@ -0,0 +1 @@ +../../Task/Video-display-modes/Groovy \ No newline at end of file diff --git a/Lang/Harbour/Align-columns b/Lang/Harbour/Align-columns new file mode 120000 index 0000000000..43e9181bef --- /dev/null +++ b/Lang/Harbour/Align-columns @@ -0,0 +1 @@ +../../Task/Align-columns/Harbour \ No newline at end of file diff --git a/Lang/Harbour/Loop-over-multiple-arrays-simultaneously b/Lang/Harbour/Loop-over-multiple-arrays-simultaneously new file mode 120000 index 0000000000..b2892c34c3 --- /dev/null +++ b/Lang/Harbour/Loop-over-multiple-arrays-simultaneously @@ -0,0 +1 @@ +../../Task/Loop-over-multiple-arrays-simultaneously/Harbour \ No newline at end of file diff --git a/Lang/Haskell/Function-prototype b/Lang/Haskell/Function-prototype new file mode 120000 index 0000000000..b817f81d2f --- /dev/null +++ b/Lang/Haskell/Function-prototype @@ -0,0 +1 @@ +../../Task/Function-prototype/Haskell \ No newline at end of file diff --git a/Lang/Haskell/Keyboard-input-Flush-the-keyboard-buffer b/Lang/Haskell/Keyboard-input-Flush-the-keyboard-buffer new file mode 120000 index 0000000000..f22f53812e --- /dev/null +++ b/Lang/Haskell/Keyboard-input-Flush-the-keyboard-buffer @@ -0,0 +1 @@ +../../Task/Keyboard-input-Flush-the-keyboard-buffer/Haskell \ No newline at end of file diff --git a/Lang/Haskell/Knuths-algorithm-S b/Lang/Haskell/Knuths-algorithm-S new file mode 120000 index 0000000000..180da2e06a --- /dev/null +++ b/Lang/Haskell/Knuths-algorithm-S @@ -0,0 +1 @@ +../../Task/Knuths-algorithm-S/Haskell \ No newline at end of file diff --git a/Lang/Haskell/LU-decomposition b/Lang/Haskell/LU-decomposition new file mode 120000 index 0000000000..e49cd4f5ac --- /dev/null +++ b/Lang/Haskell/LU-decomposition @@ -0,0 +1 @@ +../../Task/LU-decomposition/Haskell \ No newline at end of file diff --git a/Lang/Haskell/QR-decomposition b/Lang/Haskell/QR-decomposition new file mode 120000 index 0000000000..a9e6d8d638 --- /dev/null +++ b/Lang/Haskell/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/Haskell \ No newline at end of file diff --git a/Lang/Haskell/Set-of-real-numbers b/Lang/Haskell/Set-of-real-numbers new file mode 120000 index 0000000000..91271fe82d --- /dev/null +++ b/Lang/Haskell/Set-of-real-numbers @@ -0,0 +1 @@ +../../Task/Set-of-real-numbers/Haskell \ No newline at end of file diff --git a/Lang/Haskell/Xiaolin-Wus-line-algorithm b/Lang/Haskell/Xiaolin-Wus-line-algorithm new file mode 120000 index 0000000000..e6c9e32860 --- /dev/null +++ b/Lang/Haskell/Xiaolin-Wus-line-algorithm @@ -0,0 +1 @@ +../../Task/Xiaolin-Wus-line-algorithm/Haskell \ No newline at end of file diff --git a/Lang/Haxe/00DESCRIPTION b/Lang/Haxe/00DESCRIPTION index a4c86ecfa3..4954c6d845 100644 --- a/Lang/Haxe/00DESCRIPTION +++ b/Lang/Haxe/00DESCRIPTION @@ -1,5 +1,11 @@ {{Stub}}{{language -|strength=strong -|compat=duck -|site=http://haxe.org}} -'''Haxe''' is a programming language designed for creating interactive web applications. There are several official compiler targets - Adobe Flash, [[JavaScript]], Neko VM, [[PHP]], [[C++]], [[Java]], [[C sharp]]. \ No newline at end of file +|site:https://haxe.org/ +|gc=yes +|checking=static +|strength=strong}} + +'''[https://haxe.org/ Haxe]''' is a general-purpose high-level modern OO programming language with a familiar C-/JS-like syntax. It can compile to numerous targets, including [[C++]], [[Python]], [[JavaScript]], [[Lua]], [[Java]], [[PHP]], [[C sharp]], ActionScript3, Adobe Flash, as well as to bytecode for its very own HashLink VM and Neko VM, and the JVM. The compiler also comes with its own built-in interpreter. + +With Haxe you can compile a single codebase to multiple targets depending upon your [https://haxe.org/use-cases/ use-case]. + +Haxe is a mature language with a very fast compiler. See its [https://haxe.org/documentation/introduction/language-introduction.html Language Intro] for a quick overview of the language. \ No newline at end of file diff --git a/Lang/HolyC/00DESCRIPTION b/Lang/HolyC/00DESCRIPTION index d93aaee2ca..fa260a70cb 100644 --- a/Lang/HolyC/00DESCRIPTION +++ b/Lang/HolyC/00DESCRIPTION @@ -9,7 +9,7 @@ '''HolyC''' is a variation of [[C|C]] developed by Terry A. Davis. HolyC is the official programming language for The Temple Operating System ([http://www.templeos.org/ TempleOS]). -The official HolyC documentation is provided with TempleOS. ([https://templeos.sheikhs.space/Wb/Doc/HolyC.html mirror], [https://web.archive.org/web/20170325000321/http://www.templeos.org/Wb/Doc/HolyC.html archive]). +The official HolyC documentation is provided with TempleOS. ([https://web.archive.org/web/20170325000321/http://www.templeos.org/Wb/Doc/HolyC.html archive]). == Related Resources == diff --git a/Lang/HolyC/99-Bottles-of-Beer b/Lang/HolyC/99-Bottles-of-Beer new file mode 120000 index 0000000000..26bf23d1ec --- /dev/null +++ b/Lang/HolyC/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/HolyC \ No newline at end of file diff --git a/Lang/Hy/Playing-cards b/Lang/Hy/Playing-cards new file mode 120000 index 0000000000..bc7f2d5f72 --- /dev/null +++ b/Lang/Hy/Playing-cards @@ -0,0 +1 @@ +../../Task/Playing-cards/Hy \ No newline at end of file diff --git a/Lang/J/00DESCRIPTION b/Lang/J/00DESCRIPTION index a558e645d5..76c6c4533a 100644 --- a/Lang/J/00DESCRIPTION +++ b/Lang/J/00DESCRIPTION @@ -8,7 +8,7 @@ |tags=j |hopl id=1558 |LCT=yes -|bnf=http://www.jsoftware.com/jwiki/Backus%E2%80%93Naur_Form}} +|bnf=https://code.jsoftware.com/wiki/Guides/Language_FAQ/J_BNF}} {{language programming paradigm|Dynamic}} {{language programming paradigm|functional}} {{language programming paradigm|imperative}} diff --git a/Lang/J/Dining-philosophers b/Lang/J/Dining-philosophers new file mode 120000 index 0000000000..f044d5690b --- /dev/null +++ b/Lang/J/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/J \ No newline at end of file diff --git a/Lang/Java/00DESCRIPTION b/Lang/Java/00DESCRIPTION index 7a1836ab77..da0fb3b0fe 100644 --- a/Lang/Java/00DESCRIPTION +++ b/Lang/Java/00DESCRIPTION @@ -40,8 +40,6 @@ Useful Java links: * [http://www.java.com java.com] * [http://www.java.net java.net] * [http://openjdk.java.net OpenJDK] -* [https://hackr.io/tutorials/learn-java Hackr.io] -* [https://reactdom.com/java ReactDOM] ==Todo== [[Reports:Tasks_not_implemented_in_Java]] \ No newline at end of file diff --git a/Lang/Java/Create-a-file-on-magnetic-tape b/Lang/Java/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..6c0ca00918 --- /dev/null +++ b/Lang/Java/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/Java \ No newline at end of file diff --git a/Lang/Java/Extend-your-language b/Lang/Java/Extend-your-language new file mode 120000 index 0000000000..4d5d897b40 --- /dev/null +++ b/Lang/Java/Extend-your-language @@ -0,0 +1 @@ +../../Task/Extend-your-language/Java \ No newline at end of file diff --git a/Lang/Java/FizzBuzz b/Lang/Java/FizzBuzz new file mode 120000 index 0000000000..b7e778d9be --- /dev/null +++ b/Lang/Java/FizzBuzz @@ -0,0 +1 @@ +../../Task/FizzBuzz/Java \ No newline at end of file diff --git a/Lang/Java/Narcissist b/Lang/Java/Narcissist new file mode 120000 index 0000000000..49e4f6ca73 --- /dev/null +++ b/Lang/Java/Narcissist @@ -0,0 +1 @@ +../../Task/Narcissist/Java \ No newline at end of file diff --git a/Lang/Java/Write-to-Windows-event-log b/Lang/Java/Write-to-Windows-event-log new file mode 120000 index 0000000000..bf0f5a9714 --- /dev/null +++ b/Lang/Java/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/Java \ No newline at end of file diff --git a/Lang/JavaScript/CRC-32 b/Lang/JavaScript/CRC-32 new file mode 120000 index 0000000000..f5829b976e --- /dev/null +++ b/Lang/JavaScript/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Convert-decimal-number-to-rational b/Lang/JavaScript/Convert-decimal-number-to-rational new file mode 120000 index 0000000000..0f8350f109 --- /dev/null +++ b/Lang/JavaScript/Convert-decimal-number-to-rational @@ -0,0 +1 @@ +../../Task/Convert-decimal-number-to-rational/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Execute-a-Markov-algorithm b/Lang/JavaScript/Execute-a-Markov-algorithm new file mode 120000 index 0000000000..3dda3478c7 --- /dev/null +++ b/Lang/JavaScript/Execute-a-Markov-algorithm @@ -0,0 +1 @@ +../../Task/Execute-a-Markov-algorithm/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Find-common-directory-path b/Lang/JavaScript/Find-common-directory-path new file mode 120000 index 0000000000..503f31b0b3 --- /dev/null +++ b/Lang/JavaScript/Find-common-directory-path @@ -0,0 +1 @@ +../../Task/Find-common-directory-path/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Galton-box-animation b/Lang/JavaScript/Galton-box-animation new file mode 120000 index 0000000000..6f17f8da61 --- /dev/null +++ b/Lang/JavaScript/Galton-box-animation @@ -0,0 +1 @@ +../../Task/Galton-box-animation/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Hello-world-Newbie b/Lang/JavaScript/Hello-world-Newbie new file mode 120000 index 0000000000..14f3c7059e --- /dev/null +++ b/Lang/JavaScript/Hello-world-Newbie @@ -0,0 +1 @@ +../../Task/Hello-world-Newbie/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Last-letter-first-letter b/Lang/JavaScript/Last-letter-first-letter new file mode 120000 index 0000000000..4388de1382 --- /dev/null +++ b/Lang/JavaScript/Last-letter-first-letter @@ -0,0 +1 @@ +../../Task/Last-letter-first-letter/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/MD4 b/Lang/JavaScript/MD4 new file mode 120000 index 0000000000..9e833be2dd --- /dev/null +++ b/Lang/JavaScript/MD4 @@ -0,0 +1 @@ +../../Task/MD4/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Rock-paper-scissors b/Lang/JavaScript/Rock-paper-scissors new file mode 120000 index 0000000000..297d07b2a6 --- /dev/null +++ b/Lang/JavaScript/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Set-consolidation b/Lang/JavaScript/Set-consolidation new file mode 120000 index 0000000000..d007b51c23 --- /dev/null +++ b/Lang/JavaScript/Set-consolidation @@ -0,0 +1 @@ +../../Task/Set-consolidation/JavaScript \ No newline at end of file diff --git a/Lang/JavaScript/Stern-Brocot-sequence b/Lang/JavaScript/Stern-Brocot-sequence new file mode 120000 index 0000000000..d8b65f6276 --- /dev/null +++ b/Lang/JavaScript/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/JavaScript \ No newline at end of file diff --git a/Lang/Julia/00DESCRIPTION b/Lang/Julia/00DESCRIPTION index 1c807ba161..4020fe7c57 100644 --- a/Lang/Julia/00DESCRIPTION +++ b/Lang/Julia/00DESCRIPTION @@ -2,7 +2,7 @@ {{language |Julia |exec=byte -|site=http://julialang.org/ +|site=https://julialang.org/ |gc=yes |parampass=both |safety=both diff --git a/Lang/Julia/9-billion-names-of-God-the-integer b/Lang/Julia/9-billion-names-of-God-the-integer new file mode 120000 index 0000000000..5cd2d8e3fb --- /dev/null +++ b/Lang/Julia/9-billion-names-of-God-the-integer @@ -0,0 +1 @@ +../../Task/9-billion-names-of-God-the-integer/Julia \ No newline at end of file diff --git a/Lang/Julia/Binary-strings b/Lang/Julia/Binary-strings new file mode 120000 index 0000000000..3af0a78635 --- /dev/null +++ b/Lang/Julia/Binary-strings @@ -0,0 +1 @@ +../../Task/Binary-strings/Julia \ No newline at end of file diff --git a/Lang/Julia/Bitwise-IO b/Lang/Julia/Bitwise-IO new file mode 120000 index 0000000000..3aaf72568d --- /dev/null +++ b/Lang/Julia/Bitwise-IO @@ -0,0 +1 @@ +../../Task/Bitwise-IO/Julia \ No newline at end of file diff --git a/Lang/Julia/Calendar b/Lang/Julia/Calendar new file mode 120000 index 0000000000..d94f652b58 --- /dev/null +++ b/Lang/Julia/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Julia \ No newline at end of file diff --git a/Lang/Julia/Calendar---for-REAL-programmers b/Lang/Julia/Calendar---for-REAL-programmers new file mode 120000 index 0000000000..6d5e1e73dd --- /dev/null +++ b/Lang/Julia/Calendar---for-REAL-programmers @@ -0,0 +1 @@ +../../Task/Calendar---for-REAL-programmers/Julia \ No newline at end of file diff --git a/Lang/Julia/Check-Machin-like-formulas b/Lang/Julia/Check-Machin-like-formulas new file mode 120000 index 0000000000..2cc5074fb2 --- /dev/null +++ b/Lang/Julia/Check-Machin-like-formulas @@ -0,0 +1 @@ +../../Task/Check-Machin-like-formulas/Julia \ No newline at end of file diff --git a/Lang/Julia/Checkpoint-synchronization b/Lang/Julia/Checkpoint-synchronization new file mode 120000 index 0000000000..95f24bc470 --- /dev/null +++ b/Lang/Julia/Checkpoint-synchronization @@ -0,0 +1 @@ +../../Task/Checkpoint-synchronization/Julia \ No newline at end of file diff --git a/Lang/Julia/Color-of-a-screen-pixel b/Lang/Julia/Color-of-a-screen-pixel new file mode 120000 index 0000000000..4c8bd31e1a --- /dev/null +++ b/Lang/Julia/Color-of-a-screen-pixel @@ -0,0 +1 @@ +../../Task/Color-of-a-screen-pixel/Julia \ No newline at end of file diff --git a/Lang/Julia/Color-quantization b/Lang/Julia/Color-quantization new file mode 120000 index 0000000000..39bcba2f8c --- /dev/null +++ b/Lang/Julia/Color-quantization @@ -0,0 +1 @@ +../../Task/Color-quantization/Julia \ No newline at end of file diff --git a/Lang/Julia/Colour-pinstripe-Display b/Lang/Julia/Colour-pinstripe-Display new file mode 120000 index 0000000000..9222cb3132 --- /dev/null +++ b/Lang/Julia/Colour-pinstripe-Display @@ -0,0 +1 @@ +../../Task/Colour-pinstripe-Display/Julia \ No newline at end of file diff --git a/Lang/Julia/Compare-sorting-algorithms-performance b/Lang/Julia/Compare-sorting-algorithms-performance new file mode 120000 index 0000000000..ccc27769c7 --- /dev/null +++ b/Lang/Julia/Compare-sorting-algorithms-performance @@ -0,0 +1 @@ +../../Task/Compare-sorting-algorithms-performance/Julia \ No newline at end of file diff --git a/Lang/Julia/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N- b/Lang/Julia/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N- new file mode 120000 index 0000000000..d1d4cf41d6 --- /dev/null +++ b/Lang/Julia/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N- @@ -0,0 +1 @@ +../../Task/Continued-fraction-Arithmetic-G-matrix-NG,-Contined-Fraction-N-/Julia \ No newline at end of file diff --git a/Lang/Julia/Create-a-file-on-magnetic-tape b/Lang/Julia/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..b25635b811 --- /dev/null +++ b/Lang/Julia/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/Julia \ No newline at end of file diff --git a/Lang/Julia/Cut-a-rectangle b/Lang/Julia/Cut-a-rectangle new file mode 120000 index 0000000000..7cebcf9fb4 --- /dev/null +++ b/Lang/Julia/Cut-a-rectangle @@ -0,0 +1 @@ +../../Task/Cut-a-rectangle/Julia \ No newline at end of file diff --git a/Lang/Julia/DNS-query b/Lang/Julia/DNS-query new file mode 120000 index 0000000000..3090582570 --- /dev/null +++ b/Lang/Julia/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/Julia \ No newline at end of file diff --git a/Lang/Julia/Deal-cards-for-FreeCell b/Lang/Julia/Deal-cards-for-FreeCell new file mode 120000 index 0000000000..f9ac787e66 --- /dev/null +++ b/Lang/Julia/Deal-cards-for-FreeCell @@ -0,0 +1 @@ +../../Task/Deal-cards-for-FreeCell/Julia \ No newline at end of file diff --git a/Lang/Julia/Death-Star b/Lang/Julia/Death-Star new file mode 120000 index 0000000000..fcb6c11b1e --- /dev/null +++ b/Lang/Julia/Death-Star @@ -0,0 +1 @@ +../../Task/Death-Star/Julia \ No newline at end of file diff --git a/Lang/Julia/Deconvolution-2D+ b/Lang/Julia/Deconvolution-2D+ new file mode 120000 index 0000000000..206526dd2c --- /dev/null +++ b/Lang/Julia/Deconvolution-2D+ @@ -0,0 +1 @@ +../../Task/Deconvolution-2D+/Julia \ No newline at end of file diff --git a/Lang/Julia/Determine-if-only-one-instance-is-running b/Lang/Julia/Determine-if-only-one-instance-is-running new file mode 120000 index 0000000000..7c97650c47 --- /dev/null +++ b/Lang/Julia/Determine-if-only-one-instance-is-running @@ -0,0 +1 @@ +../../Task/Determine-if-only-one-instance-is-running/Julia \ No newline at end of file diff --git a/Lang/Julia/Distributed-programming b/Lang/Julia/Distributed-programming new file mode 120000 index 0000000000..68e5af433e --- /dev/null +++ b/Lang/Julia/Distributed-programming @@ -0,0 +1 @@ +../../Task/Distributed-programming/Julia \ No newline at end of file diff --git a/Lang/Julia/Documentation b/Lang/Julia/Documentation new file mode 120000 index 0000000000..5d03e9103a --- /dev/null +++ b/Lang/Julia/Documentation @@ -0,0 +1 @@ +../../Task/Documentation/Julia \ No newline at end of file diff --git a/Lang/Julia/Doubly-linked-list-Definition b/Lang/Julia/Doubly-linked-list-Definition new file mode 120000 index 0000000000..1d08fd9e2d --- /dev/null +++ b/Lang/Julia/Doubly-linked-list-Definition @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Definition/Julia \ No newline at end of file diff --git a/Lang/Julia/Doubly-linked-list-Element-insertion b/Lang/Julia/Doubly-linked-list-Element-insertion new file mode 120000 index 0000000000..49ee30e5de --- /dev/null +++ b/Lang/Julia/Doubly-linked-list-Element-insertion @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Element-insertion/Julia \ No newline at end of file diff --git a/Lang/Julia/Doubly-linked-list-Traversal b/Lang/Julia/Doubly-linked-list-Traversal new file mode 120000 index 0000000000..7f6dc0653e --- /dev/null +++ b/Lang/Julia/Doubly-linked-list-Traversal @@ -0,0 +1 @@ +../../Task/Doubly-linked-list-Traversal/Julia \ No newline at end of file diff --git a/Lang/Julia/Draw-a-clock b/Lang/Julia/Draw-a-clock new file mode 120000 index 0000000000..8e0313b17b --- /dev/null +++ b/Lang/Julia/Draw-a-clock @@ -0,0 +1 @@ +../../Task/Draw-a-clock/Julia \ No newline at end of file diff --git a/Lang/Julia/Echo-server b/Lang/Julia/Echo-server new file mode 120000 index 0000000000..57ca97c6d2 --- /dev/null +++ b/Lang/Julia/Echo-server @@ -0,0 +1 @@ +../../Task/Echo-server/Julia \ No newline at end of file diff --git a/Lang/Julia/Execute-SNUSP b/Lang/Julia/Execute-SNUSP new file mode 120000 index 0000000000..153c7e65ec --- /dev/null +++ b/Lang/Julia/Execute-SNUSP @@ -0,0 +1 @@ +../../Task/Execute-SNUSP/Julia \ No newline at end of file diff --git a/Lang/Julia/Extend-your-language b/Lang/Julia/Extend-your-language new file mode 120000 index 0000000000..3a611d5b3e --- /dev/null +++ b/Lang/Julia/Extend-your-language @@ -0,0 +1 @@ +../../Task/Extend-your-language/Julia \ No newline at end of file diff --git a/Lang/Julia/First-class-environments b/Lang/Julia/First-class-environments new file mode 120000 index 0000000000..f1e0372c72 --- /dev/null +++ b/Lang/Julia/First-class-environments @@ -0,0 +1 @@ +../../Task/First-class-environments/Julia \ No newline at end of file diff --git a/Lang/Julia/Fork b/Lang/Julia/Fork new file mode 120000 index 0000000000..0d289feffe --- /dev/null +++ b/Lang/Julia/Fork @@ -0,0 +1 @@ +../../Task/Fork/Julia \ No newline at end of file diff --git a/Lang/Julia/Fractal-tree b/Lang/Julia/Fractal-tree new file mode 120000 index 0000000000..1577d982d1 --- /dev/null +++ b/Lang/Julia/Fractal-tree @@ -0,0 +1 @@ +../../Task/Fractal-tree/Julia \ No newline at end of file diff --git a/Lang/Julia/Function-prototype b/Lang/Julia/Function-prototype new file mode 120000 index 0000000000..534746524c --- /dev/null +++ b/Lang/Julia/Function-prototype @@ -0,0 +1 @@ +../../Task/Function-prototype/Julia \ No newline at end of file diff --git a/Lang/Julia/GUI-Maximum-window-dimensions b/Lang/Julia/GUI-Maximum-window-dimensions new file mode 120000 index 0000000000..c2ec4fd959 --- /dev/null +++ b/Lang/Julia/GUI-Maximum-window-dimensions @@ -0,0 +1 @@ +../../Task/GUI-Maximum-window-dimensions/Julia \ No newline at end of file diff --git a/Lang/Julia/Galton-box-animation b/Lang/Julia/Galton-box-animation new file mode 120000 index 0000000000..3551f1fda7 --- /dev/null +++ b/Lang/Julia/Galton-box-animation @@ -0,0 +1 @@ +../../Task/Galton-box-animation/Julia \ No newline at end of file diff --git a/Lang/Julia/Greyscale-bars-Display b/Lang/Julia/Greyscale-bars-Display new file mode 120000 index 0000000000..18ebb84fd5 --- /dev/null +++ b/Lang/Julia/Greyscale-bars-Display @@ -0,0 +1 @@ +../../Task/Greyscale-bars-Display/Julia \ No newline at end of file diff --git a/Lang/Julia/HTTPS-Authenticated b/Lang/Julia/HTTPS-Authenticated new file mode 120000 index 0000000000..1f8fe30462 --- /dev/null +++ b/Lang/Julia/HTTPS-Authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Authenticated/Julia \ No newline at end of file diff --git a/Lang/Julia/HTTPS-Client-authenticated b/Lang/Julia/HTTPS-Client-authenticated new file mode 120000 index 0000000000..0c82ff1549 --- /dev/null +++ b/Lang/Julia/HTTPS-Client-authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Client-authenticated/Julia \ No newline at end of file diff --git a/Lang/Julia/Hello-world-Line-printer b/Lang/Julia/Hello-world-Line-printer new file mode 120000 index 0000000000..97203880db --- /dev/null +++ b/Lang/Julia/Hello-world-Line-printer @@ -0,0 +1 @@ +../../Task/Hello-world-Line-printer/Julia \ No newline at end of file diff --git a/Lang/Julia/History-variables b/Lang/Julia/History-variables new file mode 120000 index 0000000000..b9fbd35fb6 --- /dev/null +++ b/Lang/Julia/History-variables @@ -0,0 +1 @@ +../../Task/History-variables/Julia \ No newline at end of file diff --git a/Lang/Julia/Honeycombs b/Lang/Julia/Honeycombs new file mode 120000 index 0000000000..f8547a7b73 --- /dev/null +++ b/Lang/Julia/Honeycombs @@ -0,0 +1 @@ +../../Task/Honeycombs/Julia \ No newline at end of file diff --git a/Lang/Julia/Hough-transform b/Lang/Julia/Hough-transform new file mode 120000 index 0000000000..aab68450af --- /dev/null +++ b/Lang/Julia/Hough-transform @@ -0,0 +1 @@ +../../Task/Hough-transform/Julia \ No newline at end of file diff --git a/Lang/Julia/Huffman-coding b/Lang/Julia/Huffman-coding new file mode 120000 index 0000000000..551d91415e --- /dev/null +++ b/Lang/Julia/Huffman-coding @@ -0,0 +1 @@ +../../Task/Huffman-coding/Julia \ No newline at end of file diff --git a/Lang/Julia/Image-noise b/Lang/Julia/Image-noise new file mode 120000 index 0000000000..8032426519 --- /dev/null +++ b/Lang/Julia/Image-noise @@ -0,0 +1 @@ +../../Task/Image-noise/Julia \ No newline at end of file diff --git a/Lang/Julia/Inheritance-Multiple b/Lang/Julia/Inheritance-Multiple new file mode 120000 index 0000000000..c22f0565d3 --- /dev/null +++ b/Lang/Julia/Inheritance-Multiple @@ -0,0 +1 @@ +../../Task/Inheritance-Multiple/Julia \ No newline at end of file diff --git a/Lang/Julia/Inverted-index b/Lang/Julia/Inverted-index new file mode 120000 index 0000000000..98d76fb3a6 --- /dev/null +++ b/Lang/Julia/Inverted-index @@ -0,0 +1 @@ +../../Task/Inverted-index/Julia \ No newline at end of file diff --git a/Lang/Julia/Joystick-position b/Lang/Julia/Joystick-position new file mode 120000 index 0000000000..bd48416f55 --- /dev/null +++ b/Lang/Julia/Joystick-position @@ -0,0 +1 @@ +../../Task/Joystick-position/Julia \ No newline at end of file diff --git a/Lang/Julia/K-d-tree b/Lang/Julia/K-d-tree new file mode 120000 index 0000000000..ebcceb0f2c --- /dev/null +++ b/Lang/Julia/K-d-tree @@ -0,0 +1 @@ +../../Task/K-d-tree/Julia \ No newline at end of file diff --git a/Lang/Julia/K-means++-clustering b/Lang/Julia/K-means++-clustering new file mode 120000 index 0000000000..446a5d8907 --- /dev/null +++ b/Lang/Julia/K-means++-clustering @@ -0,0 +1 @@ +../../Task/K-means++-clustering/Julia \ No newline at end of file diff --git a/Lang/Julia/Keyboard-input-Keypress-check b/Lang/Julia/Keyboard-input-Keypress-check new file mode 120000 index 0000000000..4f748ef570 --- /dev/null +++ b/Lang/Julia/Keyboard-input-Keypress-check @@ -0,0 +1 @@ +../../Task/Keyboard-input-Keypress-check/Julia \ No newline at end of file diff --git a/Lang/Julia/Keyboard-macros b/Lang/Julia/Keyboard-macros new file mode 120000 index 0000000000..97555d6e96 --- /dev/null +++ b/Lang/Julia/Keyboard-macros @@ -0,0 +1 @@ +../../Task/Keyboard-macros/Julia \ No newline at end of file diff --git a/Lang/Julia/Knights-tour b/Lang/Julia/Knights-tour new file mode 120000 index 0000000000..fd9adf4fef --- /dev/null +++ b/Lang/Julia/Knights-tour @@ -0,0 +1 @@ +../../Task/Knights-tour/Julia \ No newline at end of file diff --git a/Lang/Julia/Langtons-ant b/Lang/Julia/Langtons-ant new file mode 120000 index 0000000000..0e1d94f895 --- /dev/null +++ b/Lang/Julia/Langtons-ant @@ -0,0 +1 @@ +../../Task/Langtons-ant/Julia \ No newline at end of file diff --git a/Lang/Julia/Literals-String b/Lang/Julia/Literals-String new file mode 120000 index 0000000000..e240381d2f --- /dev/null +++ b/Lang/Julia/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/Julia \ No newline at end of file diff --git a/Lang/Julia/MD5-Implementation b/Lang/Julia/MD5-Implementation new file mode 120000 index 0000000000..8836db37e8 --- /dev/null +++ b/Lang/Julia/MD5-Implementation @@ -0,0 +1 @@ +../../Task/MD5-Implementation/Julia \ No newline at end of file diff --git a/Lang/Julia/Machine-code b/Lang/Julia/Machine-code new file mode 120000 index 0000000000..3fdcc8ac54 --- /dev/null +++ b/Lang/Julia/Machine-code @@ -0,0 +1 @@ +../../Task/Machine-code/Julia \ No newline at end of file diff --git a/Lang/Julia/Metaprogramming b/Lang/Julia/Metaprogramming new file mode 120000 index 0000000000..89ef764a3e --- /dev/null +++ b/Lang/Julia/Metaprogramming @@ -0,0 +1 @@ +../../Task/Metaprogramming/Julia \ No newline at end of file diff --git a/Lang/Julia/Metered-concurrency b/Lang/Julia/Metered-concurrency new file mode 120000 index 0000000000..3ac0861fd7 --- /dev/null +++ b/Lang/Julia/Metered-concurrency @@ -0,0 +1 @@ +../../Task/Metered-concurrency/Julia \ No newline at end of file diff --git a/Lang/Julia/Morse-code b/Lang/Julia/Morse-code new file mode 120000 index 0000000000..402e856d8b --- /dev/null +++ b/Lang/Julia/Morse-code @@ -0,0 +1 @@ +../../Task/Morse-code/Julia \ No newline at end of file diff --git a/Lang/Julia/Mouse-position b/Lang/Julia/Mouse-position new file mode 120000 index 0000000000..0e0b019390 --- /dev/null +++ b/Lang/Julia/Mouse-position @@ -0,0 +1 @@ +../../Task/Mouse-position/Julia \ No newline at end of file diff --git a/Lang/Julia/Multisplit b/Lang/Julia/Multisplit new file mode 120000 index 0000000000..8485b0c165 --- /dev/null +++ b/Lang/Julia/Multisplit @@ -0,0 +1 @@ +../../Task/Multisplit/Julia \ No newline at end of file diff --git a/Lang/Julia/Munching-squares b/Lang/Julia/Munching-squares new file mode 120000 index 0000000000..4c5136cdc5 --- /dev/null +++ b/Lang/Julia/Munching-squares @@ -0,0 +1 @@ +../../Task/Munching-squares/Julia \ No newline at end of file diff --git a/Lang/Julia/Natural-sorting b/Lang/Julia/Natural-sorting new file mode 120000 index 0000000000..7fbcf86071 --- /dev/null +++ b/Lang/Julia/Natural-sorting @@ -0,0 +1 @@ +../../Task/Natural-sorting/Julia \ No newline at end of file diff --git a/Lang/Julia/Nautical-bell b/Lang/Julia/Nautical-bell new file mode 120000 index 0000000000..e81f34c693 --- /dev/null +++ b/Lang/Julia/Nautical-bell @@ -0,0 +1 @@ +../../Task/Nautical-bell/Julia \ No newline at end of file diff --git a/Lang/Julia/OpenGL b/Lang/Julia/OpenGL new file mode 120000 index 0000000000..c06bf2735e --- /dev/null +++ b/Lang/Julia/OpenGL @@ -0,0 +1 @@ +../../Task/OpenGL/Julia \ No newline at end of file diff --git a/Lang/Julia/Paraffins b/Lang/Julia/Paraffins new file mode 120000 index 0000000000..ad90875a33 --- /dev/null +++ b/Lang/Julia/Paraffins @@ -0,0 +1 @@ +../../Task/Paraffins/Julia \ No newline at end of file diff --git a/Lang/Julia/Pattern-matching b/Lang/Julia/Pattern-matching new file mode 120000 index 0000000000..6920130cbb --- /dev/null +++ b/Lang/Julia/Pattern-matching @@ -0,0 +1 @@ +../../Task/Pattern-matching/Julia \ No newline at end of file diff --git a/Lang/Julia/Pig-the-dice-game-Player b/Lang/Julia/Pig-the-dice-game-Player new file mode 120000 index 0000000000..8c039dc362 --- /dev/null +++ b/Lang/Julia/Pig-the-dice-game-Player @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game-Player/Julia \ No newline at end of file diff --git a/Lang/Julia/Pointers-and-references b/Lang/Julia/Pointers-and-references new file mode 120000 index 0000000000..6d7414696e --- /dev/null +++ b/Lang/Julia/Pointers-and-references @@ -0,0 +1 @@ +../../Task/Pointers-and-references/Julia \ No newline at end of file diff --git a/Lang/Julia/Polymorphic-copy b/Lang/Julia/Polymorphic-copy new file mode 120000 index 0000000000..b054b75fc0 --- /dev/null +++ b/Lang/Julia/Polymorphic-copy @@ -0,0 +1 @@ +../../Task/Polymorphic-copy/Julia \ No newline at end of file diff --git a/Lang/Julia/Pragmatic-directives b/Lang/Julia/Pragmatic-directives new file mode 120000 index 0000000000..5636da080d --- /dev/null +++ b/Lang/Julia/Pragmatic-directives @@ -0,0 +1 @@ +../../Task/Pragmatic-directives/Julia \ No newline at end of file diff --git a/Lang/Julia/Rate-counter b/Lang/Julia/Rate-counter new file mode 120000 index 0000000000..ee71def7d9 --- /dev/null +++ b/Lang/Julia/Rate-counter @@ -0,0 +1 @@ +../../Task/Rate-counter/Julia \ No newline at end of file diff --git a/Lang/Julia/Rendezvous b/Lang/Julia/Rendezvous new file mode 120000 index 0000000000..e854514596 --- /dev/null +++ b/Lang/Julia/Rendezvous @@ -0,0 +1 @@ +../../Task/Rendezvous/Julia \ No newline at end of file diff --git a/Lang/Julia/Scope-modifiers b/Lang/Julia/Scope-modifiers new file mode 120000 index 0000000000..4fa959ca2a --- /dev/null +++ b/Lang/Julia/Scope-modifiers @@ -0,0 +1 @@ +../../Task/Scope-modifiers/Julia \ No newline at end of file diff --git a/Lang/Julia/Self-referential-sequence b/Lang/Julia/Self-referential-sequence new file mode 120000 index 0000000000..7c30ffaa59 --- /dev/null +++ b/Lang/Julia/Self-referential-sequence @@ -0,0 +1 @@ +../../Task/Self-referential-sequence/Julia \ No newline at end of file diff --git a/Lang/Julia/Set-puzzle b/Lang/Julia/Set-puzzle new file mode 120000 index 0000000000..ce4ace98b4 --- /dev/null +++ b/Lang/Julia/Set-puzzle @@ -0,0 +1 @@ +../../Task/Set-puzzle/Julia \ No newline at end of file diff --git a/Lang/Julia/Simple-database b/Lang/Julia/Simple-database new file mode 120000 index 0000000000..036968562b --- /dev/null +++ b/Lang/Julia/Simple-database @@ -0,0 +1 @@ +../../Task/Simple-database/Julia \ No newline at end of file diff --git a/Lang/Julia/Sokoban b/Lang/Julia/Sokoban new file mode 120000 index 0000000000..e2e57ee5e9 --- /dev/null +++ b/Lang/Julia/Sokoban @@ -0,0 +1 @@ +../../Task/Sokoban/Julia \ No newline at end of file diff --git a/Lang/Julia/Solve-a-Hidato-puzzle b/Lang/Julia/Solve-a-Hidato-puzzle new file mode 120000 index 0000000000..4cc8603dc7 --- /dev/null +++ b/Lang/Julia/Solve-a-Hidato-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Hidato-puzzle/Julia \ No newline at end of file diff --git a/Lang/Julia/Solve-a-Holy-Knights-tour b/Lang/Julia/Solve-a-Holy-Knights-tour new file mode 120000 index 0000000000..9d1dead360 --- /dev/null +++ b/Lang/Julia/Solve-a-Holy-Knights-tour @@ -0,0 +1 @@ +../../Task/Solve-a-Holy-Knights-tour/Julia \ No newline at end of file diff --git a/Lang/Julia/Solve-a-Hopido-puzzle b/Lang/Julia/Solve-a-Hopido-puzzle new file mode 120000 index 0000000000..478b68199d --- /dev/null +++ b/Lang/Julia/Solve-a-Hopido-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Hopido-puzzle/Julia \ No newline at end of file diff --git a/Lang/Julia/Solve-a-Numbrix-puzzle b/Lang/Julia/Solve-a-Numbrix-puzzle new file mode 120000 index 0000000000..8a6cce2bfb --- /dev/null +++ b/Lang/Julia/Solve-a-Numbrix-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Numbrix-puzzle/Julia \ No newline at end of file diff --git a/Lang/Julia/Solve-the-no-connection-puzzle b/Lang/Julia/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..69670d30fd --- /dev/null +++ b/Lang/Julia/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/Julia \ No newline at end of file diff --git a/Lang/Julia/Sorting-algorithms-Heapsort b/Lang/Julia/Sorting-algorithms-Heapsort new file mode 120000 index 0000000000..f8244ce67b --- /dev/null +++ b/Lang/Julia/Sorting-algorithms-Heapsort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Heapsort/Julia \ No newline at end of file diff --git a/Lang/Julia/Sorting-algorithms-Radix-sort b/Lang/Julia/Sorting-algorithms-Radix-sort new file mode 120000 index 0000000000..02783017dd --- /dev/null +++ b/Lang/Julia/Sorting-algorithms-Radix-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Radix-sort/Julia \ No newline at end of file diff --git a/Lang/Julia/Sorting-algorithms-Strand-sort b/Lang/Julia/Sorting-algorithms-Strand-sort new file mode 120000 index 0000000000..afba21e857 --- /dev/null +++ b/Lang/Julia/Sorting-algorithms-Strand-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Strand-sort/Julia \ No newline at end of file diff --git a/Lang/Julia/Speech-synthesis b/Lang/Julia/Speech-synthesis new file mode 120000 index 0000000000..539cc90f87 --- /dev/null +++ b/Lang/Julia/Speech-synthesis @@ -0,0 +1 @@ +../../Task/Speech-synthesis/Julia \ No newline at end of file diff --git a/Lang/Julia/Subtractive-generator b/Lang/Julia/Subtractive-generator new file mode 120000 index 0000000000..1ce34196d7 --- /dev/null +++ b/Lang/Julia/Subtractive-generator @@ -0,0 +1 @@ +../../Task/Subtractive-generator/Julia \ No newline at end of file diff --git a/Lang/Julia/Sutherland-Hodgman-polygon-clipping b/Lang/Julia/Sutherland-Hodgman-polygon-clipping new file mode 120000 index 0000000000..be9ca0cd81 --- /dev/null +++ b/Lang/Julia/Sutherland-Hodgman-polygon-clipping @@ -0,0 +1 @@ +../../Task/Sutherland-Hodgman-polygon-clipping/Julia \ No newline at end of file diff --git a/Lang/Julia/Take-notes-on-the-command-line b/Lang/Julia/Take-notes-on-the-command-line new file mode 120000 index 0000000000..b25a503fbb --- /dev/null +++ b/Lang/Julia/Take-notes-on-the-command-line @@ -0,0 +1 @@ +../../Task/Take-notes-on-the-command-line/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Cursor-movement b/Lang/Julia/Terminal-control-Cursor-movement new file mode 120000 index 0000000000..64100bb1e0 --- /dev/null +++ b/Lang/Julia/Terminal-control-Cursor-movement @@ -0,0 +1 @@ +../../Task/Terminal-control-Cursor-movement/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Cursor-positioning b/Lang/Julia/Terminal-control-Cursor-positioning new file mode 120000 index 0000000000..795f0fe33d --- /dev/null +++ b/Lang/Julia/Terminal-control-Cursor-positioning @@ -0,0 +1 @@ +../../Task/Terminal-control-Cursor-positioning/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Dimensions b/Lang/Julia/Terminal-control-Dimensions new file mode 120000 index 0000000000..ad687d0f7a --- /dev/null +++ b/Lang/Julia/Terminal-control-Dimensions @@ -0,0 +1 @@ +../../Task/Terminal-control-Dimensions/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Display-an-extended-character b/Lang/Julia/Terminal-control-Display-an-extended-character new file mode 120000 index 0000000000..32e98cd74c --- /dev/null +++ b/Lang/Julia/Terminal-control-Display-an-extended-character @@ -0,0 +1 @@ +../../Task/Terminal-control-Display-an-extended-character/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Hiding-the-cursor b/Lang/Julia/Terminal-control-Hiding-the-cursor new file mode 120000 index 0000000000..c0f01fb9dc --- /dev/null +++ b/Lang/Julia/Terminal-control-Hiding-the-cursor @@ -0,0 +1 @@ +../../Task/Terminal-control-Hiding-the-cursor/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Inverse-video b/Lang/Julia/Terminal-control-Inverse-video new file mode 120000 index 0000000000..9195615c32 --- /dev/null +++ b/Lang/Julia/Terminal-control-Inverse-video @@ -0,0 +1 @@ +../../Task/Terminal-control-Inverse-video/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Positional-read b/Lang/Julia/Terminal-control-Positional-read new file mode 120000 index 0000000000..ad12f6c4a6 --- /dev/null +++ b/Lang/Julia/Terminal-control-Positional-read @@ -0,0 +1 @@ +../../Task/Terminal-control-Positional-read/Julia \ No newline at end of file diff --git a/Lang/Julia/Terminal-control-Preserve-screen b/Lang/Julia/Terminal-control-Preserve-screen new file mode 120000 index 0000000000..908795cad2 --- /dev/null +++ b/Lang/Julia/Terminal-control-Preserve-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Preserve-screen/Julia \ No newline at end of file diff --git a/Lang/Julia/Thieles-interpolation-formula b/Lang/Julia/Thieles-interpolation-formula new file mode 120000 index 0000000000..98a6cb076d --- /dev/null +++ b/Lang/Julia/Thieles-interpolation-formula @@ -0,0 +1 @@ +../../Task/Thieles-interpolation-formula/Julia \ No newline at end of file diff --git a/Lang/Julia/Tic-tac-toe b/Lang/Julia/Tic-tac-toe new file mode 120000 index 0000000000..15068bc92e --- /dev/null +++ b/Lang/Julia/Tic-tac-toe @@ -0,0 +1 @@ +../../Task/Tic-tac-toe/Julia \ No newline at end of file diff --git a/Lang/Julia/Undefined-values b/Lang/Julia/Undefined-values new file mode 120000 index 0000000000..036a1a3794 --- /dev/null +++ b/Lang/Julia/Undefined-values @@ -0,0 +1 @@ +../../Task/Undefined-values/Julia \ No newline at end of file diff --git a/Lang/Julia/Universal-Turing-machine b/Lang/Julia/Universal-Turing-machine new file mode 120000 index 0000000000..5cd6ddd3bf --- /dev/null +++ b/Lang/Julia/Universal-Turing-machine @@ -0,0 +1 @@ +../../Task/Universal-Turing-machine/Julia \ No newline at end of file diff --git a/Lang/Julia/Update-a-configuration-file b/Lang/Julia/Update-a-configuration-file new file mode 120000 index 0000000000..3573b89f07 --- /dev/null +++ b/Lang/Julia/Update-a-configuration-file @@ -0,0 +1 @@ +../../Task/Update-a-configuration-file/Julia \ No newline at end of file diff --git a/Lang/Julia/User-input-Graphical b/Lang/Julia/User-input-Graphical new file mode 120000 index 0000000000..68562c2b23 --- /dev/null +++ b/Lang/Julia/User-input-Graphical @@ -0,0 +1 @@ +../../Task/User-input-Graphical/Julia \ No newline at end of file diff --git a/Lang/Julia/Variable-size-Set b/Lang/Julia/Variable-size-Set new file mode 120000 index 0000000000..2819a444e2 --- /dev/null +++ b/Lang/Julia/Variable-size-Set @@ -0,0 +1 @@ +../../Task/Variable-size-Set/Julia \ No newline at end of file diff --git a/Lang/Julia/Video-display-modes b/Lang/Julia/Video-display-modes new file mode 120000 index 0000000000..3398b2cadd --- /dev/null +++ b/Lang/Julia/Video-display-modes @@ -0,0 +1 @@ +../../Task/Video-display-modes/Julia \ No newline at end of file diff --git a/Lang/Julia/Visualize-a-tree b/Lang/Julia/Visualize-a-tree new file mode 120000 index 0000000000..ad595a3e22 --- /dev/null +++ b/Lang/Julia/Visualize-a-tree @@ -0,0 +1 @@ +../../Task/Visualize-a-tree/Julia \ No newline at end of file diff --git a/Lang/Julia/Window-management b/Lang/Julia/Window-management new file mode 120000 index 0000000000..2dd71a07ec --- /dev/null +++ b/Lang/Julia/Window-management @@ -0,0 +1 @@ +../../Task/Window-management/Julia \ No newline at end of file diff --git a/Lang/Julia/Wireworld b/Lang/Julia/Wireworld new file mode 120000 index 0000000000..535bbca4b9 --- /dev/null +++ b/Lang/Julia/Wireworld @@ -0,0 +1 @@ +../../Task/Wireworld/Julia \ No newline at end of file diff --git a/Lang/Julia/World-Cup-group-stage b/Lang/Julia/World-Cup-group-stage new file mode 120000 index 0000000000..88c087e096 --- /dev/null +++ b/Lang/Julia/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/Julia \ No newline at end of file diff --git a/Lang/Julia/Write-language-name-in-3D-ASCII b/Lang/Julia/Write-language-name-in-3D-ASCII new file mode 120000 index 0000000000..c9b2f7b4c5 --- /dev/null +++ b/Lang/Julia/Write-language-name-in-3D-ASCII @@ -0,0 +1 @@ +../../Task/Write-language-name-in-3D-ASCII/Julia \ No newline at end of file diff --git a/Lang/Julia/Write-to-Windows-event-log b/Lang/Julia/Write-to-Windows-event-log new file mode 120000 index 0000000000..2dfa47cc15 --- /dev/null +++ b/Lang/Julia/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/Julia \ No newline at end of file diff --git a/Lang/Julia/XML-DOM-serialization b/Lang/Julia/XML-DOM-serialization new file mode 120000 index 0000000000..f65dafc029 --- /dev/null +++ b/Lang/Julia/XML-DOM-serialization @@ -0,0 +1 @@ +../../Task/XML-DOM-serialization/Julia \ No newline at end of file diff --git a/Lang/Julia/XML-Output b/Lang/Julia/XML-Output new file mode 120000 index 0000000000..faba466109 --- /dev/null +++ b/Lang/Julia/XML-Output @@ -0,0 +1 @@ +../../Task/XML-Output/Julia \ No newline at end of file diff --git a/Lang/Julia/XML-XPath b/Lang/Julia/XML-XPath new file mode 120000 index 0000000000..3d6e8baeba --- /dev/null +++ b/Lang/Julia/XML-XPath @@ -0,0 +1 @@ +../../Task/XML-XPath/Julia \ No newline at end of file diff --git a/Lang/Julia/Zeckendorf-arithmetic b/Lang/Julia/Zeckendorf-arithmetic new file mode 120000 index 0000000000..7c71f2d09b --- /dev/null +++ b/Lang/Julia/Zeckendorf-arithmetic @@ -0,0 +1 @@ +../../Task/Zeckendorf-arithmetic/Julia \ No newline at end of file diff --git a/Lang/K/Abundant,-deficient-and-perfect-number-classifications b/Lang/K/Abundant,-deficient-and-perfect-number-classifications new file mode 120000 index 0000000000..ac13c00386 --- /dev/null +++ b/Lang/K/Abundant,-deficient-and-perfect-number-classifications @@ -0,0 +1 @@ +../../Task/Abundant,-deficient-and-perfect-number-classifications/K \ No newline at end of file diff --git a/Lang/K/Find-the-last-Sunday-of-each-month b/Lang/K/Find-the-last-Sunday-of-each-month new file mode 120000 index 0000000000..b621ea2089 --- /dev/null +++ b/Lang/K/Find-the-last-Sunday-of-each-month @@ -0,0 +1 @@ +../../Task/Find-the-last-Sunday-of-each-month/K \ No newline at end of file diff --git a/Lang/K/Last-Friday-of-each-month b/Lang/K/Last-Friday-of-each-month new file mode 120000 index 0000000000..c30f085521 --- /dev/null +++ b/Lang/K/Last-Friday-of-each-month @@ -0,0 +1 @@ +../../Task/Last-Friday-of-each-month/K \ No newline at end of file diff --git a/Lang/K/Matrix-exponentiation-operator b/Lang/K/Matrix-exponentiation-operator new file mode 120000 index 0000000000..a35a6126ae --- /dev/null +++ b/Lang/K/Matrix-exponentiation-operator @@ -0,0 +1 @@ +../../Task/Matrix-exponentiation-operator/K \ No newline at end of file diff --git a/Lang/K/Middle-three-digits b/Lang/K/Middle-three-digits new file mode 120000 index 0000000000..37461e1090 --- /dev/null +++ b/Lang/K/Middle-three-digits @@ -0,0 +1 @@ +../../Task/Middle-three-digits/K \ No newline at end of file diff --git a/Lang/K/Phrase-reversals b/Lang/K/Phrase-reversals new file mode 120000 index 0000000000..0500688c09 --- /dev/null +++ b/Lang/K/Phrase-reversals @@ -0,0 +1 @@ +../../Task/Phrase-reversals/K \ No newline at end of file diff --git a/Lang/K/Zero-to-the-zero-power b/Lang/K/Zero-to-the-zero-power new file mode 120000 index 0000000000..3f4d9bef3c --- /dev/null +++ b/Lang/K/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/K \ No newline at end of file diff --git a/Lang/Kotlin/Chat-server b/Lang/Kotlin/Chat-server new file mode 120000 index 0000000000..4c5d0c003e --- /dev/null +++ b/Lang/Kotlin/Chat-server @@ -0,0 +1 @@ +../../Task/Chat-server/Kotlin \ No newline at end of file diff --git a/Lang/LLVM/Arithmetic-geometric-mean b/Lang/LLVM/Arithmetic-geometric-mean new file mode 120000 index 0000000000..e1a551b483 --- /dev/null +++ b/Lang/LLVM/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Binary-digits b/Lang/LLVM/Binary-digits new file mode 120000 index 0000000000..8926ee8342 --- /dev/null +++ b/Lang/LLVM/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Box-the-compass b/Lang/LLVM/Box-the-compass new file mode 120000 index 0000000000..999ec17820 --- /dev/null +++ b/Lang/LLVM/Box-the-compass @@ -0,0 +1 @@ +../../Task/Box-the-compass/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Dot-product b/Lang/LLVM/Dot-product new file mode 120000 index 0000000000..5efa3f7266 --- /dev/null +++ b/Lang/LLVM/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Even-or-odd b/Lang/LLVM/Even-or-odd new file mode 120000 index 0000000000..41f557bd47 --- /dev/null +++ b/Lang/LLVM/Even-or-odd @@ -0,0 +1 @@ +../../Task/Even-or-odd/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Factorial b/Lang/LLVM/Factorial new file mode 120000 index 0000000000..fe9323b2bc --- /dev/null +++ b/Lang/LLVM/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Fibonacci-sequence b/Lang/LLVM/Fibonacci-sequence new file mode 120000 index 0000000000..d21dbef9de --- /dev/null +++ b/Lang/LLVM/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/LLVM \ No newline at end of file diff --git a/Lang/LLVM/FizzBuzz b/Lang/LLVM/FizzBuzz new file mode 120000 index 0000000000..aeccdb0a01 --- /dev/null +++ b/Lang/LLVM/FizzBuzz @@ -0,0 +1 @@ +../../Task/FizzBuzz/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Hello-world-Newline-omission b/Lang/LLVM/Hello-world-Newline-omission new file mode 120000 index 0000000000..844b5ae23b --- /dev/null +++ b/Lang/LLVM/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Hello-world-Standard-error b/Lang/LLVM/Hello-world-Standard-error new file mode 120000 index 0000000000..3386d50ef5 --- /dev/null +++ b/Lang/LLVM/Hello-world-Standard-error @@ -0,0 +1 @@ +../../Task/Hello-world-Standard-error/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Integer-sequence b/Lang/LLVM/Integer-sequence new file mode 120000 index 0000000000..63f92fc939 --- /dev/null +++ b/Lang/LLVM/Integer-sequence @@ -0,0 +1 @@ +../../Task/Integer-sequence/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Leap-year b/Lang/LLVM/Leap-year new file mode 120000 index 0000000000..897788d8cb --- /dev/null +++ b/Lang/LLVM/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Logical-operations b/Lang/LLVM/Logical-operations new file mode 120000 index 0000000000..e2a6e8a326 --- /dev/null +++ b/Lang/LLVM/Logical-operations @@ -0,0 +1 @@ +../../Task/Logical-operations/LLVM \ No newline at end of file diff --git a/Lang/LLVM/Reverse-a-string b/Lang/LLVM/Reverse-a-string new file mode 120000 index 0000000000..d6eb6d7e62 --- /dev/null +++ b/Lang/LLVM/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/LLVM \ No newline at end of file diff --git a/Lang/Lambdatalk/00DESCRIPTION b/Lang/Lambdatalk/00DESCRIPTION index 4d7c3f8c89..9c6c1bab4a 100644 --- a/Lang/Lambdatalk/00DESCRIPTION +++ b/Lang/Lambdatalk/00DESCRIPTION @@ -120,7 +120,9 @@ Using names helps to recognize a data structure and its accessors: - lambdas are pure black boxes, they '''don't create closures''' and are context free, inner lambdas don't see outer functions' arguments, there are no lexical scoping, no free variables, -- lambdas accept de facto '''partial function application''': called with a number of values lesser than its arity, a lambda memorizes the given values and returns a new lambda waiting for the rest. +- lambdas accept de facto '''partial function application''': called with a number of values lesser than its arity, a lambda memorizes the given values and returns a new lambda waiting for the rest, + +- called with a number of values greater than its arity, a lambda feeds the extra values in the last argument, a kind of de facto '''variadicity''' '''Note:''': This is what Ward Cunningham wrote about such an iconoclastic implementation: ''« I was surprised that the technique worked so well in so many cases. I knew that regex are highly optimized and the cpus themselves optimize sequential access to memory which the regex must have at its core. [..] Yes, this has at its heart the repeated application of a text transformation. The fact that it is repeated application of the same transformation makes it exceptional. [..] Repeated application of Regular Expressions can perform Touring Complete computations. This works because the needed "state" is in the partially evaluated text itself. »'' All is said! @@ -165,12 +167,6 @@ Web design is not forgotten and examples can be seen in the workshop's website. The {lambda way} project adds on browsers a thin overlay, {lambda tank}, giving to {lambda talk} a small ''Interactive Development Environment'' without any external dependencies and thereby easy to download (50kb) and install on any web account provider running PHP. From any web browser, on any system, complex and dynamic web pages can be created, enriched, structured and tested in real time on the web. -A full presentation of the {lambda way} project can be seen in: - - - http://lambdaway.free.fr/ - - http://lambdaway.free.fr/workshop/?view=about - - http://lambdaway.free.fr/workshop/?view=foundations - - http://lambdaway.free.fr/workshop/?view=oxford_slides - - and several other pages of the workshop. +A full presentation of the {lambda way} project can be seen in this last version: http://lambdaway.free.fr/lambdaspeech . Your opinion is welcome. Alain Marty \ No newline at end of file diff --git a/Lang/Lambdatalk/Create-an-HTML-table b/Lang/Lambdatalk/Create-an-HTML-table new file mode 120000 index 0000000000..889c1323d0 --- /dev/null +++ b/Lang/Lambdatalk/Create-an-HTML-table @@ -0,0 +1 @@ +../../Task/Create-an-HTML-table/Lambdatalk \ No newline at end of file diff --git a/Lang/Lambdatalk/Guess-the-number-With-feedback b/Lang/Lambdatalk/Guess-the-number-With-feedback new file mode 120000 index 0000000000..a1720431d3 --- /dev/null +++ b/Lang/Lambdatalk/Guess-the-number-With-feedback @@ -0,0 +1 @@ +../../Task/Guess-the-number-With-feedback/Lambdatalk \ No newline at end of file diff --git a/Lang/Liberty-BASIC/AKS-test-for-primes b/Lang/Liberty-BASIC/AKS-test-for-primes new file mode 120000 index 0000000000..d0b5344c6d --- /dev/null +++ b/Lang/Liberty-BASIC/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/Liberty-BASIC \ No newline at end of file diff --git a/Lang/Liberty-BASIC/Almost-prime b/Lang/Liberty-BASIC/Almost-prime new file mode 120000 index 0000000000..52bdce68d7 --- /dev/null +++ b/Lang/Liberty-BASIC/Almost-prime @@ -0,0 +1 @@ +../../Task/Almost-prime/Liberty-BASIC \ No newline at end of file diff --git a/Lang/Liberty-BASIC/Nth b/Lang/Liberty-BASIC/Nth new file mode 120000 index 0000000000..c181ebe7f5 --- /dev/null +++ b/Lang/Liberty-BASIC/Nth @@ -0,0 +1 @@ +../../Task/Nth/Liberty-BASIC \ No newline at end of file diff --git a/Lang/Lua/00DESCRIPTION b/Lang/Lua/00DESCRIPTION index 54480e0394..aee873525c 100644 --- a/Lang/Lua/00DESCRIPTION +++ b/Lang/Lua/00DESCRIPTION @@ -23,12 +23,15 @@ As a result, the base language is light—in fact, the full reference interprete ==Unimplemented programming tasks== Output from [[Find_unimplemented_tasks]] : -Lua has 338 unimplemented programming tasks: +Lua has 355 unimplemented programming tasks: 15 puzzle solver 2048 4-rings or 4-squares puzzle 9 billion names of God the integer AKS test for primes + Abbreviations, automatic + Abbreviations, easy + Abbreviations, simple Active Directory/Connect Active Directory/Search for a user Active object @@ -44,7 +47,6 @@ Lua has 338 unimplemented programming tasks: Arithmetic-geometric mean/Calculate Pi Atomic updates Average loop length - Babbage problem Balanced ternary Bernoulli numbers Best shuffle @@ -61,7 +63,6 @@ Lua has 338 unimplemented programming tasks: Brace expansion Break OO privacy Bulls and cows/Player - CRC-32 Call a function in a shared library Canny edge detector Carmichael 3 strong pseudoprimes @@ -70,9 +71,9 @@ Lua has 338 unimplemented programming tasks: Chat server Check Machin-like formulas Checkpoint synchronization - Chinese remainder theorem Chinese zodiac Cholesky decomposition + Church Numerals Circles of given radius through two points Closest-pair problem Color of a screen pixel @@ -97,6 +98,7 @@ Lua has 338 unimplemented programming tasks: Convert decimal number to rational Create a file on magnetic tape Create an object at a given address + Currency Cut a rectangle Death Star Deconvolution/2D+ @@ -116,6 +118,7 @@ Lua has 338 unimplemented programming tasks: Draw a pixel Draw a rotating cube Dutch national flag problem + EKG sequence convergence Eertree Egyptian division Egyptian fractions @@ -123,6 +126,7 @@ Lua has 338 unimplemented programming tasks: Elementary cellular automaton Enforced immutability Equilibrium index + Euler's identity Events Executable library Extend your language @@ -133,6 +137,7 @@ Lua has 338 unimplemented programming tasks: Find largest left truncatable prime in a given base Find palindromic numbers in both binary and ternary bases Floyd-Warshall algorithm + Four is magic Four is the number of letters in the ... Fractran Function frequency @@ -141,6 +146,7 @@ Lua has 338 unimplemented programming tasks: GUI/Maximum window dimensions Galton box animation Gaussian elimination + Generate random chess position Go Fish Greyscale bars/Display HTTPS/Client-authenticated @@ -160,11 +166,13 @@ Lua has 338 unimplemented programming tasks: Hunt The Wumpus Image convolution Image noise + Index finite lists of positive integers Inheritance/Single Integer overflow Inverted index Inverted syntax Jaro distance + Jewels and Stones Joystick position Julia set K-d tree @@ -177,11 +185,16 @@ Lua has 338 unimplemented programming tasks: Knapsack problem/Bounded Knapsack problem/Continuous Knuth's algorithm S + Knuth's power tree Kolakoski sequence LU decomposition + Largest number divisible by its digits Last letter-first letter + Law of cosines - triples Long multiplication + Long primes Loops/Increment loop index within loop body + Loops/Wrong ranges Lucas-Lehmer test Lucky and even lucky numbers Lychrel numbers @@ -196,6 +209,7 @@ Lua has 338 unimplemented programming tasks: Metered concurrency Metronome Miller–Rabin primality test + Mind boggling card trick Minesweeper game Modular exponentiation Modular inverse @@ -206,6 +220,7 @@ Lua has 338 unimplemented programming tasks: Natural sorting Nautical bell Negative base numbers + Nested templated data Non-continuous subsequences Nonoblock Nonogram solver @@ -213,7 +228,6 @@ Lua has 338 unimplemented programming tasks: OLE Automation Object serialization Odd word problem - Old lady swallowed a fly OpenWebNet Password Paraffins Parallel Brute Force @@ -258,6 +272,7 @@ Lua has 338 unimplemented programming tasks: Ranking methods Rate counter Ray-casting algorithm + Recaman's sequence Record sound Reflection/Get source Reflection/List methods @@ -283,6 +298,7 @@ Lua has 338 unimplemented programming tasks: Set consolidation Set of real numbers Set puzzle + Shortest common supersequence Sierpinski carpet Sierpinski pentagon Sierpinski triangle @@ -303,7 +319,9 @@ Lua has 338 unimplemented programming tasks: Sorting algorithms/Strand sort Sparkline in unicode Speech synthesis + Spelling of ordinal numbers Spinning rod animation/Text + Square but not cube Start from a main routine State name puzzle Stream Merge @@ -311,6 +329,7 @@ Lua has 338 unimplemented programming tasks: Sum and Product Puzzle Sum to 100 Superellipse + Superpermutation minimisation Taxicab numbers Terminal control/Coloured text Terminal control/Cursor movement @@ -333,7 +352,6 @@ Lua has 338 unimplemented programming tasks: Truth table Twelve statements URL parser - UTF-8 encode and decode Ulam spiral (for primes) Unicode strings Update a configuration file @@ -355,7 +373,6 @@ Lua has 338 unimplemented programming tasks: Window management Word search World Cup group stage - Write language name in 3D ASCII Write to Windows event log Xiaolin Wu's line algorithm Yahoo! search interface diff --git a/Lang/Lua/Append-a-record-to-the-end-of-a-text-file b/Lang/Lua/Append-a-record-to-the-end-of-a-text-file new file mode 120000 index 0000000000..fc44744dd1 --- /dev/null +++ b/Lang/Lua/Append-a-record-to-the-end-of-a-text-file @@ -0,0 +1 @@ +../../Task/Append-a-record-to-the-end-of-a-text-file/Lua \ No newline at end of file diff --git a/Lang/Lua/CRC-32 b/Lang/Lua/CRC-32 new file mode 120000 index 0000000000..96f1c4b92c --- /dev/null +++ b/Lang/Lua/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/Lua \ No newline at end of file diff --git a/Lang/Lua/Chinese-remainder-theorem b/Lang/Lua/Chinese-remainder-theorem new file mode 120000 index 0000000000..1da4ed2850 --- /dev/null +++ b/Lang/Lua/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/Lua \ No newline at end of file diff --git a/Lang/Lua/Circles-of-given-radius-through-two-points b/Lang/Lua/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..d8780edc1b --- /dev/null +++ b/Lang/Lua/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/Lua \ No newline at end of file diff --git a/Lang/Lua/Create-a-file-on-magnetic-tape b/Lang/Lua/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..fcd27b50af --- /dev/null +++ b/Lang/Lua/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/Lua \ No newline at end of file diff --git a/Lang/Lua/Execute-Brain---- b/Lang/Lua/Execute-Brain---- new file mode 120000 index 0000000000..3075e77cc3 --- /dev/null +++ b/Lang/Lua/Execute-Brain---- @@ -0,0 +1 @@ +../../Task/Execute-Brain----/Lua \ No newline at end of file diff --git a/Lang/Lua/Hofstadter-Conway-$10,000-sequence b/Lang/Lua/Hofstadter-Conway-$10,000-sequence new file mode 120000 index 0000000000..e03b15c467 --- /dev/null +++ b/Lang/Lua/Hofstadter-Conway-$10,000-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Conway-$10,000-sequence/Lua \ No newline at end of file diff --git a/Lang/Lua/K-means++-clustering b/Lang/Lua/K-means++-clustering new file mode 120000 index 0000000000..188845aca2 --- /dev/null +++ b/Lang/Lua/K-means++-clustering @@ -0,0 +1 @@ +../../Task/K-means++-clustering/Lua \ No newline at end of file diff --git a/Lang/Lua/Old-lady-swallowed-a-fly b/Lang/Lua/Old-lady-swallowed-a-fly new file mode 120000 index 0000000000..00510ea728 --- /dev/null +++ b/Lang/Lua/Old-lady-swallowed-a-fly @@ -0,0 +1 @@ +../../Task/Old-lady-swallowed-a-fly/Lua \ No newline at end of file diff --git a/Lang/Lua/Polynomial-regression b/Lang/Lua/Polynomial-regression new file mode 120000 index 0000000000..e2b183a785 --- /dev/null +++ b/Lang/Lua/Polynomial-regression @@ -0,0 +1 @@ +../../Task/Polynomial-regression/Lua \ No newline at end of file diff --git a/Lang/Lua/Set-of-real-numbers b/Lang/Lua/Set-of-real-numbers new file mode 120000 index 0000000000..3a394d871c --- /dev/null +++ b/Lang/Lua/Set-of-real-numbers @@ -0,0 +1 @@ +../../Task/Set-of-real-numbers/Lua \ No newline at end of file diff --git a/Lang/Lua/Tree-traversal b/Lang/Lua/Tree-traversal new file mode 120000 index 0000000000..ddd1812e19 --- /dev/null +++ b/Lang/Lua/Tree-traversal @@ -0,0 +1 @@ +../../Task/Tree-traversal/Lua \ No newline at end of file diff --git a/Lang/Lua/Walk-a-directory-Recursively b/Lang/Lua/Walk-a-directory-Recursively new file mode 120000 index 0000000000..4989ad2304 --- /dev/null +++ b/Lang/Lua/Walk-a-directory-Recursively @@ -0,0 +1 @@ +../../Task/Walk-a-directory-Recursively/Lua \ No newline at end of file diff --git a/Lang/Lua/Write-language-name-in-3D-ASCII b/Lang/Lua/Write-language-name-in-3D-ASCII new file mode 120000 index 0000000000..61b6d0ddb5 --- /dev/null +++ b/Lang/Lua/Write-language-name-in-3D-ASCII @@ -0,0 +1 @@ +../../Task/Write-language-name-in-3D-ASCII/Lua \ No newline at end of file diff --git a/Lang/M4/Count-in-factors b/Lang/M4/Count-in-factors new file mode 120000 index 0000000000..2f040f9b62 --- /dev/null +++ b/Lang/M4/Count-in-factors @@ -0,0 +1 @@ +../../Task/Count-in-factors/M4 \ No newline at end of file diff --git a/Lang/M4/Count-in-octal b/Lang/M4/Count-in-octal new file mode 120000 index 0000000000..0fc2b7745b --- /dev/null +++ b/Lang/M4/Count-in-octal @@ -0,0 +1 @@ +../../Task/Count-in-octal/M4 \ No newline at end of file diff --git a/Lang/MATLAB/Percentage-difference-between-images b/Lang/MATLAB/Percentage-difference-between-images new file mode 120000 index 0000000000..f74822f807 --- /dev/null +++ b/Lang/MATLAB/Percentage-difference-between-images @@ -0,0 +1 @@ +../../Task/Percentage-difference-between-images/MATLAB \ No newline at end of file diff --git a/Lang/MAXScript/Binary-digits b/Lang/MAXScript/Binary-digits new file mode 120000 index 0000000000..8f33f49b20 --- /dev/null +++ b/Lang/MAXScript/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/MAXScript \ No newline at end of file diff --git a/Lang/MAXScript/Even-or-odd b/Lang/MAXScript/Even-or-odd new file mode 120000 index 0000000000..c1c0fe4f6e --- /dev/null +++ b/Lang/MAXScript/Even-or-odd @@ -0,0 +1 @@ +../../Task/Even-or-odd/MAXScript \ No newline at end of file diff --git a/Lang/MAXScript/Reverse-words-in-a-string b/Lang/MAXScript/Reverse-words-in-a-string new file mode 120000 index 0000000000..7d5ea1ee59 --- /dev/null +++ b/Lang/MAXScript/Reverse-words-in-a-string @@ -0,0 +1 @@ +../../Task/Reverse-words-in-a-string/MAXScript \ No newline at end of file diff --git a/Lang/MUMPS/Generate-lower-case-ASCII-alphabet b/Lang/MUMPS/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..b15007906a --- /dev/null +++ b/Lang/MUMPS/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/MUMPS \ No newline at end of file diff --git a/Lang/MUMPS/Keyboard-input-Obtain-a-Y-or-N-response b/Lang/MUMPS/Keyboard-input-Obtain-a-Y-or-N-response new file mode 120000 index 0000000000..fbcb43e30b --- /dev/null +++ b/Lang/MUMPS/Keyboard-input-Obtain-a-Y-or-N-response @@ -0,0 +1 @@ +../../Task/Keyboard-input-Obtain-a-Y-or-N-response/MUMPS \ No newline at end of file diff --git a/Lang/MUMPS/Loops-Do-while b/Lang/MUMPS/Loops-Do-while new file mode 120000 index 0000000000..8e2e75e723 --- /dev/null +++ b/Lang/MUMPS/Loops-Do-while @@ -0,0 +1 @@ +../../Task/Loops-Do-while/MUMPS \ No newline at end of file diff --git a/Lang/MUMPS/Phrase-reversals b/Lang/MUMPS/Phrase-reversals new file mode 120000 index 0000000000..f1d842e412 --- /dev/null +++ b/Lang/MUMPS/Phrase-reversals @@ -0,0 +1 @@ +../../Task/Phrase-reversals/MUMPS \ No newline at end of file diff --git a/Lang/MUMPS/Sorting-algorithms-Quicksort b/Lang/MUMPS/Sorting-algorithms-Quicksort new file mode 120000 index 0000000000..2b37b28056 --- /dev/null +++ b/Lang/MUMPS/Sorting-algorithms-Quicksort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Quicksort/MUMPS \ No newline at end of file diff --git a/Lang/MUMPS/Terminal-control-Ringing-the-terminal-bell b/Lang/MUMPS/Terminal-control-Ringing-the-terminal-bell new file mode 120000 index 0000000000..8196e564e8 --- /dev/null +++ b/Lang/MUMPS/Terminal-control-Ringing-the-terminal-bell @@ -0,0 +1 @@ +../../Task/Terminal-control-Ringing-the-terminal-bell/MUMPS \ No newline at end of file diff --git a/Lang/Maple/00DESCRIPTION b/Lang/Maple/00DESCRIPTION index dff6601ba1..9c34ad0791 100644 --- a/Lang/Maple/00DESCRIPTION +++ b/Lang/Maple/00DESCRIPTION @@ -1,5 +1,8 @@ -{{stub}} {{language |site=http://www.maplesoft.com/products/maple/}} +Maple is a symbolic and numeric computing environment, and is also a multi-paradigm programming language. +Developed by Maplesoft, Maple also covers other aspects of technical computing, including visualization, data analysis, matrix computation, and connectivity. + +A toolbox, MapleSim, adds functionality for multidomain physical modeling and code generation. [[Category:Mathematical programming languages]] \ No newline at end of file diff --git a/Lang/Maple/9-billion-names-of-God-the-integer b/Lang/Maple/9-billion-names-of-God-the-integer new file mode 120000 index 0000000000..e9a45af79c --- /dev/null +++ b/Lang/Maple/9-billion-names-of-God-the-integer @@ -0,0 +1 @@ +../../Task/9-billion-names-of-God-the-integer/Maple \ No newline at end of file diff --git a/Lang/Maple/Abundant,-deficient-and-perfect-number-classifications b/Lang/Maple/Abundant,-deficient-and-perfect-number-classifications new file mode 120000 index 0000000000..d284639983 --- /dev/null +++ b/Lang/Maple/Abundant,-deficient-and-perfect-number-classifications @@ -0,0 +1 @@ +../../Task/Abundant,-deficient-and-perfect-number-classifications/Maple \ No newline at end of file diff --git a/Lang/Maple/Death-Star b/Lang/Maple/Death-Star new file mode 120000 index 0000000000..f56d08bfa5 --- /dev/null +++ b/Lang/Maple/Death-Star @@ -0,0 +1 @@ +../../Task/Death-Star/Maple \ No newline at end of file diff --git a/Lang/Maple/Draw-a-cuboid b/Lang/Maple/Draw-a-cuboid new file mode 120000 index 0000000000..14f74535bb --- /dev/null +++ b/Lang/Maple/Draw-a-cuboid @@ -0,0 +1 @@ +../../Task/Draw-a-cuboid/Maple \ No newline at end of file diff --git a/Lang/Maple/Hello-world-Line-printer b/Lang/Maple/Hello-world-Line-printer new file mode 120000 index 0000000000..31a407359d --- /dev/null +++ b/Lang/Maple/Hello-world-Line-printer @@ -0,0 +1 @@ +../../Task/Hello-world-Line-printer/Maple \ No newline at end of file diff --git a/Lang/Maple/Kaprekar-numbers b/Lang/Maple/Kaprekar-numbers new file mode 120000 index 0000000000..5a65bd2470 --- /dev/null +++ b/Lang/Maple/Kaprekar-numbers @@ -0,0 +1 @@ +../../Task/Kaprekar-numbers/Maple \ No newline at end of file diff --git a/Lang/Maple/Number-names b/Lang/Maple/Number-names new file mode 120000 index 0000000000..51f1516ee1 --- /dev/null +++ b/Lang/Maple/Number-names @@ -0,0 +1 @@ +../../Task/Number-names/Maple \ No newline at end of file diff --git a/Lang/Maple/One-of-n-lines-in-a-file b/Lang/Maple/One-of-n-lines-in-a-file new file mode 120000 index 0000000000..4e96012310 --- /dev/null +++ b/Lang/Maple/One-of-n-lines-in-a-file @@ -0,0 +1 @@ +../../Task/One-of-n-lines-in-a-file/Maple \ No newline at end of file diff --git a/Lang/Maple/Perfect-numbers b/Lang/Maple/Perfect-numbers new file mode 120000 index 0000000000..3ba2c2cc19 --- /dev/null +++ b/Lang/Maple/Perfect-numbers @@ -0,0 +1 @@ +../../Task/Perfect-numbers/Maple \ No newline at end of file diff --git a/Lang/Maple/Pernicious-numbers b/Lang/Maple/Pernicious-numbers new file mode 120000 index 0000000000..29a774260f --- /dev/null +++ b/Lang/Maple/Pernicious-numbers @@ -0,0 +1 @@ +../../Task/Pernicious-numbers/Maple \ No newline at end of file diff --git a/Lang/Maple/Polynomial-regression b/Lang/Maple/Polynomial-regression new file mode 120000 index 0000000000..eb7e840dcf --- /dev/null +++ b/Lang/Maple/Polynomial-regression @@ -0,0 +1 @@ +../../Task/Polynomial-regression/Maple \ No newline at end of file diff --git a/Lang/Maple/Sieve-of-Eratosthenes b/Lang/Maple/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..5c6c116679 --- /dev/null +++ b/Lang/Maple/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Maple \ No newline at end of file diff --git a/Lang/Maple/Yin-and-yang b/Lang/Maple/Yin-and-yang new file mode 120000 index 0000000000..79cba4a0bd --- /dev/null +++ b/Lang/Maple/Yin-and-yang @@ -0,0 +1 @@ +../../Task/Yin-and-yang/Maple \ No newline at end of file diff --git a/Lang/Mathematica/Color-of-a-screen-pixel b/Lang/Mathematica/Color-of-a-screen-pixel new file mode 120000 index 0000000000..2d850e13a2 --- /dev/null +++ b/Lang/Mathematica/Color-of-a-screen-pixel @@ -0,0 +1 @@ +../../Task/Color-of-a-screen-pixel/Mathematica \ No newline at end of file diff --git a/Lang/Mathematica/Hello-world-Web-server b/Lang/Mathematica/Hello-world-Web-server new file mode 120000 index 0000000000..95d24ac956 --- /dev/null +++ b/Lang/Mathematica/Hello-world-Web-server @@ -0,0 +1 @@ +../../Task/Hello-world-Web-server/Mathematica \ No newline at end of file diff --git a/Lang/Mathematica/Keyboard-input-Obtain-a-Y-or-N-response b/Lang/Mathematica/Keyboard-input-Obtain-a-Y-or-N-response new file mode 120000 index 0000000000..2b0d122150 --- /dev/null +++ b/Lang/Mathematica/Keyboard-input-Obtain-a-Y-or-N-response @@ -0,0 +1 @@ +../../Task/Keyboard-input-Obtain-a-Y-or-N-response/Mathematica \ No newline at end of file diff --git a/Lang/Mercury/ABC-Problem b/Lang/Mercury/ABC-Problem new file mode 120000 index 0000000000..acb29dcbec --- /dev/null +++ b/Lang/Mercury/ABC-Problem @@ -0,0 +1 @@ +../../Task/ABC-Problem/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Abstract-type b/Lang/Mercury/Abstract-type new file mode 120000 index 0000000000..8ab75eb8be --- /dev/null +++ b/Lang/Mercury/Abstract-type @@ -0,0 +1 @@ +../../Task/Abstract-type/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Accumulator-factory b/Lang/Mercury/Accumulator-factory new file mode 120000 index 0000000000..593314af06 --- /dev/null +++ b/Lang/Mercury/Accumulator-factory @@ -0,0 +1 @@ +../../Task/Accumulator-factory/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Arrays b/Lang/Mercury/Arrays new file mode 120000 index 0000000000..20f33a2067 --- /dev/null +++ b/Lang/Mercury/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Balanced-brackets b/Lang/Mercury/Balanced-brackets new file mode 120000 index 0000000000..fb35defc69 --- /dev/null +++ b/Lang/Mercury/Balanced-brackets @@ -0,0 +1 @@ +../../Task/Balanced-brackets/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Empty-string b/Lang/Mercury/Empty-string new file mode 120000 index 0000000000..ddf0cbf504 --- /dev/null +++ b/Lang/Mercury/Empty-string @@ -0,0 +1 @@ +../../Task/Empty-string/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Old-lady-swallowed-a-fly b/Lang/Mercury/Old-lady-swallowed-a-fly new file mode 120000 index 0000000000..524b532485 --- /dev/null +++ b/Lang/Mercury/Old-lady-swallowed-a-fly @@ -0,0 +1 @@ +../../Task/Old-lady-swallowed-a-fly/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Permutations b/Lang/Mercury/Permutations new file mode 120000 index 0000000000..95870487f9 --- /dev/null +++ b/Lang/Mercury/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Pythagorean-triples b/Lang/Mercury/Pythagorean-triples new file mode 120000 index 0000000000..5d9e4db67b --- /dev/null +++ b/Lang/Mercury/Pythagorean-triples @@ -0,0 +1 @@ +../../Task/Pythagorean-triples/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Range-extraction b/Lang/Mercury/Range-extraction new file mode 120000 index 0000000000..2ea31595d4 --- /dev/null +++ b/Lang/Mercury/Range-extraction @@ -0,0 +1 @@ +../../Task/Range-extraction/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Rock-paper-scissors b/Lang/Mercury/Rock-paper-scissors new file mode 120000 index 0000000000..fc366585a2 --- /dev/null +++ b/Lang/Mercury/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Sieve-of-Eratosthenes b/Lang/Mercury/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..1daae00055 --- /dev/null +++ b/Lang/Mercury/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Topological-sort b/Lang/Mercury/Topological-sort new file mode 120000 index 0000000000..56a32d2554 --- /dev/null +++ b/Lang/Mercury/Topological-sort @@ -0,0 +1 @@ +../../Task/Topological-sort/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Use-another-language-to-call-a-function b/Lang/Mercury/Use-another-language-to-call-a-function new file mode 120000 index 0000000000..4a57275482 --- /dev/null +++ b/Lang/Mercury/Use-another-language-to-call-a-function @@ -0,0 +1 @@ +../../Task/Use-another-language-to-call-a-function/Mercury \ No newline at end of file diff --git a/Lang/Mercury/Variables b/Lang/Mercury/Variables new file mode 120000 index 0000000000..2eb53499e0 --- /dev/null +++ b/Lang/Mercury/Variables @@ -0,0 +1 @@ +../../Task/Variables/Mercury \ No newline at end of file diff --git a/Lang/Modula-2/Arithmetic-geometric-mean b/Lang/Modula-2/Arithmetic-geometric-mean new file mode 120000 index 0000000000..7253f86301 --- /dev/null +++ b/Lang/Modula-2/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/Modula-2 \ No newline at end of file diff --git a/Lang/Modula-2/Chinese-remainder-theorem b/Lang/Modula-2/Chinese-remainder-theorem new file mode 120000 index 0000000000..451535aa89 --- /dev/null +++ b/Lang/Modula-2/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/Modula-2 \ No newline at end of file diff --git a/Lang/Modula-2/Quine b/Lang/Modula-2/Quine new file mode 120000 index 0000000000..6dfcb2fbf3 --- /dev/null +++ b/Lang/Modula-2/Quine @@ -0,0 +1 @@ +../../Task/Quine/Modula-2 \ No newline at end of file diff --git a/Lang/Modula-2/Ranking-methods b/Lang/Modula-2/Ranking-methods new file mode 120000 index 0000000000..ceedc90319 --- /dev/null +++ b/Lang/Modula-2/Ranking-methods @@ -0,0 +1 @@ +../../Task/Ranking-methods/Modula-2 \ No newline at end of file diff --git a/Lang/Modula-3/Caesar-cipher b/Lang/Modula-3/Caesar-cipher new file mode 120000 index 0000000000..d1b8af8e3a --- /dev/null +++ b/Lang/Modula-3/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/Modula-3 \ No newline at end of file diff --git a/Lang/Modula-3/Dining-philosophers b/Lang/Modula-3/Dining-philosophers new file mode 120000 index 0000000000..a7143c7a35 --- /dev/null +++ b/Lang/Modula-3/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/Modula-3 \ No newline at end of file diff --git a/Lang/Modula-3/Gaussian-elimination b/Lang/Modula-3/Gaussian-elimination new file mode 120000 index 0000000000..e976e89fdf --- /dev/null +++ b/Lang/Modula-3/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/Modula-3 \ No newline at end of file diff --git a/Lang/Modula-3/Permutations b/Lang/Modula-3/Permutations new file mode 120000 index 0000000000..0f3b7b9468 --- /dev/null +++ b/Lang/Modula-3/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/Modula-3 \ No newline at end of file diff --git a/Lang/Neko/00DESCRIPTION b/Lang/Neko/00DESCRIPTION index 053221edf9..89beba186e 100644 --- a/Lang/Neko/00DESCRIPTION +++ b/Lang/Neko/00DESCRIPTION @@ -1,4 +1,3 @@ -{{stub}} {{language |exec=bytecode |gc=yes @@ -6,4 +5,20 @@ |site=http://nekovm.org/ }} -'''Neko''' is a high-level [[Dynamic_programming|dynamically typed]] programming language developed by Nicolas Cannasse at [http://motion-twin.com/ Motion-Twin] as part of a R&D effort for better languages. \ No newline at end of file +'''Neko''' is a high-level [[Dynamic_programming|dynamically typed]] programming language developed by Nicolas Cannasse at [http://motion-twin.com/ Motion-Twin] as part of a R&D effort for better languages. + +'''Neko''' is also the name used for a Virtual Machine bytecode interpreter. The VM can be embedded in applications via a C language API. + +The '''nekoc''' command compiles Neko source code into NekoVM bytecode. The '''neko''' command runs NekoVM bytecode. + +Another language, '''NekoML''', also compiles to NekoVM bytecode. '''nekoml''' is a higher level functional programming language, inspired by OCaml. + +Other tools that ship with Neko, include a '''nekotools boot''' wrapper to create native executables that encapsulate NekoVM bytecode, and a small web server engine with embedded Neko. The '''nekotools server''' engine emulates the API provided by the Apache webserver plugin modules ''mod_neko'' and ''mod_tora''. + +'''Neko''' is a core part of the [[Haxe]] programming language/toolkit; one of the output targets. Neko is used for system level access, command line applications, and takes a supporting role in some of the tools that make up the Haxe programming environment. + +'''Neko''', introduced in 2005, may be superseded by a new virtual machine engine for Haxe development, [[HashLink]]. '''HashLink''' was introduced in 2016, designed as a successor to '''Neko'''. Haxe 4 (in preview in late 2018), still supports compilation to Neko bytecode and the '''Haxe 4''' environment still uses Neko library functions. + +* https://nekovm.org +* https://haxe.org +* https://hashlink.haxe.org \ No newline at end of file diff --git a/Lang/Neko/99-Bottles-of-Beer b/Lang/Neko/99-Bottles-of-Beer new file mode 120000 index 0000000000..6e5668fbb2 --- /dev/null +++ b/Lang/Neko/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/Neko \ No newline at end of file diff --git a/Lang/Neko/A+B b/Lang/Neko/A+B new file mode 120000 index 0000000000..4b97e4c729 --- /dev/null +++ b/Lang/Neko/A+B @@ -0,0 +1 @@ +../../Task/A+B/Neko \ No newline at end of file diff --git a/Lang/Neko/Array-concatenation b/Lang/Neko/Array-concatenation new file mode 120000 index 0000000000..aea19fc941 --- /dev/null +++ b/Lang/Neko/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/Neko \ No newline at end of file diff --git a/Lang/Neko/Bitwise-operations b/Lang/Neko/Bitwise-operations new file mode 120000 index 0000000000..8831cecd3a --- /dev/null +++ b/Lang/Neko/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/Neko \ No newline at end of file diff --git a/Lang/Neko/Boolean-values b/Lang/Neko/Boolean-values new file mode 120000 index 0000000000..65291b9f28 --- /dev/null +++ b/Lang/Neko/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/Neko \ No newline at end of file diff --git a/Lang/Neko/CRC-32 b/Lang/Neko/CRC-32 new file mode 120000 index 0000000000..6ff69f107d --- /dev/null +++ b/Lang/Neko/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/Neko \ No newline at end of file diff --git a/Lang/Neko/Character-codes b/Lang/Neko/Character-codes new file mode 120000 index 0000000000..02efa67f08 --- /dev/null +++ b/Lang/Neko/Character-codes @@ -0,0 +1 @@ +../../Task/Character-codes/Neko \ No newline at end of file diff --git a/Lang/Neko/Check-that-file-exists b/Lang/Neko/Check-that-file-exists new file mode 120000 index 0000000000..83b023ef22 --- /dev/null +++ b/Lang/Neko/Check-that-file-exists @@ -0,0 +1 @@ +../../Task/Check-that-file-exists/Neko \ No newline at end of file diff --git a/Lang/Neko/Command-line-arguments b/Lang/Neko/Command-line-arguments new file mode 120000 index 0000000000..a281598e52 --- /dev/null +++ b/Lang/Neko/Command-line-arguments @@ -0,0 +1 @@ +../../Task/Command-line-arguments/Neko \ No newline at end of file diff --git a/Lang/Neko/Concurrent-computing b/Lang/Neko/Concurrent-computing new file mode 120000 index 0000000000..1d98890413 --- /dev/null +++ b/Lang/Neko/Concurrent-computing @@ -0,0 +1 @@ +../../Task/Concurrent-computing/Neko \ No newline at end of file diff --git a/Lang/Neko/DNS-query b/Lang/Neko/DNS-query new file mode 120000 index 0000000000..0c4884497b --- /dev/null +++ b/Lang/Neko/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/Neko \ No newline at end of file diff --git a/Lang/Neko/Date-format b/Lang/Neko/Date-format new file mode 120000 index 0000000000..379d95d021 --- /dev/null +++ b/Lang/Neko/Date-format @@ -0,0 +1 @@ +../../Task/Date-format/Neko \ No newline at end of file diff --git a/Lang/Neko/Documentation b/Lang/Neko/Documentation new file mode 120000 index 0000000000..9475727289 --- /dev/null +++ b/Lang/Neko/Documentation @@ -0,0 +1 @@ +../../Task/Documentation/Neko \ No newline at end of file diff --git a/Lang/Neko/Find-limit-of-recursion b/Lang/Neko/Find-limit-of-recursion new file mode 120000 index 0000000000..f8630090cf --- /dev/null +++ b/Lang/Neko/Find-limit-of-recursion @@ -0,0 +1 @@ +../../Task/Find-limit-of-recursion/Neko \ No newline at end of file diff --git a/Lang/Neko/Generate-lower-case-ASCII-alphabet b/Lang/Neko/Generate-lower-case-ASCII-alphabet new file mode 120000 index 0000000000..594d6d3a38 --- /dev/null +++ b/Lang/Neko/Generate-lower-case-ASCII-alphabet @@ -0,0 +1 @@ +../../Task/Generate-lower-case-ASCII-alphabet/Neko \ No newline at end of file diff --git a/Lang/Neko/Greatest-element-of-a-list b/Lang/Neko/Greatest-element-of-a-list new file mode 120000 index 0000000000..01b80362d4 --- /dev/null +++ b/Lang/Neko/Greatest-element-of-a-list @@ -0,0 +1 @@ +../../Task/Greatest-element-of-a-list/Neko \ No newline at end of file diff --git a/Lang/Neko/Hash-from-two-arrays b/Lang/Neko/Hash-from-two-arrays new file mode 120000 index 0000000000..db473aac71 --- /dev/null +++ b/Lang/Neko/Hash-from-two-arrays @@ -0,0 +1 @@ +../../Task/Hash-from-two-arrays/Neko \ No newline at end of file diff --git a/Lang/Neko/Hello-world-Graphical b/Lang/Neko/Hello-world-Graphical new file mode 120000 index 0000000000..32fb551276 --- /dev/null +++ b/Lang/Neko/Hello-world-Graphical @@ -0,0 +1 @@ +../../Task/Hello-world-Graphical/Neko \ No newline at end of file diff --git a/Lang/Neko/Hello-world-Newline-omission b/Lang/Neko/Hello-world-Newline-omission new file mode 120000 index 0000000000..81bee223c1 --- /dev/null +++ b/Lang/Neko/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/Neko \ No newline at end of file diff --git a/Lang/Neko/Hello-world-Standard-error b/Lang/Neko/Hello-world-Standard-error new file mode 120000 index 0000000000..85745b5453 --- /dev/null +++ b/Lang/Neko/Hello-world-Standard-error @@ -0,0 +1 @@ +../../Task/Hello-world-Standard-error/Neko \ No newline at end of file diff --git a/Lang/Neko/Host-introspection b/Lang/Neko/Host-introspection new file mode 120000 index 0000000000..a1f9e56cd3 --- /dev/null +++ b/Lang/Neko/Host-introspection @@ -0,0 +1 @@ +../../Task/Host-introspection/Neko \ No newline at end of file diff --git a/Lang/Neko/Jump-anywhere b/Lang/Neko/Jump-anywhere new file mode 120000 index 0000000000..d91a6554c1 --- /dev/null +++ b/Lang/Neko/Jump-anywhere @@ -0,0 +1 @@ +../../Task/Jump-anywhere/Neko \ No newline at end of file diff --git a/Lang/Neko/Leap-year b/Lang/Neko/Leap-year new file mode 120000 index 0000000000..f580046172 --- /dev/null +++ b/Lang/Neko/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/Neko \ No newline at end of file diff --git a/Lang/Neko/Literals-Integer b/Lang/Neko/Literals-Integer new file mode 120000 index 0000000000..4c9fb03ba0 --- /dev/null +++ b/Lang/Neko/Literals-Integer @@ -0,0 +1 @@ +../../Task/Literals-Integer/Neko \ No newline at end of file diff --git a/Lang/Neko/Logical-operations b/Lang/Neko/Logical-operations new file mode 120000 index 0000000000..6c497ebbe6 --- /dev/null +++ b/Lang/Neko/Logical-operations @@ -0,0 +1 @@ +../../Task/Logical-operations/Neko \ No newline at end of file diff --git a/Lang/Neko/Loops-Break b/Lang/Neko/Loops-Break new file mode 120000 index 0000000000..1940d68c81 --- /dev/null +++ b/Lang/Neko/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/Neko \ No newline at end of file diff --git a/Lang/Neko/Loops-Continue b/Lang/Neko/Loops-Continue new file mode 120000 index 0000000000..975d085828 --- /dev/null +++ b/Lang/Neko/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/Neko \ No newline at end of file diff --git a/Lang/Neko/Loops-Do-while b/Lang/Neko/Loops-Do-while new file mode 120000 index 0000000000..9a2914de62 --- /dev/null +++ b/Lang/Neko/Loops-Do-while @@ -0,0 +1 @@ +../../Task/Loops-Do-while/Neko \ No newline at end of file diff --git a/Lang/Neko/Loops-Nested b/Lang/Neko/Loops-Nested new file mode 120000 index 0000000000..05708dbb42 --- /dev/null +++ b/Lang/Neko/Loops-Nested @@ -0,0 +1 @@ +../../Task/Loops-Nested/Neko \ No newline at end of file diff --git a/Lang/Neko/MD5 b/Lang/Neko/MD5 new file mode 120000 index 0000000000..76c7c12c0c --- /dev/null +++ b/Lang/Neko/MD5 @@ -0,0 +1 @@ +../../Task/MD5/Neko \ No newline at end of file diff --git a/Lang/Neko/Multiplication-tables b/Lang/Neko/Multiplication-tables new file mode 120000 index 0000000000..bfe3166379 --- /dev/null +++ b/Lang/Neko/Multiplication-tables @@ -0,0 +1 @@ +../../Task/Multiplication-tables/Neko \ No newline at end of file diff --git a/Lang/Neko/Null-object b/Lang/Neko/Null-object new file mode 120000 index 0000000000..c262dc1c22 --- /dev/null +++ b/Lang/Neko/Null-object @@ -0,0 +1 @@ +../../Task/Null-object/Neko \ No newline at end of file diff --git a/Lang/Neko/Object-serialization b/Lang/Neko/Object-serialization new file mode 120000 index 0000000000..86ef5efa95 --- /dev/null +++ b/Lang/Neko/Object-serialization @@ -0,0 +1 @@ +../../Task/Object-serialization/Neko \ No newline at end of file diff --git a/Lang/Neko/Program-termination b/Lang/Neko/Program-termination new file mode 120000 index 0000000000..48e9e43955 --- /dev/null +++ b/Lang/Neko/Program-termination @@ -0,0 +1 @@ +../../Task/Program-termination/Neko \ No newline at end of file diff --git a/Lang/Neko/Read-a-file-line-by-line b/Lang/Neko/Read-a-file-line-by-line new file mode 120000 index 0000000000..bb5a3cca2d --- /dev/null +++ b/Lang/Neko/Read-a-file-line-by-line @@ -0,0 +1 @@ +../../Task/Read-a-file-line-by-line/Neko \ No newline at end of file diff --git a/Lang/Neko/Read-entire-file b/Lang/Neko/Read-entire-file new file mode 120000 index 0000000000..49db05e18d --- /dev/null +++ b/Lang/Neko/Read-entire-file @@ -0,0 +1 @@ +../../Task/Read-entire-file/Neko \ No newline at end of file diff --git a/Lang/Neko/Real-constants-and-functions b/Lang/Neko/Real-constants-and-functions new file mode 120000 index 0000000000..64763faa26 --- /dev/null +++ b/Lang/Neko/Real-constants-and-functions @@ -0,0 +1 @@ +../../Task/Real-constants-and-functions/Neko \ No newline at end of file diff --git a/Lang/Neko/Remove-duplicate-elements b/Lang/Neko/Remove-duplicate-elements new file mode 120000 index 0000000000..60176a0ddb --- /dev/null +++ b/Lang/Neko/Remove-duplicate-elements @@ -0,0 +1 @@ +../../Task/Remove-duplicate-elements/Neko \ No newline at end of file diff --git a/Lang/Neko/Repeat-a-string b/Lang/Neko/Repeat-a-string new file mode 120000 index 0000000000..db5a34ca21 --- /dev/null +++ b/Lang/Neko/Repeat-a-string @@ -0,0 +1 @@ +../../Task/Repeat-a-string/Neko \ No newline at end of file diff --git a/Lang/Neko/Reverse-a-string b/Lang/Neko/Reverse-a-string new file mode 120000 index 0000000000..ee2bedd9dd --- /dev/null +++ b/Lang/Neko/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Neko \ No newline at end of file diff --git a/Lang/Neko/Rot-13 b/Lang/Neko/Rot-13 new file mode 120000 index 0000000000..a0906c472e --- /dev/null +++ b/Lang/Neko/Rot-13 @@ -0,0 +1 @@ +../../Task/Rot-13/Neko \ No newline at end of file diff --git a/Lang/Neko/Sockets b/Lang/Neko/Sockets new file mode 120000 index 0000000000..ffc6c5b897 --- /dev/null +++ b/Lang/Neko/Sockets @@ -0,0 +1 @@ +../../Task/Sockets/Neko \ No newline at end of file diff --git a/Lang/Neko/Sort-an-integer-array b/Lang/Neko/Sort-an-integer-array new file mode 120000 index 0000000000..6981f000fa --- /dev/null +++ b/Lang/Neko/Sort-an-integer-array @@ -0,0 +1 @@ +../../Task/Sort-an-integer-array/Neko \ No newline at end of file diff --git a/Lang/Neko/String-append b/Lang/Neko/String-append new file mode 120000 index 0000000000..14a1f6198e --- /dev/null +++ b/Lang/Neko/String-append @@ -0,0 +1 @@ +../../Task/String-append/Neko \ No newline at end of file diff --git a/Lang/Neko/String-concatenation b/Lang/Neko/String-concatenation new file mode 120000 index 0000000000..4047272f15 --- /dev/null +++ b/Lang/Neko/String-concatenation @@ -0,0 +1 @@ +../../Task/String-concatenation/Neko \ No newline at end of file diff --git a/Lang/Neko/String-interpolation--included- b/Lang/Neko/String-interpolation--included- new file mode 120000 index 0000000000..3039a68312 --- /dev/null +++ b/Lang/Neko/String-interpolation--included- @@ -0,0 +1 @@ +../../Task/String-interpolation--included-/Neko \ No newline at end of file diff --git a/Lang/Neko/String-prepend b/Lang/Neko/String-prepend new file mode 120000 index 0000000000..3b9a3779dc --- /dev/null +++ b/Lang/Neko/String-prepend @@ -0,0 +1 @@ +../../Task/String-prepend/Neko \ No newline at end of file diff --git a/Lang/Neko/Substring-Top-and-tail b/Lang/Neko/Substring-Top-and-tail new file mode 120000 index 0000000000..c8a9bdd84c --- /dev/null +++ b/Lang/Neko/Substring-Top-and-tail @@ -0,0 +1 @@ +../../Task/Substring-Top-and-tail/Neko \ No newline at end of file diff --git a/Lang/Neko/System-time b/Lang/Neko/System-time new file mode 120000 index 0000000000..e05c037b3c --- /dev/null +++ b/Lang/Neko/System-time @@ -0,0 +1 @@ +../../Task/System-time/Neko \ No newline at end of file diff --git a/Lang/Neko/User-input-Text b/Lang/Neko/User-input-Text new file mode 120000 index 0000000000..858d4e32f1 --- /dev/null +++ b/Lang/Neko/User-input-Text @@ -0,0 +1 @@ +../../Task/User-input-Text/Neko \ No newline at end of file diff --git a/Lang/Neko/XML-Input b/Lang/Neko/XML-Input new file mode 120000 index 0000000000..257a723d5f --- /dev/null +++ b/Lang/Neko/XML-Input @@ -0,0 +1 @@ +../../Task/XML-Input/Neko \ No newline at end of file diff --git a/Lang/Neko/Zero-to-the-zero-power b/Lang/Neko/Zero-to-the-zero-power new file mode 120000 index 0000000000..e1a9a0e1c7 --- /dev/null +++ b/Lang/Neko/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/Neko \ No newline at end of file diff --git a/Lang/NewLISP/Arithmetic-geometric-mean b/Lang/NewLISP/Arithmetic-geometric-mean new file mode 120000 index 0000000000..f750eacab4 --- /dev/null +++ b/Lang/NewLISP/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/NewLISP \ No newline at end of file diff --git a/Lang/NewLISP/Regular-expressions b/Lang/NewLISP/Regular-expressions new file mode 120000 index 0000000000..f9a7a54e1c --- /dev/null +++ b/Lang/NewLISP/Regular-expressions @@ -0,0 +1 @@ +../../Task/Regular-expressions/NewLISP \ No newline at end of file diff --git a/Lang/Nial/Arithmetic-Integer b/Lang/Nial/Arithmetic-Integer new file mode 120000 index 0000000000..ccc01e96a6 --- /dev/null +++ b/Lang/Nial/Arithmetic-Integer @@ -0,0 +1 @@ +../../Task/Arithmetic-Integer/Nial \ No newline at end of file diff --git a/Lang/Nial/Array-concatenation b/Lang/Nial/Array-concatenation new file mode 120000 index 0000000000..1f9d68eaf1 --- /dev/null +++ b/Lang/Nial/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/Nial \ No newline at end of file diff --git a/Lang/Nickle/00DESCRIPTION b/Lang/Nickle/00DESCRIPTION index caf8a2316f..53bb3afeae 100644 --- a/Lang/Nickle/00DESCRIPTION +++ b/Lang/Nickle/00DESCRIPTION @@ -1,3 +1,63 @@ -{{stub}}{{language +{{language |site=http://nickle.org/ -}} \ No newline at end of file +|gc=yes +|parampass=value +|express=implicit +|checking=dynamic +}} + +Nickle is a numerically oriented prototyping and scripting environment, with a syntax resembling C. + +By Keith Packard and Bart Massey. Debuted in 2001, the most common version in use is probably 2.79 from 2017. 2.85 was tagged on 2019-07-31 + +Originally a command line desk calculator, Nickle was extended with more sophisticated programming features. + +The numeric datatypes within Nickle make it a good choice for the design and implementation of numeric algorithms. Nickle provides three numeric data types: arbitrary precision integers, arbitrary-precision rationals and unbounded floating-point "reals" with specifiable precision. + +Other datatypes include multi-dimensional arrays, strings, structures, tagged unions and pointers. Higher level types include file, semaphore and thread. Functions are fully call by value, arrays and structures are copied, not referenced. + +The reference implementation includes an interactive top level with byte code compilation before evaluation. + +Example: +/* Arrays to JSON */ +autoimport JSON; +int [*] d = {1,2,3}; +poly [*] p = {1, "abc", 42}; + +printf("%s\n", to_json(d)); +printf("%s\n", to_json(p)); + +/* digits, %v spec for any "poly" types */ +printf("%g\n", 1/3); +printf("%g\n", imprecise(1/3, 8)); /* 8 bit internal precision */ +printf("%v\n", imprecise(1/3, 32)); /* 32 bit precision */ +printf("%v\n", imprecise(1/3, 500)); /* 500 bit precision */ +int f = 50!; +print f; + +/* looping */ +for (int i = 0; i < dim(p); i++) { + printf("%v ", p[i]); +} +printf("\n"); + +{{out}} +
prompt$ nickle sampler.5c
+[
+        1,
+        2,
+        3
+]
+[
+        1,
+        "abc",
+        42
+]
+0.333333333333333
+0.33
+0.333333333
+0.333333333333333
+global int f = 30414093201713378043612608166064768844377641568960512000000000000;
+1 "abc" 42
+ +While very suitable for general purpose programming, Nickle excels at prototyping numeric algorithms, and can be a nice complement to tools like Perl and AWK. \ No newline at end of file diff --git a/Lang/Nickle/Factorial b/Lang/Nickle/Factorial new file mode 120000 index 0000000000..20ad4874ce --- /dev/null +++ b/Lang/Nickle/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Nickle \ No newline at end of file diff --git a/Lang/Nickle/Hello-world-Text b/Lang/Nickle/Hello-world-Text new file mode 120000 index 0000000000..d47e46610b --- /dev/null +++ b/Lang/Nickle/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/Nickle \ No newline at end of file diff --git a/Lang/Nim/00DESCRIPTION b/Lang/Nim/00DESCRIPTION index ac05eedde3..fec58492b3 100644 --- a/Lang/Nim/00DESCRIPTION +++ b/Lang/Nim/00DESCRIPTION @@ -1,6 +1,6 @@ {{language |exec=machine -|gc=yes +|gc=yes (optional) |parampass=both |express=both |strength=strong @@ -8,6 +8,6 @@ |checking=static |site=http://nim-lang.org}} {{language programming paradigm|imperative}} -Nim (formerly known as Nimrod) is a general purpose, high-level, system programming, statically typed imperative compiled programming language that is developed by Andreas Rumpf. There is a lot of focus on portability and efficiency. The language compiles to C and supports many C compilers. Nim is actively being developed although it could use more developers. The language has extensive [http://nim-lang.org/docs/lib.html documentation], and a very good [http://nimrod-lang.org/docs/tut1.html tutorial]. +Nim (formerly known as Nimrod) is a general purpose, high-level, system programming, statically typed imperative compiled programming language that is developed by Andreas Rumpf. There is a lot of focus on portability and efficiency. The language compiles to C, C++ and JavaScript. Nim is actively being developed. The language has extensive [https://nim-lang.org/documentation.html documentation], and a very good [https://nim-lang.org/docs/tut1.html tutorial]. -You can ask for help on Freenode in the #nim channel. \ No newline at end of file +You can ask for help in the chat on Freenode in the #nim channel, on [https://gitter.im/nim-lang/Nim Gitter/Nim] or in the [https://forum.nim-lang.org forum]. \ No newline at end of file diff --git a/Lang/Nim/24-game-Solve b/Lang/Nim/24-game-Solve new file mode 120000 index 0000000000..5fe30c29fb --- /dev/null +++ b/Lang/Nim/24-game-Solve @@ -0,0 +1 @@ +../../Task/24-game-Solve/Nim \ No newline at end of file diff --git a/Lang/Nim/Arithmetic-evaluation b/Lang/Nim/Arithmetic-evaluation new file mode 120000 index 0000000000..1638b6782f --- /dev/null +++ b/Lang/Nim/Arithmetic-evaluation @@ -0,0 +1 @@ +../../Task/Arithmetic-evaluation/Nim \ No newline at end of file diff --git a/Lang/Nim/Best-shuffle b/Lang/Nim/Best-shuffle new file mode 120000 index 0000000000..16ce40d879 --- /dev/null +++ b/Lang/Nim/Best-shuffle @@ -0,0 +1 @@ +../../Task/Best-shuffle/Nim \ No newline at end of file diff --git a/Lang/Nim/Bitcoin-address-validation b/Lang/Nim/Bitcoin-address-validation new file mode 120000 index 0000000000..82b7c7f466 --- /dev/null +++ b/Lang/Nim/Bitcoin-address-validation @@ -0,0 +1 @@ +../../Task/Bitcoin-address-validation/Nim \ No newline at end of file diff --git a/Lang/Nim/Bitcoin-public-point-to-address b/Lang/Nim/Bitcoin-public-point-to-address new file mode 120000 index 0000000000..65f03fe4ff --- /dev/null +++ b/Lang/Nim/Bitcoin-public-point-to-address @@ -0,0 +1 @@ +../../Task/Bitcoin-public-point-to-address/Nim \ No newline at end of file diff --git a/Lang/Nim/Create-an-object-at-a-given-address b/Lang/Nim/Create-an-object-at-a-given-address new file mode 120000 index 0000000000..2f40bb182e --- /dev/null +++ b/Lang/Nim/Create-an-object-at-a-given-address @@ -0,0 +1 @@ +../../Task/Create-an-object-at-a-given-address/Nim \ No newline at end of file diff --git a/Lang/Nim/DNS-query b/Lang/Nim/DNS-query new file mode 120000 index 0000000000..4d9e7798f1 --- /dev/null +++ b/Lang/Nim/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/Nim \ No newline at end of file diff --git a/Lang/Nim/Extensible-prime-generator b/Lang/Nim/Extensible-prime-generator new file mode 120000 index 0000000000..c0a973bda8 --- /dev/null +++ b/Lang/Nim/Extensible-prime-generator @@ -0,0 +1 @@ +../../Task/Extensible-prime-generator/Nim \ No newline at end of file diff --git a/Lang/Nim/Image-noise b/Lang/Nim/Image-noise new file mode 120000 index 0000000000..ff43d88c00 --- /dev/null +++ b/Lang/Nim/Image-noise @@ -0,0 +1 @@ +../../Task/Image-noise/Nim \ No newline at end of file diff --git a/Lang/Nim/Inverted-syntax b/Lang/Nim/Inverted-syntax new file mode 120000 index 0000000000..2384c2d352 --- /dev/null +++ b/Lang/Nim/Inverted-syntax @@ -0,0 +1 @@ +../../Task/Inverted-syntax/Nim \ No newline at end of file diff --git a/Lang/Nim/Parsing-Shunting-yard-algorithm b/Lang/Nim/Parsing-Shunting-yard-algorithm new file mode 120000 index 0000000000..fa0e876000 --- /dev/null +++ b/Lang/Nim/Parsing-Shunting-yard-algorithm @@ -0,0 +1 @@ +../../Task/Parsing-Shunting-yard-algorithm/Nim \ No newline at end of file diff --git a/Lang/Nim/RIPEMD-160 b/Lang/Nim/RIPEMD-160 new file mode 120000 index 0000000000..57ff09cb4f --- /dev/null +++ b/Lang/Nim/RIPEMD-160 @@ -0,0 +1 @@ +../../Task/RIPEMD-160/Nim \ No newline at end of file diff --git a/Lang/Nim/S-Expressions b/Lang/Nim/S-Expressions new file mode 120000 index 0000000000..5d9d7d3459 --- /dev/null +++ b/Lang/Nim/S-Expressions @@ -0,0 +1 @@ +../../Task/S-Expressions/Nim \ No newline at end of file diff --git a/Lang/Nim/Stem-and-leaf-plot b/Lang/Nim/Stem-and-leaf-plot new file mode 120000 index 0000000000..bff8433cdb --- /dev/null +++ b/Lang/Nim/Stem-and-leaf-plot @@ -0,0 +1 @@ +../../Task/Stem-and-leaf-plot/Nim \ No newline at end of file diff --git a/Lang/Nim/Sudoku b/Lang/Nim/Sudoku new file mode 120000 index 0000000000..e2da7c12cc --- /dev/null +++ b/Lang/Nim/Sudoku @@ -0,0 +1 @@ +../../Task/Sudoku/Nim \ No newline at end of file diff --git a/Lang/Nim/Terminal-control-Dimensions b/Lang/Nim/Terminal-control-Dimensions new file mode 120000 index 0000000000..8ed5864868 --- /dev/null +++ b/Lang/Nim/Terminal-control-Dimensions @@ -0,0 +1 @@ +../../Task/Terminal-control-Dimensions/Nim \ No newline at end of file diff --git a/Lang/Nim/Terminal-control-Hiding-the-cursor b/Lang/Nim/Terminal-control-Hiding-the-cursor new file mode 120000 index 0000000000..b41872cf0f --- /dev/null +++ b/Lang/Nim/Terminal-control-Hiding-the-cursor @@ -0,0 +1 @@ +../../Task/Terminal-control-Hiding-the-cursor/Nim \ No newline at end of file diff --git a/Lang/Nim/Voronoi-diagram b/Lang/Nim/Voronoi-diagram new file mode 120000 index 0000000000..2508f6595a --- /dev/null +++ b/Lang/Nim/Voronoi-diagram @@ -0,0 +1 @@ +../../Task/Voronoi-diagram/Nim \ No newline at end of file diff --git a/Lang/OCaml/Calendar b/Lang/OCaml/Calendar new file mode 120000 index 0000000000..c0dcd2c42a --- /dev/null +++ b/Lang/OCaml/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/OCaml \ No newline at end of file diff --git a/Lang/OCaml/Function-prototype b/Lang/OCaml/Function-prototype new file mode 120000 index 0000000000..97dfbe70e4 --- /dev/null +++ b/Lang/OCaml/Function-prototype @@ -0,0 +1 @@ +../../Task/Function-prototype/OCaml \ No newline at end of file diff --git a/Lang/OCaml/Here-document b/Lang/OCaml/Here-document new file mode 120000 index 0000000000..c96ddf836b --- /dev/null +++ b/Lang/OCaml/Here-document @@ -0,0 +1 @@ +../../Task/Here-document/OCaml \ No newline at end of file diff --git a/Lang/OPL/Loops-Infinite b/Lang/OPL/Loops-Infinite new file mode 120000 index 0000000000..1db1c2df44 --- /dev/null +++ b/Lang/OPL/Loops-Infinite @@ -0,0 +1 @@ +../../Task/Loops-Infinite/OPL \ No newline at end of file diff --git a/Lang/Objeck/00DESCRIPTION b/Lang/Objeck/00DESCRIPTION index 2aacf5a086..eb6b4b9f26 100644 --- a/Lang/Objeck/00DESCRIPTION +++ b/Lang/Objeck/00DESCRIPTION @@ -9,8 +9,8 @@ |LCT=yes}} {{language programming paradigm|Object-oriented}}{{language programming paradigm|functional}} -The '''Objeck Programming Language''' is an [[object-oriented]] computing language with [[functional programming|functional]] features. The language has ties with [[Java]] and [[Scheme]]. In this language all data types, except for higher-order functions, are treated as objects. +'''Objeck ''' is an [[object-oriented]] computing language with [[functional programming|functional]] features. The language has ties with [[Java]] and [[Scheme]]. In this language all data types are treated as objects and functions are first-class. -The programming environment consists of an optimizing compiler, command-line debugger and virtual machine with associated [[Garbage collection|garbage collector]] and [[JIT]] compiler. The compiler emits binary [[bytecode]] that is executed by the runtime system. The runtime system has the ability to translate the bytecode into AMD64 or IA-32 executable machine code on the fly. +The programming environment consists of an optimizing compiler, command-line debugger and virtual machine with associated [[Garbage collection|garbage collector]] and [[JIT]] compiler. The compiler emits binary [[bytecode]] that is executed by the runtime system. The runtime system has the ability to translate the bytecode into AMD64 or IA-32 machine code on the fly. -For more information check out the [http://www.objeck.org/docs/objeck_lang.pdf Programmer's Guide] or this YouTube [https://www.youtube.com/watch?v=IUaQYdw02TU video]. The language can be [http://www.objeck.org obtained] from the main project homepage. \ No newline at end of file +For more information check out the getting started [https://www.objeck.org/getting_started.html guide]. \ No newline at end of file diff --git a/Lang/Objeck/Assertions b/Lang/Objeck/Assertions new file mode 120000 index 0000000000..2f8958c7e9 --- /dev/null +++ b/Lang/Objeck/Assertions @@ -0,0 +1 @@ +../../Task/Assertions/Objeck \ No newline at end of file diff --git a/Lang/Objeck/CRC-32 b/Lang/Objeck/CRC-32 new file mode 120000 index 0000000000..49900ab685 --- /dev/null +++ b/Lang/Objeck/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/Objeck \ No newline at end of file diff --git a/Lang/Objeck/CSV-data-manipulation b/Lang/Objeck/CSV-data-manipulation new file mode 120000 index 0000000000..8e9770f0ba --- /dev/null +++ b/Lang/Objeck/CSV-data-manipulation @@ -0,0 +1 @@ +../../Task/CSV-data-manipulation/Objeck \ No newline at end of file diff --git a/Lang/Objeck/CSV-to-HTML-translation b/Lang/Objeck/CSV-to-HTML-translation new file mode 120000 index 0000000000..ab26efddc8 --- /dev/null +++ b/Lang/Objeck/CSV-to-HTML-translation @@ -0,0 +1 @@ +../../Task/CSV-to-HTML-translation/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Closures-Value-capture b/Lang/Objeck/Closures-Value-capture new file mode 120000 index 0000000000..5f092293c6 --- /dev/null +++ b/Lang/Objeck/Closures-Value-capture @@ -0,0 +1 @@ +../../Task/Closures-Value-capture/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Comma-quibbling b/Lang/Objeck/Comma-quibbling new file mode 120000 index 0000000000..b28da8980e --- /dev/null +++ b/Lang/Objeck/Comma-quibbling @@ -0,0 +1 @@ +../../Task/Comma-quibbling/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Constrained-genericity b/Lang/Objeck/Constrained-genericity new file mode 120000 index 0000000000..ab6b639499 --- /dev/null +++ b/Lang/Objeck/Constrained-genericity @@ -0,0 +1 @@ +../../Task/Constrained-genericity/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Delegates b/Lang/Objeck/Delegates new file mode 120000 index 0000000000..a2c2ced7be --- /dev/null +++ b/Lang/Objeck/Delegates @@ -0,0 +1 @@ +../../Task/Delegates/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Documentation b/Lang/Objeck/Documentation new file mode 120000 index 0000000000..e885f72ffa --- /dev/null +++ b/Lang/Objeck/Documentation @@ -0,0 +1 @@ +../../Task/Documentation/Objeck \ No newline at end of file diff --git a/Lang/Objeck/First-class-functions b/Lang/Objeck/First-class-functions new file mode 120000 index 0000000000..106be1d150 --- /dev/null +++ b/Lang/Objeck/First-class-functions @@ -0,0 +1 @@ +../../Task/First-class-functions/Objeck \ No newline at end of file diff --git a/Lang/Objeck/First-class-functions-Use-numbers-analogously b/Lang/Objeck/First-class-functions-Use-numbers-analogously new file mode 120000 index 0000000000..1a5c4a6068 --- /dev/null +++ b/Lang/Objeck/First-class-functions-Use-numbers-analogously @@ -0,0 +1 @@ +../../Task/First-class-functions-Use-numbers-analogously/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Iterated-digits-squaring b/Lang/Objeck/Iterated-digits-squaring new file mode 120000 index 0000000000..68a96543d0 --- /dev/null +++ b/Lang/Objeck/Iterated-digits-squaring @@ -0,0 +1 @@ +../../Task/Iterated-digits-squaring/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Loops-Continue b/Lang/Objeck/Loops-Continue new file mode 120000 index 0000000000..b6b69dbd28 --- /dev/null +++ b/Lang/Objeck/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Ludic-numbers b/Lang/Objeck/Ludic-numbers new file mode 120000 index 0000000000..71c463bc1a --- /dev/null +++ b/Lang/Objeck/Ludic-numbers @@ -0,0 +1 @@ +../../Task/Ludic-numbers/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Price-fraction b/Lang/Objeck/Price-fraction new file mode 120000 index 0000000000..40ec145a70 --- /dev/null +++ b/Lang/Objeck/Price-fraction @@ -0,0 +1 @@ +../../Task/Price-fraction/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Sierpinski-triangle-Graphical b/Lang/Objeck/Sierpinski-triangle-Graphical new file mode 120000 index 0000000000..639347f118 --- /dev/null +++ b/Lang/Objeck/Sierpinski-triangle-Graphical @@ -0,0 +1 @@ +../../Task/Sierpinski-triangle-Graphical/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Soundex b/Lang/Objeck/Soundex new file mode 120000 index 0000000000..d819822ec6 --- /dev/null +++ b/Lang/Objeck/Soundex @@ -0,0 +1 @@ +../../Task/Soundex/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Terminal-control-Display-an-extended-character b/Lang/Objeck/Terminal-control-Display-an-extended-character new file mode 120000 index 0000000000..c70a56831f --- /dev/null +++ b/Lang/Objeck/Terminal-control-Display-an-extended-character @@ -0,0 +1 @@ +../../Task/Terminal-control-Display-an-extended-character/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Tic-tac-toe b/Lang/Objeck/Tic-tac-toe new file mode 120000 index 0000000000..bf7f640419 --- /dev/null +++ b/Lang/Objeck/Tic-tac-toe @@ -0,0 +1 @@ +../../Task/Tic-tac-toe/Objeck \ No newline at end of file diff --git a/Lang/Objeck/Walk-a-directory-Recursively b/Lang/Objeck/Walk-a-directory-Recursively new file mode 120000 index 0000000000..f46e9189b5 --- /dev/null +++ b/Lang/Objeck/Walk-a-directory-Recursively @@ -0,0 +1 @@ +../../Task/Walk-a-directory-Recursively/Objeck \ No newline at end of file diff --git a/Lang/Octave/Langtons-ant b/Lang/Octave/Langtons-ant new file mode 120000 index 0000000000..f122bc6515 --- /dev/null +++ b/Lang/Octave/Langtons-ant @@ -0,0 +1 @@ +../../Task/Langtons-ant/Octave \ No newline at end of file diff --git a/Lang/Ol/00DESCRIPTION b/Lang/Ol/00DESCRIPTION index cc4d77196d..9460eece00 100644 --- a/Lang/Ol/00DESCRIPTION +++ b/Lang/Ol/00DESCRIPTION @@ -12,9 +12,11 @@ [[Category:Scheme Implementations]] {{language programming paradigm|functional}} -Ol (Otus Lisp) is a purely* functional dialect of [[derived from::Lisp]]. It implements an extended subset of [http://www.schemers.org/Documents/Standards/R5RS/ R5RS] Scheme including, but not limited to, some of the [http://srfi.schemers.org/ SRFI], open source / free software, with a permissive license. +Ol (Otus Lisp) is a purely* functional dialect of [[derived from::Lisp]]. -It is small, embeddable and crossplatform. +It implements an extended subset of [http://www.schemers.org/Documents/Standards/R5RS/ R5RS] ([http://www.r7rs.org R7RS] from version 2.0) Scheme including, but not limited to, some of the [http://srfi.schemers.org/ SRFI]s, open source / free software, with a permissive license. + +It is small (approx 42kb virtual machine size), embeddable and crossplatform (x86/64, aarch64, arm, powerpc, mips32/64; GNU/Linux, Windows, Unix and *BSDs, Android, webOS, Minoca, Odroid, LattePanda; Web in asm.js form). Builds and source codes can be found at project [https://yuriy-chumak.github.io/ol/ home page] or [https://github.com/yuriy-chumak/ol Github]. diff --git a/Lang/Ol/100-doors b/Lang/Ol/100-doors new file mode 120000 index 0000000000..fbcd871850 --- /dev/null +++ b/Lang/Ol/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Ol \ No newline at end of file diff --git a/Lang/Ol/Anonymous-recursion b/Lang/Ol/Anonymous-recursion new file mode 120000 index 0000000000..b1a8a0fb27 --- /dev/null +++ b/Lang/Ol/Anonymous-recursion @@ -0,0 +1 @@ +../../Task/Anonymous-recursion/Ol \ No newline at end of file diff --git a/Lang/Ol/Arrays b/Lang/Ol/Arrays new file mode 120000 index 0000000000..0cd507ee3e --- /dev/null +++ b/Lang/Ol/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/Ol \ No newline at end of file diff --git a/Lang/Ol/Comma-quibbling b/Lang/Ol/Comma-quibbling new file mode 120000 index 0000000000..31d648e418 --- /dev/null +++ b/Lang/Ol/Comma-quibbling @@ -0,0 +1 @@ +../../Task/Comma-quibbling/Ol \ No newline at end of file diff --git a/Lang/Ol/Conditional-structures b/Lang/Ol/Conditional-structures new file mode 120000 index 0000000000..6131b711f8 --- /dev/null +++ b/Lang/Ol/Conditional-structures @@ -0,0 +1 @@ +../../Task/Conditional-structures/Ol \ No newline at end of file diff --git a/Lang/Ol/Conways-Game-of-Life b/Lang/Ol/Conways-Game-of-Life new file mode 120000 index 0000000000..ef7e16e1b1 --- /dev/null +++ b/Lang/Ol/Conways-Game-of-Life @@ -0,0 +1 @@ +../../Task/Conways-Game-of-Life/Ol \ No newline at end of file diff --git a/Lang/Ol/Detect-division-by-zero b/Lang/Ol/Detect-division-by-zero new file mode 120000 index 0000000000..1b11ab0ca7 --- /dev/null +++ b/Lang/Ol/Detect-division-by-zero @@ -0,0 +1 @@ +../../Task/Detect-division-by-zero/Ol \ No newline at end of file diff --git a/Lang/Ol/Dot-product b/Lang/Ol/Dot-product new file mode 120000 index 0000000000..16e8d91ffa --- /dev/null +++ b/Lang/Ol/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/Ol \ No newline at end of file diff --git a/Lang/Ol/Fibonacci-n-step-number-sequences b/Lang/Ol/Fibonacci-n-step-number-sequences new file mode 120000 index 0000000000..0cfdb0bfb7 --- /dev/null +++ b/Lang/Ol/Fibonacci-n-step-number-sequences @@ -0,0 +1 @@ +../../Task/Fibonacci-n-step-number-sequences/Ol \ No newline at end of file diff --git a/Lang/Ol/First-class-functions b/Lang/Ol/First-class-functions new file mode 120000 index 0000000000..65be50c3d1 --- /dev/null +++ b/Lang/Ol/First-class-functions @@ -0,0 +1 @@ +../../Task/First-class-functions/Ol \ No newline at end of file diff --git a/Lang/Ol/Forest-fire b/Lang/Ol/Forest-fire new file mode 120000 index 0000000000..a3809cc3ee --- /dev/null +++ b/Lang/Ol/Forest-fire @@ -0,0 +1 @@ +../../Task/Forest-fire/Ol \ No newline at end of file diff --git a/Lang/Ol/Function-definition b/Lang/Ol/Function-definition new file mode 120000 index 0000000000..7f4fd7e0e0 --- /dev/null +++ b/Lang/Ol/Function-definition @@ -0,0 +1 @@ +../../Task/Function-definition/Ol \ No newline at end of file diff --git a/Lang/Ol/Greatest-common-divisor b/Lang/Ol/Greatest-common-divisor new file mode 120000 index 0000000000..c3a209e1af --- /dev/null +++ b/Lang/Ol/Greatest-common-divisor @@ -0,0 +1 @@ +../../Task/Greatest-common-divisor/Ol \ No newline at end of file diff --git a/Lang/Ol/Hello-world-Graphical b/Lang/Ol/Hello-world-Graphical new file mode 120000 index 0000000000..6f85578185 --- /dev/null +++ b/Lang/Ol/Hello-world-Graphical @@ -0,0 +1 @@ +../../Task/Hello-world-Graphical/Ol \ No newline at end of file diff --git a/Lang/Ol/Hello-world-Standard-error b/Lang/Ol/Hello-world-Standard-error new file mode 120000 index 0000000000..5123c85aa8 --- /dev/null +++ b/Lang/Ol/Hello-world-Standard-error @@ -0,0 +1 @@ +../../Task/Hello-world-Standard-error/Ol \ No newline at end of file diff --git a/Lang/Ol/Higher-order-functions b/Lang/Ol/Higher-order-functions new file mode 120000 index 0000000000..e3c31e7649 --- /dev/null +++ b/Lang/Ol/Higher-order-functions @@ -0,0 +1 @@ +../../Task/Higher-order-functions/Ol \ No newline at end of file diff --git a/Lang/Ol/Infinity b/Lang/Ol/Infinity new file mode 120000 index 0000000000..9d0777335f --- /dev/null +++ b/Lang/Ol/Infinity @@ -0,0 +1 @@ +../../Task/Infinity/Ol \ No newline at end of file diff --git a/Lang/Ol/Integer-comparison b/Lang/Ol/Integer-comparison new file mode 120000 index 0000000000..a21682bf13 --- /dev/null +++ b/Lang/Ol/Integer-comparison @@ -0,0 +1 @@ +../../Task/Integer-comparison/Ol \ No newline at end of file diff --git a/Lang/Ol/Integer-sequence b/Lang/Ol/Integer-sequence new file mode 120000 index 0000000000..f6883c0d65 --- /dev/null +++ b/Lang/Ol/Integer-sequence @@ -0,0 +1 @@ +../../Task/Integer-sequence/Ol \ No newline at end of file diff --git a/Lang/Ol/Jump-anywhere b/Lang/Ol/Jump-anywhere new file mode 120000 index 0000000000..f074b4e53a --- /dev/null +++ b/Lang/Ol/Jump-anywhere @@ -0,0 +1 @@ +../../Task/Jump-anywhere/Ol \ No newline at end of file diff --git a/Lang/Ol/Knuth-shuffle b/Lang/Ol/Knuth-shuffle new file mode 120000 index 0000000000..da53e27934 --- /dev/null +++ b/Lang/Ol/Knuth-shuffle @@ -0,0 +1 @@ +../../Task/Knuth-shuffle/Ol \ No newline at end of file diff --git a/Lang/Ol/LZW-compression b/Lang/Ol/LZW-compression new file mode 120000 index 0000000000..9db9acd97d --- /dev/null +++ b/Lang/Ol/LZW-compression @@ -0,0 +1 @@ +../../Task/LZW-compression/Ol \ No newline at end of file diff --git a/Lang/Ol/Long-multiplication b/Lang/Ol/Long-multiplication new file mode 120000 index 0000000000..0ae37804f3 --- /dev/null +++ b/Lang/Ol/Long-multiplication @@ -0,0 +1 @@ +../../Task/Long-multiplication/Ol \ No newline at end of file diff --git a/Lang/Ol/Loops-Break b/Lang/Ol/Loops-Break new file mode 120000 index 0000000000..cb53345053 --- /dev/null +++ b/Lang/Ol/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/Ol \ No newline at end of file diff --git a/Lang/Ol/Loops-Infinite b/Lang/Ol/Loops-Infinite new file mode 120000 index 0000000000..0b3db10d0b --- /dev/null +++ b/Lang/Ol/Loops-Infinite @@ -0,0 +1 @@ +../../Task/Loops-Infinite/Ol \ No newline at end of file diff --git a/Lang/Ol/Man-or-boy-test b/Lang/Ol/Man-or-boy-test new file mode 120000 index 0000000000..8a0d2fb329 --- /dev/null +++ b/Lang/Ol/Man-or-boy-test @@ -0,0 +1 @@ +../../Task/Man-or-boy-test/Ol \ No newline at end of file diff --git a/Lang/Ol/Mandelbrot-set b/Lang/Ol/Mandelbrot-set new file mode 120000 index 0000000000..521d2fad4a --- /dev/null +++ b/Lang/Ol/Mandelbrot-set @@ -0,0 +1 @@ +../../Task/Mandelbrot-set/Ol \ No newline at end of file diff --git a/Lang/Ol/Maze-generation b/Lang/Ol/Maze-generation new file mode 120000 index 0000000000..7617817cdf --- /dev/null +++ b/Lang/Ol/Maze-generation @@ -0,0 +1 @@ +../../Task/Maze-generation/Ol \ No newline at end of file diff --git a/Lang/Ol/Mutual-recursion b/Lang/Ol/Mutual-recursion new file mode 120000 index 0000000000..eb290013dd --- /dev/null +++ b/Lang/Ol/Mutual-recursion @@ -0,0 +1 @@ +../../Task/Mutual-recursion/Ol \ No newline at end of file diff --git a/Lang/Ol/Object-serialization b/Lang/Ol/Object-serialization new file mode 120000 index 0000000000..5bfd52d2bc --- /dev/null +++ b/Lang/Ol/Object-serialization @@ -0,0 +1 @@ +../../Task/Object-serialization/Ol \ No newline at end of file diff --git a/Lang/Ol/Odd-word-problem b/Lang/Ol/Odd-word-problem new file mode 120000 index 0000000000..31c4bc963b --- /dev/null +++ b/Lang/Ol/Odd-word-problem @@ -0,0 +1 @@ +../../Task/Odd-word-problem/Ol \ No newline at end of file diff --git a/Lang/Ol/OpenGL b/Lang/Ol/OpenGL new file mode 120000 index 0000000000..17626dd18c --- /dev/null +++ b/Lang/Ol/OpenGL @@ -0,0 +1 @@ +../../Task/OpenGL/Ol \ No newline at end of file diff --git a/Lang/Ol/Order-two-numerical-lists b/Lang/Ol/Order-two-numerical-lists new file mode 120000 index 0000000000..7c5576dbaf --- /dev/null +++ b/Lang/Ol/Order-two-numerical-lists @@ -0,0 +1 @@ +../../Task/Order-two-numerical-lists/Ol \ No newline at end of file diff --git a/Lang/Ol/Palindrome-detection b/Lang/Ol/Palindrome-detection new file mode 120000 index 0000000000..870525dd61 --- /dev/null +++ b/Lang/Ol/Palindrome-detection @@ -0,0 +1 @@ +../../Task/Palindrome-detection/Ol \ No newline at end of file diff --git a/Lang/Ol/Pi b/Lang/Ol/Pi new file mode 120000 index 0000000000..1673dfb956 --- /dev/null +++ b/Lang/Ol/Pi @@ -0,0 +1 @@ +../../Task/Pi/Ol \ No newline at end of file diff --git a/Lang/Ol/Pick-random-element b/Lang/Ol/Pick-random-element new file mode 120000 index 0000000000..bb5493b424 --- /dev/null +++ b/Lang/Ol/Pick-random-element @@ -0,0 +1 @@ +../../Task/Pick-random-element/Ol \ No newline at end of file diff --git a/Lang/Ol/Plot-coordinate-pairs b/Lang/Ol/Plot-coordinate-pairs new file mode 120000 index 0000000000..0bdcca9260 --- /dev/null +++ b/Lang/Ol/Plot-coordinate-pairs @@ -0,0 +1 @@ +../../Task/Plot-coordinate-pairs/Ol \ No newline at end of file diff --git a/Lang/Ol/Program-name b/Lang/Ol/Program-name new file mode 120000 index 0000000000..68728fec83 --- /dev/null +++ b/Lang/Ol/Program-name @@ -0,0 +1 @@ +../../Task/Program-name/Ol \ No newline at end of file diff --git a/Lang/Ol/Program-termination b/Lang/Ol/Program-termination new file mode 120000 index 0000000000..515f355693 --- /dev/null +++ b/Lang/Ol/Program-termination @@ -0,0 +1 @@ +../../Task/Program-termination/Ol \ No newline at end of file diff --git a/Lang/Ol/Pythagorean-triples b/Lang/Ol/Pythagorean-triples new file mode 120000 index 0000000000..bd84cb03a3 --- /dev/null +++ b/Lang/Ol/Pythagorean-triples @@ -0,0 +1 @@ +../../Task/Pythagorean-triples/Ol \ No newline at end of file diff --git a/Lang/Ol/Read-entire-file b/Lang/Ol/Read-entire-file new file mode 120000 index 0000000000..8d28e34394 --- /dev/null +++ b/Lang/Ol/Read-entire-file @@ -0,0 +1 @@ +../../Task/Read-entire-file/Ol \ No newline at end of file diff --git a/Lang/Ol/Regular-expressions b/Lang/Ol/Regular-expressions new file mode 120000 index 0000000000..e4214d0b5b --- /dev/null +++ b/Lang/Ol/Regular-expressions @@ -0,0 +1 @@ +../../Task/Regular-expressions/Ol \ No newline at end of file diff --git a/Lang/Ol/Reverse-a-string b/Lang/Ol/Reverse-a-string new file mode 120000 index 0000000000..e6e7bfc11f --- /dev/null +++ b/Lang/Ol/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Ol \ No newline at end of file diff --git a/Lang/Ol/Sequence-of-non-squares b/Lang/Ol/Sequence-of-non-squares new file mode 120000 index 0000000000..dca6da71e8 --- /dev/null +++ b/Lang/Ol/Sequence-of-non-squares @@ -0,0 +1 @@ +../../Task/Sequence-of-non-squares/Ol \ No newline at end of file diff --git a/Lang/Ol/Set b/Lang/Ol/Set new file mode 120000 index 0000000000..11840148ec --- /dev/null +++ b/Lang/Ol/Set @@ -0,0 +1 @@ +../../Task/Set/Ol \ No newline at end of file diff --git a/Lang/Ol/Sieve-of-Eratosthenes b/Lang/Ol/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..f73c556b50 --- /dev/null +++ b/Lang/Ol/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Ol \ No newline at end of file diff --git a/Lang/Ol/Sum-and-product-of-an-array b/Lang/Ol/Sum-and-product-of-an-array new file mode 120000 index 0000000000..e103f427c8 --- /dev/null +++ b/Lang/Ol/Sum-and-product-of-an-array @@ -0,0 +1 @@ +../../Task/Sum-and-product-of-an-array/Ol \ No newline at end of file diff --git a/Lang/Ol/Sum-digits-of-an-integer b/Lang/Ol/Sum-digits-of-an-integer new file mode 120000 index 0000000000..24c243ea83 --- /dev/null +++ b/Lang/Ol/Sum-digits-of-an-integer @@ -0,0 +1 @@ +../../Task/Sum-digits-of-an-integer/Ol \ No newline at end of file diff --git a/Lang/Ol/Sum-multiples-of-3-and-5 b/Lang/Ol/Sum-multiples-of-3-and-5 new file mode 120000 index 0000000000..83a0d17215 --- /dev/null +++ b/Lang/Ol/Sum-multiples-of-3-and-5 @@ -0,0 +1 @@ +../../Task/Sum-multiples-of-3-and-5/Ol \ No newline at end of file diff --git a/Lang/Ol/Sum-of-squares b/Lang/Ol/Sum-of-squares new file mode 120000 index 0000000000..cd23b2799e --- /dev/null +++ b/Lang/Ol/Sum-of-squares @@ -0,0 +1 @@ +../../Task/Sum-of-squares/Ol \ No newline at end of file diff --git a/Lang/Ol/Zero-to-the-zero-power b/Lang/Ol/Zero-to-the-zero-power new file mode 120000 index 0000000000..e203aa3763 --- /dev/null +++ b/Lang/Ol/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/Ol \ No newline at end of file diff --git a/Lang/OpenEdge-Progress/Combinations b/Lang/OpenEdge-Progress/Combinations new file mode 120000 index 0000000000..ed1fb057d4 --- /dev/null +++ b/Lang/OpenEdge-Progress/Combinations @@ -0,0 +1 @@ +../../Task/Combinations/OpenEdge-Progress \ No newline at end of file diff --git a/Lang/OpenEdge-Progress/Permutations b/Lang/OpenEdge-Progress/Permutations new file mode 120000 index 0000000000..ae1a1e3762 --- /dev/null +++ b/Lang/OpenEdge-Progress/Permutations @@ -0,0 +1 @@ +../../Task/Permutations/OpenEdge-Progress \ No newline at end of file diff --git a/Lang/Oz/00DESCRIPTION b/Lang/Oz/00DESCRIPTION index 31a6626c9c..1faa3feeba 100644 --- a/Lang/Oz/00DESCRIPTION +++ b/Lang/Oz/00DESCRIPTION @@ -1,5 +1,5 @@ {{language|Oz -|site=http://www.mozart-oz.org +|site=https://mozart.github.io/ |checking=dynamic |gc=yes |LCT=yes @@ -17,7 +17,7 @@ The [[Mozart/Oz|Mozart]] Programming System is the primary implementation of Oz. ==How to execute the examples on Rosetta Code== All examples that start with declare can be used directly in the Emacs-based IDE, without a separate compilation step. Just copy the source code to the Oz buffer and select the menu item "Oz→Feed Buffer". -Some examples are functor definitions and must be compiled. If a makefile.oz is supplied, execute ozmake to build the project. Otherwise call the compiler directly: ozc -c filename.oz. Execute a compiled functor with ozengine filename.ozf. +Some examples are functor definitions and must be compiled. The compiler is invoked with a command such as: ozc -c filename.oz, and then executed with the command, ozengine filename.ozf. This [https://stackoverflow.com/a/29207029/371304 Stack Overflow answer] shows an example of the boilerplate to transform code written for the Emacs IDE to code that can run directly on the Mozart VM. ==Citation== #[https://mozart.github.io/mozart-v1/doc-1.4.0/tutorial/index.html Tutorial of Oz] diff --git a/Lang/PARI-GP/00DESCRIPTION b/Lang/PARI-GP/00DESCRIPTION index 21b73ea162..e1f1c23bbc 100644 --- a/Lang/PARI-GP/00DESCRIPTION +++ b/Lang/PARI-GP/00DESCRIPTION @@ -20,7 +20,7 @@ PARI/GP is composed of two parts: a [[C]] library called PARI and an interface, PARI was written by Henri Cohen and others at Université de Bordeaux and is now maintained by Karim Belabas. gp was originally written by Dominique Bernardi, then maintained and enhanced by Karim Belabas and Ilya Zakharevich, and finally rewritten by Bill Allombert. == Getting PARI/GP == -PARI/GP can be used in many different operating systems. For other systems, see the [http://pari.math.u-bordeaux.fr/download.html download page] or the [https://pari.math.u-bordeaux.fr/lists-index.html mailing lists]. +PARI/GP can be used in many different operating systems. This is a reasonably comprehensive list of currently-supported systems; for other systems, please use the [https://pari.math.u-bordeaux.fr/lists-index.html mailing lists]. {| class="wikitable" |- @@ -46,7 +46,7 @@ PARI/GP can be used in many different operating systems. For other systems, see | [http://pari.math.u-bordeaux.fr/pub/pari/windows/snapshots/ official site] | run |- -| rowspan="5" | Linux +| rowspan="6" | Linux | Ubuntu/Debian | package manager | [https://packages.debian.org/stretch/pari-gp Debian packages] @@ -77,7 +77,7 @@ PARI/GP can be used in many different operating systems. For other systems, see | [http://pari.math.u-bordeaux.fr/download.html official site] | [http://math.crg4.com/software.html#pari Building PARI/GP in Linux] |- -| rowspan="2" | Mac OS +| rowspan="4" | macOS | at least El Capitan (10.11) | DMG installer (stable or development) | [http://pari.math.u-bordeaux.fr/download.html#macos official site] @@ -88,6 +88,16 @@ PARI/GP can be used in many different operating systems. For other systems, see | [http://pari.math.u-bordeaux.fr/download.html#macos official site] | run |- +| unknown, at least OS X (10.?) +| package manager +| [https://www.macports.org/ports.php?by=variant&substr=mt MacPorts search] (and [https://github.com/macports/macports-ports/blob/master/math/pari/Portfile portfile]) +| sudo port install pari +|- +| unknown +| package manager +| [https://brewformulas.org/ Homebrew] [https://brewformulas.org/Pari formula] +| brew install pari +|- | rowspan="5" | Android | various | package manager @@ -116,11 +126,11 @@ PARI/GP can be used in many different operating systems. For other systems, see |- | iOS | iOS 8+ -| package manager +| app | [https://itunes.apple.com/us/app/sage-math/id496492945?mt=8 sage-math] | Click the "+" in the top-right to start a new program, then click and hold on "Sage" at the top until the "Select Language" dropdown appears, then choose GP. (You can also use the wrapper function pari in a Sage snippet.) |- -| rowspan="4" | Online +| rowspan="4" | online | Chrome, Firefox, Internet Explorer | local Javascript | [http://pari.math.u-bordeaux.fr/gp.html Emscripten] @@ -151,13 +161,14 @@ The most common way to use PARI is through the gp calculator, using its own scri * [https://github.com/jdemeyer/pari_jupyter Jupyter kernel] If you want to program with PARI, many languages are supported: -* [[C]]: PARI is written in C, so it's very easy to either write your own programs or extend gp using C. The [http://pari.math.u-bordeaux.fr/pub/pari/manuals/gp2c/gp2c.html gp2c] utility converts GP scripts into executable C code. +* [[C]]: PARI is written in C, so it's very easy to either write your own programs or extend gp using C. +** The [http://pari.math.u-bordeaux.fr/pub/pari/manuals/gp2c/gp2c.html gp2c] utility converts GP scripts into executable C code. ** For use with the Gnu Mpc library, there is also [http://www.multiprecision.org/?prog=pari-gnump Pari-Gnump]. * [[C++]]: PARI can be used directly in C++. The code is intentionally written in a C++-compatible style. -fpermissive is sometimes useful when compiling with g++. * [[Python]]: ** [http://www.sagemath.org/ SageMath] (or SAGE) is a Python-based system that includes GP among others ** [http://code.google.com/p/pari-python/ pari-python] -** [https://pypi.python.org/pypi/cypari/ cypari] is a fork of the GP component of SageMath +** [https://pypi.python.org/pypi/cypari/ cypari] is a fork of the GP component of SageMath (see also the voluminous [https://buildmedia.readthedocs.org/media/pdf/cypari2/latest/cypari2.pdf CyPari2 Documentation]) * [[Perl]]: ** [http://search.cpan.org/dist/Math-Pari/ Math::Pari] ** [https://github.com/FreeMonad/GPP GPP] @@ -175,23 +186,31 @@ If you want to program with PARI, many languages are supported: *[http://hyperpolyglot.org/more-computer-algebra Comparison with Magma, GAP, and Singular] === Tutorials === -*[http://pari.math.u-bordeaux.fr/pub/pari/manuals/2.9.0/tutorial.pdf Official tutorial] by The PARI Group (58 pp., 2016) +*[http://pari.math.u-bordeaux.fr/pub/pari/manuals/2.11.1/tutorial.pdf Official tutorial] by The PARI Group (58 pp., 2018) +*French tutorials (slides) by Bill Allombert (2017): +** [https://pari.math.u-bordeaux.fr/Events/PARI2017c/talks/init.pdf Introduction à PARI/GP] (13 pp.) +** [https://pari.math.u-bordeaux.fr/Events/PARI2017c/talks/prog.pdf Programmation GP] (11 pp.) +** [https://pari.math.u-bordeaux.fr/Events/PARI2017c/talks/TAN.pdf Théorie algébrique des nombres] (31 pp.) +** [https://pari.math.u-bordeaux.fr/Events/PARI2017c/talks/TAN2.pdf Théorie algébrique des nombres avancée] (22 pp.) +** [https://pari.math.u-bordeaux.fr/Events/PARI2017c/talks/ecc.pdf Courbes elliptiques sur les corps finis] (4 pp.) *[http://www.math.u-bordeaux.fr/~ballombe/talks/bordeaux-20150924.pdf Tutorial on Elliptic Curves] by Bill Allombert and Karim Belabas (5 pp., 2016) *[http://www.personal.psu.edu/bug/467/pariinfo.pdf Beginning PARI Programming for CSE/MATH 467] by W. Dale Brownawell (7 pp., 2014) -*[http://www.math.uiuc.edu/~r-ash/GPTutorial.pdf Tutorial] by Robert B. Ash (20 pp., 2007) -*[http://people.math.umass.edu/~siman/09.791N/tutorial.pdf Tutorial] by Siman Wong (6 pp., 2009) -*[http://www.math.uconn.edu/~kconrad/math5230f08/parihandout.pdf Introduction] by Keith Conrad (7 pp., 2008) -*[http://www.linuxjournal.com/article/1068 The Pari Package On Linux], by Klaus-Peter Nischke (3 pp., 1995) -*[http://mvngu.wordpress.com/2008/08/01/parigp-programming-for-basic-cryptography/ PARI/GP programming for basic cryptography] by Minh Van Nguyen (appx. 3 pp., 2008); also appears in an [https://bitbucket.org/mvngu/www/downloads/2008-11-25_numtheory-crypto-gp.pdf extended version] (9 pp., 2008) -*[http://www.exploringbinary.com/exploring-binary-numbers-with-parigp-calculator/ Exploring binary numbers with PARI/GP calculator] by Rick Regan (appx. 4 pp., 2009) -*Video tutorials, parts [http://www.youtube.com/watch?v=0G-9JzlrzBM 1] [http://www.youtube.com/watch?v=d7i0rv59hns 2] [http://www.youtube.com/watch?v=wCyU2n-G-pk 3] [http://www.youtube.com/watch?v=WOCuBvK8O6Q 4] (appx. 20 minutes, 2011) -*[http://w3.countnumber.de/fischer/res-ZT2007/PariByExample.pdf Erste Schritte mit PARI/GP] by Lars Fischer (13 pp., 2007; German) -*[http://www.maths.tcd.ie/~vlasenko/MA2316/ Class notes] including PARI/GP tutorial and sample code by Masha Vlasenko (2013) -* Class notes, parts [http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_01.pdf 1][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_02.pdf 2][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_03.pdf 3][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_04.pdf 4][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_05.pdf 5][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_sieve.pdf sieve] by Benjamin L. Levitt (41 pp., 2009; now offline?) -*[http://users.aims.ac.za/~richard/faq/index.php Pari/GP Tutorial] by Akinola Richard Olatokunbo (now offline; [https://web.archive.org/web/20170324230906/http://users.aims.ac.za/~richard/faq/index.php archived version]) *[https://www.youtube.com/watch?v=FeG0BYRrDOE&t=12m Video demo of RSA in PARI/GP] by Maren1955 (2014, 17:39) +*[http://www.maths.tcd.ie/~vlasenko/MA2316/ Class notes] including PARI/GP tutorial and sample code by Masha Vlasenko (2013) +*Video tutorials, parts [http://www.youtube.com/watch?v=0G-9JzlrzBM 1] [http://www.youtube.com/watch?v=d7i0rv59hns 2] [http://www.youtube.com/watch?v=wCyU2n-G-pk 3] [http://www.youtube.com/watch?v=WOCuBvK8O6Q 4] (appx. 20 minutes, 2011) +*[http://people.math.umass.edu/~siman/09.791N/tutorial.pdf Tutorial] by Siman Wong (6 pp., 2009) +*[http://www.exploringbinary.com/exploring-binary-numbers-with-parigp-calculator/ Exploring binary numbers with PARI/GP calculator] by Rick Regan (appx. 4 pp., 2009) +* Class notes, parts [http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_01.pdf 1][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_02.pdf 2][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_03.pdf 3][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_04.pdf 4][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_05.pdf 5][http://myweb.csuchico.edu/~blevitt/math230/230coursedocs/230notes/230notes_sieve.pdf sieve] by Benjamin L. Levitt (41 pp., 2009; now offline?) +*[http://www.math.uconn.edu/~kconrad/math5230f08/parihandout.pdf Introduction] by Keith Conrad (7 pp., 2008) +*[http://mvngu.wordpress.com/2008/08/01/parigp-programming-for-basic-cryptography/ PARI/GP programming for basic cryptography] by Minh Van Nguyen (appx. 3 pp., 2008); also appears in an [https://bitbucket.org/mvngu/www/downloads/2008-11-25_numtheory-crypto-gp.pdf extended version] (9 pp., 2008) +*[http://www.math.uiuc.edu/~r-ash/GPTutorial.pdf Tutorial] by Robert B. Ash (20 pp., 2007) +*[http://w3.countnumber.de/fischer/res-ZT2007/PariByExample.pdf Erste Schritte mit PARI/GP] by Lars Fischer (13 pp., 2007; German) +*[http://www.linuxjournal.com/article/1068 The Pari Package On Linux], by Klaus-Peter Nischke (3 pp., 1995) +*[http://users.aims.ac.za/~richard/faq/index.php Pari/GP Tutorial] by Akinola Richard Olatokunbo (now offline; [https://web.archive.org/web/20170324230906/http://users.aims.ac.za/~richard/faq/index.php archived version]) === Papers on PARI/GP === +* Karim Belabas and Henri Cohen, [https://arxiv.org/abs/1810.00547 Modular Forms in Pari/GP], ''Research in the Mathematical Sciences'' '''5''':37 (2018) +* Henri Cohen, [https://arxiv.org/abs/1809.10908 Expansions at Cusps and Petersson Products in Pari/GP], ''Elliptic Integrals, Functions, and Modular Forms in Quantum Field Theory'', Nov 2017, Zeuthen, Germany. Springer Wien, ''Elliptic Integrals, Functions, and Modular Forms in Quantum Field Theory''. (2018) * Karim Belabas and Jean-François Jaulent, [https://www.math.u-bordeaux.fr/~jjaulent/Articles/bnflog.ps The logarithmic class group package in PARI/GP], ''Mathematical Publications of Besançon, Algebra and Number Theory'' (2016), pp. 5–18. * Bill Alombert, [http://www.math.u-bordeaux.fr/~allomber/darkpaper.pdf A new interpretor for PARI/GP], ''Journal de Théorie des Nombres de Bordeaux'' '''20''':3 (2008), pp. 531–541. (English) * Paul Zimmermann, [http://www.loria.fr/~zimmerma/talks/henri.pdf The Ups and Downs of PARI/GP in the last 20 years], Explicit Methods in Number Theory, October 15th-19th 2007 diff --git a/Lang/PARI-GP/Yin-and-yang b/Lang/PARI-GP/Yin-and-yang new file mode 120000 index 0000000000..3c65906d89 --- /dev/null +++ b/Lang/PARI-GP/Yin-and-yang @@ -0,0 +1 @@ +../../Task/Yin-and-yang/PARI-GP \ No newline at end of file diff --git a/Lang/PDP-11-Assembly/N-queens-problem b/Lang/PDP-11-Assembly/N-queens-problem new file mode 120000 index 0000000000..43ff1f596b --- /dev/null +++ b/Lang/PDP-11-Assembly/N-queens-problem @@ -0,0 +1 @@ +../../Task/N-queens-problem/PDP-11-Assembly \ No newline at end of file diff --git a/Lang/PHP/Deal-cards-for-FreeCell b/Lang/PHP/Deal-cards-for-FreeCell new file mode 120000 index 0000000000..4f38214f99 --- /dev/null +++ b/Lang/PHP/Deal-cards-for-FreeCell @@ -0,0 +1 @@ +../../Task/Deal-cards-for-FreeCell/PHP \ No newline at end of file diff --git a/Lang/PHP/Maze-generation b/Lang/PHP/Maze-generation new file mode 120000 index 0000000000..5e26d65e31 --- /dev/null +++ b/Lang/PHP/Maze-generation @@ -0,0 +1 @@ +../../Task/Maze-generation/PHP \ No newline at end of file diff --git a/Lang/PHP/Word-wrap b/Lang/PHP/Word-wrap new file mode 120000 index 0000000000..9330e3cedb --- /dev/null +++ b/Lang/PHP/Word-wrap @@ -0,0 +1 @@ +../../Task/Word-wrap/PHP \ No newline at end of file diff --git a/Lang/Pascal/Dining-philosophers b/Lang/Pascal/Dining-philosophers new file mode 120000 index 0000000000..c92a07d181 --- /dev/null +++ b/Lang/Pascal/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Enumerations b/Lang/Pascal/Enumerations new file mode 120000 index 0000000000..e77f10d8e5 --- /dev/null +++ b/Lang/Pascal/Enumerations @@ -0,0 +1 @@ +../../Task/Enumerations/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Formatted-numeric-output b/Lang/Pascal/Formatted-numeric-output new file mode 120000 index 0000000000..a52b188a21 --- /dev/null +++ b/Lang/Pascal/Formatted-numeric-output @@ -0,0 +1 @@ +../../Task/Formatted-numeric-output/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Penneys-game b/Lang/Pascal/Penneys-game new file mode 120000 index 0000000000..f5d4890b7d --- /dev/null +++ b/Lang/Pascal/Penneys-game @@ -0,0 +1 @@ +../../Task/Penneys-game/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Scope-modifiers b/Lang/Pascal/Scope-modifiers new file mode 120000 index 0000000000..e651a12c55 --- /dev/null +++ b/Lang/Pascal/Scope-modifiers @@ -0,0 +1 @@ +../../Task/Scope-modifiers/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Terminal-control-Coloured-text b/Lang/Pascal/Terminal-control-Coloured-text new file mode 120000 index 0000000000..57ffb08ceb --- /dev/null +++ b/Lang/Pascal/Terminal-control-Coloured-text @@ -0,0 +1 @@ +../../Task/Terminal-control-Coloured-text/Pascal \ No newline at end of file diff --git a/Lang/Pascal/Yin-and-yang b/Lang/Pascal/Yin-and-yang new file mode 120000 index 0000000000..ce1fff794f --- /dev/null +++ b/Lang/Pascal/Yin-and-yang @@ -0,0 +1 @@ +../../Task/Yin-and-yang/Pascal \ No newline at end of file diff --git a/Lang/Perl-6/00DESCRIPTION b/Lang/Perl-6/00DESCRIPTION index 741b1e1125..e54994bc7e 100644 --- a/Lang/Perl-6/00DESCRIPTION +++ b/Lang/Perl-6/00DESCRIPTION @@ -14,26 +14,25 @@ {{language programming paradigm|functional}} {{language programming paradigm|object-oriented}} {{language programming paradigm|generic}} +{{infobox_begin}}Can't install Perl 6 locally?
Try Perl 6 on-line!
+[https://perl6.github.io/6pad/ Try Perl 6 on 6pad].
+[https://tio.run/#perl6 Try Perl 6 on tio.run].
+[https://glot.io/new/perl6 Try Perl 6 on glot.io]. +{{infobox_end}} Perl 6 is the up-and-coming little sister to Perl 5. Though it resembles previous versions of [[Perl]] to no small degree, Perl 6 is substantially a new language; by design, it isn't backwards-compatible with Perl 5. The first official release was at Christmas of 2015. Damian Conway described the basic philosophy of Perl 6 as follows: -
The Perl 6 design process is about keeping what works in Perl 5, fixing what doesn't, and adding what's missing. -That means there will be a few fundamental changes to the language, a large number of extensions to existing features, and a handful of completely new ideas. -These modifications, enhancements, and innovations will work together to make the future Perl even more insanely great -- without, we hope, making it even more greatly insane.
+
The Perl 6 design process is about keeping what works in Perl 5, fixing what doesn't, and adding what's missing. That means there will be a few fundamental changes to the language, a large number of extensions to existing features, and a handful of completely new ideas. These modifications, enhancements, and innovations will work together to make the future Perl even more insanely great -- without, we hope, making it even more greatly insane.
Major new features include multiple dispatch, declarative classes, grammars, formal parameters to subroutines, type constraints on variables, lazy evaluation, junctions, meta-operators, and the ability to change Perl's syntax at will. The definition of Perl 6 is specified entirely by a test suite, so we could in theory have multiple implementations. -The current version of the language is 6.c (short for 6.christmas), as defined by the test suite known as "roast" (Repository Of All Spec Tests). +The current version of the language is 6.d, as defined by the test suite known as "roast" (Repository Of All Spec Tests). Compiler releases have date-based versions, and these are typically used in Rosetta Code entries for the "works with" fields. -The only compiler implementing the full test suite, rakudo, currently runs on either MoarVM or JVM. -Subsequent language revisions are planned (with provisional names of "Diwali", "Eid", and other such celebrations), but these will only come out once a year or so. -In 2016 we are primarily working on performance and documentation of the stable 6.c version. +The only compiler implementing the full test suite, Rakudo, currently runs on either of two backends, MoarVM or JVM. +Subsequent language revisions are planned for release on a roughly yearly cycle. -
- -==Todo== -[[Reports:Tasks_not_implemented_in_Perl_6]] \ No newline at end of file +
\ No newline at end of file diff --git a/Lang/Perl-6/Active-Directory-Connect b/Lang/Perl-6/Active-Directory-Connect new file mode 120000 index 0000000000..6211c65842 --- /dev/null +++ b/Lang/Perl-6/Active-Directory-Connect @@ -0,0 +1 @@ +../../Task/Active-Directory-Connect/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Active-Directory-Search-for-a-user b/Lang/Perl-6/Active-Directory-Search-for-a-user new file mode 120000 index 0000000000..adbb8a69c2 --- /dev/null +++ b/Lang/Perl-6/Active-Directory-Search-for-a-user @@ -0,0 +1 @@ +../../Task/Active-Directory-Search-for-a-user/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Active-object b/Lang/Perl-6/Active-object new file mode 120000 index 0000000000..a56c0dc79a --- /dev/null +++ b/Lang/Perl-6/Active-object @@ -0,0 +1 @@ +../../Task/Active-object/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Animate-a-pendulum b/Lang/Perl-6/Animate-a-pendulum new file mode 120000 index 0000000000..c167e18375 --- /dev/null +++ b/Lang/Perl-6/Animate-a-pendulum @@ -0,0 +1 @@ +../../Task/Animate-a-pendulum/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Animation b/Lang/Perl-6/Animation new file mode 120000 index 0000000000..24b616b3ce --- /dev/null +++ b/Lang/Perl-6/Animation @@ -0,0 +1 @@ +../../Task/Animation/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Bitmap-PPM-conversion-through-a-pipe b/Lang/Perl-6/Bitmap-PPM-conversion-through-a-pipe new file mode 120000 index 0000000000..5112126ebf --- /dev/null +++ b/Lang/Perl-6/Bitmap-PPM-conversion-through-a-pipe @@ -0,0 +1 @@ +../../Task/Bitmap-PPM-conversion-through-a-pipe/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Checkpoint-synchronization b/Lang/Perl-6/Checkpoint-synchronization new file mode 120000 index 0000000000..b263f1d4d0 --- /dev/null +++ b/Lang/Perl-6/Checkpoint-synchronization @@ -0,0 +1 @@ +../../Task/Checkpoint-synchronization/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Color-quantization b/Lang/Perl-6/Color-quantization new file mode 120000 index 0000000000..5a3e8457fa --- /dev/null +++ b/Lang/Perl-6/Color-quantization @@ -0,0 +1 @@ +../../Task/Color-quantization/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Create-an-object-at-a-given-address b/Lang/Perl-6/Create-an-object-at-a-given-address new file mode 120000 index 0000000000..1ed2a683df --- /dev/null +++ b/Lang/Perl-6/Create-an-object-at-a-given-address @@ -0,0 +1 @@ +../../Task/Create-an-object-at-a-given-address/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/GUI-Maximum-window-dimensions b/Lang/Perl-6/GUI-Maximum-window-dimensions new file mode 120000 index 0000000000..4d59e6da0d --- /dev/null +++ b/Lang/Perl-6/GUI-Maximum-window-dimensions @@ -0,0 +1 @@ +../../Task/GUI-Maximum-window-dimensions/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/HTTPS-Client-authenticated b/Lang/Perl-6/HTTPS-Client-authenticated new file mode 120000 index 0000000000..845cffc61b --- /dev/null +++ b/Lang/Perl-6/HTTPS-Client-authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Client-authenticated/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Hough-transform b/Lang/Perl-6/Hough-transform new file mode 120000 index 0000000000..d007ba8e78 --- /dev/null +++ b/Lang/Perl-6/Hough-transform @@ -0,0 +1 @@ +../../Task/Hough-transform/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Image-convolution b/Lang/Perl-6/Image-convolution new file mode 120000 index 0000000000..4744c9a6eb --- /dev/null +++ b/Lang/Perl-6/Image-convolution @@ -0,0 +1 @@ +../../Task/Image-convolution/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Keyboard-input-Flush-the-keyboard-buffer b/Lang/Perl-6/Keyboard-input-Flush-the-keyboard-buffer new file mode 120000 index 0000000000..7c6b066c42 --- /dev/null +++ b/Lang/Perl-6/Keyboard-input-Flush-the-keyboard-buffer @@ -0,0 +1 @@ +../../Task/Keyboard-input-Flush-the-keyboard-buffer/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Keyboard-input-Keypress-check b/Lang/Perl-6/Keyboard-input-Keypress-check new file mode 120000 index 0000000000..00ccc11580 --- /dev/null +++ b/Lang/Perl-6/Keyboard-input-Keypress-check @@ -0,0 +1 @@ +../../Task/Keyboard-input-Keypress-check/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Median-filter b/Lang/Perl-6/Median-filter new file mode 120000 index 0000000000..6a7d69e373 --- /dev/null +++ b/Lang/Perl-6/Median-filter @@ -0,0 +1 @@ +../../Task/Median-filter/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Object-serialization b/Lang/Perl-6/Object-serialization new file mode 120000 index 0000000000..85cc2a89e0 --- /dev/null +++ b/Lang/Perl-6/Object-serialization @@ -0,0 +1 @@ +../../Task/Object-serialization/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Percentage-difference-between-images b/Lang/Perl-6/Percentage-difference-between-images new file mode 120000 index 0000000000..c6d2bef126 --- /dev/null +++ b/Lang/Perl-6/Percentage-difference-between-images @@ -0,0 +1 @@ +../../Task/Percentage-difference-between-images/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/QR-decomposition b/Lang/Perl-6/QR-decomposition new file mode 120000 index 0000000000..a7f83ebd92 --- /dev/null +++ b/Lang/Perl-6/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/SOAP b/Lang/Perl-6/SOAP new file mode 120000 index 0000000000..273fe912d7 --- /dev/null +++ b/Lang/Perl-6/SOAP @@ -0,0 +1 @@ +../../Task/SOAP/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/SQL-based-authentication b/Lang/Perl-6/SQL-based-authentication new file mode 120000 index 0000000000..446d8a9bb0 --- /dev/null +++ b/Lang/Perl-6/SQL-based-authentication @@ -0,0 +1 @@ +../../Task/SQL-based-authentication/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Safe-addition b/Lang/Perl-6/Safe-addition new file mode 120000 index 0000000000..2067303082 --- /dev/null +++ b/Lang/Perl-6/Safe-addition @@ -0,0 +1 @@ +../../Task/Safe-addition/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Send-email b/Lang/Perl-6/Send-email new file mode 120000 index 0000000000..e98126a24e --- /dev/null +++ b/Lang/Perl-6/Send-email @@ -0,0 +1 @@ +../../Task/Send-email/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Simulate-input-Keyboard b/Lang/Perl-6/Simulate-input-Keyboard new file mode 120000 index 0000000000..0e30ead97a --- /dev/null +++ b/Lang/Perl-6/Simulate-input-Keyboard @@ -0,0 +1 @@ +../../Task/Simulate-input-Keyboard/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Simulate-input-Mouse b/Lang/Perl-6/Simulate-input-Mouse new file mode 120000 index 0000000000..b049e7bfb2 --- /dev/null +++ b/Lang/Perl-6/Simulate-input-Mouse @@ -0,0 +1 @@ +../../Task/Simulate-input-Mouse/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Terminal-control-Positional-read b/Lang/Perl-6/Terminal-control-Positional-read new file mode 120000 index 0000000000..39fda201f0 --- /dev/null +++ b/Lang/Perl-6/Terminal-control-Positional-read @@ -0,0 +1 @@ +../../Task/Terminal-control-Positional-read/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/The-ISAAC-Cipher b/Lang/Perl-6/The-ISAAC-Cipher new file mode 120000 index 0000000000..9a8f61a7a8 --- /dev/null +++ b/Lang/Perl-6/The-ISAAC-Cipher @@ -0,0 +1 @@ +../../Task/The-ISAAC-Cipher/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Vogels-approximation-method b/Lang/Perl-6/Vogels-approximation-method new file mode 120000 index 0000000000..365e0e4c8c --- /dev/null +++ b/Lang/Perl-6/Vogels-approximation-method @@ -0,0 +1 @@ +../../Task/Vogels-approximation-method/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Window-management b/Lang/Perl-6/Window-management new file mode 120000 index 0000000000..8b12ccfdc5 --- /dev/null +++ b/Lang/Perl-6/Window-management @@ -0,0 +1 @@ +../../Task/Window-management/Perl-6 \ No newline at end of file diff --git a/Lang/Perl-6/Zebra-puzzle b/Lang/Perl-6/Zebra-puzzle new file mode 120000 index 0000000000..db73c0165a --- /dev/null +++ b/Lang/Perl-6/Zebra-puzzle @@ -0,0 +1 @@ +../../Task/Zebra-puzzle/Perl-6 \ No newline at end of file diff --git a/Lang/Perl/Average-loop-length b/Lang/Perl/Average-loop-length new file mode 120000 index 0000000000..3b0d196ed3 --- /dev/null +++ b/Lang/Perl/Average-loop-length @@ -0,0 +1 @@ +../../Task/Average-loop-length/Perl \ No newline at end of file diff --git a/Lang/Perl/Deconvolution-1D b/Lang/Perl/Deconvolution-1D new file mode 120000 index 0000000000..e316ce8d41 --- /dev/null +++ b/Lang/Perl/Deconvolution-1D @@ -0,0 +1 @@ +../../Task/Deconvolution-1D/Perl \ No newline at end of file diff --git a/Lang/Perl/Deconvolution-2D+ b/Lang/Perl/Deconvolution-2D+ new file mode 120000 index 0000000000..38ff63cf37 --- /dev/null +++ b/Lang/Perl/Deconvolution-2D+ @@ -0,0 +1 @@ +../../Task/Deconvolution-2D+/Perl \ No newline at end of file diff --git a/Lang/Perl/Galton-box-animation b/Lang/Perl/Galton-box-animation new file mode 120000 index 0000000000..5d5cb58a83 --- /dev/null +++ b/Lang/Perl/Galton-box-animation @@ -0,0 +1 @@ +../../Task/Galton-box-animation/Perl \ No newline at end of file diff --git a/Lang/Perl/Greyscale-bars-Display b/Lang/Perl/Greyscale-bars-Display new file mode 120000 index 0000000000..c348ea5bcb --- /dev/null +++ b/Lang/Perl/Greyscale-bars-Display @@ -0,0 +1 @@ +../../Task/Greyscale-bars-Display/Perl \ No newline at end of file diff --git a/Lang/Perl/Horizontal-sundial-calculations b/Lang/Perl/Horizontal-sundial-calculations new file mode 120000 index 0000000000..44641ad3a2 --- /dev/null +++ b/Lang/Perl/Horizontal-sundial-calculations @@ -0,0 +1 @@ +../../Task/Horizontal-sundial-calculations/Perl \ No newline at end of file diff --git a/Lang/Perl/Hough-transform b/Lang/Perl/Hough-transform new file mode 120000 index 0000000000..b716ca2ab6 --- /dev/null +++ b/Lang/Perl/Hough-transform @@ -0,0 +1 @@ +../../Task/Hough-transform/Perl \ No newline at end of file diff --git a/Lang/Perl/Image-noise b/Lang/Perl/Image-noise new file mode 120000 index 0000000000..8c3255780f --- /dev/null +++ b/Lang/Perl/Image-noise @@ -0,0 +1 @@ +../../Task/Image-noise/Perl \ No newline at end of file diff --git a/Lang/Perl/Keyboard-macros b/Lang/Perl/Keyboard-macros new file mode 120000 index 0000000000..11c1983146 --- /dev/null +++ b/Lang/Perl/Keyboard-macros @@ -0,0 +1 @@ +../../Task/Keyboard-macros/Perl \ No newline at end of file diff --git a/Lang/Perl/LU-decomposition b/Lang/Perl/LU-decomposition new file mode 120000 index 0000000000..348539710a --- /dev/null +++ b/Lang/Perl/LU-decomposition @@ -0,0 +1 @@ +../../Task/LU-decomposition/Perl \ No newline at end of file diff --git a/Lang/Perl/Main-step-of-GOST-28147-89 b/Lang/Perl/Main-step-of-GOST-28147-89 new file mode 120000 index 0000000000..0d016d10fb --- /dev/null +++ b/Lang/Perl/Main-step-of-GOST-28147-89 @@ -0,0 +1 @@ +../../Task/Main-step-of-GOST-28147-89/Perl \ No newline at end of file diff --git a/Lang/Perl/Metronome b/Lang/Perl/Metronome new file mode 120000 index 0000000000..03664b2b8e --- /dev/null +++ b/Lang/Perl/Metronome @@ -0,0 +1 @@ +../../Task/Metronome/Perl \ No newline at end of file diff --git a/Lang/Perl/Nautical-bell b/Lang/Perl/Nautical-bell new file mode 120000 index 0000000000..7ce2e0b64a --- /dev/null +++ b/Lang/Perl/Nautical-bell @@ -0,0 +1 @@ +../../Task/Nautical-bell/Perl \ No newline at end of file diff --git a/Lang/Perl/Numerical-integration b/Lang/Perl/Numerical-integration new file mode 120000 index 0000000000..f67c90bb05 --- /dev/null +++ b/Lang/Perl/Numerical-integration @@ -0,0 +1 @@ +../../Task/Numerical-integration/Perl \ No newline at end of file diff --git a/Lang/Perl/Numerical-integration-Gauss-Legendre-Quadrature b/Lang/Perl/Numerical-integration-Gauss-Legendre-Quadrature new file mode 120000 index 0000000000..183586c511 --- /dev/null +++ b/Lang/Perl/Numerical-integration-Gauss-Legendre-Quadrature @@ -0,0 +1 @@ +../../Task/Numerical-integration-Gauss-Legendre-Quadrature/Perl \ No newline at end of file diff --git a/Lang/Perl/Percentage-difference-between-images b/Lang/Perl/Percentage-difference-between-images new file mode 120000 index 0000000000..f640bd6eb5 --- /dev/null +++ b/Lang/Perl/Percentage-difference-between-images @@ -0,0 +1 @@ +../../Task/Percentage-difference-between-images/Perl \ No newline at end of file diff --git a/Lang/Perl/Percolation-Bond-percolation b/Lang/Perl/Percolation-Bond-percolation new file mode 120000 index 0000000000..d0952c303f --- /dev/null +++ b/Lang/Perl/Percolation-Bond-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Bond-percolation/Perl \ No newline at end of file diff --git a/Lang/Perl/Percolation-Mean-cluster-density b/Lang/Perl/Percolation-Mean-cluster-density new file mode 120000 index 0000000000..be9fe3d0cf --- /dev/null +++ b/Lang/Perl/Percolation-Mean-cluster-density @@ -0,0 +1 @@ +../../Task/Percolation-Mean-cluster-density/Perl \ No newline at end of file diff --git a/Lang/Perl/Percolation-Site-percolation b/Lang/Perl/Percolation-Site-percolation new file mode 120000 index 0000000000..c2de3d6c9b --- /dev/null +++ b/Lang/Perl/Percolation-Site-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Site-percolation/Perl \ No newline at end of file diff --git a/Lang/Perl/Pig-the-dice-game-Player b/Lang/Perl/Pig-the-dice-game-Player new file mode 120000 index 0000000000..2e7ecfc0e9 --- /dev/null +++ b/Lang/Perl/Pig-the-dice-game-Player @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game-Player/Perl \ No newline at end of file diff --git a/Lang/Perl/Pinstripe-Display b/Lang/Perl/Pinstripe-Display new file mode 120000 index 0000000000..8646f3049a --- /dev/null +++ b/Lang/Perl/Pinstripe-Display @@ -0,0 +1 @@ +../../Task/Pinstripe-Display/Perl \ No newline at end of file diff --git a/Lang/Perl/Problem-of-Apollonius b/Lang/Perl/Problem-of-Apollonius new file mode 120000 index 0000000000..b487d52ea6 --- /dev/null +++ b/Lang/Perl/Problem-of-Apollonius @@ -0,0 +1 @@ +../../Task/Problem-of-Apollonius/Perl \ No newline at end of file diff --git a/Lang/Perl/RSA-code b/Lang/Perl/RSA-code new file mode 120000 index 0000000000..42be4293fb --- /dev/null +++ b/Lang/Perl/RSA-code @@ -0,0 +1 @@ +../../Task/RSA-code/Perl \ No newline at end of file diff --git a/Lang/Perl/Ranking-methods b/Lang/Perl/Ranking-methods new file mode 120000 index 0000000000..4d1b22e178 --- /dev/null +++ b/Lang/Perl/Ranking-methods @@ -0,0 +1 @@ +../../Task/Ranking-methods/Perl \ No newline at end of file diff --git a/Lang/Perl/Safe-addition b/Lang/Perl/Safe-addition new file mode 120000 index 0000000000..2e9315469b --- /dev/null +++ b/Lang/Perl/Safe-addition @@ -0,0 +1 @@ +../../Task/Safe-addition/Perl \ No newline at end of file diff --git a/Lang/Perl/Scope-Function-names-and-labels b/Lang/Perl/Scope-Function-names-and-labels new file mode 120000 index 0000000000..7955b27031 --- /dev/null +++ b/Lang/Perl/Scope-Function-names-and-labels @@ -0,0 +1 @@ +../../Task/Scope-Function-names-and-labels/Perl \ No newline at end of file diff --git a/Lang/Perl/Solve-a-Hopido-puzzle b/Lang/Perl/Solve-a-Hopido-puzzle new file mode 120000 index 0000000000..869276abe0 --- /dev/null +++ b/Lang/Perl/Solve-a-Hopido-puzzle @@ -0,0 +1 @@ +../../Task/Solve-a-Hopido-puzzle/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Coloured-text b/Lang/Perl/Terminal-control-Coloured-text new file mode 120000 index 0000000000..f6dd4f9f67 --- /dev/null +++ b/Lang/Perl/Terminal-control-Coloured-text @@ -0,0 +1 @@ +../../Task/Terminal-control-Coloured-text/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Cursor-movement b/Lang/Perl/Terminal-control-Cursor-movement new file mode 120000 index 0000000000..11850ad317 --- /dev/null +++ b/Lang/Perl/Terminal-control-Cursor-movement @@ -0,0 +1 @@ +../../Task/Terminal-control-Cursor-movement/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Display-an-extended-character b/Lang/Perl/Terminal-control-Display-an-extended-character new file mode 120000 index 0000000000..4d89ee1fe4 --- /dev/null +++ b/Lang/Perl/Terminal-control-Display-an-extended-character @@ -0,0 +1 @@ +../../Task/Terminal-control-Display-an-extended-character/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Hiding-the-cursor b/Lang/Perl/Terminal-control-Hiding-the-cursor new file mode 120000 index 0000000000..f3d1d39ab2 --- /dev/null +++ b/Lang/Perl/Terminal-control-Hiding-the-cursor @@ -0,0 +1 @@ +../../Task/Terminal-control-Hiding-the-cursor/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Inverse-video b/Lang/Perl/Terminal-control-Inverse-video new file mode 120000 index 0000000000..4707a816fb --- /dev/null +++ b/Lang/Perl/Terminal-control-Inverse-video @@ -0,0 +1 @@ +../../Task/Terminal-control-Inverse-video/Perl \ No newline at end of file diff --git a/Lang/Perl/Terminal-control-Unicode-output b/Lang/Perl/Terminal-control-Unicode-output new file mode 120000 index 0000000000..d91d7a09b1 --- /dev/null +++ b/Lang/Perl/Terminal-control-Unicode-output @@ -0,0 +1 @@ +../../Task/Terminal-control-Unicode-output/Perl \ No newline at end of file diff --git a/Lang/Perl/Total-circles-area b/Lang/Perl/Total-circles-area new file mode 120000 index 0000000000..4ae57b1234 --- /dev/null +++ b/Lang/Perl/Total-circles-area @@ -0,0 +1 @@ +../../Task/Total-circles-area/Perl \ No newline at end of file diff --git a/Lang/Perl/Verify-distribution-uniformity-Chi-squared-test b/Lang/Perl/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..60bec11088 --- /dev/null +++ b/Lang/Perl/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/Perl \ No newline at end of file diff --git a/Lang/Perl/Verify-distribution-uniformity-Naive b/Lang/Perl/Verify-distribution-uniformity-Naive new file mode 120000 index 0000000000..e0e67411c4 --- /dev/null +++ b/Lang/Perl/Verify-distribution-uniformity-Naive @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Naive/Perl \ No newline at end of file diff --git a/Lang/Perl/Video-display-modes b/Lang/Perl/Video-display-modes new file mode 120000 index 0000000000..70915a4af7 --- /dev/null +++ b/Lang/Perl/Video-display-modes @@ -0,0 +1 @@ +../../Task/Video-display-modes/Perl \ No newline at end of file diff --git a/Lang/Perl/Voronoi-diagram b/Lang/Perl/Voronoi-diagram new file mode 120000 index 0000000000..06307f5756 --- /dev/null +++ b/Lang/Perl/Voronoi-diagram @@ -0,0 +1 @@ +../../Task/Voronoi-diagram/Perl \ No newline at end of file diff --git a/Lang/Perl/World-Cup-group-stage b/Lang/Perl/World-Cup-group-stage new file mode 120000 index 0000000000..e228209164 --- /dev/null +++ b/Lang/Perl/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/Perl \ No newline at end of file diff --git a/Lang/Perl/Zhang-Suen-thinning-algorithm b/Lang/Perl/Zhang-Suen-thinning-algorithm new file mode 120000 index 0000000000..34c1763383 --- /dev/null +++ b/Lang/Perl/Zhang-Suen-thinning-algorithm @@ -0,0 +1 @@ +../../Task/Zhang-Suen-thinning-algorithm/Perl \ No newline at end of file diff --git a/Lang/Phix/00DESCRIPTION b/Lang/Phix/00DESCRIPTION index 424a53e08f..ed2e3e4736 100644 --- a/Lang/Phix/00DESCRIPTION +++ b/Lang/Phix/00DESCRIPTION @@ -13,7 +13,7 @@ }} Phix is a self-hosted hybrid interpreter/compiler, developed by Pete Lomax. It is very easy to use, and similar to Euphoria. -A single 16MB download contains a pre-compiled executable, all the sources, and'' '''everything''' ''needed to recompile them, in about 15 seconds. The download also contains a full-featured programmer's editor and 130+ demo programs. +A simple 20MB download contains a pre-compiled executable, all the sources, and'' '''everything''' ''needed to recompile them, in about 15 seconds. The download also contains a full-featured programmer's editor and 130+ demo programs. Perhaps the most striking feature of Phix is that it has just five builtin data types: 
@@ -25,11 +25,12 @@ Perhaps the most striking feature of Phix is that it has just five builtin data
Despite such apparent simplicity, or perhaps precisely because of it, Phix programs are pretty fast - not quite achieving the runtime performance of C or assembly, but making up for it with a very fast edit/run cycle and proper human-readable messages should anything go wrong (even in shipped pre-compiled executables). Sequences are the real powerhouse of Phix. The one type covers lists, queues, tables, trees, and arrays, with strings being the subset that is array of character. They can grow and shrink automatically without any memory management overhead. For example if s="food" then s[2..3]="e" makes s "fed", and then s[2..1]="east" makes s "feasted". -Phix applies the principle of least surprise, for instance in some languages myproc(list) or res = myfunc(list) can mangle list, whereas in Phix if you actually want that to happen you would code list = myproc(list) (and myproc would need to become a function) or {res,list} = myfunc(list). Likewise 1/2 is 0.5 (not 0, unless you explicitly ask for the floor()) and 0-1 is -1 (not +MAXINT). A core tenet is that for any line of code there is one and only one possible interpretation of it, and said meaning is utterly intuitive. +Phix applies the principle of least surprise, for instance in some languages myproc(list) or res = myfunc(list) can mangle list, whereas in Phix if you actually want that to happen you would code list = myproc(list) (and myproc would need to become a function) or {res,list} = myfunc(list). Likewise 1/2 is 0.5 (not 0, unless you explicitly ask for the floor()) and 0-1 is -1 (not +MAXINT). A core tenet is that for any line of code there is one and only one possible interpretation of it, and said meaning is utterly intuitive. True fact: the given answer for the question "describe what f(a++) does" in "More Exceptional C++" lists 4 possibilities for f, and 3 for a (so 12 in total) and uses the phrase "could mean just about anything" not once but twice - shudder. -The principle goal of Phix is to make debugging easier, a whole subject area that does not seem to get the attention it deserves. Not entirely sure I am succeeding, yet. +Phix is not inherently object orientated, but achieves many of the claimed benefits, yet in a much simpler way. In fact I have been looking for proof that object orientation actually improves productivity compared to other paradigms for decades, and never found it. Not to say that I won't support it, but I certainly won't enforce it. One other thing I have never found is a "good object orientated design", and reached the conclusion that mythical creature simply does not exist, at least not as a separate entity as opposed to some ethereal quality of the finished code. Feel free to argue that one on [[User_talk:Petelomax]]. Phix offers perfectly decent encapsulation at the file level, proving that is not the sole purview of oo, implements polymorphism far more elegantly than C-based languages and far safer than duck-typed languages, and as for the third pillar of oop, inheritance, well isn't the current mantra "favour composition over inheritance"? + +The fundamental goal of Phix is to make debugging easier, a whole subject area that does not seem to get the attention it deserves, despite several studies finding that most programmers actually spend between 70 and 90% of their time debugging. (Most of us tend to think that getting just-written code to work is somehow not debugging, but that bloke with a clipboard stood behind you would disagree.) ==See also== * [http://phix.x10.mx Phix site] -* [https://bitbucket.org/petelomax/phix/src bitbucket] -* [[Reports:Tasks_not_implemented_in_Phix|Wishlist]] \ No newline at end of file +* [https://bitbucket.org/petelomax/phix/src bitbucket] \ No newline at end of file diff --git a/Lang/Phix/Accumulator-factory b/Lang/Phix/Accumulator-factory new file mode 120000 index 0000000000..abed7a3fb3 --- /dev/null +++ b/Lang/Phix/Accumulator-factory @@ -0,0 +1 @@ +../../Task/Accumulator-factory/Phix \ No newline at end of file diff --git a/Lang/Phix/Active-object b/Lang/Phix/Active-object new file mode 120000 index 0000000000..b1a9f6486d --- /dev/null +++ b/Lang/Phix/Active-object @@ -0,0 +1 @@ +../../Task/Active-object/Phix \ No newline at end of file diff --git a/Lang/Phix/Bitwise-IO b/Lang/Phix/Bitwise-IO new file mode 120000 index 0000000000..becd68727b --- /dev/null +++ b/Lang/Phix/Bitwise-IO @@ -0,0 +1 @@ +../../Task/Bitwise-IO/Phix \ No newline at end of file diff --git a/Lang/Phix/Carmichael-3-strong-pseudoprimes b/Lang/Phix/Carmichael-3-strong-pseudoprimes new file mode 120000 index 0000000000..cf359e12fb --- /dev/null +++ b/Lang/Phix/Carmichael-3-strong-pseudoprimes @@ -0,0 +1 @@ +../../Task/Carmichael-3-strong-pseudoprimes/Phix \ No newline at end of file diff --git a/Lang/Phix/Check-Machin-like-formulas b/Lang/Phix/Check-Machin-like-formulas new file mode 120000 index 0000000000..305a33a31b --- /dev/null +++ b/Lang/Phix/Check-Machin-like-formulas @@ -0,0 +1 @@ +../../Task/Check-Machin-like-formulas/Phix \ No newline at end of file diff --git a/Lang/Phix/Checkpoint-synchronization b/Lang/Phix/Checkpoint-synchronization new file mode 120000 index 0000000000..544fb9e3c0 --- /dev/null +++ b/Lang/Phix/Checkpoint-synchronization @@ -0,0 +1 @@ +../../Task/Checkpoint-synchronization/Phix \ No newline at end of file diff --git a/Lang/Phix/Chinese-remainder-theorem b/Lang/Phix/Chinese-remainder-theorem new file mode 120000 index 0000000000..e83b2bcd19 --- /dev/null +++ b/Lang/Phix/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/Phix \ No newline at end of file diff --git a/Lang/Phix/Circles-of-given-radius-through-two-points b/Lang/Phix/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..0928f83864 --- /dev/null +++ b/Lang/Phix/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/Phix \ No newline at end of file diff --git a/Lang/Phix/Color-quantization b/Lang/Phix/Color-quantization new file mode 120000 index 0000000000..f2d88f9395 --- /dev/null +++ b/Lang/Phix/Color-quantization @@ -0,0 +1 @@ +../../Task/Color-quantization/Phix \ No newline at end of file diff --git a/Lang/Phix/Continued-fraction-Arithmetic-Construct-from-rational-number b/Lang/Phix/Continued-fraction-Arithmetic-Construct-from-rational-number new file mode 120000 index 0000000000..8c770973dc --- /dev/null +++ b/Lang/Phix/Continued-fraction-Arithmetic-Construct-from-rational-number @@ -0,0 +1 @@ +../../Task/Continued-fraction-Arithmetic-Construct-from-rational-number/Phix \ No newline at end of file diff --git a/Lang/Phix/Create-a-file-on-magnetic-tape b/Lang/Phix/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..3c70849d54 --- /dev/null +++ b/Lang/Phix/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/Phix \ No newline at end of file diff --git a/Lang/Phix/Cut-a-rectangle b/Lang/Phix/Cut-a-rectangle new file mode 120000 index 0000000000..4af5b01a07 --- /dev/null +++ b/Lang/Phix/Cut-a-rectangle @@ -0,0 +1 @@ +../../Task/Cut-a-rectangle/Phix \ No newline at end of file diff --git a/Lang/Phix/DNS-query b/Lang/Phix/DNS-query new file mode 120000 index 0000000000..3f67249e34 --- /dev/null +++ b/Lang/Phix/DNS-query @@ -0,0 +1 @@ +../../Task/DNS-query/Phix \ No newline at end of file diff --git a/Lang/Phix/Deconvolution-2D+ b/Lang/Phix/Deconvolution-2D+ new file mode 120000 index 0000000000..ed858c666c --- /dev/null +++ b/Lang/Phix/Deconvolution-2D+ @@ -0,0 +1 @@ +../../Task/Deconvolution-2D+/Phix \ No newline at end of file diff --git a/Lang/Phix/Events b/Lang/Phix/Events new file mode 120000 index 0000000000..868220dff0 --- /dev/null +++ b/Lang/Phix/Events @@ -0,0 +1 @@ +../../Task/Events/Phix \ No newline at end of file diff --git a/Lang/Phix/File-modification-time b/Lang/Phix/File-modification-time new file mode 120000 index 0000000000..94406a85fe --- /dev/null +++ b/Lang/Phix/File-modification-time @@ -0,0 +1 @@ +../../Task/File-modification-time/Phix \ No newline at end of file diff --git a/Lang/Phix/Find-largest-left-truncatable-prime-in-a-given-base b/Lang/Phix/Find-largest-left-truncatable-prime-in-a-given-base new file mode 120000 index 0000000000..fc59e7b7ac --- /dev/null +++ b/Lang/Phix/Find-largest-left-truncatable-prime-in-a-given-base @@ -0,0 +1 @@ +../../Task/Find-largest-left-truncatable-prime-in-a-given-base/Phix \ No newline at end of file diff --git a/Lang/Phix/Flipping-bits-game b/Lang/Phix/Flipping-bits-game new file mode 120000 index 0000000000..8759573924 --- /dev/null +++ b/Lang/Phix/Flipping-bits-game @@ -0,0 +1 @@ +../../Task/Flipping-bits-game/Phix \ No newline at end of file diff --git a/Lang/Phix/Formal-power-series b/Lang/Phix/Formal-power-series new file mode 120000 index 0000000000..387ec1c8cf --- /dev/null +++ b/Lang/Phix/Formal-power-series @@ -0,0 +1 @@ +../../Task/Formal-power-series/Phix \ No newline at end of file diff --git a/Lang/Phix/Fractran b/Lang/Phix/Fractran new file mode 120000 index 0000000000..e822c2056f --- /dev/null +++ b/Lang/Phix/Fractran @@ -0,0 +1 @@ +../../Task/Fractran/Phix \ No newline at end of file diff --git a/Lang/Phix/Function-frequency b/Lang/Phix/Function-frequency new file mode 120000 index 0000000000..b84128c767 --- /dev/null +++ b/Lang/Phix/Function-frequency @@ -0,0 +1 @@ +../../Task/Function-frequency/Phix \ No newline at end of file diff --git a/Lang/Phix/Gaussian-elimination b/Lang/Phix/Gaussian-elimination new file mode 120000 index 0000000000..f7c30310ca --- /dev/null +++ b/Lang/Phix/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/Phix \ No newline at end of file diff --git a/Lang/Phix/Handle-a-signal b/Lang/Phix/Handle-a-signal new file mode 120000 index 0000000000..923ecd28c1 --- /dev/null +++ b/Lang/Phix/Handle-a-signal @@ -0,0 +1 @@ +../../Task/Handle-a-signal/Phix \ No newline at end of file diff --git a/Lang/Phix/Hickerson-series-of-almost-integers b/Lang/Phix/Hickerson-series-of-almost-integers new file mode 120000 index 0000000000..474b7d7d96 --- /dev/null +++ b/Lang/Phix/Hickerson-series-of-almost-integers @@ -0,0 +1 @@ +../../Task/Hickerson-series-of-almost-integers/Phix \ No newline at end of file diff --git a/Lang/Phix/Hofstadter-Conway-$10,000-sequence b/Lang/Phix/Hofstadter-Conway-$10,000-sequence new file mode 120000 index 0000000000..e689bf96df --- /dev/null +++ b/Lang/Phix/Hofstadter-Conway-$10,000-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Conway-$10,000-sequence/Phix \ No newline at end of file diff --git a/Lang/Phix/Hofstadter-Figure-Figure-sequences b/Lang/Phix/Hofstadter-Figure-Figure-sequences new file mode 120000 index 0000000000..4df124fcb8 --- /dev/null +++ b/Lang/Phix/Hofstadter-Figure-Figure-sequences @@ -0,0 +1 @@ +../../Task/Hofstadter-Figure-Figure-sequences/Phix \ No newline at end of file diff --git a/Lang/Phix/Hofstadter-Q-sequence b/Lang/Phix/Hofstadter-Q-sequence new file mode 120000 index 0000000000..451b5ba63b --- /dev/null +++ b/Lang/Phix/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/Phix \ No newline at end of file diff --git a/Lang/Phix/Hostname b/Lang/Phix/Hostname new file mode 120000 index 0000000000..369192921e --- /dev/null +++ b/Lang/Phix/Hostname @@ -0,0 +1 @@ +../../Task/Hostname/Phix \ No newline at end of file diff --git a/Lang/Phix/Hough-transform b/Lang/Phix/Hough-transform new file mode 120000 index 0000000000..200c065421 --- /dev/null +++ b/Lang/Phix/Hough-transform @@ -0,0 +1 @@ +../../Task/Hough-transform/Phix \ No newline at end of file diff --git a/Lang/Phix/Image-convolution b/Lang/Phix/Image-convolution new file mode 120000 index 0000000000..034aec8880 --- /dev/null +++ b/Lang/Phix/Image-convolution @@ -0,0 +1 @@ +../../Task/Image-convolution/Phix \ No newline at end of file diff --git a/Lang/Phix/Image-noise b/Lang/Phix/Image-noise new file mode 120000 index 0000000000..a22ccdc724 --- /dev/null +++ b/Lang/Phix/Image-noise @@ -0,0 +1 @@ +../../Task/Image-noise/Phix \ No newline at end of file diff --git a/Lang/Phix/Introspection b/Lang/Phix/Introspection new file mode 120000 index 0000000000..aee9cf1120 --- /dev/null +++ b/Lang/Phix/Introspection @@ -0,0 +1 @@ +../../Task/Introspection/Phix \ No newline at end of file diff --git a/Lang/Phix/Inverted-syntax b/Lang/Phix/Inverted-syntax new file mode 120000 index 0000000000..4e07ab9da2 --- /dev/null +++ b/Lang/Phix/Inverted-syntax @@ -0,0 +1 @@ +../../Task/Inverted-syntax/Phix \ No newline at end of file diff --git a/Lang/Phix/K-d-tree b/Lang/Phix/K-d-tree new file mode 120000 index 0000000000..8cc6782a6b --- /dev/null +++ b/Lang/Phix/K-d-tree @@ -0,0 +1 @@ +../../Task/K-d-tree/Phix \ No newline at end of file diff --git a/Lang/Phix/K-means++-clustering b/Lang/Phix/K-means++-clustering new file mode 120000 index 0000000000..f87d85f535 --- /dev/null +++ b/Lang/Phix/K-means++-clustering @@ -0,0 +1 @@ +../../Task/K-means++-clustering/Phix \ No newline at end of file diff --git a/Lang/Phix/Mad-Libs b/Lang/Phix/Mad-Libs new file mode 120000 index 0000000000..f0efe363cf --- /dev/null +++ b/Lang/Phix/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/Phix \ No newline at end of file diff --git a/Lang/Phix/Magic-squares-of-odd-order b/Lang/Phix/Magic-squares-of-odd-order new file mode 120000 index 0000000000..f5a1d715fd --- /dev/null +++ b/Lang/Phix/Magic-squares-of-odd-order @@ -0,0 +1 @@ +../../Task/Magic-squares-of-odd-order/Phix \ No newline at end of file diff --git a/Lang/Phix/Median-filter b/Lang/Phix/Median-filter new file mode 120000 index 0000000000..d8d95a86e8 --- /dev/null +++ b/Lang/Phix/Median-filter @@ -0,0 +1 @@ +../../Task/Median-filter/Phix \ No newline at end of file diff --git a/Lang/Phix/Metaprogramming b/Lang/Phix/Metaprogramming new file mode 120000 index 0000000000..db6359c139 --- /dev/null +++ b/Lang/Phix/Metaprogramming @@ -0,0 +1 @@ +../../Task/Metaprogramming/Phix \ No newline at end of file diff --git a/Lang/Phix/Modular-exponentiation b/Lang/Phix/Modular-exponentiation new file mode 120000 index 0000000000..faf53ed1e4 --- /dev/null +++ b/Lang/Phix/Modular-exponentiation @@ -0,0 +1 @@ +../../Task/Modular-exponentiation/Phix \ No newline at end of file diff --git a/Lang/Phix/Modular-inverse b/Lang/Phix/Modular-inverse new file mode 120000 index 0000000000..f9726beb32 --- /dev/null +++ b/Lang/Phix/Modular-inverse @@ -0,0 +1 @@ +../../Task/Modular-inverse/Phix \ No newline at end of file diff --git a/Lang/Phix/Multiple-regression b/Lang/Phix/Multiple-regression new file mode 120000 index 0000000000..94bec0d510 --- /dev/null +++ b/Lang/Phix/Multiple-regression @@ -0,0 +1 @@ +../../Task/Multiple-regression/Phix \ No newline at end of file diff --git a/Lang/Phix/Multiplicative-order b/Lang/Phix/Multiplicative-order new file mode 120000 index 0000000000..d8158d29b0 --- /dev/null +++ b/Lang/Phix/Multiplicative-order @@ -0,0 +1 @@ +../../Task/Multiplicative-order/Phix \ No newline at end of file diff --git a/Lang/Phix/Munching-squares b/Lang/Phix/Munching-squares new file mode 120000 index 0000000000..d4915cd6d5 --- /dev/null +++ b/Lang/Phix/Munching-squares @@ -0,0 +1 @@ +../../Task/Munching-squares/Phix \ No newline at end of file diff --git a/Lang/Phix/Narcissist b/Lang/Phix/Narcissist new file mode 120000 index 0000000000..b213fb9a9e --- /dev/null +++ b/Lang/Phix/Narcissist @@ -0,0 +1 @@ +../../Task/Narcissist/Phix \ No newline at end of file diff --git a/Lang/Phix/Numeric-error-propagation b/Lang/Phix/Numeric-error-propagation new file mode 120000 index 0000000000..27e40601fb --- /dev/null +++ b/Lang/Phix/Numeric-error-propagation @@ -0,0 +1 @@ +../../Task/Numeric-error-propagation/Phix \ No newline at end of file diff --git a/Lang/Phix/Numerical-integration-Gauss-Legendre-Quadrature b/Lang/Phix/Numerical-integration-Gauss-Legendre-Quadrature new file mode 120000 index 0000000000..c6105efb92 --- /dev/null +++ b/Lang/Phix/Numerical-integration-Gauss-Legendre-Quadrature @@ -0,0 +1 @@ +../../Task/Numerical-integration-Gauss-Legendre-Quadrature/Phix \ No newline at end of file diff --git a/Lang/Phix/Object-serialization b/Lang/Phix/Object-serialization new file mode 120000 index 0000000000..4f962dae25 --- /dev/null +++ b/Lang/Phix/Object-serialization @@ -0,0 +1 @@ +../../Task/Object-serialization/Phix \ No newline at end of file diff --git a/Lang/Phix/Paraffins b/Lang/Phix/Paraffins new file mode 120000 index 0000000000..b9cbb60d70 --- /dev/null +++ b/Lang/Phix/Paraffins @@ -0,0 +1 @@ +../../Task/Paraffins/Phix \ No newline at end of file diff --git a/Lang/Phix/Parallel-calculations b/Lang/Phix/Parallel-calculations new file mode 120000 index 0000000000..3753f6b30a --- /dev/null +++ b/Lang/Phix/Parallel-calculations @@ -0,0 +1 @@ +../../Task/Parallel-calculations/Phix \ No newline at end of file diff --git a/Lang/Phix/Parse-an-IP-Address b/Lang/Phix/Parse-an-IP-Address new file mode 120000 index 0000000000..c6f801a2bd --- /dev/null +++ b/Lang/Phix/Parse-an-IP-Address @@ -0,0 +1 @@ +../../Task/Parse-an-IP-Address/Phix \ No newline at end of file diff --git a/Lang/Phix/Pattern-matching b/Lang/Phix/Pattern-matching new file mode 120000 index 0000000000..095be5e9c5 --- /dev/null +++ b/Lang/Phix/Pattern-matching @@ -0,0 +1 @@ +../../Task/Pattern-matching/Phix \ No newline at end of file diff --git a/Lang/Phix/Penneys-game b/Lang/Phix/Penneys-game new file mode 120000 index 0000000000..5ccd22b2ee --- /dev/null +++ b/Lang/Phix/Penneys-game @@ -0,0 +1 @@ +../../Task/Penneys-game/Phix \ No newline at end of file diff --git a/Lang/Phix/Percentage-difference-between-images b/Lang/Phix/Percentage-difference-between-images new file mode 120000 index 0000000000..91d72d858f --- /dev/null +++ b/Lang/Phix/Percentage-difference-between-images @@ -0,0 +1 @@ +../../Task/Percentage-difference-between-images/Phix \ No newline at end of file diff --git a/Lang/Phix/Percolation-Bond-percolation b/Lang/Phix/Percolation-Bond-percolation new file mode 120000 index 0000000000..4059eb0844 --- /dev/null +++ b/Lang/Phix/Percolation-Bond-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Bond-percolation/Phix \ No newline at end of file diff --git a/Lang/Phix/Percolation-Mean-cluster-density b/Lang/Phix/Percolation-Mean-cluster-density new file mode 120000 index 0000000000..b02d758842 --- /dev/null +++ b/Lang/Phix/Percolation-Mean-cluster-density @@ -0,0 +1 @@ +../../Task/Percolation-Mean-cluster-density/Phix \ No newline at end of file diff --git a/Lang/Phix/Percolation-Mean-run-density b/Lang/Phix/Percolation-Mean-run-density new file mode 120000 index 0000000000..500513219d --- /dev/null +++ b/Lang/Phix/Percolation-Mean-run-density @@ -0,0 +1 @@ +../../Task/Percolation-Mean-run-density/Phix \ No newline at end of file diff --git a/Lang/Phix/Percolation-Site-percolation b/Lang/Phix/Percolation-Site-percolation new file mode 120000 index 0000000000..1d6037807b --- /dev/null +++ b/Lang/Phix/Percolation-Site-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Site-percolation/Phix \ No newline at end of file diff --git a/Lang/Phix/Permutations-Rank-of-a-permutation b/Lang/Phix/Permutations-Rank-of-a-permutation new file mode 120000 index 0000000000..7212381cb8 --- /dev/null +++ b/Lang/Phix/Permutations-Rank-of-a-permutation @@ -0,0 +1 @@ +../../Task/Permutations-Rank-of-a-permutation/Phix \ No newline at end of file diff --git a/Lang/Phix/Pig-the-dice-game b/Lang/Phix/Pig-the-dice-game new file mode 120000 index 0000000000..4870ecc1c1 --- /dev/null +++ b/Lang/Phix/Pig-the-dice-game @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game/Phix \ No newline at end of file diff --git a/Lang/Phix/Pig-the-dice-game-Player b/Lang/Phix/Pig-the-dice-game-Player new file mode 120000 index 0000000000..6f3e21c464 --- /dev/null +++ b/Lang/Phix/Pig-the-dice-game-Player @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game-Player/Phix \ No newline at end of file diff --git a/Lang/Phix/Play-recorded-sounds b/Lang/Phix/Play-recorded-sounds new file mode 120000 index 0000000000..a2ae478392 --- /dev/null +++ b/Lang/Phix/Play-recorded-sounds @@ -0,0 +1 @@ +../../Task/Play-recorded-sounds/Phix \ No newline at end of file diff --git a/Lang/Phix/Polynomial-long-division b/Lang/Phix/Polynomial-long-division new file mode 120000 index 0000000000..f855cc9e02 --- /dev/null +++ b/Lang/Phix/Polynomial-long-division @@ -0,0 +1 @@ +../../Task/Polynomial-long-division/Phix \ No newline at end of file diff --git a/Lang/Phix/Problem-of-Apollonius b/Lang/Phix/Problem-of-Apollonius new file mode 120000 index 0000000000..6bf332661e --- /dev/null +++ b/Lang/Phix/Problem-of-Apollonius @@ -0,0 +1 @@ +../../Task/Problem-of-Apollonius/Phix \ No newline at end of file diff --git a/Lang/Phix/QR-decomposition b/Lang/Phix/QR-decomposition new file mode 120000 index 0000000000..7a2431f00b --- /dev/null +++ b/Lang/Phix/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/Phix \ No newline at end of file diff --git a/Lang/Phix/RSA-code b/Lang/Phix/RSA-code new file mode 120000 index 0000000000..bc0c8aaf55 --- /dev/null +++ b/Lang/Phix/RSA-code @@ -0,0 +1 @@ +../../Task/RSA-code/Phix \ No newline at end of file diff --git a/Lang/Phix/Ranking-methods b/Lang/Phix/Ranking-methods new file mode 120000 index 0000000000..1c5836ea23 --- /dev/null +++ b/Lang/Phix/Ranking-methods @@ -0,0 +1 @@ +../../Task/Ranking-methods/Phix \ No newline at end of file diff --git a/Lang/Phix/Rate-counter b/Lang/Phix/Rate-counter new file mode 120000 index 0000000000..80eb8119a8 --- /dev/null +++ b/Lang/Phix/Rate-counter @@ -0,0 +1 @@ +../../Task/Rate-counter/Phix \ No newline at end of file diff --git a/Lang/Phix/Rendezvous b/Lang/Phix/Rendezvous new file mode 120000 index 0000000000..0b9ba4c60c --- /dev/null +++ b/Lang/Phix/Rendezvous @@ -0,0 +1 @@ +../../Task/Rendezvous/Phix \ No newline at end of file diff --git a/Lang/Phix/Resistor-mesh b/Lang/Phix/Resistor-mesh new file mode 120000 index 0000000000..adad468c64 --- /dev/null +++ b/Lang/Phix/Resistor-mesh @@ -0,0 +1 @@ +../../Task/Resistor-mesh/Phix \ No newline at end of file diff --git a/Lang/Phix/Secure-temporary-file b/Lang/Phix/Secure-temporary-file new file mode 120000 index 0000000000..aed3c8fd42 --- /dev/null +++ b/Lang/Phix/Secure-temporary-file @@ -0,0 +1 @@ +../../Task/Secure-temporary-file/Phix \ No newline at end of file diff --git a/Lang/Phix/Set-consolidation b/Lang/Phix/Set-consolidation new file mode 120000 index 0000000000..659e10c7c6 --- /dev/null +++ b/Lang/Phix/Set-consolidation @@ -0,0 +1 @@ +../../Task/Set-consolidation/Phix \ No newline at end of file diff --git a/Lang/Phix/Set-of-real-numbers b/Lang/Phix/Set-of-real-numbers new file mode 120000 index 0000000000..66743a42ac --- /dev/null +++ b/Lang/Phix/Set-of-real-numbers @@ -0,0 +1 @@ +../../Task/Set-of-real-numbers/Phix \ No newline at end of file diff --git a/Lang/Phix/Seven-sided-dice-from-five-sided-dice b/Lang/Phix/Seven-sided-dice-from-five-sided-dice new file mode 120000 index 0000000000..bace2da681 --- /dev/null +++ b/Lang/Phix/Seven-sided-dice-from-five-sided-dice @@ -0,0 +1 @@ +../../Task/Seven-sided-dice-from-five-sided-dice/Phix \ No newline at end of file diff --git a/Lang/Phix/Sokoban b/Lang/Phix/Sokoban new file mode 120000 index 0000000000..60a429efd4 --- /dev/null +++ b/Lang/Phix/Sokoban @@ -0,0 +1 @@ +../../Task/Sokoban/Phix \ No newline at end of file diff --git a/Lang/Phix/Soundex b/Lang/Phix/Soundex new file mode 120000 index 0000000000..3725ab608c --- /dev/null +++ b/Lang/Phix/Soundex @@ -0,0 +1 @@ +../../Task/Soundex/Phix \ No newline at end of file diff --git a/Lang/Phix/Sparkline-in-unicode b/Lang/Phix/Sparkline-in-unicode new file mode 120000 index 0000000000..9960910202 --- /dev/null +++ b/Lang/Phix/Sparkline-in-unicode @@ -0,0 +1 @@ +../../Task/Sparkline-in-unicode/Phix \ No newline at end of file diff --git a/Lang/Phix/Subtractive-generator b/Lang/Phix/Subtractive-generator new file mode 120000 index 0000000000..ffd771ec23 --- /dev/null +++ b/Lang/Phix/Subtractive-generator @@ -0,0 +1 @@ +../../Task/Subtractive-generator/Phix \ No newline at end of file diff --git a/Lang/Phix/Text-processing-2 b/Lang/Phix/Text-processing-2 new file mode 120000 index 0000000000..c36fe09fc4 --- /dev/null +++ b/Lang/Phix/Text-processing-2 @@ -0,0 +1 @@ +../../Task/Text-processing-2/Phix \ No newline at end of file diff --git a/Lang/Phix/The-ISAAC-Cipher b/Lang/Phix/The-ISAAC-Cipher new file mode 120000 index 0000000000..3fbd9e1802 --- /dev/null +++ b/Lang/Phix/The-ISAAC-Cipher @@ -0,0 +1 @@ +../../Task/The-ISAAC-Cipher/Phix \ No newline at end of file diff --git a/Lang/Phix/Thieles-interpolation-formula b/Lang/Phix/Thieles-interpolation-formula new file mode 120000 index 0000000000..e2be521e6a --- /dev/null +++ b/Lang/Phix/Thieles-interpolation-formula @@ -0,0 +1 @@ +../../Task/Thieles-interpolation-formula/Phix \ No newline at end of file diff --git a/Lang/Phix/Topic-variable b/Lang/Phix/Topic-variable new file mode 120000 index 0000000000..3609db7f2d --- /dev/null +++ b/Lang/Phix/Topic-variable @@ -0,0 +1 @@ +../../Task/Topic-variable/Phix \ No newline at end of file diff --git a/Lang/Phix/Topological-sort b/Lang/Phix/Topological-sort new file mode 120000 index 0000000000..effccfd8ac --- /dev/null +++ b/Lang/Phix/Topological-sort @@ -0,0 +1 @@ +../../Task/Topological-sort/Phix \ No newline at end of file diff --git a/Lang/Phix/Total-circles-area b/Lang/Phix/Total-circles-area new file mode 120000 index 0000000000..51cd15117d --- /dev/null +++ b/Lang/Phix/Total-circles-area @@ -0,0 +1 @@ +../../Task/Total-circles-area/Phix \ No newline at end of file diff --git a/Lang/Phix/Truncate-a-file b/Lang/Phix/Truncate-a-file new file mode 120000 index 0000000000..4bfa26e238 --- /dev/null +++ b/Lang/Phix/Truncate-a-file @@ -0,0 +1 @@ +../../Task/Truncate-a-file/Phix \ No newline at end of file diff --git a/Lang/Phix/Ulam-spiral--for-primes- b/Lang/Phix/Ulam-spiral--for-primes- new file mode 120000 index 0000000000..215cd668c2 --- /dev/null +++ b/Lang/Phix/Ulam-spiral--for-primes- @@ -0,0 +1 @@ +../../Task/Ulam-spiral--for-primes-/Phix \ No newline at end of file diff --git a/Lang/Phix/Vampire-number b/Lang/Phix/Vampire-number new file mode 120000 index 0000000000..919b38374d --- /dev/null +++ b/Lang/Phix/Vampire-number @@ -0,0 +1 @@ +../../Task/Vampire-number/Phix \ No newline at end of file diff --git a/Lang/Phix/Variable-size-Set b/Lang/Phix/Variable-size-Set new file mode 120000 index 0000000000..ecd4478df1 --- /dev/null +++ b/Lang/Phix/Variable-size-Set @@ -0,0 +1 @@ +../../Task/Variable-size-Set/Phix \ No newline at end of file diff --git a/Lang/Phix/Verify-distribution-uniformity-Chi-squared-test b/Lang/Phix/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..ef6580576f --- /dev/null +++ b/Lang/Phix/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/Phix \ No newline at end of file diff --git a/Lang/Phix/Verify-distribution-uniformity-Naive b/Lang/Phix/Verify-distribution-uniformity-Naive new file mode 120000 index 0000000000..d697743834 --- /dev/null +++ b/Lang/Phix/Verify-distribution-uniformity-Naive @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Naive/Phix \ No newline at end of file diff --git a/Lang/Phix/Vogels-approximation-method b/Lang/Phix/Vogels-approximation-method new file mode 120000 index 0000000000..9b9d0536d8 --- /dev/null +++ b/Lang/Phix/Vogels-approximation-method @@ -0,0 +1 @@ +../../Task/Vogels-approximation-method/Phix \ No newline at end of file diff --git a/Lang/Phix/Web-scraping b/Lang/Phix/Web-scraping new file mode 120000 index 0000000000..eceb2785d5 --- /dev/null +++ b/Lang/Phix/Web-scraping @@ -0,0 +1 @@ +../../Task/Web-scraping/Phix \ No newline at end of file diff --git a/Lang/Phix/World-Cup-group-stage b/Lang/Phix/World-Cup-group-stage new file mode 120000 index 0000000000..42d4424fba --- /dev/null +++ b/Lang/Phix/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/Phix \ No newline at end of file diff --git a/Lang/Phix/Write-to-Windows-event-log b/Lang/Phix/Write-to-Windows-event-log new file mode 120000 index 0000000000..ea5797a9ab --- /dev/null +++ b/Lang/Phix/Write-to-Windows-event-log @@ -0,0 +1 @@ +../../Task/Write-to-Windows-event-log/Phix \ No newline at end of file diff --git a/Lang/Phix/XML-DOM-serialization b/Lang/Phix/XML-DOM-serialization new file mode 120000 index 0000000000..d36b98e361 --- /dev/null +++ b/Lang/Phix/XML-DOM-serialization @@ -0,0 +1 @@ +../../Task/XML-DOM-serialization/Phix \ No newline at end of file diff --git a/Lang/Phix/Y-combinator b/Lang/Phix/Y-combinator new file mode 120000 index 0000000000..6671b593e0 --- /dev/null +++ b/Lang/Phix/Y-combinator @@ -0,0 +1 @@ +../../Task/Y-combinator/Phix \ No newline at end of file diff --git a/Lang/Phix/Zeckendorf-arithmetic b/Lang/Phix/Zeckendorf-arithmetic new file mode 120000 index 0000000000..7431b4f2ae --- /dev/null +++ b/Lang/Phix/Zeckendorf-arithmetic @@ -0,0 +1 @@ +../../Task/Zeckendorf-arithmetic/Phix \ No newline at end of file diff --git a/Lang/Picat/00DESCRIPTION b/Lang/Picat/00DESCRIPTION index f66cf163bf..22316d0c2d 100644 --- a/Lang/Picat/00DESCRIPTION +++ b/Lang/Picat/00DESCRIPTION @@ -1 +1,12 @@ -{{language}}{{stub}} \ No newline at end of file +{{language|Picat +}}{{language programming paradigm|Declarative}}{{language programming paradigm|Logic_Programming}} + + +Picat is a simple, and yet powerful, logic-based multi-paradigm programming language aimed for general-purpose applications, including non-determinism, tabling, constraint solving (Constraint Programming, SAT, and MIP), planning, functions, list comprehensions, and general imperative constructs such as for loops, while loops, and re-assignments. Picat is available via http://picat-lang.org/ . +

+There are quite a few Picat examples at http://hakank.org/picat/ . +
+ +== References == + + \ No newline at end of file diff --git a/Lang/Picat/100-doors b/Lang/Picat/100-doors new file mode 120000 index 0000000000..eb35b14c93 --- /dev/null +++ b/Lang/Picat/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Picat \ No newline at end of file diff --git a/Lang/Picat/24-game-Solve b/Lang/Picat/24-game-Solve new file mode 120000 index 0000000000..c1836e35a9 --- /dev/null +++ b/Lang/Picat/24-game-Solve @@ -0,0 +1 @@ +../../Task/24-game-Solve/Picat \ No newline at end of file diff --git a/Lang/Picat/99-Bottles-of-Beer b/Lang/Picat/99-Bottles-of-Beer new file mode 120000 index 0000000000..0f513a2c9d --- /dev/null +++ b/Lang/Picat/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/Picat \ No newline at end of file diff --git a/Lang/Picat/Caesar-cipher b/Lang/Picat/Caesar-cipher new file mode 120000 index 0000000000..cb05c17e86 --- /dev/null +++ b/Lang/Picat/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/Picat \ No newline at end of file diff --git a/Lang/Picat/N-queens-problem b/Lang/Picat/N-queens-problem new file mode 120000 index 0000000000..77202b4a9b --- /dev/null +++ b/Lang/Picat/N-queens-problem @@ -0,0 +1 @@ +../../Task/N-queens-problem/Picat \ No newline at end of file diff --git a/Lang/Picat/Solve-the-no-connection-puzzle b/Lang/Picat/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..38c79b1d28 --- /dev/null +++ b/Lang/Picat/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/Picat \ No newline at end of file diff --git a/Lang/PicoLisp/Continued-fraction b/Lang/PicoLisp/Continued-fraction new file mode 120000 index 0000000000..93917e7136 --- /dev/null +++ b/Lang/PicoLisp/Continued-fraction @@ -0,0 +1 @@ +../../Task/Continued-fraction/PicoLisp \ No newline at end of file diff --git a/Lang/Pony/100-doors b/Lang/Pony/100-doors new file mode 120000 index 0000000000..2e42dd86e1 --- /dev/null +++ b/Lang/Pony/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Pony \ No newline at end of file diff --git a/Lang/Pony/A+B b/Lang/Pony/A+B new file mode 120000 index 0000000000..149090856b --- /dev/null +++ b/Lang/Pony/A+B @@ -0,0 +1 @@ +../../Task/A+B/Pony \ No newline at end of file diff --git a/Lang/Pony/Accumulator-factory b/Lang/Pony/Accumulator-factory new file mode 120000 index 0000000000..30dd6ed233 --- /dev/null +++ b/Lang/Pony/Accumulator-factory @@ -0,0 +1 @@ +../../Task/Accumulator-factory/Pony \ No newline at end of file diff --git a/Lang/Pony/Array-concatenation b/Lang/Pony/Array-concatenation new file mode 120000 index 0000000000..7d0a70fb1d --- /dev/null +++ b/Lang/Pony/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/Pony \ No newline at end of file diff --git a/Lang/Pony/Sieve-of-Eratosthenes b/Lang/Pony/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..f27a98068b --- /dev/null +++ b/Lang/Pony/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Pony \ No newline at end of file diff --git a/Lang/PowerBASIC/CRC-32 b/Lang/PowerBASIC/CRC-32 new file mode 120000 index 0000000000..9d8d826253 --- /dev/null +++ b/Lang/PowerBASIC/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerBASIC/Find-common-directory-path b/Lang/PowerBASIC/Find-common-directory-path new file mode 120000 index 0000000000..18af78b0d9 --- /dev/null +++ b/Lang/PowerBASIC/Find-common-directory-path @@ -0,0 +1 @@ +../../Task/Find-common-directory-path/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerBASIC/Hello-world-Text b/Lang/PowerBASIC/Hello-world-Text new file mode 120000 index 0000000000..c0bf710c56 --- /dev/null +++ b/Lang/PowerBASIC/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerBASIC/Luhn-test-of-credit-card-numbers b/Lang/PowerBASIC/Luhn-test-of-credit-card-numbers new file mode 120000 index 0000000000..a0299da8e3 --- /dev/null +++ b/Lang/PowerBASIC/Luhn-test-of-credit-card-numbers @@ -0,0 +1 @@ +../../Task/Luhn-test-of-credit-card-numbers/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerBASIC/Matrix-transposition b/Lang/PowerBASIC/Matrix-transposition new file mode 120000 index 0000000000..022a959365 --- /dev/null +++ b/Lang/PowerBASIC/Matrix-transposition @@ -0,0 +1 @@ +../../Task/Matrix-transposition/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerBASIC/Reverse-a-string b/Lang/PowerBASIC/Reverse-a-string new file mode 120000 index 0000000000..fc5bc1281c --- /dev/null +++ b/Lang/PowerBASIC/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/PowerBASIC \ No newline at end of file diff --git a/Lang/PowerShell/Unix-ls b/Lang/PowerShell/Unix-ls new file mode 120000 index 0000000000..7fa29e00bf --- /dev/null +++ b/Lang/PowerShell/Unix-ls @@ -0,0 +1 @@ +../../Task/Unix-ls/PowerShell \ No newline at end of file diff --git a/Lang/Processing/Anagrams b/Lang/Processing/Anagrams new file mode 120000 index 0000000000..49cf47dc8a --- /dev/null +++ b/Lang/Processing/Anagrams @@ -0,0 +1 @@ +../../Task/Anagrams/Processing \ No newline at end of file diff --git a/Lang/Processing/Animation b/Lang/Processing/Animation new file mode 120000 index 0000000000..567cc350ad --- /dev/null +++ b/Lang/Processing/Animation @@ -0,0 +1 @@ +../../Task/Animation/Processing \ No newline at end of file diff --git a/Lang/Processing/Binary-digits b/Lang/Processing/Binary-digits new file mode 120000 index 0000000000..4416d876dd --- /dev/null +++ b/Lang/Processing/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/Processing \ No newline at end of file diff --git a/Lang/Processing/Bulls-and-cows b/Lang/Processing/Bulls-and-cows new file mode 120000 index 0000000000..1a7a2ed2f6 --- /dev/null +++ b/Lang/Processing/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/Processing \ No newline at end of file diff --git a/Lang/Processing/Color-of-a-screen-pixel b/Lang/Processing/Color-of-a-screen-pixel new file mode 120000 index 0000000000..7a1a1275b7 --- /dev/null +++ b/Lang/Processing/Color-of-a-screen-pixel @@ -0,0 +1 @@ +../../Task/Color-of-a-screen-pixel/Processing \ No newline at end of file diff --git a/Lang/Processing/Fibonacci-sequence b/Lang/Processing/Fibonacci-sequence new file mode 120000 index 0000000000..cbe3d33be5 --- /dev/null +++ b/Lang/Processing/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/Processing \ No newline at end of file diff --git a/Lang/Processing/Image-noise b/Lang/Processing/Image-noise new file mode 120000 index 0000000000..c51772976b --- /dev/null +++ b/Lang/Processing/Image-noise @@ -0,0 +1 @@ +../../Task/Image-noise/Processing \ No newline at end of file diff --git a/Lang/Processing/Include-a-file b/Lang/Processing/Include-a-file new file mode 120000 index 0000000000..fd5b6d0c60 --- /dev/null +++ b/Lang/Processing/Include-a-file @@ -0,0 +1 @@ +../../Task/Include-a-file/Processing \ No newline at end of file diff --git a/Lang/Processing/Josephus-problem b/Lang/Processing/Josephus-problem new file mode 120000 index 0000000000..d24f574781 --- /dev/null +++ b/Lang/Processing/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/Processing \ No newline at end of file diff --git a/Lang/Processing/Levenshtein-distance b/Lang/Processing/Levenshtein-distance new file mode 120000 index 0000000000..3e79cf0a44 --- /dev/null +++ b/Lang/Processing/Levenshtein-distance @@ -0,0 +1 @@ +../../Task/Levenshtein-distance/Processing \ No newline at end of file diff --git a/Lang/Processing/Rename-a-file b/Lang/Processing/Rename-a-file new file mode 120000 index 0000000000..e32217060a --- /dev/null +++ b/Lang/Processing/Rename-a-file @@ -0,0 +1 @@ +../../Task/Rename-a-file/Processing \ No newline at end of file diff --git a/Lang/Processing/Repeat-a-string b/Lang/Processing/Repeat-a-string new file mode 120000 index 0000000000..67387a5541 --- /dev/null +++ b/Lang/Processing/Repeat-a-string @@ -0,0 +1 @@ +../../Task/Repeat-a-string/Processing \ No newline at end of file diff --git a/Lang/Prolog/Binary-strings b/Lang/Prolog/Binary-strings new file mode 120000 index 0000000000..629e774af7 --- /dev/null +++ b/Lang/Prolog/Binary-strings @@ -0,0 +1 @@ +../../Task/Binary-strings/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Calendar b/Lang/Prolog/Calendar new file mode 120000 index 0000000000..969cbc8664 --- /dev/null +++ b/Lang/Prolog/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Chat-server b/Lang/Prolog/Chat-server new file mode 120000 index 0000000000..6c8c14c4d0 --- /dev/null +++ b/Lang/Prolog/Chat-server @@ -0,0 +1 @@ +../../Task/Chat-server/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Collections b/Lang/Prolog/Collections new file mode 120000 index 0000000000..7cd3c9ca0c --- /dev/null +++ b/Lang/Prolog/Collections @@ -0,0 +1 @@ +../../Task/Collections/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Compound-data-type b/Lang/Prolog/Compound-data-type new file mode 120000 index 0000000000..e9b8832c45 --- /dev/null +++ b/Lang/Prolog/Compound-data-type @@ -0,0 +1 @@ +../../Task/Compound-data-type/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Copy-a-string b/Lang/Prolog/Copy-a-string new file mode 120000 index 0000000000..443cc8170e --- /dev/null +++ b/Lang/Prolog/Copy-a-string @@ -0,0 +1 @@ +../../Task/Copy-a-string/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Create-an-HTML-table b/Lang/Prolog/Create-an-HTML-table new file mode 120000 index 0000000000..94a33c5463 --- /dev/null +++ b/Lang/Prolog/Create-an-HTML-table @@ -0,0 +1 @@ +../../Task/Create-an-HTML-table/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Day-of-the-week b/Lang/Prolog/Day-of-the-week new file mode 120000 index 0000000000..c502a2ce97 --- /dev/null +++ b/Lang/Prolog/Day-of-the-week @@ -0,0 +1 @@ +../../Task/Day-of-the-week/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Exceptions b/Lang/Prolog/Exceptions new file mode 120000 index 0000000000..429d2cbf17 --- /dev/null +++ b/Lang/Prolog/Exceptions @@ -0,0 +1 @@ +../../Task/Exceptions/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Five-weekends b/Lang/Prolog/Five-weekends new file mode 120000 index 0000000000..34952092ec --- /dev/null +++ b/Lang/Prolog/Five-weekends @@ -0,0 +1 @@ +../../Task/Five-weekends/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Four-bit-adder b/Lang/Prolog/Four-bit-adder new file mode 120000 index 0000000000..82bfa6944d --- /dev/null +++ b/Lang/Prolog/Four-bit-adder @@ -0,0 +1 @@ +../../Task/Four-bit-adder/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Inverted-syntax b/Lang/Prolog/Inverted-syntax new file mode 120000 index 0000000000..6cb1e14415 --- /dev/null +++ b/Lang/Prolog/Inverted-syntax @@ -0,0 +1 @@ +../../Task/Inverted-syntax/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Loops-Downward-for b/Lang/Prolog/Loops-Downward-for new file mode 120000 index 0000000000..3c46247360 --- /dev/null +++ b/Lang/Prolog/Loops-Downward-for @@ -0,0 +1 @@ +../../Task/Loops-Downward-for/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Loops-For b/Lang/Prolog/Loops-For new file mode 120000 index 0000000000..2211ddeb58 --- /dev/null +++ b/Lang/Prolog/Loops-For @@ -0,0 +1 @@ +../../Task/Loops-For/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Loops-For-with-a-specified-step b/Lang/Prolog/Loops-For-with-a-specified-step new file mode 120000 index 0000000000..7eba534df8 --- /dev/null +++ b/Lang/Prolog/Loops-For-with-a-specified-step @@ -0,0 +1 @@ +../../Task/Loops-For-with-a-specified-step/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Loops-N-plus-one-half b/Lang/Prolog/Loops-N-plus-one-half new file mode 120000 index 0000000000..a57a849081 --- /dev/null +++ b/Lang/Prolog/Loops-N-plus-one-half @@ -0,0 +1 @@ +../../Task/Loops-N-plus-one-half/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Metaprogramming b/Lang/Prolog/Metaprogramming new file mode 120000 index 0000000000..b89faf76fa --- /dev/null +++ b/Lang/Prolog/Metaprogramming @@ -0,0 +1 @@ +../../Task/Metaprogramming/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Minesweeper-game b/Lang/Prolog/Minesweeper-game new file mode 120000 index 0000000000..0e63b4bc73 --- /dev/null +++ b/Lang/Prolog/Minesweeper-game @@ -0,0 +1 @@ +../../Task/Minesweeper-game/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Named-parameters b/Lang/Prolog/Named-parameters new file mode 120000 index 0000000000..b539a1d6b1 --- /dev/null +++ b/Lang/Prolog/Named-parameters @@ -0,0 +1 @@ +../../Task/Named-parameters/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Penneys-game b/Lang/Prolog/Penneys-game new file mode 120000 index 0000000000..249eb1861f --- /dev/null +++ b/Lang/Prolog/Penneys-game @@ -0,0 +1 @@ +../../Task/Penneys-game/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Program-name b/Lang/Prolog/Program-name new file mode 120000 index 0000000000..af9520e9a7 --- /dev/null +++ b/Lang/Prolog/Program-name @@ -0,0 +1 @@ +../../Task/Program-name/Prolog \ No newline at end of file diff --git a/Lang/Prolog/Rock-paper-scissors b/Lang/Prolog/Rock-paper-scissors new file mode 120000 index 0000000000..b08a6934b4 --- /dev/null +++ b/Lang/Prolog/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/Prolog \ No newline at end of file diff --git a/Lang/Pure-Data/100-doors b/Lang/Pure-Data/100-doors new file mode 120000 index 0000000000..b12952801a --- /dev/null +++ b/Lang/Pure-Data/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Pure-Data \ No newline at end of file diff --git a/Lang/PureBasic/Function-prototype b/Lang/PureBasic/Function-prototype new file mode 120000 index 0000000000..e97989f31f --- /dev/null +++ b/Lang/PureBasic/Function-prototype @@ -0,0 +1 @@ +../../Task/Function-prototype/PureBasic \ No newline at end of file diff --git a/Lang/PureBasic/Hofstadter-Q-sequence b/Lang/PureBasic/Hofstadter-Q-sequence new file mode 120000 index 0000000000..8f02c3bce9 --- /dev/null +++ b/Lang/PureBasic/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/PureBasic \ No newline at end of file diff --git a/Lang/PureBasic/Quickselect-algorithm b/Lang/PureBasic/Quickselect-algorithm new file mode 120000 index 0000000000..08f976c86b --- /dev/null +++ b/Lang/PureBasic/Quickselect-algorithm @@ -0,0 +1 @@ +../../Task/Quickselect-algorithm/PureBasic \ No newline at end of file diff --git a/Lang/Python/Bitmap-PPM-conversion-through-a-pipe b/Lang/Python/Bitmap-PPM-conversion-through-a-pipe new file mode 120000 index 0000000000..a3a9e25a05 --- /dev/null +++ b/Lang/Python/Bitmap-PPM-conversion-through-a-pipe @@ -0,0 +1 @@ +../../Task/Bitmap-PPM-conversion-through-a-pipe/Python \ No newline at end of file diff --git a/Lang/Python/Bitmap-Read-an-image-through-a-pipe b/Lang/Python/Bitmap-Read-an-image-through-a-pipe new file mode 120000 index 0000000000..cc724fb661 --- /dev/null +++ b/Lang/Python/Bitmap-Read-an-image-through-a-pipe @@ -0,0 +1 @@ +../../Task/Bitmap-Read-an-image-through-a-pipe/Python \ No newline at end of file diff --git a/Lang/Python/Catmull-Clark-subdivision-surface b/Lang/Python/Catmull-Clark-subdivision-surface new file mode 120000 index 0000000000..2e6941947a --- /dev/null +++ b/Lang/Python/Catmull-Clark-subdivision-surface @@ -0,0 +1 @@ +../../Task/Catmull-Clark-subdivision-surface/Python \ No newline at end of file diff --git a/Lang/Python/Checkpoint-synchronization b/Lang/Python/Checkpoint-synchronization new file mode 120000 index 0000000000..fb07acba6a --- /dev/null +++ b/Lang/Python/Checkpoint-synchronization @@ -0,0 +1 @@ +../../Task/Checkpoint-synchronization/Python \ No newline at end of file diff --git a/Lang/Python/Colour-pinstripe-Printer b/Lang/Python/Colour-pinstripe-Printer new file mode 120000 index 0000000000..945ef3c399 --- /dev/null +++ b/Lang/Python/Colour-pinstripe-Printer @@ -0,0 +1 @@ +../../Task/Colour-pinstripe-Printer/Python \ No newline at end of file diff --git a/Lang/Python/Deconvolution-2D+ b/Lang/Python/Deconvolution-2D+ new file mode 120000 index 0000000000..be951b0b51 --- /dev/null +++ b/Lang/Python/Deconvolution-2D+ @@ -0,0 +1 @@ +../../Task/Deconvolution-2D+/Python \ No newline at end of file diff --git a/Lang/Python/Video-display-modes b/Lang/Python/Video-display-modes new file mode 120000 index 0000000000..7f65a752eb --- /dev/null +++ b/Lang/Python/Video-display-modes @@ -0,0 +1 @@ +../../Task/Video-display-modes/Python \ No newline at end of file diff --git a/Lang/Python/Zeckendorf-arithmetic b/Lang/Python/Zeckendorf-arithmetic new file mode 120000 index 0000000000..edb0e88ee1 --- /dev/null +++ b/Lang/Python/Zeckendorf-arithmetic @@ -0,0 +1 @@ +../../Task/Zeckendorf-arithmetic/Python \ No newline at end of file diff --git a/Lang/Q/99-Bottles-of-Beer b/Lang/Q/99-Bottles-of-Beer new file mode 120000 index 0000000000..ebc766f485 --- /dev/null +++ b/Lang/Q/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/Q \ No newline at end of file diff --git a/Lang/Q/Array-concatenation b/Lang/Q/Array-concatenation new file mode 120000 index 0000000000..72d60a04d8 --- /dev/null +++ b/Lang/Q/Array-concatenation @@ -0,0 +1 @@ +../../Task/Array-concatenation/Q \ No newline at end of file diff --git a/Lang/Q/Averages-Arithmetic-mean b/Lang/Q/Averages-Arithmetic-mean new file mode 120000 index 0000000000..e7b60cbbf8 --- /dev/null +++ b/Lang/Q/Averages-Arithmetic-mean @@ -0,0 +1 @@ +../../Task/Averages-Arithmetic-mean/Q \ No newline at end of file diff --git a/Lang/Q/Averages-Mode b/Lang/Q/Averages-Mode new file mode 120000 index 0000000000..59aec9c543 --- /dev/null +++ b/Lang/Q/Averages-Mode @@ -0,0 +1 @@ +../../Task/Averages-Mode/Q \ No newline at end of file diff --git a/Lang/Q/CSV-data-manipulation b/Lang/Q/CSV-data-manipulation new file mode 120000 index 0000000000..b26a879ca7 --- /dev/null +++ b/Lang/Q/CSV-data-manipulation @@ -0,0 +1 @@ +../../Task/CSV-data-manipulation/Q \ No newline at end of file diff --git a/Lang/Q/Detect-division-by-zero b/Lang/Q/Detect-division-by-zero new file mode 120000 index 0000000000..b6da910805 --- /dev/null +++ b/Lang/Q/Detect-division-by-zero @@ -0,0 +1 @@ +../../Task/Detect-division-by-zero/Q \ No newline at end of file diff --git a/Lang/Q/Filter b/Lang/Q/Filter new file mode 120000 index 0000000000..5c785c7a06 --- /dev/null +++ b/Lang/Q/Filter @@ -0,0 +1 @@ +../../Task/Filter/Q \ No newline at end of file diff --git a/Lang/Q/Flatten-a-list b/Lang/Q/Flatten-a-list new file mode 120000 index 0000000000..b919c57c2e --- /dev/null +++ b/Lang/Q/Flatten-a-list @@ -0,0 +1 @@ +../../Task/Flatten-a-list/Q \ No newline at end of file diff --git a/Lang/Q/Integer-sequence b/Lang/Q/Integer-sequence new file mode 120000 index 0000000000..f9438030cb --- /dev/null +++ b/Lang/Q/Integer-sequence @@ -0,0 +1 @@ +../../Task/Integer-sequence/Q \ No newline at end of file diff --git a/Lang/Q/Leap-year b/Lang/Q/Leap-year new file mode 120000 index 0000000000..b942e0a4b8 --- /dev/null +++ b/Lang/Q/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/Q \ No newline at end of file diff --git a/Lang/Q/Luhn-test-of-credit-card-numbers b/Lang/Q/Luhn-test-of-credit-card-numbers new file mode 120000 index 0000000000..6558bba1d2 --- /dev/null +++ b/Lang/Q/Luhn-test-of-credit-card-numbers @@ -0,0 +1 @@ +../../Task/Luhn-test-of-credit-card-numbers/Q \ No newline at end of file diff --git a/Lang/Q/Operator-precedence b/Lang/Q/Operator-precedence new file mode 120000 index 0000000000..cdd21da49d --- /dev/null +++ b/Lang/Q/Operator-precedence @@ -0,0 +1 @@ +../../Task/Operator-precedence/Q \ No newline at end of file diff --git a/Lang/Q/SEDOLs b/Lang/Q/SEDOLs new file mode 120000 index 0000000000..0831667c66 --- /dev/null +++ b/Lang/Q/SEDOLs @@ -0,0 +1 @@ +../../Task/SEDOLs/Q \ No newline at end of file diff --git a/Lang/Q/Sum-multiples-of-3-and-5 b/Lang/Q/Sum-multiples-of-3-and-5 new file mode 120000 index 0000000000..9f6e652362 --- /dev/null +++ b/Lang/Q/Sum-multiples-of-3-and-5 @@ -0,0 +1 @@ +../../Task/Sum-multiples-of-3-and-5/Q \ No newline at end of file diff --git a/Lang/Q/Sum-of-a-series b/Lang/Q/Sum-of-a-series new file mode 120000 index 0000000000..8b4ba365ca --- /dev/null +++ b/Lang/Q/Sum-of-a-series @@ -0,0 +1 @@ +../../Task/Sum-of-a-series/Q \ No newline at end of file diff --git a/Lang/Q/Sum-of-squares b/Lang/Q/Sum-of-squares new file mode 120000 index 0000000000..abfa735d76 --- /dev/null +++ b/Lang/Q/Sum-of-squares @@ -0,0 +1 @@ +../../Task/Sum-of-squares/Q \ No newline at end of file diff --git a/Lang/R/Average-loop-length b/Lang/R/Average-loop-length new file mode 120000 index 0000000000..d923970bf6 --- /dev/null +++ b/Lang/R/Average-loop-length @@ -0,0 +1 @@ +../../Task/Average-loop-length/R \ No newline at end of file diff --git a/Lang/R/Binary-digits b/Lang/R/Binary-digits new file mode 120000 index 0000000000..d0f12fd295 --- /dev/null +++ b/Lang/R/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/R \ No newline at end of file diff --git a/Lang/R/CRC-32 b/Lang/R/CRC-32 new file mode 120000 index 0000000000..d40ec9e4ab --- /dev/null +++ b/Lang/R/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/R \ No newline at end of file diff --git a/Lang/R/Check-Machin-like-formulas b/Lang/R/Check-Machin-like-formulas new file mode 120000 index 0000000000..18d4cdca88 --- /dev/null +++ b/Lang/R/Check-Machin-like-formulas @@ -0,0 +1 @@ +../../Task/Check-Machin-like-formulas/R \ No newline at end of file diff --git a/Lang/R/Convert-decimal-number-to-rational b/Lang/R/Convert-decimal-number-to-rational new file mode 120000 index 0000000000..0c38d24615 --- /dev/null +++ b/Lang/R/Convert-decimal-number-to-rational @@ -0,0 +1 @@ +../../Task/Convert-decimal-number-to-rational/R \ No newline at end of file diff --git a/Lang/R/Generate-Chess960-starting-position b/Lang/R/Generate-Chess960-starting-position new file mode 120000 index 0000000000..8f1e1f631e --- /dev/null +++ b/Lang/R/Generate-Chess960-starting-position @@ -0,0 +1 @@ +../../Task/Generate-Chess960-starting-position/R \ No newline at end of file diff --git a/Lang/R/Hello-world-Newline-omission b/Lang/R/Hello-world-Newline-omission new file mode 120000 index 0000000000..5ffc8984c1 --- /dev/null +++ b/Lang/R/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/R \ No newline at end of file diff --git a/Lang/R/Pi b/Lang/R/Pi new file mode 120000 index 0000000000..4e54229a8f --- /dev/null +++ b/Lang/R/Pi @@ -0,0 +1 @@ +../../Task/Pi/R \ No newline at end of file diff --git a/Lang/R/Remove-duplicate-elements b/Lang/R/Remove-duplicate-elements new file mode 120000 index 0000000000..84d0ce2a69 --- /dev/null +++ b/Lang/R/Remove-duplicate-elements @@ -0,0 +1 @@ +../../Task/Remove-duplicate-elements/R \ No newline at end of file diff --git a/Lang/R/SHA-1 b/Lang/R/SHA-1 new file mode 120000 index 0000000000..ad26cd31cd --- /dev/null +++ b/Lang/R/SHA-1 @@ -0,0 +1 @@ +../../Task/SHA-1/R \ No newline at end of file diff --git a/Lang/R/SHA-256 b/Lang/R/SHA-256 new file mode 120000 index 0000000000..3026305890 --- /dev/null +++ b/Lang/R/SHA-256 @@ -0,0 +1 @@ +../../Task/SHA-256/R \ No newline at end of file diff --git a/Lang/R/Topswops b/Lang/R/Topswops new file mode 120000 index 0000000000..7f3b7ca29f --- /dev/null +++ b/Lang/R/Topswops @@ -0,0 +1 @@ +../../Task/Topswops/R \ No newline at end of file diff --git a/Lang/REALbasic/00DESCRIPTION b/Lang/REALbasic/00DESCRIPTION index 066ad7cabc..32383a629f 100644 --- a/Lang/REALbasic/00DESCRIPTION +++ b/Lang/REALbasic/00DESCRIPTION @@ -5,7 +5,7 @@ {{language programming paradigm|Object-oriented}} '''REALbasic''' (or '''RB''') is a [[BASIC]] compiler for [[Windows]], [[Mac OS]], and [[Linux]], made by [http://www.xojo.com/ Xojo, Inc.] It has its own [[IDE]], and projects are saved to a proprietary binary format. Unlike most BASICs, REALbasic is heavily object-oriented. -As of June 2013, the language, IDE, and company have been re-branded as "Xojo". +As of June 2013, the language, IDE, and company have been re-branded as [[Xojo]]. REALbasic is not compatible with other BASICs, for the most part; examples from other BASICs usually have to be completely rewritten to work in RB. diff --git a/Lang/REXX/00DESCRIPTION b/Lang/REXX/00DESCRIPTION index 05071df6e0..1c7ce1696d 100644 --- a/Lang/REXX/00DESCRIPTION +++ b/Lang/REXX/00DESCRIPTION @@ -7,12 +7,20 @@ |compat=nominative |checking=dynamic |parampass=value}} + {{Wikipedia|REXX}} REXX (REstructured eXtended eXecutor) is an interpreted programming language which was developed at IBM.   It is a structured high-level programming language which was designed to be both easy to learn and easy to read.   Both proprietary and open source interpreters for REXX are available on a wide range of computing platforms, and compilers are available for IBM mainframes. + +'''REXX'''   is also spelled: +::*   Rexx +::*   REXX + + + * '''[[wp:ARexx|ARexx]]''' is a classic REXX implementation (with extensions) for the AmigaOS, given in bundle since AmigaOS 2.   (Regina REXX has specific support for the extended functions that were introduced in ARexx.)   ARexx was written in 1987 by William S. Hawes. * '''[[Brexx]]''' a classic REXX written by Vassilis N. Vlachoudis, it is free and it's open source and available under the GNU General Public License. @@ -62,6 +70,7 @@
[Most of the entries were entered mostly from memory and apologies are offered for not knowing more about what wording should be used; the IBM operating systems or Program Products that run REXX are numerous and varied.   Their complete (official) names would fill a pageful.   Some of the REXXes are no longer sold nor available for downloading or purchase, others are no longer maintained.   Naming of names is being avoided (especially those licensed products for sale), and it is hoped that this is seen that no products nor vendors are being endorsed, appraised, or critiqued.]   -- [[User:Gerard Schildberger|Gerard Schildberger]] 09:28, 1 July 2012 (UTC) ===External Links=== +* [https://en.wikipedia.org/wiki/Rexx English Wikipedia REXX ] * [https://github.com/vlachoudis/brexx Brexx interpreter] * [http://www.oorexx.org/ Open Object Rexx - www.oorexx.org] * [http://www.netrexx.org The NetRexx Programming Language - www.netrexx.org] diff --git a/Lang/REXX/Animation b/Lang/REXX/Animation new file mode 120000 index 0000000000..ac019c9e61 --- /dev/null +++ b/Lang/REXX/Animation @@ -0,0 +1 @@ +../../Task/Animation/REXX \ No newline at end of file diff --git a/Lang/REXX/Galton-box-animation b/Lang/REXX/Galton-box-animation new file mode 120000 index 0000000000..d36cd0d842 --- /dev/null +++ b/Lang/REXX/Galton-box-animation @@ -0,0 +1 @@ +../../Task/Galton-box-animation/REXX \ No newline at end of file diff --git a/Lang/REXX/Longest-increasing-subsequence b/Lang/REXX/Longest-increasing-subsequence new file mode 120000 index 0000000000..98b998f3b7 --- /dev/null +++ b/Lang/REXX/Longest-increasing-subsequence @@ -0,0 +1 @@ +../../Task/Longest-increasing-subsequence/REXX \ No newline at end of file diff --git a/Lang/REXX/Polymorphic-copy b/Lang/REXX/Polymorphic-copy new file mode 120000 index 0000000000..ce1429a7b7 --- /dev/null +++ b/Lang/REXX/Polymorphic-copy @@ -0,0 +1 @@ +../../Task/Polymorphic-copy/REXX \ No newline at end of file diff --git a/Lang/REXX/User-input-Graphical b/Lang/REXX/User-input-Graphical new file mode 120000 index 0000000000..90ea6afe0f --- /dev/null +++ b/Lang/REXX/User-input-Graphical @@ -0,0 +1 @@ +../../Task/User-input-Graphical/REXX \ No newline at end of file diff --git a/Lang/REXX/Verify-distribution-uniformity-Chi-squared-test b/Lang/REXX/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..545dbbc50d --- /dev/null +++ b/Lang/REXX/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/REXX \ No newline at end of file diff --git a/Lang/REXX/World-Cup-group-stage b/Lang/REXX/World-Cup-group-stage new file mode 120000 index 0000000000..448d8a347f --- /dev/null +++ b/Lang/REXX/World-Cup-group-stage @@ -0,0 +1 @@ +../../Task/World-Cup-group-stage/REXX \ No newline at end of file diff --git a/Lang/RPG/99-Bottles-of-Beer b/Lang/RPG/99-Bottles-of-Beer new file mode 120000 index 0000000000..c1c9a2960d --- /dev/null +++ b/Lang/RPG/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/RPG \ No newline at end of file diff --git a/Lang/RPG/Leap-year b/Lang/RPG/Leap-year new file mode 120000 index 0000000000..02792f949e --- /dev/null +++ b/Lang/RPG/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/RPG \ No newline at end of file diff --git a/Lang/RPL/Dot-product b/Lang/RPL/Dot-product new file mode 120000 index 0000000000..7e2371f549 --- /dev/null +++ b/Lang/RPL/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/RPL \ No newline at end of file diff --git a/Lang/Red/24-game b/Lang/Red/24-game new file mode 120000 index 0000000000..b7ea78b695 --- /dev/null +++ b/Lang/Red/24-game @@ -0,0 +1 @@ +../../Task/24-game/Red \ No newline at end of file diff --git a/Lang/Red/Bulls-and-cows b/Lang/Red/Bulls-and-cows new file mode 120000 index 0000000000..183039e7b1 --- /dev/null +++ b/Lang/Red/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/Red \ No newline at end of file diff --git a/Lang/Red/Copy-a-string b/Lang/Red/Copy-a-string new file mode 120000 index 0000000000..efa197a6fa --- /dev/null +++ b/Lang/Red/Copy-a-string @@ -0,0 +1 @@ +../../Task/Copy-a-string/Red \ No newline at end of file diff --git a/Lang/Red/Create-an-HTML-table b/Lang/Red/Create-an-HTML-table new file mode 120000 index 0000000000..f00c4d236e --- /dev/null +++ b/Lang/Red/Create-an-HTML-table @@ -0,0 +1 @@ +../../Task/Create-an-HTML-table/Red \ No newline at end of file diff --git a/Lang/Red/Guess-the-number b/Lang/Red/Guess-the-number new file mode 120000 index 0000000000..c3b6e915b0 --- /dev/null +++ b/Lang/Red/Guess-the-number @@ -0,0 +1 @@ +../../Task/Guess-the-number/Red \ No newline at end of file diff --git a/Lang/Red/Sorting-algorithms-Quicksort b/Lang/Red/Sorting-algorithms-Quicksort new file mode 120000 index 0000000000..7ef98509de --- /dev/null +++ b/Lang/Red/Sorting-algorithms-Quicksort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Quicksort/Red \ No newline at end of file diff --git a/Lang/Retro/00DESCRIPTION b/Lang/Retro/00DESCRIPTION index 055916b1a1..235fab64e2 100644 --- a/Lang/Retro/00DESCRIPTION +++ b/Lang/Retro/00DESCRIPTION @@ -1,6 +1,6 @@ {{language|Retro |exec=machine -|site=http://rx-core.org +|site=http://retroforth.org |gc=no |parampass=reference |untyped=yes @@ -10,7 +10,7 @@ Retro is a stack-based, concatenative programming language with roots in [[Forth]]. ==Links== -*[http://rx-core.org Main Site] -*[http://rx-core.org/rx.fossil/wiki?name=documentation Documentation] +*[http://forthworks.com/retro Main Site] +*[http://forth.works/book.html Documentation] {{Language programming paradigm|Concatenative}} \ No newline at end of file diff --git a/Lang/Ring/Sokoban b/Lang/Ring/Sokoban new file mode 120000 index 0000000000..752efb1740 --- /dev/null +++ b/Lang/Ring/Sokoban @@ -0,0 +1 @@ +../../Task/Sokoban/Ring \ No newline at end of file diff --git a/Lang/Robotic/00DESCRIPTION b/Lang/Robotic/00DESCRIPTION index 9df7a5fb92..1357806257 100644 --- a/Lang/Robotic/00DESCRIPTION +++ b/Lang/Robotic/00DESCRIPTION @@ -3,4 +3,4 @@ site=http://vault.digitalmzx.net/index.php }} -Robotic is a [[programming language]] for the game creation system titled [[wp:MegaZeux|MegaZeux]]. It is a simple language that is used for Robots placed within a MegaZeux world. Some of the few features for this language include the use of subroutines, arithmetic expressions, strings, counters, etc. \ No newline at end of file +Robotic is a [[programming language]] for the game creation system titled [[wp:MegaZeux|MegaZeux]]. It is a simple language that is used for Robots placed within a MegaZeux world. Some of the few features for this language include the use of subroutines, arithmetic expressions, strings, counters (variables), etc. \ No newline at end of file diff --git a/Lang/Robotic/A+B b/Lang/Robotic/A+B new file mode 120000 index 0000000000..f745e7a665 --- /dev/null +++ b/Lang/Robotic/A+B @@ -0,0 +1 @@ +../../Task/A+B/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Arithmetic-Integer b/Lang/Robotic/Arithmetic-Integer new file mode 120000 index 0000000000..025814b462 --- /dev/null +++ b/Lang/Robotic/Arithmetic-Integer @@ -0,0 +1 @@ +../../Task/Arithmetic-Integer/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Arrays b/Lang/Robotic/Arrays new file mode 120000 index 0000000000..fb86781fbe --- /dev/null +++ b/Lang/Robotic/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Bitwise-operations b/Lang/Robotic/Bitwise-operations new file mode 120000 index 0000000000..2bdaca85b6 --- /dev/null +++ b/Lang/Robotic/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Comments b/Lang/Robotic/Comments new file mode 120000 index 0000000000..5f3504e954 --- /dev/null +++ b/Lang/Robotic/Comments @@ -0,0 +1 @@ +../../Task/Comments/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Empty-program b/Lang/Robotic/Empty-program new file mode 120000 index 0000000000..5e2d95817a --- /dev/null +++ b/Lang/Robotic/Empty-program @@ -0,0 +1 @@ +../../Task/Empty-program/Robotic \ No newline at end of file diff --git a/Lang/Robotic/FizzBuzz b/Lang/Robotic/FizzBuzz new file mode 120000 index 0000000000..e620d1e89e --- /dev/null +++ b/Lang/Robotic/FizzBuzz @@ -0,0 +1 @@ +../../Task/FizzBuzz/Robotic \ No newline at end of file diff --git a/Lang/Robotic/Reverse-a-string b/Lang/Robotic/Reverse-a-string new file mode 120000 index 0000000000..8cf023a1df --- /dev/null +++ b/Lang/Robotic/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Robotic \ No newline at end of file diff --git a/Lang/Robotic/String-length b/Lang/Robotic/String-length new file mode 120000 index 0000000000..8535ea3c21 --- /dev/null +++ b/Lang/Robotic/String-length @@ -0,0 +1 @@ +../../Task/String-length/Robotic \ No newline at end of file diff --git a/Lang/Robotic/User-input-Text b/Lang/Robotic/User-input-Text new file mode 120000 index 0000000000..3319ee1922 --- /dev/null +++ b/Lang/Robotic/User-input-Text @@ -0,0 +1 @@ +../../Task/User-input-Text/Robotic \ No newline at end of file diff --git a/Lang/Ruby/HTTPS-Authenticated b/Lang/Ruby/HTTPS-Authenticated new file mode 120000 index 0000000000..aafda4d69f --- /dev/null +++ b/Lang/Ruby/HTTPS-Authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Authenticated/Ruby \ No newline at end of file diff --git a/Lang/Ruby/HTTPS-Client-authenticated b/Lang/Ruby/HTTPS-Client-authenticated new file mode 120000 index 0000000000..c0f54d0cb4 --- /dev/null +++ b/Lang/Ruby/HTTPS-Client-authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Client-authenticated/Ruby \ No newline at end of file diff --git a/Lang/Ruby/SQL-based-authentication b/Lang/Ruby/SQL-based-authentication new file mode 120000 index 0000000000..4115c4b173 --- /dev/null +++ b/Lang/Ruby/SQL-based-authentication @@ -0,0 +1 @@ +../../Task/SQL-based-authentication/Ruby \ No newline at end of file diff --git a/Lang/Rust/Active-Directory-Connect b/Lang/Rust/Active-Directory-Connect new file mode 120000 index 0000000000..1d7978e1f1 --- /dev/null +++ b/Lang/Rust/Active-Directory-Connect @@ -0,0 +1 @@ +../../Task/Active-Directory-Connect/Rust \ No newline at end of file diff --git a/Lang/Rust/Active-object b/Lang/Rust/Active-object new file mode 120000 index 0000000000..04f0d3db3d --- /dev/null +++ b/Lang/Rust/Active-object @@ -0,0 +1 @@ +../../Task/Active-object/Rust \ No newline at end of file diff --git a/Lang/Rust/Anagrams-Deranged-anagrams b/Lang/Rust/Anagrams-Deranged-anagrams new file mode 120000 index 0000000000..2cc73e62e3 --- /dev/null +++ b/Lang/Rust/Anagrams-Deranged-anagrams @@ -0,0 +1 @@ +../../Task/Anagrams-Deranged-anagrams/Rust \ No newline at end of file diff --git a/Lang/Rust/Anonymous-recursion b/Lang/Rust/Anonymous-recursion new file mode 120000 index 0000000000..f83240e7b2 --- /dev/null +++ b/Lang/Rust/Anonymous-recursion @@ -0,0 +1 @@ +../../Task/Anonymous-recursion/Rust \ No newline at end of file diff --git a/Lang/Rust/Append-a-record-to-the-end-of-a-text-file b/Lang/Rust/Append-a-record-to-the-end-of-a-text-file new file mode 120000 index 0000000000..3f10de74e3 --- /dev/null +++ b/Lang/Rust/Append-a-record-to-the-end-of-a-text-file @@ -0,0 +1 @@ +../../Task/Append-a-record-to-the-end-of-a-text-file/Rust \ No newline at end of file diff --git a/Lang/Rust/Arithmetic-evaluation b/Lang/Rust/Arithmetic-evaluation new file mode 120000 index 0000000000..04437ab43d --- /dev/null +++ b/Lang/Rust/Arithmetic-evaluation @@ -0,0 +1 @@ +../../Task/Arithmetic-evaluation/Rust \ No newline at end of file diff --git a/Lang/Rust/Arithmetic-geometric-mean-Calculate-Pi b/Lang/Rust/Arithmetic-geometric-mean-Calculate-Pi new file mode 120000 index 0000000000..56b31aa9cf --- /dev/null +++ b/Lang/Rust/Arithmetic-geometric-mean-Calculate-Pi @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean-Calculate-Pi/Rust \ No newline at end of file diff --git a/Lang/Rust/Bitmap b/Lang/Rust/Bitmap new file mode 120000 index 0000000000..953b07e016 --- /dev/null +++ b/Lang/Rust/Bitmap @@ -0,0 +1 @@ +../../Task/Bitmap/Rust \ No newline at end of file diff --git a/Lang/Rust/Bitmap-Bresenhams-line-algorithm b/Lang/Rust/Bitmap-Bresenhams-line-algorithm new file mode 120000 index 0000000000..fdc17e2301 --- /dev/null +++ b/Lang/Rust/Bitmap-Bresenhams-line-algorithm @@ -0,0 +1 @@ +../../Task/Bitmap-Bresenhams-line-algorithm/Rust \ No newline at end of file diff --git a/Lang/Rust/Bitmap-Flood-fill b/Lang/Rust/Bitmap-Flood-fill new file mode 120000 index 0000000000..309d906b28 --- /dev/null +++ b/Lang/Rust/Bitmap-Flood-fill @@ -0,0 +1 @@ +../../Task/Bitmap-Flood-fill/Rust \ No newline at end of file diff --git a/Lang/Rust/Box-the-compass b/Lang/Rust/Box-the-compass new file mode 120000 index 0000000000..1f4e6e6035 --- /dev/null +++ b/Lang/Rust/Box-the-compass @@ -0,0 +1 @@ +../../Task/Box-the-compass/Rust \ No newline at end of file diff --git a/Lang/Rust/CSV-data-manipulation b/Lang/Rust/CSV-data-manipulation new file mode 120000 index 0000000000..01a44b117e --- /dev/null +++ b/Lang/Rust/CSV-data-manipulation @@ -0,0 +1 @@ +../../Task/CSV-data-manipulation/Rust \ No newline at end of file diff --git a/Lang/Rust/CSV-to-HTML-translation b/Lang/Rust/CSV-to-HTML-translation new file mode 120000 index 0000000000..17b9eaf6fe --- /dev/null +++ b/Lang/Rust/CSV-to-HTML-translation @@ -0,0 +1 @@ +../../Task/CSV-to-HTML-translation/Rust \ No newline at end of file diff --git a/Lang/Rust/Calendar b/Lang/Rust/Calendar new file mode 120000 index 0000000000..5ff368f702 --- /dev/null +++ b/Lang/Rust/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Rust \ No newline at end of file diff --git a/Lang/Rust/Conways-Game-of-Life b/Lang/Rust/Conways-Game-of-Life new file mode 120000 index 0000000000..840c455604 --- /dev/null +++ b/Lang/Rust/Conways-Game-of-Life @@ -0,0 +1 @@ +../../Task/Conways-Game-of-Life/Rust \ No newline at end of file diff --git a/Lang/Rust/Count-in-factors b/Lang/Rust/Count-in-factors new file mode 120000 index 0000000000..220ad67236 --- /dev/null +++ b/Lang/Rust/Count-in-factors @@ -0,0 +1 @@ +../../Task/Count-in-factors/Rust \ No newline at end of file diff --git a/Lang/Rust/Create-a-file-on-magnetic-tape b/Lang/Rust/Create-a-file-on-magnetic-tape new file mode 120000 index 0000000000..ef07bac4a2 --- /dev/null +++ b/Lang/Rust/Create-a-file-on-magnetic-tape @@ -0,0 +1 @@ +../../Task/Create-a-file-on-magnetic-tape/Rust \ No newline at end of file diff --git a/Lang/Rust/Define-a-primitive-data-type b/Lang/Rust/Define-a-primitive-data-type new file mode 120000 index 0000000000..68f0798ca6 --- /dev/null +++ b/Lang/Rust/Define-a-primitive-data-type @@ -0,0 +1 @@ +../../Task/Define-a-primitive-data-type/Rust \ No newline at end of file diff --git a/Lang/Rust/Delegates b/Lang/Rust/Delegates new file mode 120000 index 0000000000..e1e99c6667 --- /dev/null +++ b/Lang/Rust/Delegates @@ -0,0 +1 @@ +../../Task/Delegates/Rust \ No newline at end of file diff --git a/Lang/Rust/Documentation b/Lang/Rust/Documentation new file mode 120000 index 0000000000..df9cdd6b31 --- /dev/null +++ b/Lang/Rust/Documentation @@ -0,0 +1 @@ +../../Task/Documentation/Rust \ No newline at end of file diff --git a/Lang/Rust/Environment-variables b/Lang/Rust/Environment-variables new file mode 120000 index 0000000000..0c66a9e3bb --- /dev/null +++ b/Lang/Rust/Environment-variables @@ -0,0 +1 @@ +../../Task/Environment-variables/Rust \ No newline at end of file diff --git a/Lang/Rust/Euler-method b/Lang/Rust/Euler-method new file mode 120000 index 0000000000..97bb18fef5 --- /dev/null +++ b/Lang/Rust/Euler-method @@ -0,0 +1 @@ +../../Task/Euler-method/Rust \ No newline at end of file diff --git a/Lang/Rust/Events b/Lang/Rust/Events new file mode 120000 index 0000000000..d0e3036697 --- /dev/null +++ b/Lang/Rust/Events @@ -0,0 +1 @@ +../../Task/Events/Rust \ No newline at end of file diff --git a/Lang/Rust/Exceptions-Catch-an-exception-thrown-in-a-nested-call b/Lang/Rust/Exceptions-Catch-an-exception-thrown-in-a-nested-call new file mode 120000 index 0000000000..64c74ff021 --- /dev/null +++ b/Lang/Rust/Exceptions-Catch-an-exception-thrown-in-a-nested-call @@ -0,0 +1 @@ +../../Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Rust \ No newline at end of file diff --git a/Lang/Rust/Find-common-directory-path b/Lang/Rust/Find-common-directory-path new file mode 120000 index 0000000000..5e5c6967fa --- /dev/null +++ b/Lang/Rust/Find-common-directory-path @@ -0,0 +1 @@ +../../Task/Find-common-directory-path/Rust \ No newline at end of file diff --git a/Lang/Rust/Floyds-triangle b/Lang/Rust/Floyds-triangle new file mode 120000 index 0000000000..03c9f8d542 --- /dev/null +++ b/Lang/Rust/Floyds-triangle @@ -0,0 +1 @@ +../../Task/Floyds-triangle/Rust \ No newline at end of file diff --git a/Lang/Rust/Fork b/Lang/Rust/Fork new file mode 120000 index 0000000000..abbf0281a1 --- /dev/null +++ b/Lang/Rust/Fork @@ -0,0 +1 @@ +../../Task/Fork/Rust \ No newline at end of file diff --git a/Lang/Rust/Four-bit-adder b/Lang/Rust/Four-bit-adder new file mode 120000 index 0000000000..2a84bda986 --- /dev/null +++ b/Lang/Rust/Four-bit-adder @@ -0,0 +1 @@ +../../Task/Four-bit-adder/Rust \ No newline at end of file diff --git a/Lang/Rust/Gaussian-elimination b/Lang/Rust/Gaussian-elimination new file mode 120000 index 0000000000..b4b76f40be --- /dev/null +++ b/Lang/Rust/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/Rust \ No newline at end of file diff --git a/Lang/Rust/Generator-Exponential b/Lang/Rust/Generator-Exponential new file mode 120000 index 0000000000..1289995727 --- /dev/null +++ b/Lang/Rust/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/Rust \ No newline at end of file diff --git a/Lang/Rust/History-variables b/Lang/Rust/History-variables new file mode 120000 index 0000000000..99b5f4eb99 --- /dev/null +++ b/Lang/Rust/History-variables @@ -0,0 +1 @@ +../../Task/History-variables/Rust \ No newline at end of file diff --git a/Lang/Rust/Host-introspection b/Lang/Rust/Host-introspection new file mode 120000 index 0000000000..50704426a4 --- /dev/null +++ b/Lang/Rust/Host-introspection @@ -0,0 +1 @@ +../../Task/Host-introspection/Rust \ No newline at end of file diff --git a/Lang/Rust/Hostname b/Lang/Rust/Hostname new file mode 120000 index 0000000000..0d5a428b66 --- /dev/null +++ b/Lang/Rust/Hostname @@ -0,0 +1 @@ +../../Task/Hostname/Rust \ No newline at end of file diff --git a/Lang/Rust/I-before-E-except-after-C b/Lang/Rust/I-before-E-except-after-C new file mode 120000 index 0000000000..e0a4c4ac4d --- /dev/null +++ b/Lang/Rust/I-before-E-except-after-C @@ -0,0 +1 @@ +../../Task/I-before-E-except-after-C/Rust \ No newline at end of file diff --git a/Lang/Rust/Inheritance-Multiple b/Lang/Rust/Inheritance-Multiple new file mode 120000 index 0000000000..bb4c930c69 --- /dev/null +++ b/Lang/Rust/Inheritance-Multiple @@ -0,0 +1 @@ +../../Task/Inheritance-Multiple/Rust \ No newline at end of file diff --git a/Lang/Rust/Inheritance-Single b/Lang/Rust/Inheritance-Single new file mode 120000 index 0000000000..1a1ed9c740 --- /dev/null +++ b/Lang/Rust/Inheritance-Single @@ -0,0 +1 @@ +../../Task/Inheritance-Single/Rust \ No newline at end of file diff --git a/Lang/Rust/Josephus-problem b/Lang/Rust/Josephus-problem new file mode 120000 index 0000000000..118e7c5579 --- /dev/null +++ b/Lang/Rust/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/Rust \ No newline at end of file diff --git a/Lang/Rust/Knapsack-problem-Continuous b/Lang/Rust/Knapsack-problem-Continuous new file mode 120000 index 0000000000..8ae9637f4b --- /dev/null +++ b/Lang/Rust/Knapsack-problem-Continuous @@ -0,0 +1 @@ +../../Task/Knapsack-problem-Continuous/Rust \ No newline at end of file diff --git a/Lang/Rust/LU-decomposition b/Lang/Rust/LU-decomposition new file mode 120000 index 0000000000..1237d8068b --- /dev/null +++ b/Lang/Rust/LU-decomposition @@ -0,0 +1 @@ +../../Task/LU-decomposition/Rust \ No newline at end of file diff --git a/Lang/Rust/Largest-int-from-concatenated-ints b/Lang/Rust/Largest-int-from-concatenated-ints new file mode 120000 index 0000000000..6c814957cd --- /dev/null +++ b/Lang/Rust/Largest-int-from-concatenated-ints @@ -0,0 +1 @@ +../../Task/Largest-int-from-concatenated-ints/Rust \ No newline at end of file diff --git a/Lang/Rust/Longest-string-challenge b/Lang/Rust/Longest-string-challenge new file mode 120000 index 0000000000..e83395aba7 --- /dev/null +++ b/Lang/Rust/Longest-string-challenge @@ -0,0 +1 @@ +../../Task/Longest-string-challenge/Rust \ No newline at end of file diff --git a/Lang/Rust/MD5-Implementation b/Lang/Rust/MD5-Implementation new file mode 120000 index 0000000000..55b77eba6a --- /dev/null +++ b/Lang/Rust/MD5-Implementation @@ -0,0 +1 @@ +../../Task/MD5-Implementation/Rust \ No newline at end of file diff --git a/Lang/Rust/Machine-code b/Lang/Rust/Machine-code new file mode 120000 index 0000000000..22571fa6de --- /dev/null +++ b/Lang/Rust/Machine-code @@ -0,0 +1 @@ +../../Task/Machine-code/Rust \ No newline at end of file diff --git a/Lang/Rust/Mad-Libs b/Lang/Rust/Mad-Libs new file mode 120000 index 0000000000..3046e93e1c --- /dev/null +++ b/Lang/Rust/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/Rust \ No newline at end of file diff --git a/Lang/Rust/Main-step-of-GOST-28147-89 b/Lang/Rust/Main-step-of-GOST-28147-89 new file mode 120000 index 0000000000..61f48deb4a --- /dev/null +++ b/Lang/Rust/Main-step-of-GOST-28147-89 @@ -0,0 +1 @@ +../../Task/Main-step-of-GOST-28147-89/Rust \ No newline at end of file diff --git a/Lang/Rust/Maze-generation b/Lang/Rust/Maze-generation new file mode 120000 index 0000000000..88c48c9312 --- /dev/null +++ b/Lang/Rust/Maze-generation @@ -0,0 +1 @@ +../../Task/Maze-generation/Rust \ No newline at end of file diff --git a/Lang/Rust/Maze-solving b/Lang/Rust/Maze-solving new file mode 120000 index 0000000000..880d8adc13 --- /dev/null +++ b/Lang/Rust/Maze-solving @@ -0,0 +1 @@ +../../Task/Maze-solving/Rust \ No newline at end of file diff --git a/Lang/Rust/Memory-allocation b/Lang/Rust/Memory-allocation new file mode 120000 index 0000000000..84750f4822 --- /dev/null +++ b/Lang/Rust/Memory-allocation @@ -0,0 +1 @@ +../../Task/Memory-allocation/Rust \ No newline at end of file diff --git a/Lang/Rust/Modular-exponentiation b/Lang/Rust/Modular-exponentiation new file mode 120000 index 0000000000..06074824a2 --- /dev/null +++ b/Lang/Rust/Modular-exponentiation @@ -0,0 +1 @@ +../../Task/Modular-exponentiation/Rust \ No newline at end of file diff --git a/Lang/Rust/Morse-code b/Lang/Rust/Morse-code new file mode 120000 index 0000000000..ef6987d5a3 --- /dev/null +++ b/Lang/Rust/Morse-code @@ -0,0 +1 @@ +../../Task/Morse-code/Rust \ No newline at end of file diff --git a/Lang/Rust/Move-to-front-algorithm b/Lang/Rust/Move-to-front-algorithm new file mode 120000 index 0000000000..1c64c79434 --- /dev/null +++ b/Lang/Rust/Move-to-front-algorithm @@ -0,0 +1 @@ +../../Task/Move-to-front-algorithm/Rust \ No newline at end of file diff --git a/Lang/Rust/Multiple-distinct-objects b/Lang/Rust/Multiple-distinct-objects new file mode 120000 index 0000000000..35f8b582e9 --- /dev/null +++ b/Lang/Rust/Multiple-distinct-objects @@ -0,0 +1 @@ +../../Task/Multiple-distinct-objects/Rust \ No newline at end of file diff --git a/Lang/Rust/Number-names b/Lang/Rust/Number-names new file mode 120000 index 0000000000..33735d8755 --- /dev/null +++ b/Lang/Rust/Number-names @@ -0,0 +1 @@ +../../Task/Number-names/Rust \ No newline at end of file diff --git a/Lang/Rust/Object-serialization b/Lang/Rust/Object-serialization new file mode 120000 index 0000000000..5b336b91fd --- /dev/null +++ b/Lang/Rust/Object-serialization @@ -0,0 +1 @@ +../../Task/Object-serialization/Rust \ No newline at end of file diff --git a/Lang/Rust/One-dimensional-cellular-automata b/Lang/Rust/One-dimensional-cellular-automata new file mode 120000 index 0000000000..0b68abe0a2 --- /dev/null +++ b/Lang/Rust/One-dimensional-cellular-automata @@ -0,0 +1 @@ +../../Task/One-dimensional-cellular-automata/Rust \ No newline at end of file diff --git a/Lang/Rust/Order-two-numerical-lists b/Lang/Rust/Order-two-numerical-lists new file mode 120000 index 0000000000..6b66dbee6b --- /dev/null +++ b/Lang/Rust/Order-two-numerical-lists @@ -0,0 +1 @@ +../../Task/Order-two-numerical-lists/Rust \ No newline at end of file diff --git a/Lang/Rust/Percentage-difference-between-images b/Lang/Rust/Percentage-difference-between-images new file mode 120000 index 0000000000..9e333ce63d --- /dev/null +++ b/Lang/Rust/Percentage-difference-between-images @@ -0,0 +1 @@ +../../Task/Percentage-difference-between-images/Rust \ No newline at end of file diff --git a/Lang/Rust/Pi b/Lang/Rust/Pi new file mode 120000 index 0000000000..9306983bb7 --- /dev/null +++ b/Lang/Rust/Pi @@ -0,0 +1 @@ +../../Task/Pi/Rust \ No newline at end of file diff --git a/Lang/Rust/Regular-expressions b/Lang/Rust/Regular-expressions new file mode 120000 index 0000000000..26c873499e --- /dev/null +++ b/Lang/Rust/Regular-expressions @@ -0,0 +1 @@ +../../Task/Regular-expressions/Rust \ No newline at end of file diff --git a/Lang/Rust/Roots-of-unity b/Lang/Rust/Roots-of-unity new file mode 120000 index 0000000000..bd6b17781a --- /dev/null +++ b/Lang/Rust/Roots-of-unity @@ -0,0 +1 @@ +../../Task/Roots-of-unity/Rust \ No newline at end of file diff --git a/Lang/Rust/Sierpinski-carpet b/Lang/Rust/Sierpinski-carpet new file mode 120000 index 0000000000..430007d03a --- /dev/null +++ b/Lang/Rust/Sierpinski-carpet @@ -0,0 +1 @@ +../../Task/Sierpinski-carpet/Rust \ No newline at end of file diff --git a/Lang/Rust/Sort-an-array-of-composite-structures b/Lang/Rust/Sort-an-array-of-composite-structures new file mode 120000 index 0000000000..95b24cd587 --- /dev/null +++ b/Lang/Rust/Sort-an-array-of-composite-structures @@ -0,0 +1 @@ +../../Task/Sort-an-array-of-composite-structures/Rust \ No newline at end of file diff --git a/Lang/Rust/Strip-comments-from-a-string b/Lang/Rust/Strip-comments-from-a-string new file mode 120000 index 0000000000..0bb7e3dad3 --- /dev/null +++ b/Lang/Rust/Strip-comments-from-a-string @@ -0,0 +1 @@ +../../Task/Strip-comments-from-a-string/Rust \ No newline at end of file diff --git a/Lang/Rust/Sudoku b/Lang/Rust/Sudoku new file mode 120000 index 0000000000..f5750e28f6 --- /dev/null +++ b/Lang/Rust/Sudoku @@ -0,0 +1 @@ +../../Task/Sudoku/Rust \ No newline at end of file diff --git a/Lang/Rust/Terminal-control-Clear-the-screen b/Lang/Rust/Terminal-control-Clear-the-screen new file mode 120000 index 0000000000..6666284caa --- /dev/null +++ b/Lang/Rust/Terminal-control-Clear-the-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Clear-the-screen/Rust \ No newline at end of file diff --git a/Lang/Rust/Ternary-logic b/Lang/Rust/Ternary-logic new file mode 120000 index 0000000000..550ee46dab --- /dev/null +++ b/Lang/Rust/Ternary-logic @@ -0,0 +1 @@ +../../Task/Ternary-logic/Rust \ No newline at end of file diff --git a/Lang/Rust/Trabb-Pardo-Knuth-algorithm b/Lang/Rust/Trabb-Pardo-Knuth-algorithm new file mode 120000 index 0000000000..94bd6067cf --- /dev/null +++ b/Lang/Rust/Trabb-Pardo-Knuth-algorithm @@ -0,0 +1 @@ +../../Task/Trabb-Pardo-Knuth-algorithm/Rust \ No newline at end of file diff --git a/Lang/Rust/URL-decoding b/Lang/Rust/URL-decoding new file mode 120000 index 0000000000..155c4ebbf6 --- /dev/null +++ b/Lang/Rust/URL-decoding @@ -0,0 +1 @@ +../../Task/URL-decoding/Rust \ No newline at end of file diff --git a/Lang/Rust/URL-encoding b/Lang/Rust/URL-encoding new file mode 120000 index 0000000000..bbe8681102 --- /dev/null +++ b/Lang/Rust/URL-encoding @@ -0,0 +1 @@ +../../Task/URL-encoding/Rust \ No newline at end of file diff --git a/Lang/Rust/Variable-size-Get b/Lang/Rust/Variable-size-Get new file mode 120000 index 0000000000..143558b919 --- /dev/null +++ b/Lang/Rust/Variable-size-Get @@ -0,0 +1 @@ +../../Task/Variable-size-Get/Rust \ No newline at end of file diff --git a/Lang/Rust/Write-language-name-in-3D-ASCII b/Lang/Rust/Write-language-name-in-3D-ASCII new file mode 120000 index 0000000000..4bcde362b5 --- /dev/null +++ b/Lang/Rust/Write-language-name-in-3D-ASCII @@ -0,0 +1 @@ +../../Task/Write-language-name-in-3D-ASCII/Rust \ No newline at end of file diff --git a/Lang/Rust/XML-Output b/Lang/Rust/XML-Output new file mode 120000 index 0000000000..e7f15c405d --- /dev/null +++ b/Lang/Rust/XML-Output @@ -0,0 +1 @@ +../../Task/XML-Output/Rust \ No newline at end of file diff --git a/Lang/SQL/Arithmetic-geometric-mean b/Lang/SQL/Arithmetic-geometric-mean new file mode 120000 index 0000000000..d06ff1cbdd --- /dev/null +++ b/Lang/SQL/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/SQL \ No newline at end of file diff --git a/Lang/SQL/Averages-Mode b/Lang/SQL/Averages-Mode new file mode 120000 index 0000000000..e3a11c4c1d --- /dev/null +++ b/Lang/SQL/Averages-Mode @@ -0,0 +1 @@ +../../Task/Averages-Mode/SQL \ No newline at end of file diff --git a/Lang/SQL/Averages-Pythagorean-means b/Lang/SQL/Averages-Pythagorean-means new file mode 120000 index 0000000000..221782fa1c --- /dev/null +++ b/Lang/SQL/Averages-Pythagorean-means @@ -0,0 +1 @@ +../../Task/Averages-Pythagorean-means/SQL \ No newline at end of file diff --git a/Lang/SQL/Day-of-the-week b/Lang/SQL/Day-of-the-week new file mode 120000 index 0000000000..1b766130aa --- /dev/null +++ b/Lang/SQL/Day-of-the-week @@ -0,0 +1 @@ +../../Task/Day-of-the-week/SQL \ No newline at end of file diff --git a/Lang/SQL/Hamming-numbers b/Lang/SQL/Hamming-numbers new file mode 120000 index 0000000000..b0594bd863 --- /dev/null +++ b/Lang/SQL/Hamming-numbers @@ -0,0 +1 @@ +../../Task/Hamming-numbers/SQL \ No newline at end of file diff --git a/Lang/SQL/Sort-an-array-of-composite-structures b/Lang/SQL/Sort-an-array-of-composite-structures new file mode 120000 index 0000000000..5c9253d3a4 --- /dev/null +++ b/Lang/SQL/Sort-an-array-of-composite-structures @@ -0,0 +1 @@ +../../Task/Sort-an-array-of-composite-structures/SQL \ No newline at end of file diff --git a/Lang/SQL/Sudoku b/Lang/SQL/Sudoku new file mode 120000 index 0000000000..b9ea348d45 --- /dev/null +++ b/Lang/SQL/Sudoku @@ -0,0 +1 @@ +../../Task/Sudoku/SQL \ No newline at end of file diff --git a/Lang/Scala/00DESCRIPTION b/Lang/Scala/00DESCRIPTION index 3535ecf235..24a3ff4951 100644 --- a/Lang/Scala/00DESCRIPTION +++ b/Lang/Scala/00DESCRIPTION @@ -16,5 +16,11 @@ The language is most focused on the results of the program, therefor the [http:/ Lots of RC tasks addresses technical "features" of goto's, break, continue, side effects, pointers, type-casting, weak-typing and so on and are deliberately not Scala's cup of tea. Compiled strongly-typed languages, where more defects can be caught at compile time, are less prone to runtime failures than interpreted or weakly-typed languages. +==Links== +* [[wp:Scala_(programming_language)|Scala in Wikipedia]] +* [https://docs.scala-lang.org/tour/tour-of-scala.html Tour of Scala and Tutorial] +* [https://www.scala-lang.org/files/archive/spec/2.13/ Scala language specification] +* [https://www.scala-lang.org/api/current/ Scala standard library documentation] + ==Todo== [[Reports:Tasks_not_implemented_in_Scala]] \ No newline at end of file diff --git a/Lang/Scala/Flipping-bits-game b/Lang/Scala/Flipping-bits-game new file mode 120000 index 0000000000..a2947a4eae --- /dev/null +++ b/Lang/Scala/Flipping-bits-game @@ -0,0 +1 @@ +../../Task/Flipping-bits-game/Scala \ No newline at end of file diff --git a/Lang/Scala/Guess-the-number-With-feedback--player- b/Lang/Scala/Guess-the-number-With-feedback--player- new file mode 120000 index 0000000000..55db4ec703 --- /dev/null +++ b/Lang/Scala/Guess-the-number-With-feedback--player- @@ -0,0 +1 @@ +../../Task/Guess-the-number-With-feedback--player-/Scala \ No newline at end of file diff --git a/Lang/Scala/Honeycombs b/Lang/Scala/Honeycombs new file mode 120000 index 0000000000..50c70ccf2d --- /dev/null +++ b/Lang/Scala/Honeycombs @@ -0,0 +1 @@ +../../Task/Honeycombs/Scala \ No newline at end of file diff --git a/Lang/Scala/Ludic-numbers b/Lang/Scala/Ludic-numbers new file mode 120000 index 0000000000..e75f69dad3 --- /dev/null +++ b/Lang/Scala/Ludic-numbers @@ -0,0 +1 @@ +../../Task/Ludic-numbers/Scala \ No newline at end of file diff --git a/Lang/Scala/Morse-code b/Lang/Scala/Morse-code new file mode 120000 index 0000000000..a61fca737b --- /dev/null +++ b/Lang/Scala/Morse-code @@ -0,0 +1 @@ +../../Task/Morse-code/Scala \ No newline at end of file diff --git a/Lang/Scala/Numerical-integration-Gauss-Legendre-Quadrature b/Lang/Scala/Numerical-integration-Gauss-Legendre-Quadrature new file mode 120000 index 0000000000..68f321ee44 --- /dev/null +++ b/Lang/Scala/Numerical-integration-Gauss-Legendre-Quadrature @@ -0,0 +1 @@ +../../Task/Numerical-integration-Gauss-Legendre-Quadrature/Scala \ No newline at end of file diff --git a/Lang/Scala/Pig-the-dice-game b/Lang/Scala/Pig-the-dice-game new file mode 120000 index 0000000000..9c7836f436 --- /dev/null +++ b/Lang/Scala/Pig-the-dice-game @@ -0,0 +1 @@ +../../Task/Pig-the-dice-game/Scala \ No newline at end of file diff --git a/Lang/Scala/Polynomial-regression b/Lang/Scala/Polynomial-regression new file mode 120000 index 0000000000..29124b2918 --- /dev/null +++ b/Lang/Scala/Polynomial-regression @@ -0,0 +1 @@ +../../Task/Polynomial-regression/Scala \ No newline at end of file diff --git a/Lang/Scala/Self-referential-sequence b/Lang/Scala/Self-referential-sequence new file mode 120000 index 0000000000..042c5e2c95 --- /dev/null +++ b/Lang/Scala/Self-referential-sequence @@ -0,0 +1 @@ +../../Task/Self-referential-sequence/Scala \ No newline at end of file diff --git a/Lang/Scala/Solve-the-no-connection-puzzle b/Lang/Scala/Solve-the-no-connection-puzzle new file mode 120000 index 0000000000..383ff2233a --- /dev/null +++ b/Lang/Scala/Solve-the-no-connection-puzzle @@ -0,0 +1 @@ +../../Task/Solve-the-no-connection-puzzle/Scala \ No newline at end of file diff --git a/Lang/Scala/Truncatable-primes b/Lang/Scala/Truncatable-primes new file mode 120000 index 0000000000..bea560820d --- /dev/null +++ b/Lang/Scala/Truncatable-primes @@ -0,0 +1 @@ +../../Task/Truncatable-primes/Scala \ No newline at end of file diff --git a/Lang/Scala/Universal-Turing-machine b/Lang/Scala/Universal-Turing-machine new file mode 120000 index 0000000000..55ea1954d3 --- /dev/null +++ b/Lang/Scala/Universal-Turing-machine @@ -0,0 +1 @@ +../../Task/Universal-Turing-machine/Scala \ No newline at end of file diff --git a/Lang/Scala/Verify-distribution-uniformity-Chi-squared-test b/Lang/Scala/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..0f249a1ce7 --- /dev/null +++ b/Lang/Scala/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/Scala \ No newline at end of file diff --git a/Lang/Scala/Voronoi-diagram b/Lang/Scala/Voronoi-diagram new file mode 120000 index 0000000000..44fa20bdf4 --- /dev/null +++ b/Lang/Scala/Voronoi-diagram @@ -0,0 +1 @@ +../../Task/Voronoi-diagram/Scala \ No newline at end of file diff --git a/Lang/Scheme/AKS-test-for-primes b/Lang/Scheme/AKS-test-for-primes new file mode 120000 index 0000000000..c8287077b1 --- /dev/null +++ b/Lang/Scheme/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/Scheme \ No newline at end of file diff --git a/Lang/Scheme/Deepcopy b/Lang/Scheme/Deepcopy new file mode 120000 index 0000000000..1b271e369c --- /dev/null +++ b/Lang/Scheme/Deepcopy @@ -0,0 +1 @@ +../../Task/Deepcopy/Scheme \ No newline at end of file diff --git a/Lang/Scheme/Pi b/Lang/Scheme/Pi new file mode 120000 index 0000000000..26ac2726b1 --- /dev/null +++ b/Lang/Scheme/Pi @@ -0,0 +1 @@ +../../Task/Pi/Scheme \ No newline at end of file diff --git a/Lang/Scheme/Zeckendorf-number-representation b/Lang/Scheme/Zeckendorf-number-representation new file mode 120000 index 0000000000..14dff1ec40 --- /dev/null +++ b/Lang/Scheme/Zeckendorf-number-representation @@ -0,0 +1 @@ +../../Task/Zeckendorf-number-representation/Scheme \ No newline at end of file diff --git a/Lang/Seed7/00DESCRIPTION b/Lang/Seed7/00DESCRIPTION index 46674935a0..53bb00a65a 100644 --- a/Lang/Seed7/00DESCRIPTION +++ b/Lang/Seed7/00DESCRIPTION @@ -11,4 +11,5 @@ In Seed7 new statements and operators can be declared easily. Functions with typ ==See also== * [[wp:Seed7|Seed7 on Wikipedia]] -* [http://seed7.sourceforge.net/ Seed7 Homepage] \ No newline at end of file +* [http://seed7.sourceforge.net/ Seed7 Homepage] +* [https://sourceforge.net/projects/seed7/files Download Seed7] \ No newline at end of file diff --git a/Lang/Seed7/Abundant,-deficient-and-perfect-number-classifications b/Lang/Seed7/Abundant,-deficient-and-perfect-number-classifications new file mode 120000 index 0000000000..8a5c5e47ca --- /dev/null +++ b/Lang/Seed7/Abundant,-deficient-and-perfect-number-classifications @@ -0,0 +1 @@ +../../Task/Abundant,-deficient-and-perfect-number-classifications/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Almost-prime b/Lang/Seed7/Almost-prime new file mode 120000 index 0000000000..461bcee2db --- /dev/null +++ b/Lang/Seed7/Almost-prime @@ -0,0 +1 @@ +../../Task/Almost-prime/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Bernoulli-numbers b/Lang/Seed7/Bernoulli-numbers new file mode 120000 index 0000000000..048ac6277b --- /dev/null +++ b/Lang/Seed7/Bernoulli-numbers @@ -0,0 +1 @@ +../../Task/Bernoulli-numbers/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Bitcoin-address-validation b/Lang/Seed7/Bitcoin-address-validation new file mode 120000 index 0000000000..793c01de49 --- /dev/null +++ b/Lang/Seed7/Bitcoin-address-validation @@ -0,0 +1 @@ +../../Task/Bitcoin-address-validation/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Bitcoin-public-point-to-address b/Lang/Seed7/Bitcoin-public-point-to-address new file mode 120000 index 0000000000..afe92af131 --- /dev/null +++ b/Lang/Seed7/Bitcoin-public-point-to-address @@ -0,0 +1 @@ +../../Task/Bitcoin-public-point-to-address/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Bitwise-IO b/Lang/Seed7/Bitwise-IO new file mode 120000 index 0000000000..03f7492434 --- /dev/null +++ b/Lang/Seed7/Bitwise-IO @@ -0,0 +1 @@ +../../Task/Bitwise-IO/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Pernicious-numbers b/Lang/Seed7/Pernicious-numbers new file mode 120000 index 0000000000..5909350dc2 --- /dev/null +++ b/Lang/Seed7/Pernicious-numbers @@ -0,0 +1 @@ +../../Task/Pernicious-numbers/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Phrase-reversals b/Lang/Seed7/Phrase-reversals new file mode 120000 index 0000000000..113ab0956d --- /dev/null +++ b/Lang/Seed7/Phrase-reversals @@ -0,0 +1 @@ +../../Task/Phrase-reversals/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/RIPEMD-160 b/Lang/Seed7/RIPEMD-160 new file mode 120000 index 0000000000..41012edacb --- /dev/null +++ b/Lang/Seed7/RIPEMD-160 @@ -0,0 +1 @@ +../../Task/RIPEMD-160/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Start-from-a-main-routine b/Lang/Seed7/Start-from-a-main-routine new file mode 120000 index 0000000000..cc1915c0af --- /dev/null +++ b/Lang/Seed7/Start-from-a-main-routine @@ -0,0 +1 @@ +../../Task/Start-from-a-main-routine/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Terminal-control-Unicode-output b/Lang/Seed7/Terminal-control-Unicode-output new file mode 120000 index 0000000000..12614746e6 --- /dev/null +++ b/Lang/Seed7/Terminal-control-Unicode-output @@ -0,0 +1 @@ +../../Task/Terminal-control-Unicode-output/Seed7 \ No newline at end of file diff --git a/Lang/Seed7/Unix-ls b/Lang/Seed7/Unix-ls new file mode 120000 index 0000000000..664da653bf --- /dev/null +++ b/Lang/Seed7/Unix-ls @@ -0,0 +1 @@ +../../Task/Unix-ls/Seed7 \ No newline at end of file diff --git a/Lang/Sidef/00DESCRIPTION b/Lang/Sidef/00DESCRIPTION index 1c5a0597f3..26ba2cc083 100644 --- a/Lang/Sidef/00DESCRIPTION +++ b/Lang/Sidef/00DESCRIPTION @@ -22,7 +22,4 @@ The language is mostly used as a research programming language. For more details, see: * Gitbook: [http://trizen.gitbooks.io/sidef-lang/content/ http://trizen.gitbooks.io/sidef-lang/content/] * Tutorial: [https://github.com/trizen/sidef/wiki https://github.com/trizen/sidef/wiki] -* Development page: [https://github.com/trizen/sidef https://github.com/trizen/sidef] - -==Todo== -[[Reports:Tasks_not_implemented_in_Sidef]] \ No newline at end of file +* Development page: [https://github.com/trizen/sidef https://github.com/trizen/sidef] \ No newline at end of file diff --git a/Lang/Sidef/Flow-control-structures b/Lang/Sidef/Flow-control-structures new file mode 120000 index 0000000000..da33c401d2 --- /dev/null +++ b/Lang/Sidef/Flow-control-structures @@ -0,0 +1 @@ +../../Task/Flow-control-structures/Sidef \ No newline at end of file diff --git a/Lang/Sidef/Generate-Chess960-starting-position b/Lang/Sidef/Generate-Chess960-starting-position new file mode 120000 index 0000000000..3f8a72e4d6 --- /dev/null +++ b/Lang/Sidef/Generate-Chess960-starting-position @@ -0,0 +1 @@ +../../Task/Generate-Chess960-starting-position/Sidef \ No newline at end of file diff --git a/Lang/Sidef/Iterated-digits-squaring b/Lang/Sidef/Iterated-digits-squaring new file mode 120000 index 0000000000..ab55c767e5 --- /dev/null +++ b/Lang/Sidef/Iterated-digits-squaring @@ -0,0 +1 @@ +../../Task/Iterated-digits-squaring/Sidef \ No newline at end of file diff --git a/Lang/Sidef/Metronome b/Lang/Sidef/Metronome new file mode 120000 index 0000000000..0cb6a93fb6 --- /dev/null +++ b/Lang/Sidef/Metronome @@ -0,0 +1 @@ +../../Task/Metronome/Sidef \ No newline at end of file diff --git a/Lang/Sidef/Percolation-Site-percolation b/Lang/Sidef/Percolation-Site-percolation new file mode 120000 index 0000000000..c6fd37aa76 --- /dev/null +++ b/Lang/Sidef/Percolation-Site-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Site-percolation/Sidef \ No newline at end of file diff --git a/Lang/Sidef/Verify-distribution-uniformity-Chi-squared-test b/Lang/Sidef/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..5e13a65a19 --- /dev/null +++ b/Lang/Sidef/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/Sidef \ No newline at end of file diff --git a/Lang/Simula/Anagrams-Deranged-anagrams b/Lang/Simula/Anagrams-Deranged-anagrams new file mode 120000 index 0000000000..40a521e366 --- /dev/null +++ b/Lang/Simula/Anagrams-Deranged-anagrams @@ -0,0 +1 @@ +../../Task/Anagrams-Deranged-anagrams/Simula \ No newline at end of file diff --git a/Lang/Simula/Average-loop-length b/Lang/Simula/Average-loop-length new file mode 120000 index 0000000000..e23242b2f1 --- /dev/null +++ b/Lang/Simula/Average-loop-length @@ -0,0 +1 @@ +../../Task/Average-loop-length/Simula \ No newline at end of file diff --git a/Lang/Simula/Balanced-brackets b/Lang/Simula/Balanced-brackets new file mode 120000 index 0000000000..8ac9a40cc6 --- /dev/null +++ b/Lang/Simula/Balanced-brackets @@ -0,0 +1 @@ +../../Task/Balanced-brackets/Simula \ No newline at end of file diff --git a/Lang/Simula/Binary-digits b/Lang/Simula/Binary-digits new file mode 120000 index 0000000000..275d926e59 --- /dev/null +++ b/Lang/Simula/Binary-digits @@ -0,0 +1 @@ +../../Task/Binary-digits/Simula \ No newline at end of file diff --git a/Lang/Simula/Binary-search b/Lang/Simula/Binary-search new file mode 120000 index 0000000000..aaf372eaea --- /dev/null +++ b/Lang/Simula/Binary-search @@ -0,0 +1 @@ +../../Task/Binary-search/Simula \ No newline at end of file diff --git a/Lang/Simula/Bitwise-operations b/Lang/Simula/Bitwise-operations new file mode 120000 index 0000000000..1ba81927a8 --- /dev/null +++ b/Lang/Simula/Bitwise-operations @@ -0,0 +1 @@ +../../Task/Bitwise-operations/Simula \ No newline at end of file diff --git a/Lang/Simula/Calendar b/Lang/Simula/Calendar new file mode 120000 index 0000000000..9e1127cc1f --- /dev/null +++ b/Lang/Simula/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Simula \ No newline at end of file diff --git a/Lang/Simula/Dining-philosophers b/Lang/Simula/Dining-philosophers new file mode 120000 index 0000000000..907e604d44 --- /dev/null +++ b/Lang/Simula/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/Simula \ No newline at end of file diff --git a/Lang/Simula/Perfect-numbers b/Lang/Simula/Perfect-numbers new file mode 120000 index 0000000000..ee99eca34f --- /dev/null +++ b/Lang/Simula/Perfect-numbers @@ -0,0 +1 @@ +../../Task/Perfect-numbers/Simula \ No newline at end of file diff --git a/Lang/Simula/Pi b/Lang/Simula/Pi new file mode 120000 index 0000000000..38a93d1fb3 --- /dev/null +++ b/Lang/Simula/Pi @@ -0,0 +1 @@ +../../Task/Pi/Simula \ No newline at end of file diff --git a/Lang/Simula/Prime-decomposition b/Lang/Simula/Prime-decomposition new file mode 120000 index 0000000000..973d1d8aa3 --- /dev/null +++ b/Lang/Simula/Prime-decomposition @@ -0,0 +1 @@ +../../Task/Prime-decomposition/Simula \ No newline at end of file diff --git a/Lang/Simula/Reverse-a-string b/Lang/Simula/Reverse-a-string new file mode 120000 index 0000000000..1098a7f0dd --- /dev/null +++ b/Lang/Simula/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Simula \ No newline at end of file diff --git a/Lang/Simula/Zeckendorf-number-representation b/Lang/Simula/Zeckendorf-number-representation new file mode 120000 index 0000000000..c8dc6f2b01 --- /dev/null +++ b/Lang/Simula/Zeckendorf-number-representation @@ -0,0 +1 @@ +../../Task/Zeckendorf-number-representation/Simula \ No newline at end of file diff --git a/Lang/Smalltalk/Calendar b/Lang/Smalltalk/Calendar new file mode 120000 index 0000000000..dc466205eb --- /dev/null +++ b/Lang/Smalltalk/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Smalltalk \ No newline at end of file diff --git a/Lang/Smalltalk/Delegates b/Lang/Smalltalk/Delegates new file mode 120000 index 0000000000..ea2b494e2e --- /dev/null +++ b/Lang/Smalltalk/Delegates @@ -0,0 +1 @@ +../../Task/Delegates/Smalltalk \ No newline at end of file diff --git a/Lang/Smalltalk/Identity-matrix b/Lang/Smalltalk/Identity-matrix new file mode 120000 index 0000000000..5662dc28ec --- /dev/null +++ b/Lang/Smalltalk/Identity-matrix @@ -0,0 +1 @@ +../../Task/Identity-matrix/Smalltalk \ No newline at end of file diff --git a/Lang/Smalltalk/Loops-Continue b/Lang/Smalltalk/Loops-Continue new file mode 120000 index 0000000000..221f5c51c0 --- /dev/null +++ b/Lang/Smalltalk/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/Smalltalk \ No newline at end of file diff --git a/Lang/Smalltalk/Run-length-encoding b/Lang/Smalltalk/Run-length-encoding new file mode 120000 index 0000000000..acad6d23a0 --- /dev/null +++ b/Lang/Smalltalk/Run-length-encoding @@ -0,0 +1 @@ +../../Task/Run-length-encoding/Smalltalk \ No newline at end of file diff --git a/Lang/SmileBASIC/00DESCRIPTION b/Lang/SmileBASIC/00DESCRIPTION index 4d3d27c049..a12e205559 100644 --- a/Lang/SmileBASIC/00DESCRIPTION +++ b/Lang/SmileBASIC/00DESCRIPTION @@ -1 +1 @@ -{{stub}}{{language}} \ No newline at end of file +{{stub}}{{language|SmileBASIC}} \ No newline at end of file diff --git a/Lang/SmileBASIC/99-Bottles-of-Beer b/Lang/SmileBASIC/99-Bottles-of-Beer new file mode 120000 index 0000000000..7b9581683a --- /dev/null +++ b/Lang/SmileBASIC/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Ackermann-function b/Lang/SmileBASIC/Ackermann-function new file mode 120000 index 0000000000..a8dcf85cce --- /dev/null +++ b/Lang/SmileBASIC/Ackermann-function @@ -0,0 +1 @@ +../../Task/Ackermann-function/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Character-codes b/Lang/SmileBASIC/Character-codes new file mode 120000 index 0000000000..0cc632f937 --- /dev/null +++ b/Lang/SmileBASIC/Character-codes @@ -0,0 +1 @@ +../../Task/Character-codes/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Color-of-a-screen-pixel b/Lang/SmileBASIC/Color-of-a-screen-pixel new file mode 120000 index 0000000000..f7e8d01b22 --- /dev/null +++ b/Lang/SmileBASIC/Color-of-a-screen-pixel @@ -0,0 +1 @@ +../../Task/Color-of-a-screen-pixel/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Colour-bars-Display b/Lang/SmileBASIC/Colour-bars-Display new file mode 120000 index 0000000000..404389fc4d --- /dev/null +++ b/Lang/SmileBASIC/Colour-bars-Display @@ -0,0 +1 @@ +../../Task/Colour-bars-Display/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Colour-pinstripe-Display b/Lang/SmileBASIC/Colour-pinstripe-Display new file mode 120000 index 0000000000..1fc0987c2d --- /dev/null +++ b/Lang/SmileBASIC/Colour-pinstripe-Display @@ -0,0 +1 @@ +../../Task/Colour-pinstripe-Display/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Digital-root b/Lang/SmileBASIC/Digital-root new file mode 120000 index 0000000000..e26e28601f --- /dev/null +++ b/Lang/SmileBASIC/Digital-root @@ -0,0 +1 @@ +../../Task/Digital-root/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Hello-world-Graphical b/Lang/SmileBASIC/Hello-world-Graphical new file mode 120000 index 0000000000..33650ad958 --- /dev/null +++ b/Lang/SmileBASIC/Hello-world-Graphical @@ -0,0 +1 @@ +../../Task/Hello-world-Graphical/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Quine b/Lang/SmileBASIC/Quine new file mode 120000 index 0000000000..8eb923e8d5 --- /dev/null +++ b/Lang/SmileBASIC/Quine @@ -0,0 +1 @@ +../../Task/Quine/SmileBASIC \ No newline at end of file diff --git a/Lang/SmileBASIC/Terminal-control-Clear-the-screen b/Lang/SmileBASIC/Terminal-control-Clear-the-screen new file mode 120000 index 0000000000..04f2721176 --- /dev/null +++ b/Lang/SmileBASIC/Terminal-control-Clear-the-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Clear-the-screen/SmileBASIC \ No newline at end of file diff --git a/Lang/Spin/00DESCRIPTION b/Lang/Spin/00DESCRIPTION index 020019de51..26281a72d0 100644 --- a/Lang/Spin/00DESCRIPTION +++ b/Lang/Spin/00DESCRIPTION @@ -13,13 +13,17 @@ Atypical: ==Implementations== * [https://www.parallax.com/downloads/propeller-tool-software-windows The Propeller Tool] - Parallax's original Spin IDE. * [http://www.fnarfbargle.com/ Brad's Spin Tool] +** BST - IDE (monolithic binary including compiler) +** BSTC - stand alone commandline compiler * [http://forums.parallax.com/discussion/106401/homespun-spin-compiler-0-31-now-open-source HomeSpun] * [http://www.sphinxcompiler.com/ Sphinxcompiler] * Spinc (included in [http://forums.parallax.com/discussion/123795/spinix/p1 Spinix]) * [https://github.com/parallaxinc/OpenSpin OpenSpin] -* [http://forums.parallax.com/discussion/164101/fastspin-an-lmm-compiler-for-spin FastSpin] +* [http://forums.parallax.com/discussion/164101/fastspin-an-lmm-compiler-for-spin FastSpin/FlexSpin] ==Links== * https://www.parallax.com/sites/default/files/downloads/P8X32A-Web-PropellerManual-v1.2.pdf -* https://lamestation.atlassian.net/wiki/display/SPIN/Propeller+Spin+Manual+Home -* https://github.com/rosco-pc/propeller-wiki \ No newline at end of file +* https://lamestation.atlassian.net/wiki/display/SPIN +* https://github.com/rosco-pc/propeller-wiki + +---- \ No newline at end of file diff --git a/Lang/Spin/100-doors b/Lang/Spin/100-doors new file mode 120000 index 0000000000..645fcbbfe1 --- /dev/null +++ b/Lang/Spin/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Spin \ No newline at end of file diff --git a/Lang/Spin/Factorial b/Lang/Spin/Factorial new file mode 120000 index 0000000000..7c3630a301 --- /dev/null +++ b/Lang/Spin/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Spin \ No newline at end of file diff --git a/Lang/Spin/Fibonacci-sequence b/Lang/Spin/Fibonacci-sequence new file mode 120000 index 0000000000..c254a67402 --- /dev/null +++ b/Lang/Spin/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-Break b/Lang/Spin/Loops-Break new file mode 120000 index 0000000000..97fa810e9b --- /dev/null +++ b/Lang/Spin/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-Continue b/Lang/Spin/Loops-Continue new file mode 120000 index 0000000000..8bbcc726f0 --- /dev/null +++ b/Lang/Spin/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-Do-while b/Lang/Spin/Loops-Do-while new file mode 120000 index 0000000000..4d8435c3ba --- /dev/null +++ b/Lang/Spin/Loops-Do-while @@ -0,0 +1 @@ +../../Task/Loops-Do-while/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-Downward-for b/Lang/Spin/Loops-Downward-for new file mode 120000 index 0000000000..d79f1967a6 --- /dev/null +++ b/Lang/Spin/Loops-Downward-for @@ -0,0 +1 @@ +../../Task/Loops-Downward-for/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-For b/Lang/Spin/Loops-For new file mode 120000 index 0000000000..3fb98b2d30 --- /dev/null +++ b/Lang/Spin/Loops-For @@ -0,0 +1 @@ +../../Task/Loops-For/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-For-with-a-specified-step b/Lang/Spin/Loops-For-with-a-specified-step new file mode 120000 index 0000000000..150eb7fc14 --- /dev/null +++ b/Lang/Spin/Loops-For-with-a-specified-step @@ -0,0 +1 @@ +../../Task/Loops-For-with-a-specified-step/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-Infinite b/Lang/Spin/Loops-Infinite new file mode 120000 index 0000000000..61494ee0e6 --- /dev/null +++ b/Lang/Spin/Loops-Infinite @@ -0,0 +1 @@ +../../Task/Loops-Infinite/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-N-plus-one-half b/Lang/Spin/Loops-N-plus-one-half new file mode 120000 index 0000000000..5b2ea07ef2 --- /dev/null +++ b/Lang/Spin/Loops-N-plus-one-half @@ -0,0 +1 @@ +../../Task/Loops-N-plus-one-half/Spin \ No newline at end of file diff --git a/Lang/Spin/Loops-While b/Lang/Spin/Loops-While new file mode 120000 index 0000000000..b6c089e353 --- /dev/null +++ b/Lang/Spin/Loops-While @@ -0,0 +1 @@ +../../Task/Loops-While/Spin \ No newline at end of file diff --git a/Lang/Spin/Mandelbrot-set b/Lang/Spin/Mandelbrot-set new file mode 120000 index 0000000000..b44a5eba5e --- /dev/null +++ b/Lang/Spin/Mandelbrot-set @@ -0,0 +1 @@ +../../Task/Mandelbrot-set/Spin \ No newline at end of file diff --git a/Lang/Standard-ML/Element-wise-operations b/Lang/Standard-ML/Element-wise-operations new file mode 120000 index 0000000000..f9b43431c9 --- /dev/null +++ b/Lang/Standard-ML/Element-wise-operations @@ -0,0 +1 @@ +../../Task/Element-wise-operations/Standard-ML \ No newline at end of file diff --git a/Lang/Standard-ML/Matrix-multiplication b/Lang/Standard-ML/Matrix-multiplication new file mode 120000 index 0000000000..f0fed2ae28 --- /dev/null +++ b/Lang/Standard-ML/Matrix-multiplication @@ -0,0 +1 @@ +../../Task/Matrix-multiplication/Standard-ML \ No newline at end of file diff --git a/Lang/Standard-ML/QR-decomposition b/Lang/Standard-ML/QR-decomposition new file mode 120000 index 0000000000..8637344936 --- /dev/null +++ b/Lang/Standard-ML/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/Standard-ML \ No newline at end of file diff --git a/Lang/Stata/00DESCRIPTION b/Lang/Stata/00DESCRIPTION index 19ee115061..82a88ba734 100644 --- a/Lang/Stata/00DESCRIPTION +++ b/Lang/Stata/00DESCRIPTION @@ -1,3 +1,5 @@ {{stub}}{{language|Stata|site=http://www.stata.com/}} -[[:wp:Stata|Stata]] is a statistical software package created in 1985 and developed by StataCorp, located in College Station, Texas. Stata includes a command-based macro language (informally called "Ado") and a matrix language called Mata. A large part of Stata is itself written in Ado and Mata, with source code available. \ No newline at end of file +[[:wp:Stata|Stata]] is a statistical software package created in 1985 and developed by StataCorp, located in College Station, Texas. Stata includes a command-based macro language (informally called "Ado") and a matrix language called Mata. A large part of Stata is itself written in Ado and Mata, with source code available. + +Stata has also APIs to call C and Java plugins, and since Stata version 16, can embed Python code within Ado programs. \ No newline at end of file diff --git a/Lang/Stata/First-class-functions b/Lang/Stata/First-class-functions new file mode 120000 index 0000000000..ec3057b671 --- /dev/null +++ b/Lang/Stata/First-class-functions @@ -0,0 +1 @@ +../../Task/First-class-functions/Stata \ No newline at end of file diff --git a/Lang/Stata/Logical-operations b/Lang/Stata/Logical-operations new file mode 120000 index 0000000000..a9cac1326f --- /dev/null +++ b/Lang/Stata/Logical-operations @@ -0,0 +1 @@ +../../Task/Logical-operations/Stata \ No newline at end of file diff --git a/Lang/Stata/Monty-Hall-problem b/Lang/Stata/Monty-Hall-problem new file mode 120000 index 0000000000..3b0931e07d --- /dev/null +++ b/Lang/Stata/Monty-Hall-problem @@ -0,0 +1 @@ +../../Task/Monty-Hall-problem/Stata \ No newline at end of file diff --git a/Lang/Stata/Sorting-algorithms-Bubble-sort b/Lang/Stata/Sorting-algorithms-Bubble-sort new file mode 120000 index 0000000000..d9f63ba458 --- /dev/null +++ b/Lang/Stata/Sorting-algorithms-Bubble-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bubble-sort/Stata \ No newline at end of file diff --git a/Lang/Stata/Sorting-algorithms-Heapsort b/Lang/Stata/Sorting-algorithms-Heapsort new file mode 120000 index 0000000000..31c34c840d --- /dev/null +++ b/Lang/Stata/Sorting-algorithms-Heapsort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Heapsort/Stata \ No newline at end of file diff --git a/Lang/SuperCollider/Call-an-object-method b/Lang/SuperCollider/Call-an-object-method new file mode 120000 index 0000000000..2fde12b665 --- /dev/null +++ b/Lang/SuperCollider/Call-an-object-method @@ -0,0 +1 @@ +../../Task/Call-an-object-method/SuperCollider \ No newline at end of file diff --git a/Lang/Swift/00DESCRIPTION b/Lang/Swift/00DESCRIPTION index 6870507618..2b1efb1a01 100644 --- a/Lang/Swift/00DESCRIPTION +++ b/Lang/Swift/00DESCRIPTION @@ -8,4 +8,4 @@ |compat=nominative |site=http://developer.apple.com/swift/ |LCT=yes}}{{language programming paradigm|Object-oriented}} -[[wp:Swift (Apple programming language)|Swift]] is an [[object-oriented]] programming language developed by Apple Inc. for Mac OS X and iOS development. It runs on the Objective-C runtime and is mainly used with the Cocoa API. It was announced at WWDC 2014. \ No newline at end of file +[[wp:Swift (Apple programming language)|Swift]] is a general purpose, multi-paradigm, systems programming language developed by Apple Inc. originally for Apple platforms. Linux support was added when open source Swift was released. It runs on the Objective-C runtime on Darwin and is mainly used with the Cocoa API. It was announced at WWDC 2014. \ No newline at end of file diff --git a/Lang/Swift/Atomic-updates b/Lang/Swift/Atomic-updates new file mode 120000 index 0000000000..2f7a9c7bb9 --- /dev/null +++ b/Lang/Swift/Atomic-updates @@ -0,0 +1 @@ +../../Task/Atomic-updates/Swift \ No newline at end of file diff --git a/Lang/Swift/Break-OO-privacy b/Lang/Swift/Break-OO-privacy new file mode 120000 index 0000000000..8b2cb5e69b --- /dev/null +++ b/Lang/Swift/Break-OO-privacy @@ -0,0 +1 @@ +../../Task/Break-OO-privacy/Swift \ No newline at end of file diff --git a/Lang/Swift/Bulls-and-cows b/Lang/Swift/Bulls-and-cows new file mode 120000 index 0000000000..c22ee1dd43 --- /dev/null +++ b/Lang/Swift/Bulls-and-cows @@ -0,0 +1 @@ +../../Task/Bulls-and-cows/Swift \ No newline at end of file diff --git a/Lang/Swift/Cholesky-decomposition b/Lang/Swift/Cholesky-decomposition new file mode 120000 index 0000000000..1524f0cbf7 --- /dev/null +++ b/Lang/Swift/Cholesky-decomposition @@ -0,0 +1 @@ +../../Task/Cholesky-decomposition/Swift \ No newline at end of file diff --git a/Lang/Swift/Circles-of-given-radius-through-two-points b/Lang/Swift/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..74cf2a4ff5 --- /dev/null +++ b/Lang/Swift/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/Swift \ No newline at end of file diff --git a/Lang/Swift/Closest-pair-problem b/Lang/Swift/Closest-pair-problem new file mode 120000 index 0000000000..5338300bd8 --- /dev/null +++ b/Lang/Swift/Closest-pair-problem @@ -0,0 +1 @@ +../../Task/Closest-pair-problem/Swift \ No newline at end of file diff --git a/Lang/Swift/Combinations-and-permutations b/Lang/Swift/Combinations-and-permutations new file mode 120000 index 0000000000..98bb85762c --- /dev/null +++ b/Lang/Swift/Combinations-and-permutations @@ -0,0 +1 @@ +../../Task/Combinations-and-permutations/Swift \ No newline at end of file diff --git a/Lang/Swift/Count-the-coins b/Lang/Swift/Count-the-coins new file mode 120000 index 0000000000..7fda30f8b6 --- /dev/null +++ b/Lang/Swift/Count-the-coins @@ -0,0 +1 @@ +../../Task/Count-the-coins/Swift \ No newline at end of file diff --git a/Lang/Swift/Deal-cards-for-FreeCell b/Lang/Swift/Deal-cards-for-FreeCell new file mode 120000 index 0000000000..ae2ae8013f --- /dev/null +++ b/Lang/Swift/Deal-cards-for-FreeCell @@ -0,0 +1 @@ +../../Task/Deal-cards-for-FreeCell/Swift \ No newline at end of file diff --git a/Lang/Swift/Enforced-immutability b/Lang/Swift/Enforced-immutability new file mode 120000 index 0000000000..551e09d235 --- /dev/null +++ b/Lang/Swift/Enforced-immutability @@ -0,0 +1 @@ +../../Task/Enforced-immutability/Swift \ No newline at end of file diff --git a/Lang/Swift/Evolutionary-algorithm b/Lang/Swift/Evolutionary-algorithm new file mode 120000 index 0000000000..7eae7ce390 --- /dev/null +++ b/Lang/Swift/Evolutionary-algorithm @@ -0,0 +1 @@ +../../Task/Evolutionary-algorithm/Swift \ No newline at end of file diff --git a/Lang/Swift/Exponentiation-operator b/Lang/Swift/Exponentiation-operator new file mode 120000 index 0000000000..d1270c8da9 --- /dev/null +++ b/Lang/Swift/Exponentiation-operator @@ -0,0 +1 @@ +../../Task/Exponentiation-operator/Swift \ No newline at end of file diff --git a/Lang/Swift/Extensible-prime-generator b/Lang/Swift/Extensible-prime-generator new file mode 120000 index 0000000000..58b1fba18a --- /dev/null +++ b/Lang/Swift/Extensible-prime-generator @@ -0,0 +1 @@ +../../Task/Extensible-prime-generator/Swift \ No newline at end of file diff --git a/Lang/Swift/Find-largest-left-truncatable-prime-in-a-given-base b/Lang/Swift/Find-largest-left-truncatable-prime-in-a-given-base new file mode 120000 index 0000000000..26ecd95a92 --- /dev/null +++ b/Lang/Swift/Find-largest-left-truncatable-prime-in-a-given-base @@ -0,0 +1 @@ +../../Task/Find-largest-left-truncatable-prime-in-a-given-base/Swift \ No newline at end of file diff --git a/Lang/Swift/Forward-difference b/Lang/Swift/Forward-difference new file mode 120000 index 0000000000..531f0569a4 --- /dev/null +++ b/Lang/Swift/Forward-difference @@ -0,0 +1 @@ +../../Task/Forward-difference/Swift \ No newline at end of file diff --git a/Lang/Swift/Harshad-or-Niven-series b/Lang/Swift/Harshad-or-Niven-series new file mode 120000 index 0000000000..efda49dcb4 --- /dev/null +++ b/Lang/Swift/Harshad-or-Niven-series @@ -0,0 +1 @@ +../../Task/Harshad-or-Niven-series/Swift \ No newline at end of file diff --git a/Lang/Swift/Identity-matrix b/Lang/Swift/Identity-matrix new file mode 120000 index 0000000000..54b04e2005 --- /dev/null +++ b/Lang/Swift/Identity-matrix @@ -0,0 +1 @@ +../../Task/Identity-matrix/Swift \ No newline at end of file diff --git a/Lang/Swift/Iterated-digits-squaring b/Lang/Swift/Iterated-digits-squaring new file mode 120000 index 0000000000..8adb504710 --- /dev/null +++ b/Lang/Swift/Iterated-digits-squaring @@ -0,0 +1 @@ +../../Task/Iterated-digits-squaring/Swift \ No newline at end of file diff --git a/Lang/Swift/Knapsack-problem-0-1 b/Lang/Swift/Knapsack-problem-0-1 new file mode 120000 index 0000000000..c8832bb9e0 --- /dev/null +++ b/Lang/Swift/Knapsack-problem-0-1 @@ -0,0 +1 @@ +../../Task/Knapsack-problem-0-1/Swift \ No newline at end of file diff --git a/Lang/Swift/Letter-frequency b/Lang/Swift/Letter-frequency new file mode 120000 index 0000000000..4e9c4dfaf0 --- /dev/null +++ b/Lang/Swift/Letter-frequency @@ -0,0 +1 @@ +../../Task/Letter-frequency/Swift \ No newline at end of file diff --git a/Lang/Swift/Longest-increasing-subsequence b/Lang/Swift/Longest-increasing-subsequence new file mode 120000 index 0000000000..c6e5ff61f5 --- /dev/null +++ b/Lang/Swift/Longest-increasing-subsequence @@ -0,0 +1 @@ +../../Task/Longest-increasing-subsequence/Swift \ No newline at end of file diff --git a/Lang/Swift/Look-and-say-sequence b/Lang/Swift/Look-and-say-sequence new file mode 120000 index 0000000000..81cf794862 --- /dev/null +++ b/Lang/Swift/Look-and-say-sequence @@ -0,0 +1 @@ +../../Task/Look-and-say-sequence/Swift \ No newline at end of file diff --git a/Lang/Swift/Lucas-Lehmer-test b/Lang/Swift/Lucas-Lehmer-test new file mode 120000 index 0000000000..4cdf206b04 --- /dev/null +++ b/Lang/Swift/Lucas-Lehmer-test @@ -0,0 +1 @@ +../../Task/Lucas-Lehmer-test/Swift \ No newline at end of file diff --git a/Lang/Swift/Machine-code b/Lang/Swift/Machine-code new file mode 120000 index 0000000000..f389343abb --- /dev/null +++ b/Lang/Swift/Machine-code @@ -0,0 +1 @@ +../../Task/Machine-code/Swift \ No newline at end of file diff --git a/Lang/Swift/Magic-squares-of-odd-order b/Lang/Swift/Magic-squares-of-odd-order new file mode 120000 index 0000000000..40680b3659 --- /dev/null +++ b/Lang/Swift/Magic-squares-of-odd-order @@ -0,0 +1 @@ +../../Task/Magic-squares-of-odd-order/Swift \ No newline at end of file diff --git a/Lang/Swift/Map-range b/Lang/Swift/Map-range new file mode 120000 index 0000000000..5332eed92d --- /dev/null +++ b/Lang/Swift/Map-range @@ -0,0 +1 @@ +../../Task/Map-range/Swift \ No newline at end of file diff --git a/Lang/Swift/Monty-Hall-problem b/Lang/Swift/Monty-Hall-problem new file mode 120000 index 0000000000..ce975de5fc --- /dev/null +++ b/Lang/Swift/Monty-Hall-problem @@ -0,0 +1 @@ +../../Task/Monty-Hall-problem/Swift \ No newline at end of file diff --git a/Lang/Swift/Multifactorial b/Lang/Swift/Multifactorial new file mode 120000 index 0000000000..0987f82478 --- /dev/null +++ b/Lang/Swift/Multifactorial @@ -0,0 +1 @@ +../../Task/Multifactorial/Swift \ No newline at end of file diff --git a/Lang/Swift/N-queens-problem b/Lang/Swift/N-queens-problem new file mode 120000 index 0000000000..a5888f5376 --- /dev/null +++ b/Lang/Swift/N-queens-problem @@ -0,0 +1 @@ +../../Task/N-queens-problem/Swift \ No newline at end of file diff --git a/Lang/Swift/Number-names b/Lang/Swift/Number-names new file mode 120000 index 0000000000..6bbe16b65d --- /dev/null +++ b/Lang/Swift/Number-names @@ -0,0 +1 @@ +../../Task/Number-names/Swift \ No newline at end of file diff --git a/Lang/Swift/Numerical-integration b/Lang/Swift/Numerical-integration new file mode 120000 index 0000000000..870d1d3412 --- /dev/null +++ b/Lang/Swift/Numerical-integration @@ -0,0 +1 @@ +../../Task/Numerical-integration/Swift \ No newline at end of file diff --git a/Lang/Swift/Order-disjoint-list-items b/Lang/Swift/Order-disjoint-list-items new file mode 120000 index 0000000000..6e29a917fd --- /dev/null +++ b/Lang/Swift/Order-disjoint-list-items @@ -0,0 +1 @@ +../../Task/Order-disjoint-list-items/Swift \ No newline at end of file diff --git a/Lang/Swift/Percolation-Bond-percolation b/Lang/Swift/Percolation-Bond-percolation new file mode 120000 index 0000000000..f72b8d3f25 --- /dev/null +++ b/Lang/Swift/Percolation-Bond-percolation @@ -0,0 +1 @@ +../../Task/Percolation-Bond-percolation/Swift \ No newline at end of file diff --git a/Lang/Swift/Prime-decomposition b/Lang/Swift/Prime-decomposition new file mode 120000 index 0000000000..5332b93dfc --- /dev/null +++ b/Lang/Swift/Prime-decomposition @@ -0,0 +1 @@ +../../Task/Prime-decomposition/Swift \ No newline at end of file diff --git a/Lang/Swift/Quaternion-type b/Lang/Swift/Quaternion-type new file mode 120000 index 0000000000..d74f88c4be --- /dev/null +++ b/Lang/Swift/Quaternion-type @@ -0,0 +1 @@ +../../Task/Quaternion-type/Swift \ No newline at end of file diff --git a/Lang/Swift/Rep-string b/Lang/Swift/Rep-string new file mode 120000 index 0000000000..12250d0ecb --- /dev/null +++ b/Lang/Swift/Rep-string @@ -0,0 +1 @@ +../../Task/Rep-string/Swift \ No newline at end of file diff --git a/Lang/Swift/Rock-paper-scissors b/Lang/Swift/Rock-paper-scissors new file mode 120000 index 0000000000..b1dcc208cd --- /dev/null +++ b/Lang/Swift/Rock-paper-scissors @@ -0,0 +1 @@ +../../Task/Rock-paper-scissors/Swift \ No newline at end of file diff --git a/Lang/Swift/Sorting-algorithms-Cocktail-sort b/Lang/Swift/Sorting-algorithms-Cocktail-sort new file mode 120000 index 0000000000..29e0c22bda --- /dev/null +++ b/Lang/Swift/Sorting-algorithms-Cocktail-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Cocktail-sort/Swift \ No newline at end of file diff --git a/Lang/Swift/Stern-Brocot-sequence b/Lang/Swift/Stern-Brocot-sequence new file mode 120000 index 0000000000..86e94065d1 --- /dev/null +++ b/Lang/Swift/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/Swift \ No newline at end of file diff --git a/Lang/Swift/Top-rank-per-group b/Lang/Swift/Top-rank-per-group new file mode 120000 index 0000000000..11af7d1da5 --- /dev/null +++ b/Lang/Swift/Top-rank-per-group @@ -0,0 +1 @@ +../../Task/Top-rank-per-group/Swift \ No newline at end of file diff --git a/Lang/Swift/Vampire-number b/Lang/Swift/Vampire-number new file mode 120000 index 0000000000..95d43a79b6 --- /dev/null +++ b/Lang/Swift/Vampire-number @@ -0,0 +1 @@ +../../Task/Vampire-number/Swift \ No newline at end of file diff --git a/Lang/Swift/Van-der-Corput-sequence b/Lang/Swift/Van-der-Corput-sequence new file mode 120000 index 0000000000..d76b932460 --- /dev/null +++ b/Lang/Swift/Van-der-Corput-sequence @@ -0,0 +1 @@ +../../Task/Van-der-Corput-sequence/Swift \ No newline at end of file diff --git a/Lang/Symsyn/00DESCRIPTION b/Lang/Symsyn/00DESCRIPTION index a8c4f306af..fb15ffc0a6 100644 --- a/Lang/Symsyn/00DESCRIPTION +++ b/Lang/Symsyn/00DESCRIPTION @@ -12,4 +12,4 @@ Bit, character, and word manipulation. TCP/IP support. -More info at : http://qsys.us/symsyn \ No newline at end of file +More info at : http://symsyn.qsys.us \ No newline at end of file diff --git a/Lang/TI-83-BASIC/00DESCRIPTION b/Lang/TI-83-BASIC/00DESCRIPTION index edb711d646..571b0d2a73 100644 --- a/Lang/TI-83-BASIC/00DESCRIPTION +++ b/Lang/TI-83-BASIC/00DESCRIPTION @@ -1,6 +1,51 @@ -{{stub}}{{language|TI-83 BASIC -|tags=ti83b}} -'''TI-83 BASIC''' or '''TI-BASIC''' is the high-level language used on TI-83/84/+/SE calculators (aside from the assembly which is also on the calculator). TI-83 BASIC is the older brother of [[TI-89 BASIC]]. One of the main complaints with TI-83 BASIC is that there is no native function that tells time, this feature was added in the TI-84+. The language itself, however, is a powerful language capable of many things; nested loops and string manipulation among others. Many students create small programs on their calculators to help them through tests and homework. One popular example is a quadratic formula program. TI-83 BASIC is not affiliated with [[BASIC]] and is not as similar to it as the name would suggest. Someone who has experience writing code in [[C]] or [[C++]] should have no trouble working with this language. +{{language|TI-83 BASIC|tags=ti83b}} +'''TI-83 BASIC''' is not affiliated with [[BASIC]] . + +'''TI-83 BASIC''' or TI-BASIC 83 is the high-level language used on TI-83/84/83+/84+ Z80 calculators (aside from the assembly which is also on the calculator). + +==Elements of language== +===Control flow=== +The language contains control flow for structured programming. +The main control flow statements are: +====If==== +If condition +Then +... +Else +... +End +====For==== +For(variable,start,stop,step) +... +End +====While==== +While condition +... +End +====Repeat==== +Repeat condition +... +End +===Data types=== +'''TI-BASIC''' is a strongly and dynamically-typed language +Variables are global. There is no local variables. So programs cannot be recursive, even if a program can call itself. +* '''Numerical variables''', 27 variables from A to Z and theta. These allow real numbers or complex numbers (implemented as pairs of reals) to be stored in floating point format. Values may range from 1E-99 to 1E99 with up to ten digits of accuracy. +* '''Strings''', 10 strings from Str1 to Str9 and Str0. +* '''Lists''', including L1 - L6, with the ability to create additional ones. These are essentially one-dimensional arrays used to store a real or complex number into each of their elements. (L1(4) would return the value of L1 at n=4) +* '''Matrices''', 8 matrices from [A] to [J]. Their elements are subject to the same restrictions as lists. Their dimensions may be defined up to 99x99 elements, although, again, available memory will limit this. ([A](3,4) would design item at row=3 column=4) +* '''Equation variables''', 10 y(x) functions: from Y1 to Y9 and Y0, 6 r(theta) polar functions: r1 - r6, and 3 u(n) integer sequences: u, v, w. (Y1(4) would return the value of Y1 at X=4, X is a real) + +==Example== +One popular example is the quadratic formula program. +Prompt A,B,C +B²-4AC->D +(-B-sqrt(D))/(2A)->Y +(-B+sqrt(D))/(2A)->X +{Y,X} +As far there is a complex mode and variable can be real or complex, this program is very ubiquitous. + + + ==See Also== * [[wp:TI-BASIC|Wikipedia: TI-BASIC]] diff --git a/Lang/TI-83-BASIC/Digital-root b/Lang/TI-83-BASIC/Digital-root new file mode 120000 index 0000000000..d3d2895237 --- /dev/null +++ b/Lang/TI-83-BASIC/Digital-root @@ -0,0 +1 @@ +../../Task/Digital-root/TI-83-BASIC \ No newline at end of file diff --git a/Lang/TI-83-BASIC/Fractran b/Lang/TI-83-BASIC/Fractran new file mode 120000 index 0000000000..e65fe1b8d9 --- /dev/null +++ b/Lang/TI-83-BASIC/Fractran @@ -0,0 +1 @@ +../../Task/Fractran/TI-83-BASIC \ No newline at end of file diff --git a/Lang/TI-83-BASIC/Reduced-row-echelon-form b/Lang/TI-83-BASIC/Reduced-row-echelon-form new file mode 120000 index 0000000000..c156055690 --- /dev/null +++ b/Lang/TI-83-BASIC/Reduced-row-echelon-form @@ -0,0 +1 @@ +../../Task/Reduced-row-echelon-form/TI-83-BASIC \ No newline at end of file diff --git a/Lang/Tcl/00DESCRIPTION b/Lang/Tcl/00DESCRIPTION index 1930bff61c..1593929ece 100644 --- a/Lang/Tcl/00DESCRIPTION +++ b/Lang/Tcl/00DESCRIPTION @@ -33,7 +33,7 @@ including [[UNIX]], [[Linux]], [[BSD]], [[Windows]], [[WinCE]], [[PocketPC]], [[Mac OS X]] and [[BeOS]].
Tcl is distributed under the [[wp:BSD licenses|BSD License]]. -;Current version: Tcl/Tk 8.6.3 (2014-11-12) +;Current version: Tcl/Tk 8.6.9 (Nov 16, 2018) The Tcl language has been implemented in multiple lower-level languages. The most common one is '''[[libtcl]]''', written in [[C]], which is @@ -45,10 +45,9 @@ Its creator, John Ousterhout, wrote about it: :''“I got the idea for Tcl while on sabbatical leave at DEC's Western Research Laboratory in the fall of 1987. I started actually implementing it when I got back to Berkeley in the spring of 1988; by summer of that year it was in use in some internal applications of ours, but there was no Tk. The first external releases of Tcl were in 1989, I believe. I started implementing Tk in 1989, and the first release of Tk was in 1991.”'' The principal pre-built distributions of Tcl are all based on [[libtcl]]; -the main ones are [[ActiveTcl]] from ActiveState, +the main ones are - besides those in the repositories of Linux and BSD Unices, which are usually current - [[ActiveTcl]] from ActiveState (for several platforms including Windows), BAWT http://www.bawt.tcl3d.org/ (for several platforms including Windows and Mac), Magicsplat http://www.magicsplat.com/tcl-installer/index.html (Windows), and [[tclkit]] from Equi4 Software ''et al''.
-Older versions of the language are distributed as part of -Apple's OSX and all Linux distributions. +Older versions of the language (8.5) are distributed as part of Apple's OS X. ==Language Syntax== ===Grammar=== @@ -154,8 +153,8 @@ The language supports the following basic types, together with many defined by e Note that all variables can hold values of ''any'' type; the language does not impose type constraints on variables at all. However, it is possible to use variable traces to enforce a type constraint if so desired. ==External Links== -*[http://www.tcl.tk/man/ Tcl Documentation] -*[http://wiki.tcl.tk Tcl Wiki] +*[http://www.tcl-lang.org/man/ Tcl Documentation] +*[http://wiki.tcl-lang.org Tcl Wiki] *[http://en.wikipedia.org/wiki/Tcl Wikipedia article] *[http://en.wikibooks.org/wiki/Programming:Tcl Wikibook] diff --git a/Lang/Transact-SQL/Haversine-formula b/Lang/Transact-SQL/Haversine-formula new file mode 120000 index 0000000000..858afb080c --- /dev/null +++ b/Lang/Transact-SQL/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/Transact-SQL \ No newline at end of file diff --git a/Lang/TypeScript/99-Bottles-of-Beer b/Lang/TypeScript/99-Bottles-of-Beer new file mode 120000 index 0000000000..830bc628d2 --- /dev/null +++ b/Lang/TypeScript/99-Bottles-of-Beer @@ -0,0 +1 @@ +../../Task/99-Bottles-of-Beer/TypeScript \ No newline at end of file diff --git a/Lang/TypeScript/Function-composition b/Lang/TypeScript/Function-composition new file mode 120000 index 0000000000..6ea0a74df7 --- /dev/null +++ b/Lang/TypeScript/Function-composition @@ -0,0 +1 @@ +../../Task/Function-composition/TypeScript \ No newline at end of file diff --git a/Lang/TypeScript/Haversine-formula b/Lang/TypeScript/Haversine-formula new file mode 120000 index 0000000000..2fcb0fb35c --- /dev/null +++ b/Lang/TypeScript/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/TypeScript \ No newline at end of file diff --git a/Lang/TypeScript/Palindrome-detection b/Lang/TypeScript/Palindrome-detection new file mode 120000 index 0000000000..20e296ee3d --- /dev/null +++ b/Lang/TypeScript/Palindrome-detection @@ -0,0 +1 @@ +../../Task/Palindrome-detection/TypeScript \ No newline at end of file diff --git a/Lang/TypeScript/Pi b/Lang/TypeScript/Pi new file mode 120000 index 0000000000..06381040db --- /dev/null +++ b/Lang/TypeScript/Pi @@ -0,0 +1 @@ +../../Task/Pi/TypeScript \ No newline at end of file diff --git a/Lang/UNIX-Shell/N-queens-problem b/Lang/UNIX-Shell/N-queens-problem new file mode 120000 index 0000000000..eea4917852 --- /dev/null +++ b/Lang/UNIX-Shell/N-queens-problem @@ -0,0 +1 @@ +../../Task/N-queens-problem/UNIX-Shell \ No newline at end of file diff --git a/Lang/VBA/9-billion-names-of-God-the-integer b/Lang/VBA/9-billion-names-of-God-the-integer new file mode 120000 index 0000000000..79fbc4e3ed --- /dev/null +++ b/Lang/VBA/9-billion-names-of-God-the-integer @@ -0,0 +1 @@ +../../Task/9-billion-names-of-God-the-integer/VBA \ No newline at end of file diff --git a/Lang/VBA/AKS-test-for-primes b/Lang/VBA/AKS-test-for-primes new file mode 120000 index 0000000000..b44ff8e71a --- /dev/null +++ b/Lang/VBA/AKS-test-for-primes @@ -0,0 +1 @@ +../../Task/AKS-test-for-primes/VBA \ No newline at end of file diff --git a/Lang/VBA/Ackermann-function b/Lang/VBA/Ackermann-function new file mode 120000 index 0000000000..72fec8f02d --- /dev/null +++ b/Lang/VBA/Ackermann-function @@ -0,0 +1 @@ +../../Task/Ackermann-function/VBA \ No newline at end of file diff --git a/Lang/VBA/Almost-prime b/Lang/VBA/Almost-prime new file mode 120000 index 0000000000..f6efa6c8c9 --- /dev/null +++ b/Lang/VBA/Almost-prime @@ -0,0 +1 @@ +../../Task/Almost-prime/VBA \ No newline at end of file diff --git a/Lang/VBA/Arithmetic-geometric-mean b/Lang/VBA/Arithmetic-geometric-mean new file mode 120000 index 0000000000..9c083322cf --- /dev/null +++ b/Lang/VBA/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/VBA \ No newline at end of file diff --git a/Lang/VBA/Arrays b/Lang/VBA/Arrays new file mode 120000 index 0000000000..c5fb3e7b35 --- /dev/null +++ b/Lang/VBA/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/VBA \ No newline at end of file diff --git a/Lang/VBA/Assertions b/Lang/VBA/Assertions new file mode 120000 index 0000000000..e3db584380 --- /dev/null +++ b/Lang/VBA/Assertions @@ -0,0 +1 @@ +../../Task/Assertions/VBA \ No newline at end of file diff --git a/Lang/VBA/Average-loop-length b/Lang/VBA/Average-loop-length new file mode 120000 index 0000000000..d3f3364af5 --- /dev/null +++ b/Lang/VBA/Average-loop-length @@ -0,0 +1 @@ +../../Task/Average-loop-length/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Arithmetic-mean b/Lang/VBA/Averages-Arithmetic-mean new file mode 120000 index 0000000000..bfca7f3503 --- /dev/null +++ b/Lang/VBA/Averages-Arithmetic-mean @@ -0,0 +1 @@ +../../Task/Averages-Arithmetic-mean/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Mean-angle b/Lang/VBA/Averages-Mean-angle new file mode 120000 index 0000000000..b7dd2bc192 --- /dev/null +++ b/Lang/VBA/Averages-Mean-angle @@ -0,0 +1 @@ +../../Task/Averages-Mean-angle/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Mean-time-of-day b/Lang/VBA/Averages-Mean-time-of-day new file mode 120000 index 0000000000..c6ae8892ca --- /dev/null +++ b/Lang/VBA/Averages-Mean-time-of-day @@ -0,0 +1 @@ +../../Task/Averages-Mean-time-of-day/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Median b/Lang/VBA/Averages-Median new file mode 120000 index 0000000000..b725fa382b --- /dev/null +++ b/Lang/VBA/Averages-Median @@ -0,0 +1 @@ +../../Task/Averages-Median/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Mode b/Lang/VBA/Averages-Mode new file mode 120000 index 0000000000..1de0f4be4f --- /dev/null +++ b/Lang/VBA/Averages-Mode @@ -0,0 +1 @@ +../../Task/Averages-Mode/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Pythagorean-means b/Lang/VBA/Averages-Pythagorean-means new file mode 120000 index 0000000000..e8f452d505 --- /dev/null +++ b/Lang/VBA/Averages-Pythagorean-means @@ -0,0 +1 @@ +../../Task/Averages-Pythagorean-means/VBA \ No newline at end of file diff --git a/Lang/VBA/Averages-Simple-moving-average b/Lang/VBA/Averages-Simple-moving-average new file mode 120000 index 0000000000..1d42f94054 --- /dev/null +++ b/Lang/VBA/Averages-Simple-moving-average @@ -0,0 +1 @@ +../../Task/Averages-Simple-moving-average/VBA \ No newline at end of file diff --git a/Lang/VBA/Boolean-values b/Lang/VBA/Boolean-values new file mode 120000 index 0000000000..f3017bf338 --- /dev/null +++ b/Lang/VBA/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/VBA \ No newline at end of file diff --git a/Lang/VBA/Box-the-compass b/Lang/VBA/Box-the-compass new file mode 120000 index 0000000000..fc64e107aa --- /dev/null +++ b/Lang/VBA/Box-the-compass @@ -0,0 +1 @@ +../../Task/Box-the-compass/VBA \ No newline at end of file diff --git a/Lang/VBA/CSV-to-HTML-translation b/Lang/VBA/CSV-to-HTML-translation new file mode 120000 index 0000000000..48b1a16bc7 --- /dev/null +++ b/Lang/VBA/CSV-to-HTML-translation @@ -0,0 +1 @@ +../../Task/CSV-to-HTML-translation/VBA \ No newline at end of file diff --git a/Lang/VBA/Call-a-function b/Lang/VBA/Call-a-function new file mode 120000 index 0000000000..b6f2f7d2be --- /dev/null +++ b/Lang/VBA/Call-a-function @@ -0,0 +1 @@ +../../Task/Call-a-function/VBA \ No newline at end of file diff --git a/Lang/VBA/Case-sensitivity-of-identifiers b/Lang/VBA/Case-sensitivity-of-identifiers new file mode 120000 index 0000000000..8469abf356 --- /dev/null +++ b/Lang/VBA/Case-sensitivity-of-identifiers @@ -0,0 +1 @@ +../../Task/Case-sensitivity-of-identifiers/VBA \ No newline at end of file diff --git a/Lang/VBA/Catamorphism b/Lang/VBA/Catamorphism new file mode 120000 index 0000000000..a8f147a7da --- /dev/null +++ b/Lang/VBA/Catamorphism @@ -0,0 +1 @@ +../../Task/Catamorphism/VBA \ No newline at end of file diff --git a/Lang/VBA/Chinese-remainder-theorem b/Lang/VBA/Chinese-remainder-theorem new file mode 120000 index 0000000000..295e53807f --- /dev/null +++ b/Lang/VBA/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/VBA \ No newline at end of file diff --git a/Lang/VBA/Circles-of-given-radius-through-two-points b/Lang/VBA/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..d1ce7fa984 --- /dev/null +++ b/Lang/VBA/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/VBA \ No newline at end of file diff --git a/Lang/VBA/Compound-data-type b/Lang/VBA/Compound-data-type new file mode 120000 index 0000000000..700cefdb9a --- /dev/null +++ b/Lang/VBA/Compound-data-type @@ -0,0 +1 @@ +../../Task/Compound-data-type/VBA \ No newline at end of file diff --git a/Lang/VBA/Concurrent-computing b/Lang/VBA/Concurrent-computing new file mode 120000 index 0000000000..9fef6b1c19 --- /dev/null +++ b/Lang/VBA/Concurrent-computing @@ -0,0 +1 @@ +../../Task/Concurrent-computing/VBA \ No newline at end of file diff --git a/Lang/VBA/Continued-fraction b/Lang/VBA/Continued-fraction new file mode 120000 index 0000000000..f20f70442a --- /dev/null +++ b/Lang/VBA/Continued-fraction @@ -0,0 +1 @@ +../../Task/Continued-fraction/VBA \ No newline at end of file diff --git a/Lang/VBA/Copy-a-string b/Lang/VBA/Copy-a-string new file mode 120000 index 0000000000..0c57618d0e --- /dev/null +++ b/Lang/VBA/Copy-a-string @@ -0,0 +1 @@ +../../Task/Copy-a-string/VBA \ No newline at end of file diff --git a/Lang/VBA/Count-the-coins b/Lang/VBA/Count-the-coins new file mode 120000 index 0000000000..a3c2163a8a --- /dev/null +++ b/Lang/VBA/Count-the-coins @@ -0,0 +1 @@ +../../Task/Count-the-coins/VBA \ No newline at end of file diff --git a/Lang/VBA/Create-a-file b/Lang/VBA/Create-a-file new file mode 120000 index 0000000000..cf208462a3 --- /dev/null +++ b/Lang/VBA/Create-a-file @@ -0,0 +1 @@ +../../Task/Create-a-file/VBA \ No newline at end of file diff --git a/Lang/VBA/Digital-root b/Lang/VBA/Digital-root new file mode 120000 index 0000000000..70a36703e3 --- /dev/null +++ b/Lang/VBA/Digital-root @@ -0,0 +1 @@ +../../Task/Digital-root/VBA \ No newline at end of file diff --git a/Lang/VBA/Dining-philosophers b/Lang/VBA/Dining-philosophers new file mode 120000 index 0000000000..ae57f209d0 --- /dev/null +++ b/Lang/VBA/Dining-philosophers @@ -0,0 +1 @@ +../../Task/Dining-philosophers/VBA \ No newline at end of file diff --git a/Lang/VBA/Dot-product b/Lang/VBA/Dot-product new file mode 120000 index 0000000000..7f87af9695 --- /dev/null +++ b/Lang/VBA/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/VBA \ No newline at end of file diff --git a/Lang/VBA/Euler-method b/Lang/VBA/Euler-method new file mode 120000 index 0000000000..67904cc80a --- /dev/null +++ b/Lang/VBA/Euler-method @@ -0,0 +1 @@ +../../Task/Euler-method/VBA \ No newline at end of file diff --git a/Lang/VBA/Exponentiation-operator b/Lang/VBA/Exponentiation-operator new file mode 120000 index 0000000000..5d81c785ff --- /dev/null +++ b/Lang/VBA/Exponentiation-operator @@ -0,0 +1 @@ +../../Task/Exponentiation-operator/VBA \ No newline at end of file diff --git a/Lang/VBA/Fractran b/Lang/VBA/Fractran new file mode 120000 index 0000000000..547444a5fe --- /dev/null +++ b/Lang/VBA/Fractran @@ -0,0 +1 @@ +../../Task/Fractran/VBA \ No newline at end of file diff --git a/Lang/VBA/Gaussian-elimination b/Lang/VBA/Gaussian-elimination new file mode 120000 index 0000000000..e3e438204d --- /dev/null +++ b/Lang/VBA/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/VBA \ No newline at end of file diff --git a/Lang/VBA/Generator-Exponential b/Lang/VBA/Generator-Exponential new file mode 120000 index 0000000000..bac7593572 --- /dev/null +++ b/Lang/VBA/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/VBA \ No newline at end of file diff --git a/Lang/VBA/Hailstone-sequence b/Lang/VBA/Hailstone-sequence new file mode 120000 index 0000000000..7abe920d20 --- /dev/null +++ b/Lang/VBA/Hailstone-sequence @@ -0,0 +1 @@ +../../Task/Hailstone-sequence/VBA \ No newline at end of file diff --git a/Lang/VBA/Hamming-numbers b/Lang/VBA/Hamming-numbers new file mode 120000 index 0000000000..531345e13f --- /dev/null +++ b/Lang/VBA/Hamming-numbers @@ -0,0 +1 @@ +../../Task/Hamming-numbers/VBA \ No newline at end of file diff --git a/Lang/VBA/Haversine-formula b/Lang/VBA/Haversine-formula new file mode 120000 index 0000000000..8902b529d3 --- /dev/null +++ b/Lang/VBA/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/VBA \ No newline at end of file diff --git a/Lang/VBA/Hello-world-Graphical b/Lang/VBA/Hello-world-Graphical new file mode 120000 index 0000000000..797be11a68 --- /dev/null +++ b/Lang/VBA/Hello-world-Graphical @@ -0,0 +1 @@ +../../Task/Hello-world-Graphical/VBA \ No newline at end of file diff --git a/Lang/VBA/Hello-world-Standard-error b/Lang/VBA/Hello-world-Standard-error new file mode 120000 index 0000000000..edea37abdd --- /dev/null +++ b/Lang/VBA/Hello-world-Standard-error @@ -0,0 +1 @@ +../../Task/Hello-world-Standard-error/VBA \ No newline at end of file diff --git a/Lang/VBA/Heronian-triangles b/Lang/VBA/Heronian-triangles new file mode 120000 index 0000000000..fe2b2d38df --- /dev/null +++ b/Lang/VBA/Heronian-triangles @@ -0,0 +1 @@ +../../Task/Heronian-triangles/VBA \ No newline at end of file diff --git a/Lang/VBA/Hofstadter-Conway-$10,000-sequence b/Lang/VBA/Hofstadter-Conway-$10,000-sequence new file mode 120000 index 0000000000..b4fb34c1ba --- /dev/null +++ b/Lang/VBA/Hofstadter-Conway-$10,000-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Conway-$10,000-sequence/VBA \ No newline at end of file diff --git a/Lang/VBA/Hofstadter-Figure-Figure-sequences b/Lang/VBA/Hofstadter-Figure-Figure-sequences new file mode 120000 index 0000000000..7a29ca0024 --- /dev/null +++ b/Lang/VBA/Hofstadter-Figure-Figure-sequences @@ -0,0 +1 @@ +../../Task/Hofstadter-Figure-Figure-sequences/VBA \ No newline at end of file diff --git a/Lang/VBA/Hofstadter-Q-sequence b/Lang/VBA/Hofstadter-Q-sequence new file mode 120000 index 0000000000..c6a5278ddd --- /dev/null +++ b/Lang/VBA/Hofstadter-Q-sequence @@ -0,0 +1 @@ +../../Task/Hofstadter-Q-sequence/VBA \ No newline at end of file diff --git a/Lang/VBA/Holidays-related-to-Easter b/Lang/VBA/Holidays-related-to-Easter new file mode 120000 index 0000000000..c54aee9d0c --- /dev/null +++ b/Lang/VBA/Holidays-related-to-Easter @@ -0,0 +1 @@ +../../Task/Holidays-related-to-Easter/VBA \ No newline at end of file diff --git a/Lang/VBA/IBAN b/Lang/VBA/IBAN new file mode 120000 index 0000000000..735435e3cc --- /dev/null +++ b/Lang/VBA/IBAN @@ -0,0 +1 @@ +../../Task/IBAN/VBA \ No newline at end of file diff --git a/Lang/VBA/Identity-matrix b/Lang/VBA/Identity-matrix new file mode 120000 index 0000000000..6ed2263912 --- /dev/null +++ b/Lang/VBA/Identity-matrix @@ -0,0 +1 @@ +../../Task/Identity-matrix/VBA \ No newline at end of file diff --git a/Lang/VBA/Input-loop b/Lang/VBA/Input-loop new file mode 120000 index 0000000000..bd892846fc --- /dev/null +++ b/Lang/VBA/Input-loop @@ -0,0 +1 @@ +../../Task/Input-loop/VBA \ No newline at end of file diff --git a/Lang/VBA/Integer-comparison b/Lang/VBA/Integer-comparison new file mode 120000 index 0000000000..9b72421ba8 --- /dev/null +++ b/Lang/VBA/Integer-comparison @@ -0,0 +1 @@ +../../Task/Integer-comparison/VBA \ No newline at end of file diff --git a/Lang/VBA/Jensens-Device b/Lang/VBA/Jensens-Device new file mode 120000 index 0000000000..ebf15e4d7c --- /dev/null +++ b/Lang/VBA/Jensens-Device @@ -0,0 +1 @@ +../../Task/Jensens-Device/VBA \ No newline at end of file diff --git a/Lang/VBA/Jump-anywhere b/Lang/VBA/Jump-anywhere new file mode 120000 index 0000000000..0200691143 --- /dev/null +++ b/Lang/VBA/Jump-anywhere @@ -0,0 +1 @@ +../../Task/Jump-anywhere/VBA \ No newline at end of file diff --git a/Lang/VBA/Knuth-shuffle b/Lang/VBA/Knuth-shuffle new file mode 120000 index 0000000000..4e4cde3b6d --- /dev/null +++ b/Lang/VBA/Knuth-shuffle @@ -0,0 +1 @@ +../../Task/Knuth-shuffle/VBA \ No newline at end of file diff --git a/Lang/VBA/LU-decomposition b/Lang/VBA/LU-decomposition new file mode 120000 index 0000000000..0dad3fbe54 --- /dev/null +++ b/Lang/VBA/LU-decomposition @@ -0,0 +1 @@ +../../Task/LU-decomposition/VBA \ No newline at end of file diff --git a/Lang/VBA/Leap-year b/Lang/VBA/Leap-year new file mode 120000 index 0000000000..08f2d57ea7 --- /dev/null +++ b/Lang/VBA/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/VBA \ No newline at end of file diff --git a/Lang/VBA/Least-common-multiple b/Lang/VBA/Least-common-multiple new file mode 120000 index 0000000000..335c89fdc1 --- /dev/null +++ b/Lang/VBA/Least-common-multiple @@ -0,0 +1 @@ +../../Task/Least-common-multiple/VBA \ No newline at end of file diff --git a/Lang/VBA/Levenshtein-distance b/Lang/VBA/Levenshtein-distance new file mode 120000 index 0000000000..9e2c4e5886 --- /dev/null +++ b/Lang/VBA/Levenshtein-distance @@ -0,0 +1 @@ +../../Task/Levenshtein-distance/VBA \ No newline at end of file diff --git a/Lang/VBA/Linear-congruential-generator b/Lang/VBA/Linear-congruential-generator new file mode 120000 index 0000000000..7dc92b3e3c --- /dev/null +++ b/Lang/VBA/Linear-congruential-generator @@ -0,0 +1 @@ +../../Task/Linear-congruential-generator/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-Break b/Lang/VBA/Loops-Break new file mode 120000 index 0000000000..9a28e9e917 --- /dev/null +++ b/Lang/VBA/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-Continue b/Lang/VBA/Loops-Continue new file mode 120000 index 0000000000..7f54a41fd6 --- /dev/null +++ b/Lang/VBA/Loops-Continue @@ -0,0 +1 @@ +../../Task/Loops-Continue/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-Do-while b/Lang/VBA/Loops-Do-while new file mode 120000 index 0000000000..0a1a0393ff --- /dev/null +++ b/Lang/VBA/Loops-Do-while @@ -0,0 +1 @@ +../../Task/Loops-Do-while/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-Downward-for b/Lang/VBA/Loops-Downward-for new file mode 120000 index 0000000000..0d432e29ca --- /dev/null +++ b/Lang/VBA/Loops-Downward-for @@ -0,0 +1 @@ +../../Task/Loops-Downward-for/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-N-plus-one-half b/Lang/VBA/Loops-N-plus-one-half new file mode 120000 index 0000000000..5f9f7b94c7 --- /dev/null +++ b/Lang/VBA/Loops-N-plus-one-half @@ -0,0 +1 @@ +../../Task/Loops-N-plus-one-half/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-Nested b/Lang/VBA/Loops-Nested new file mode 120000 index 0000000000..b5ebd98f52 --- /dev/null +++ b/Lang/VBA/Loops-Nested @@ -0,0 +1 @@ +../../Task/Loops-Nested/VBA \ No newline at end of file diff --git a/Lang/VBA/Loops-While b/Lang/VBA/Loops-While new file mode 120000 index 0000000000..15ffad64bf --- /dev/null +++ b/Lang/VBA/Loops-While @@ -0,0 +1 @@ +../../Task/Loops-While/VBA \ No newline at end of file diff --git a/Lang/VBA/Matrix-exponentiation-operator b/Lang/VBA/Matrix-exponentiation-operator new file mode 120000 index 0000000000..a2771e2dae --- /dev/null +++ b/Lang/VBA/Matrix-exponentiation-operator @@ -0,0 +1 @@ +../../Task/Matrix-exponentiation-operator/VBA \ No newline at end of file diff --git a/Lang/VBA/Matrix-multiplication b/Lang/VBA/Matrix-multiplication new file mode 120000 index 0000000000..362c0f307d --- /dev/null +++ b/Lang/VBA/Matrix-multiplication @@ -0,0 +1 @@ +../../Task/Matrix-multiplication/VBA \ No newline at end of file diff --git a/Lang/VBA/Matrix-transposition b/Lang/VBA/Matrix-transposition new file mode 120000 index 0000000000..0924e208bf --- /dev/null +++ b/Lang/VBA/Matrix-transposition @@ -0,0 +1 @@ +../../Task/Matrix-transposition/VBA \ No newline at end of file diff --git a/Lang/VBA/Modular-inverse b/Lang/VBA/Modular-inverse new file mode 120000 index 0000000000..b5ecfac39a --- /dev/null +++ b/Lang/VBA/Modular-inverse @@ -0,0 +1 @@ +../../Task/Modular-inverse/VBA \ No newline at end of file diff --git a/Lang/VBA/Mutual-recursion b/Lang/VBA/Mutual-recursion new file mode 120000 index 0000000000..eeaaa82d60 --- /dev/null +++ b/Lang/VBA/Mutual-recursion @@ -0,0 +1 @@ +../../Task/Mutual-recursion/VBA \ No newline at end of file diff --git a/Lang/VBA/Named-parameters b/Lang/VBA/Named-parameters new file mode 120000 index 0000000000..5966e9ce9e --- /dev/null +++ b/Lang/VBA/Named-parameters @@ -0,0 +1 @@ +../../Task/Named-parameters/VBA \ No newline at end of file diff --git a/Lang/VBA/Narcissist b/Lang/VBA/Narcissist new file mode 120000 index 0000000000..3e0837b672 --- /dev/null +++ b/Lang/VBA/Narcissist @@ -0,0 +1 @@ +../../Task/Narcissist/VBA \ No newline at end of file diff --git a/Lang/VBA/Narcissistic-decimal-number b/Lang/VBA/Narcissistic-decimal-number new file mode 120000 index 0000000000..af2c21dd71 --- /dev/null +++ b/Lang/VBA/Narcissistic-decimal-number @@ -0,0 +1 @@ +../../Task/Narcissistic-decimal-number/VBA \ No newline at end of file diff --git a/Lang/VBA/Non-decimal-radices-Convert b/Lang/VBA/Non-decimal-radices-Convert new file mode 120000 index 0000000000..dbdb5b0755 --- /dev/null +++ b/Lang/VBA/Non-decimal-radices-Convert @@ -0,0 +1 @@ +../../Task/Non-decimal-radices-Convert/VBA \ No newline at end of file diff --git a/Lang/VBA/Nth b/Lang/VBA/Nth new file mode 120000 index 0000000000..4c5076764b --- /dev/null +++ b/Lang/VBA/Nth @@ -0,0 +1 @@ +../../Task/Nth/VBA \ No newline at end of file diff --git a/Lang/VBA/Nth-root b/Lang/VBA/Nth-root new file mode 120000 index 0000000000..e13b6a23e5 --- /dev/null +++ b/Lang/VBA/Nth-root @@ -0,0 +1 @@ +../../Task/Nth-root/VBA \ No newline at end of file diff --git a/Lang/VBA/Null-object b/Lang/VBA/Null-object new file mode 120000 index 0000000000..e8cbb52469 --- /dev/null +++ b/Lang/VBA/Null-object @@ -0,0 +1 @@ +../../Task/Null-object/VBA \ No newline at end of file diff --git a/Lang/VBA/Number-names b/Lang/VBA/Number-names new file mode 120000 index 0000000000..eb1a68f11b --- /dev/null +++ b/Lang/VBA/Number-names @@ -0,0 +1 @@ +../../Task/Number-names/VBA \ No newline at end of file diff --git a/Lang/VBA/Number-reversal-game b/Lang/VBA/Number-reversal-game new file mode 120000 index 0000000000..c16bc5a1bf --- /dev/null +++ b/Lang/VBA/Number-reversal-game @@ -0,0 +1 @@ +../../Task/Number-reversal-game/VBA \ No newline at end of file diff --git a/Lang/VBA/Optional-parameters b/Lang/VBA/Optional-parameters new file mode 120000 index 0000000000..c804fe36bf --- /dev/null +++ b/Lang/VBA/Optional-parameters @@ -0,0 +1 @@ +../../Task/Optional-parameters/VBA \ No newline at end of file diff --git a/Lang/VBA/Order-two-numerical-lists b/Lang/VBA/Order-two-numerical-lists new file mode 120000 index 0000000000..fdc4ff3ff2 --- /dev/null +++ b/Lang/VBA/Order-two-numerical-lists @@ -0,0 +1 @@ +../../Task/Order-two-numerical-lists/VBA \ No newline at end of file diff --git a/Lang/VBA/Pascals-triangle b/Lang/VBA/Pascals-triangle new file mode 120000 index 0000000000..fc38531429 --- /dev/null +++ b/Lang/VBA/Pascals-triangle @@ -0,0 +1 @@ +../../Task/Pascals-triangle/VBA \ No newline at end of file diff --git a/Lang/VBA/Perfect-numbers b/Lang/VBA/Perfect-numbers new file mode 120000 index 0000000000..10b6bd3715 --- /dev/null +++ b/Lang/VBA/Perfect-numbers @@ -0,0 +1 @@ +../../Task/Perfect-numbers/VBA \ No newline at end of file diff --git a/Lang/VBA/Pernicious-numbers b/Lang/VBA/Pernicious-numbers new file mode 120000 index 0000000000..9e652d7ae5 --- /dev/null +++ b/Lang/VBA/Pernicious-numbers @@ -0,0 +1 @@ +../../Task/Pernicious-numbers/VBA \ No newline at end of file diff --git a/Lang/VBA/Plot-coordinate-pairs b/Lang/VBA/Plot-coordinate-pairs new file mode 120000 index 0000000000..8f61aa1125 --- /dev/null +++ b/Lang/VBA/Plot-coordinate-pairs @@ -0,0 +1 @@ +../../Task/Plot-coordinate-pairs/VBA \ No newline at end of file diff --git a/Lang/VBA/Pointers-and-references b/Lang/VBA/Pointers-and-references new file mode 120000 index 0000000000..8343474d79 --- /dev/null +++ b/Lang/VBA/Pointers-and-references @@ -0,0 +1 @@ +../../Task/Pointers-and-references/VBA \ No newline at end of file diff --git a/Lang/VBA/Polynomial-long-division b/Lang/VBA/Polynomial-long-division new file mode 120000 index 0000000000..ba050d8e56 --- /dev/null +++ b/Lang/VBA/Polynomial-long-division @@ -0,0 +1 @@ +../../Task/Polynomial-long-division/VBA \ No newline at end of file diff --git a/Lang/VBA/Polynomial-regression b/Lang/VBA/Polynomial-regression new file mode 120000 index 0000000000..454a64fb2b --- /dev/null +++ b/Lang/VBA/Polynomial-regression @@ -0,0 +1 @@ +../../Task/Polynomial-regression/VBA \ No newline at end of file diff --git a/Lang/VBA/Power-set b/Lang/VBA/Power-set new file mode 120000 index 0000000000..3bf4018358 --- /dev/null +++ b/Lang/VBA/Power-set @@ -0,0 +1 @@ +../../Task/Power-set/VBA \ No newline at end of file diff --git a/Lang/VBA/Priority-queue b/Lang/VBA/Priority-queue new file mode 120000 index 0000000000..af8078a200 --- /dev/null +++ b/Lang/VBA/Priority-queue @@ -0,0 +1 @@ +../../Task/Priority-queue/VBA \ No newline at end of file diff --git a/Lang/VBA/Program-termination b/Lang/VBA/Program-termination new file mode 120000 index 0000000000..415b2c2d98 --- /dev/null +++ b/Lang/VBA/Program-termination @@ -0,0 +1 @@ +../../Task/Program-termination/VBA \ No newline at end of file diff --git a/Lang/VBA/Pythagorean-triples b/Lang/VBA/Pythagorean-triples new file mode 120000 index 0000000000..ec229ee77c --- /dev/null +++ b/Lang/VBA/Pythagorean-triples @@ -0,0 +1 @@ +../../Task/Pythagorean-triples/VBA \ No newline at end of file diff --git a/Lang/VBA/QR-decomposition b/Lang/VBA/QR-decomposition new file mode 120000 index 0000000000..dbccca8a75 --- /dev/null +++ b/Lang/VBA/QR-decomposition @@ -0,0 +1 @@ +../../Task/QR-decomposition/VBA \ No newline at end of file diff --git a/Lang/VBA/Quaternion-type b/Lang/VBA/Quaternion-type new file mode 120000 index 0000000000..b9d823193e --- /dev/null +++ b/Lang/VBA/Quaternion-type @@ -0,0 +1 @@ +../../Task/Quaternion-type/VBA \ No newline at end of file diff --git a/Lang/VBA/Queue-Definition b/Lang/VBA/Queue-Definition new file mode 120000 index 0000000000..5349928700 --- /dev/null +++ b/Lang/VBA/Queue-Definition @@ -0,0 +1 @@ +../../Task/Queue-Definition/VBA \ No newline at end of file diff --git a/Lang/VBA/Queue-Usage b/Lang/VBA/Queue-Usage new file mode 120000 index 0000000000..e623a9510a --- /dev/null +++ b/Lang/VBA/Queue-Usage @@ -0,0 +1 @@ +../../Task/Queue-Usage/VBA \ No newline at end of file diff --git a/Lang/VBA/Quickselect-algorithm b/Lang/VBA/Quickselect-algorithm new file mode 120000 index 0000000000..4833cde2ae --- /dev/null +++ b/Lang/VBA/Quickselect-algorithm @@ -0,0 +1 @@ +../../Task/Quickselect-algorithm/VBA \ No newline at end of file diff --git a/Lang/VBA/Quine b/Lang/VBA/Quine new file mode 120000 index 0000000000..cef141e622 --- /dev/null +++ b/Lang/VBA/Quine @@ -0,0 +1 @@ +../../Task/Quine/VBA \ No newline at end of file diff --git a/Lang/VBA/Reduced-row-echelon-form b/Lang/VBA/Reduced-row-echelon-form new file mode 120000 index 0000000000..fc6ea5be41 --- /dev/null +++ b/Lang/VBA/Reduced-row-echelon-form @@ -0,0 +1 @@ +../../Task/Reduced-row-echelon-form/VBA \ No newline at end of file diff --git a/Lang/VBA/Roman-numerals-Encode b/Lang/VBA/Roman-numerals-Encode new file mode 120000 index 0000000000..5d9abf5760 --- /dev/null +++ b/Lang/VBA/Roman-numerals-Encode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Encode/VBA \ No newline at end of file diff --git a/Lang/VBA/Roots-of-unity b/Lang/VBA/Roots-of-unity new file mode 120000 index 0000000000..554e9c2d9a --- /dev/null +++ b/Lang/VBA/Roots-of-unity @@ -0,0 +1 @@ +../../Task/Roots-of-unity/VBA \ No newline at end of file diff --git a/Lang/VBA/Search-a-list b/Lang/VBA/Search-a-list new file mode 120000 index 0000000000..e9a468f0ba --- /dev/null +++ b/Lang/VBA/Search-a-list @@ -0,0 +1 @@ +../../Task/Search-a-list/VBA \ No newline at end of file diff --git a/Lang/VBA/Set b/Lang/VBA/Set new file mode 120000 index 0000000000..02143e33d3 --- /dev/null +++ b/Lang/VBA/Set @@ -0,0 +1 @@ +../../Task/Set/VBA \ No newline at end of file diff --git a/Lang/VBA/Set-consolidation b/Lang/VBA/Set-consolidation new file mode 120000 index 0000000000..101295ef32 --- /dev/null +++ b/Lang/VBA/Set-consolidation @@ -0,0 +1 @@ +../../Task/Set-consolidation/VBA \ No newline at end of file diff --git a/Lang/VBA/Seven-sided-dice-from-five-sided-dice b/Lang/VBA/Seven-sided-dice-from-five-sided-dice new file mode 120000 index 0000000000..9a16407d0e --- /dev/null +++ b/Lang/VBA/Seven-sided-dice-from-five-sided-dice @@ -0,0 +1 @@ +../../Task/Seven-sided-dice-from-five-sided-dice/VBA \ No newline at end of file diff --git a/Lang/VBA/Short-circuit-evaluation b/Lang/VBA/Short-circuit-evaluation new file mode 120000 index 0000000000..8ccee9f9ea --- /dev/null +++ b/Lang/VBA/Short-circuit-evaluation @@ -0,0 +1 @@ +../../Task/Short-circuit-evaluation/VBA \ No newline at end of file diff --git a/Lang/VBA/Sierpinski-carpet b/Lang/VBA/Sierpinski-carpet new file mode 120000 index 0000000000..c7a72b8485 --- /dev/null +++ b/Lang/VBA/Sierpinski-carpet @@ -0,0 +1 @@ +../../Task/Sierpinski-carpet/VBA \ No newline at end of file diff --git a/Lang/VBA/Sierpinski-triangle b/Lang/VBA/Sierpinski-triangle new file mode 120000 index 0000000000..d7c88056ef --- /dev/null +++ b/Lang/VBA/Sierpinski-triangle @@ -0,0 +1 @@ +../../Task/Sierpinski-triangle/VBA \ No newline at end of file diff --git a/Lang/VBA/Sieve-of-Eratosthenes b/Lang/VBA/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..7feeaec9eb --- /dev/null +++ b/Lang/VBA/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Bead-sort b/Lang/VBA/Sorting-algorithms-Bead-sort new file mode 120000 index 0000000000..11740d1c85 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Bead-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bead-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Bogosort b/Lang/VBA/Sorting-algorithms-Bogosort new file mode 120000 index 0000000000..653f34f968 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Bogosort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bogosort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Bubble-sort b/Lang/VBA/Sorting-algorithms-Bubble-sort new file mode 120000 index 0000000000..b782ea7afb --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Bubble-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bubble-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Cocktail-sort b/Lang/VBA/Sorting-algorithms-Cocktail-sort new file mode 120000 index 0000000000..5a264685e9 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Cocktail-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Cocktail-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Comb-sort b/Lang/VBA/Sorting-algorithms-Comb-sort new file mode 120000 index 0000000000..7c959be204 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Comb-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Comb-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Counting-sort b/Lang/VBA/Sorting-algorithms-Counting-sort new file mode 120000 index 0000000000..88be0e37cb --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Counting-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Counting-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Gnome-sort b/Lang/VBA/Sorting-algorithms-Gnome-sort new file mode 120000 index 0000000000..687330cd83 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Gnome-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Gnome-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Sorting-algorithms-Insertion-sort b/Lang/VBA/Sorting-algorithms-Insertion-sort new file mode 120000 index 0000000000..7eceec13c9 --- /dev/null +++ b/Lang/VBA/Sorting-algorithms-Insertion-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Insertion-sort/VBA \ No newline at end of file diff --git a/Lang/VBA/Statistics-Basic b/Lang/VBA/Statistics-Basic new file mode 120000 index 0000000000..af3e40e68a --- /dev/null +++ b/Lang/VBA/Statistics-Basic @@ -0,0 +1 @@ +../../Task/Statistics-Basic/VBA \ No newline at end of file diff --git a/Lang/VBA/String-matching b/Lang/VBA/String-matching new file mode 120000 index 0000000000..89fb8e5b90 --- /dev/null +++ b/Lang/VBA/String-matching @@ -0,0 +1 @@ +../../Task/String-matching/VBA \ No newline at end of file diff --git a/Lang/VBA/Strip-block-comments b/Lang/VBA/Strip-block-comments new file mode 120000 index 0000000000..005deb2153 --- /dev/null +++ b/Lang/VBA/Strip-block-comments @@ -0,0 +1 @@ +../../Task/Strip-block-comments/VBA \ No newline at end of file diff --git a/Lang/VBA/Strip-whitespace-from-a-string-Top-and-tail b/Lang/VBA/Strip-whitespace-from-a-string-Top-and-tail new file mode 120000 index 0000000000..9d19804b43 --- /dev/null +++ b/Lang/VBA/Strip-whitespace-from-a-string-Top-and-tail @@ -0,0 +1 @@ +../../Task/Strip-whitespace-from-a-string-Top-and-tail/VBA \ No newline at end of file diff --git a/Lang/VBA/Substring b/Lang/VBA/Substring new file mode 120000 index 0000000000..ff88febc92 --- /dev/null +++ b/Lang/VBA/Substring @@ -0,0 +1 @@ +../../Task/Substring/VBA \ No newline at end of file diff --git a/Lang/VBA/Sum-and-product-of-an-array b/Lang/VBA/Sum-and-product-of-an-array new file mode 120000 index 0000000000..47b02dae26 --- /dev/null +++ b/Lang/VBA/Sum-and-product-of-an-array @@ -0,0 +1 @@ +../../Task/Sum-and-product-of-an-array/VBA \ No newline at end of file diff --git a/Lang/VBA/Sum-of-a-series b/Lang/VBA/Sum-of-a-series new file mode 120000 index 0000000000..2b5de4bfcd --- /dev/null +++ b/Lang/VBA/Sum-of-a-series @@ -0,0 +1 @@ +../../Task/Sum-of-a-series/VBA \ No newline at end of file diff --git a/Lang/VBA/Sum-of-squares b/Lang/VBA/Sum-of-squares new file mode 120000 index 0000000000..3500730b2b --- /dev/null +++ b/Lang/VBA/Sum-of-squares @@ -0,0 +1 @@ +../../Task/Sum-of-squares/VBA \ No newline at end of file diff --git a/Lang/VBA/Time-a-function b/Lang/VBA/Time-a-function new file mode 120000 index 0000000000..270a6fb6dd --- /dev/null +++ b/Lang/VBA/Time-a-function @@ -0,0 +1 @@ +../../Task/Time-a-function/VBA \ No newline at end of file diff --git a/Lang/VBA/Top-rank-per-group b/Lang/VBA/Top-rank-per-group new file mode 120000 index 0000000000..9bef720141 --- /dev/null +++ b/Lang/VBA/Top-rank-per-group @@ -0,0 +1 @@ +../../Task/Top-rank-per-group/VBA \ No newline at end of file diff --git a/Lang/VBA/Total-circles-area b/Lang/VBA/Total-circles-area new file mode 120000 index 0000000000..dcb1bf88c7 --- /dev/null +++ b/Lang/VBA/Total-circles-area @@ -0,0 +1 @@ +../../Task/Total-circles-area/VBA \ No newline at end of file diff --git a/Lang/VBA/Tree-traversal b/Lang/VBA/Tree-traversal new file mode 120000 index 0000000000..2ee9c67984 --- /dev/null +++ b/Lang/VBA/Tree-traversal @@ -0,0 +1 @@ +../../Task/Tree-traversal/VBA \ No newline at end of file diff --git a/Lang/VBA/Trigonometric-functions b/Lang/VBA/Trigonometric-functions new file mode 120000 index 0000000000..6d7283ba59 --- /dev/null +++ b/Lang/VBA/Trigonometric-functions @@ -0,0 +1 @@ +../../Task/Trigonometric-functions/VBA \ No newline at end of file diff --git a/Lang/VBA/Twelve-statements b/Lang/VBA/Twelve-statements new file mode 120000 index 0000000000..e65831e911 --- /dev/null +++ b/Lang/VBA/Twelve-statements @@ -0,0 +1 @@ +../../Task/Twelve-statements/VBA \ No newline at end of file diff --git a/Lang/VBA/Universal-Turing-machine b/Lang/VBA/Universal-Turing-machine new file mode 120000 index 0000000000..8826c39479 --- /dev/null +++ b/Lang/VBA/Universal-Turing-machine @@ -0,0 +1 @@ +../../Task/Universal-Turing-machine/VBA \ No newline at end of file diff --git a/Lang/VBA/User-input-Text b/Lang/VBA/User-input-Text new file mode 120000 index 0000000000..fac59f6596 --- /dev/null +++ b/Lang/VBA/User-input-Text @@ -0,0 +1 @@ +../../Task/User-input-Text/VBA \ No newline at end of file diff --git a/Lang/VBA/Van-der-Corput-sequence b/Lang/VBA/Van-der-Corput-sequence new file mode 120000 index 0000000000..741360cbe8 --- /dev/null +++ b/Lang/VBA/Van-der-Corput-sequence @@ -0,0 +1 @@ +../../Task/Van-der-Corput-sequence/VBA \ No newline at end of file diff --git a/Lang/VBA/Vector-products b/Lang/VBA/Vector-products new file mode 120000 index 0000000000..56a084fbf3 --- /dev/null +++ b/Lang/VBA/Vector-products @@ -0,0 +1 @@ +../../Task/Vector-products/VBA \ No newline at end of file diff --git a/Lang/VBA/Verify-distribution-uniformity-Chi-squared-test b/Lang/VBA/Verify-distribution-uniformity-Chi-squared-test new file mode 120000 index 0000000000..0a2ab85267 --- /dev/null +++ b/Lang/VBA/Verify-distribution-uniformity-Chi-squared-test @@ -0,0 +1 @@ +../../Task/Verify-distribution-uniformity-Chi-squared-test/VBA \ No newline at end of file diff --git a/Lang/VBA/Write-float-arrays-to-a-text-file b/Lang/VBA/Write-float-arrays-to-a-text-file new file mode 120000 index 0000000000..7b20c14f47 --- /dev/null +++ b/Lang/VBA/Write-float-arrays-to-a-text-file @@ -0,0 +1 @@ +../../Task/Write-float-arrays-to-a-text-file/VBA \ No newline at end of file diff --git a/Lang/VBA/Y-combinator b/Lang/VBA/Y-combinator new file mode 120000 index 0000000000..6164af075d --- /dev/null +++ b/Lang/VBA/Y-combinator @@ -0,0 +1 @@ +../../Task/Y-combinator/VBA \ No newline at end of file diff --git a/Lang/VBA/Zebra-puzzle b/Lang/VBA/Zebra-puzzle new file mode 120000 index 0000000000..ed085d31ee --- /dev/null +++ b/Lang/VBA/Zebra-puzzle @@ -0,0 +1 @@ +../../Task/Zebra-puzzle/VBA \ No newline at end of file diff --git a/Lang/VBA/Zeckendorf-number-representation b/Lang/VBA/Zeckendorf-number-representation new file mode 120000 index 0000000000..c7fb4e3387 --- /dev/null +++ b/Lang/VBA/Zeckendorf-number-representation @@ -0,0 +1 @@ +../../Task/Zeckendorf-number-representation/VBA \ No newline at end of file diff --git a/Lang/VBA/Zero-to-the-zero-power b/Lang/VBA/Zero-to-the-zero-power new file mode 120000 index 0000000000..46f28495f7 --- /dev/null +++ b/Lang/VBA/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/VBA \ No newline at end of file diff --git a/Lang/VBA/Zhang-Suen-thinning-algorithm b/Lang/VBA/Zhang-Suen-thinning-algorithm new file mode 120000 index 0000000000..779b2d678c --- /dev/null +++ b/Lang/VBA/Zhang-Suen-thinning-algorithm @@ -0,0 +1 @@ +../../Task/Zhang-Suen-thinning-algorithm/VBA \ No newline at end of file diff --git a/Lang/VBScript/Align-columns b/Lang/VBScript/Align-columns new file mode 120000 index 0000000000..8e2cc19c4b --- /dev/null +++ b/Lang/VBScript/Align-columns @@ -0,0 +1 @@ +../../Task/Align-columns/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Bitmap-Bresenhams-line-algorithm b/Lang/VBScript/Bitmap-Bresenhams-line-algorithm new file mode 120000 index 0000000000..af992d28df --- /dev/null +++ b/Lang/VBScript/Bitmap-Bresenhams-line-algorithm @@ -0,0 +1 @@ +../../Task/Bitmap-Bresenhams-line-algorithm/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Boolean-values b/Lang/VBScript/Boolean-values new file mode 120000 index 0000000000..3d44579132 --- /dev/null +++ b/Lang/VBScript/Boolean-values @@ -0,0 +1 @@ +../../Task/Boolean-values/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Gaussian-elimination b/Lang/VBScript/Gaussian-elimination new file mode 120000 index 0000000000..33ceae1be9 --- /dev/null +++ b/Lang/VBScript/Gaussian-elimination @@ -0,0 +1 @@ +../../Task/Gaussian-elimination/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Last-letter-first-letter b/Lang/VBScript/Last-letter-first-letter new file mode 120000 index 0000000000..01d68d789e --- /dev/null +++ b/Lang/VBScript/Last-letter-first-letter @@ -0,0 +1 @@ +../../Task/Last-letter-first-letter/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Queue-Definition b/Lang/VBScript/Queue-Definition new file mode 120000 index 0000000000..920bfaf26e --- /dev/null +++ b/Lang/VBScript/Queue-Definition @@ -0,0 +1 @@ +../../Task/Queue-Definition/VBScript \ No newline at end of file diff --git a/Lang/VBScript/Roman-numerals-Decode b/Lang/VBScript/Roman-numerals-Decode new file mode 120000 index 0000000000..2df6c0a6ab --- /dev/null +++ b/Lang/VBScript/Roman-numerals-Decode @@ -0,0 +1 @@ +../../Task/Roman-numerals-Decode/VBScript \ No newline at end of file diff --git a/Lang/VHDL/Arrays b/Lang/VHDL/Arrays new file mode 120000 index 0000000000..0fc4a681a8 --- /dev/null +++ b/Lang/VHDL/Arrays @@ -0,0 +1 @@ +../../Task/Arrays/VHDL \ No newline at end of file diff --git a/Lang/Vala/00DESCRIPTION b/Lang/Vala/00DESCRIPTION index d1bd8ba5ac..0d0146746f 100644 --- a/Lang/Vala/00DESCRIPTION +++ b/Lang/Vala/00DESCRIPTION @@ -11,4 +11,6 @@ |tags=vala |LCT=no }} -'''Vala''' is a programming language created with the goal of bringing modern language features to [[C]], with no added runtime requirements and with little overhead, by targeting the GObject object system. It is being developed by Jürg Billeter and Raffaele Sandrini. The syntax borrows heavily from [[C#]]. Rather than being compiled directly to assembler or to another intermediate language, Vala is compiled to C which is then compiled with a platform's standard C compiler. \ No newline at end of file +'''Vala''' is a programming language created with the goal of bringing modern language features to [[C]], with no added runtime requirements and with little overhead, by targeting the GObject object system. It is being developed by Jürg Billeter and Raffaele Sandrini. The syntax borrows heavily from [[C#]]. Rather than being compiled directly to assembler or other intermediate representation, Vala is compiled to C source, which is then compiled with a platform's standard C compiler. + +The '''valac''' compiler also supports a language dialect called [[Genie]], that more closely resembles [[Python]] syntax. '''Genie''' syntax requires indentation based code structure blocking. The '''Genie''' dialect is also compiled to C on way to native executable by '''valac'''. \ No newline at end of file diff --git a/Lang/Vala/Hello-world-Graphical b/Lang/Vala/Hello-world-Graphical new file mode 120000 index 0000000000..0df1183d02 --- /dev/null +++ b/Lang/Vala/Hello-world-Graphical @@ -0,0 +1 @@ +../../Task/Hello-world-Graphical/Vala \ No newline at end of file diff --git a/Lang/Verilog/Greatest-common-divisor b/Lang/Verilog/Greatest-common-divisor new file mode 120000 index 0000000000..55154df8f8 --- /dev/null +++ b/Lang/Verilog/Greatest-common-divisor @@ -0,0 +1 @@ +../../Task/Greatest-common-divisor/Verilog \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/00DESCRIPTION b/Lang/Visual-Basic-.NET/00DESCRIPTION index 86daf78fdc..fbd7549264 100644 --- a/Lang/Visual-Basic-.NET/00DESCRIPTION +++ b/Lang/Visual-Basic-.NET/00DESCRIPTION @@ -8,7 +8,7 @@ |LCT=yes}}[[runs on vm::common language runtime| ]]{{language programming paradigm|Object-oriented}}{{collection|Visual Studio}} From the [http://msdn.microsoft.com/en-us/vbasic/ Visual Basic Developer Center] website: "With Visual Basic, you can create applications for Windows, the Web, mobile devices, and Office on the .NET Framework". Visual Basic .NET makes it easy to create [[Windows]] form applications quickly and efficiently. The language is [[object-oriented]] and has unique features to speed development and deployment. -Visual Basic .NET, like C# and other .NET languages, runs on the Microsoft [[runs on vm::Common Language Runtime|Common Language Runtime]] VM. +Visual Basic .NET, like [[C sharp|C#]] and other .NET languages, runs on the Microsoft [[runs on vm::Common Language Runtime|Common Language Runtime]] VM. Not to be confused with [[:Category:Visual Basic|Visual Basic]], the original pre-.NET, implementation, which has only a passing resemblance to VB.NET. diff --git a/Lang/Visual-Basic-.NET/Abundant,-deficient-and-perfect-number-classifications b/Lang/Visual-Basic-.NET/Abundant,-deficient-and-perfect-number-classifications new file mode 120000 index 0000000000..97021a0a39 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Abundant,-deficient-and-perfect-number-classifications @@ -0,0 +1 @@ +../../Task/Abundant,-deficient-and-perfect-number-classifications/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Almost-prime b/Lang/Visual-Basic-.NET/Almost-prime new file mode 120000 index 0000000000..8d8175b0e0 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Almost-prime @@ -0,0 +1 @@ +../../Task/Almost-prime/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Apply-a-callback-to-an-array b/Lang/Visual-Basic-.NET/Apply-a-callback-to-an-array new file mode 120000 index 0000000000..6b71d8483f --- /dev/null +++ b/Lang/Visual-Basic-.NET/Apply-a-callback-to-an-array @@ -0,0 +1 @@ +../../Task/Apply-a-callback-to-an-array/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Arbitrary-precision-integers--included- b/Lang/Visual-Basic-.NET/Arbitrary-precision-integers--included- new file mode 120000 index 0000000000..73b6bf7a0a --- /dev/null +++ b/Lang/Visual-Basic-.NET/Arbitrary-precision-integers--included- @@ -0,0 +1 @@ +../../Task/Arbitrary-precision-integers--included-/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean b/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean new file mode 120000 index 0000000000..ae9b5aa1f8 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean-Calculate-Pi b/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean-Calculate-Pi new file mode 120000 index 0000000000..1c37b4cc57 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Arithmetic-geometric-mean-Calculate-Pi @@ -0,0 +1 @@ +../../Task/Arithmetic-geometric-mean-Calculate-Pi/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Averages-Mean-angle b/Lang/Visual-Basic-.NET/Averages-Mean-angle new file mode 120000 index 0000000000..445b59b24f --- /dev/null +++ b/Lang/Visual-Basic-.NET/Averages-Mean-angle @@ -0,0 +1 @@ +../../Task/Averages-Mean-angle/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Averages-Pythagorean-means b/Lang/Visual-Basic-.NET/Averages-Pythagorean-means new file mode 120000 index 0000000000..067e3576a8 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Averages-Pythagorean-means @@ -0,0 +1 @@ +../../Task/Averages-Pythagorean-means/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Break-OO-privacy b/Lang/Visual-Basic-.NET/Break-OO-privacy new file mode 120000 index 0000000000..574039f3da --- /dev/null +++ b/Lang/Visual-Basic-.NET/Break-OO-privacy @@ -0,0 +1 @@ +../../Task/Break-OO-privacy/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/CSV-to-HTML-translation b/Lang/Visual-Basic-.NET/CSV-to-HTML-translation new file mode 120000 index 0000000000..b8e31a3a0d --- /dev/null +++ b/Lang/Visual-Basic-.NET/CSV-to-HTML-translation @@ -0,0 +1 @@ +../../Task/CSV-to-HTML-translation/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Caesar-cipher b/Lang/Visual-Basic-.NET/Caesar-cipher new file mode 120000 index 0000000000..7cb82dfd1d --- /dev/null +++ b/Lang/Visual-Basic-.NET/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Calendar b/Lang/Visual-Basic-.NET/Calendar new file mode 120000 index 0000000000..6fe4615cb3 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Calendar @@ -0,0 +1 @@ +../../Task/Calendar/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Calendar---for-REAL-programmers b/Lang/Visual-Basic-.NET/Calendar---for-REAL-programmers new file mode 120000 index 0000000000..1e4f1e3ab1 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Calendar---for-REAL-programmers @@ -0,0 +1 @@ +../../Task/Calendar---for-REAL-programmers/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Catalan-numbers b/Lang/Visual-Basic-.NET/Catalan-numbers new file mode 120000 index 0000000000..ee72f6e69b --- /dev/null +++ b/Lang/Visual-Basic-.NET/Catalan-numbers @@ -0,0 +1 @@ +../../Task/Catalan-numbers/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Chat-server b/Lang/Visual-Basic-.NET/Chat-server new file mode 120000 index 0000000000..a0ecc3f60a --- /dev/null +++ b/Lang/Visual-Basic-.NET/Chat-server @@ -0,0 +1 @@ +../../Task/Chat-server/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Check-Machin-like-formulas b/Lang/Visual-Basic-.NET/Check-Machin-like-formulas new file mode 120000 index 0000000000..183ab75c20 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Check-Machin-like-formulas @@ -0,0 +1 @@ +../../Task/Check-Machin-like-formulas/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Chinese-remainder-theorem b/Lang/Visual-Basic-.NET/Chinese-remainder-theorem new file mode 120000 index 0000000000..2b6c3e8281 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Chinese-remainder-theorem @@ -0,0 +1 @@ +../../Task/Chinese-remainder-theorem/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Circles-of-given-radius-through-two-points b/Lang/Visual-Basic-.NET/Circles-of-given-radius-through-two-points new file mode 120000 index 0000000000..0bfc4a3948 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Circles-of-given-radius-through-two-points @@ -0,0 +1 @@ +../../Task/Circles-of-given-radius-through-two-points/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Comma-quibbling b/Lang/Visual-Basic-.NET/Comma-quibbling new file mode 120000 index 0000000000..0f7ba56a92 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Comma-quibbling @@ -0,0 +1 @@ +../../Task/Comma-quibbling/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Compile-time-calculation b/Lang/Visual-Basic-.NET/Compile-time-calculation new file mode 120000 index 0000000000..c05d811a65 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Compile-time-calculation @@ -0,0 +1 @@ +../../Task/Compile-time-calculation/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Continued-fraction b/Lang/Visual-Basic-.NET/Continued-fraction new file mode 120000 index 0000000000..70347126dd --- /dev/null +++ b/Lang/Visual-Basic-.NET/Continued-fraction @@ -0,0 +1 @@ +../../Task/Continued-fraction/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Count-occurrences-of-a-substring b/Lang/Visual-Basic-.NET/Count-occurrences-of-a-substring new file mode 120000 index 0000000000..bf6b4bdd23 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Count-occurrences-of-a-substring @@ -0,0 +1 @@ +../../Task/Count-occurrences-of-a-substring/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Create-a-two-dimensional-array-at-runtime b/Lang/Visual-Basic-.NET/Create-a-two-dimensional-array-at-runtime new file mode 120000 index 0000000000..155b56b4ba --- /dev/null +++ b/Lang/Visual-Basic-.NET/Create-a-two-dimensional-array-at-runtime @@ -0,0 +1 @@ +../../Task/Create-a-two-dimensional-array-at-runtime/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Create-an-HTML-table b/Lang/Visual-Basic-.NET/Create-an-HTML-table new file mode 120000 index 0000000000..ca076a70e7 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Create-an-HTML-table @@ -0,0 +1 @@ +../../Task/Create-an-HTML-table/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Currying b/Lang/Visual-Basic-.NET/Currying new file mode 120000 index 0000000000..4576ea8da2 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Currying @@ -0,0 +1 @@ +../../Task/Currying/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Digital-root b/Lang/Visual-Basic-.NET/Digital-root new file mode 120000 index 0000000000..e9ea2f6943 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Digital-root @@ -0,0 +1 @@ +../../Task/Digital-root/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Dot-product b/Lang/Visual-Basic-.NET/Dot-product new file mode 120000 index 0000000000..b9a3dda623 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Empty-string b/Lang/Visual-Basic-.NET/Empty-string new file mode 120000 index 0000000000..bae26d45fe --- /dev/null +++ b/Lang/Visual-Basic-.NET/Empty-string @@ -0,0 +1 @@ +../../Task/Empty-string/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Even-or-odd b/Lang/Visual-Basic-.NET/Even-or-odd new file mode 120000 index 0000000000..7a356f99b2 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Even-or-odd @@ -0,0 +1 @@ +../../Task/Even-or-odd/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Exceptions-Catch-an-exception-thrown-in-a-nested-call b/Lang/Visual-Basic-.NET/Exceptions-Catch-an-exception-thrown-in-a-nested-call new file mode 120000 index 0000000000..b7b41170ff --- /dev/null +++ b/Lang/Visual-Basic-.NET/Exceptions-Catch-an-exception-thrown-in-a-nested-call @@ -0,0 +1 @@ +../../Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Factorial b/Lang/Visual-Basic-.NET/Factorial new file mode 120000 index 0000000000..17337b5724 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Floyds-triangle b/Lang/Visual-Basic-.NET/Floyds-triangle new file mode 120000 index 0000000000..956cdfccfc --- /dev/null +++ b/Lang/Visual-Basic-.NET/Floyds-triangle @@ -0,0 +1 @@ +../../Task/Floyds-triangle/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/GUI-Maximum-window-dimensions b/Lang/Visual-Basic-.NET/GUI-Maximum-window-dimensions new file mode 120000 index 0000000000..108f4a3abf --- /dev/null +++ b/Lang/Visual-Basic-.NET/GUI-Maximum-window-dimensions @@ -0,0 +1 @@ +../../Task/GUI-Maximum-window-dimensions/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Generator-Exponential b/Lang/Visual-Basic-.NET/Generator-Exponential new file mode 120000 index 0000000000..7cc806852f --- /dev/null +++ b/Lang/Visual-Basic-.NET/Generator-Exponential @@ -0,0 +1 @@ +../../Task/Generator-Exponential/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Guess-the-number b/Lang/Visual-Basic-.NET/Guess-the-number new file mode 120000 index 0000000000..02a44b6554 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Guess-the-number @@ -0,0 +1 @@ +../../Task/Guess-the-number/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Haversine-formula b/Lang/Visual-Basic-.NET/Haversine-formula new file mode 120000 index 0000000000..437ce50300 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Haversine-formula @@ -0,0 +1 @@ +../../Task/Haversine-formula/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Hello-world-Newline-omission b/Lang/Visual-Basic-.NET/Hello-world-Newline-omission new file mode 120000 index 0000000000..d21e31a1b0 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Hello-world-Newline-omission @@ -0,0 +1 @@ +../../Task/Hello-world-Newline-omission/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Hello-world-Standard-error b/Lang/Visual-Basic-.NET/Hello-world-Standard-error new file mode 120000 index 0000000000..54bec280e4 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Hello-world-Standard-error @@ -0,0 +1 @@ +../../Task/Hello-world-Standard-error/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Higher-order-functions b/Lang/Visual-Basic-.NET/Higher-order-functions new file mode 120000 index 0000000000..0413c1dc3c --- /dev/null +++ b/Lang/Visual-Basic-.NET/Higher-order-functions @@ -0,0 +1 @@ +../../Task/Higher-order-functions/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Horners-rule-for-polynomial-evaluation b/Lang/Visual-Basic-.NET/Horners-rule-for-polynomial-evaluation new file mode 120000 index 0000000000..b9bdb575c3 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Horners-rule-for-polynomial-evaluation @@ -0,0 +1 @@ +../../Task/Horners-rule-for-polynomial-evaluation/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/I-before-E-except-after-C b/Lang/Visual-Basic-.NET/I-before-E-except-after-C new file mode 120000 index 0000000000..a12a9d34fc --- /dev/null +++ b/Lang/Visual-Basic-.NET/I-before-E-except-after-C @@ -0,0 +1 @@ +../../Task/I-before-E-except-after-C/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Josephus-problem b/Lang/Visual-Basic-.NET/Josephus-problem new file mode 120000 index 0000000000..8900c58c14 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Kaprekar-numbers b/Lang/Visual-Basic-.NET/Kaprekar-numbers new file mode 120000 index 0000000000..26a3856631 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Kaprekar-numbers @@ -0,0 +1 @@ +../../Task/Kaprekar-numbers/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Leap-year b/Lang/Visual-Basic-.NET/Leap-year new file mode 120000 index 0000000000..c721a65554 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Leap-year @@ -0,0 +1 @@ +../../Task/Leap-year/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Loop-over-multiple-arrays-simultaneously b/Lang/Visual-Basic-.NET/Loop-over-multiple-arrays-simultaneously new file mode 120000 index 0000000000..4853dd6947 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Loop-over-multiple-arrays-simultaneously @@ -0,0 +1 @@ +../../Task/Loop-over-multiple-arrays-simultaneously/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Loops-Break b/Lang/Visual-Basic-.NET/Loops-Break new file mode 120000 index 0000000000..6e93622d57 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Loops-Break @@ -0,0 +1 @@ +../../Task/Loops-Break/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Loops-Nested b/Lang/Visual-Basic-.NET/Loops-Nested new file mode 120000 index 0000000000..239787f55b --- /dev/null +++ b/Lang/Visual-Basic-.NET/Loops-Nested @@ -0,0 +1 @@ +../../Task/Loops-Nested/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Mad-Libs b/Lang/Visual-Basic-.NET/Mad-Libs new file mode 120000 index 0000000000..502edbf739 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Mad-Libs @@ -0,0 +1 @@ +../../Task/Mad-Libs/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Make-directory-path b/Lang/Visual-Basic-.NET/Make-directory-path new file mode 120000 index 0000000000..2c8dfe2c6a --- /dev/null +++ b/Lang/Visual-Basic-.NET/Make-directory-path @@ -0,0 +1 @@ +../../Task/Make-directory-path/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Modular-exponentiation b/Lang/Visual-Basic-.NET/Modular-exponentiation new file mode 120000 index 0000000000..22d7fdcb19 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Modular-exponentiation @@ -0,0 +1 @@ +../../Task/Modular-exponentiation/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Palindrome-detection b/Lang/Visual-Basic-.NET/Palindrome-detection new file mode 120000 index 0000000000..dd1e1852e6 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Palindrome-detection @@ -0,0 +1 @@ +../../Task/Palindrome-detection/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Parsing-RPN-to-infix-conversion b/Lang/Visual-Basic-.NET/Parsing-RPN-to-infix-conversion new file mode 120000 index 0000000000..f77f07a38e --- /dev/null +++ b/Lang/Visual-Basic-.NET/Parsing-RPN-to-infix-conversion @@ -0,0 +1 @@ +../../Task/Parsing-RPN-to-infix-conversion/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Parsing-Shunting-yard-algorithm b/Lang/Visual-Basic-.NET/Parsing-Shunting-yard-algorithm new file mode 120000 index 0000000000..10cd67e50b --- /dev/null +++ b/Lang/Visual-Basic-.NET/Parsing-Shunting-yard-algorithm @@ -0,0 +1 @@ +../../Task/Parsing-Shunting-yard-algorithm/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Partial-function-application b/Lang/Visual-Basic-.NET/Partial-function-application new file mode 120000 index 0000000000..dec5d570c5 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Partial-function-application @@ -0,0 +1 @@ +../../Task/Partial-function-application/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Pascals-triangle b/Lang/Visual-Basic-.NET/Pascals-triangle new file mode 120000 index 0000000000..de107ccf58 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Pascals-triangle @@ -0,0 +1 @@ +../../Task/Pascals-triangle/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Pernicious-numbers b/Lang/Visual-Basic-.NET/Pernicious-numbers new file mode 120000 index 0000000000..7dab9795ea --- /dev/null +++ b/Lang/Visual-Basic-.NET/Pernicious-numbers @@ -0,0 +1 @@ +../../Task/Pernicious-numbers/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Pi b/Lang/Visual-Basic-.NET/Pi new file mode 120000 index 0000000000..9b1615a974 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Pi @@ -0,0 +1 @@ +../../Task/Pi/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Pick-random-element b/Lang/Visual-Basic-.NET/Pick-random-element new file mode 120000 index 0000000000..ef1fcf4cfd --- /dev/null +++ b/Lang/Visual-Basic-.NET/Pick-random-element @@ -0,0 +1 @@ +../../Task/Pick-random-element/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Quaternion-type b/Lang/Visual-Basic-.NET/Quaternion-type new file mode 120000 index 0000000000..111784d7c2 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Quaternion-type @@ -0,0 +1 @@ +../../Task/Quaternion-type/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Quine b/Lang/Visual-Basic-.NET/Quine new file mode 120000 index 0000000000..c2a8628824 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Quine @@ -0,0 +1 @@ +../../Task/Quine/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/RSA-code b/Lang/Visual-Basic-.NET/RSA-code new file mode 120000 index 0000000000..44ed5db3b1 --- /dev/null +++ b/Lang/Visual-Basic-.NET/RSA-code @@ -0,0 +1 @@ +../../Task/RSA-code/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Short-circuit-evaluation b/Lang/Visual-Basic-.NET/Short-circuit-evaluation new file mode 120000 index 0000000000..33c747de96 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Short-circuit-evaluation @@ -0,0 +1 @@ +../../Task/Short-circuit-evaluation/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Sleep b/Lang/Visual-Basic-.NET/Sleep new file mode 120000 index 0000000000..ed1a257099 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Sleep @@ -0,0 +1 @@ +../../Task/Sleep/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Start-from-a-main-routine b/Lang/Visual-Basic-.NET/Start-from-a-main-routine new file mode 120000 index 0000000000..d827e05d2f --- /dev/null +++ b/Lang/Visual-Basic-.NET/Start-from-a-main-routine @@ -0,0 +1 @@ +../../Task/Start-from-a-main-routine/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Stern-Brocot-sequence b/Lang/Visual-Basic-.NET/Stern-Brocot-sequence new file mode 120000 index 0000000000..83f2730692 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Stern-Brocot-sequence @@ -0,0 +1 @@ +../../Task/Stern-Brocot-sequence/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/String-length b/Lang/Visual-Basic-.NET/String-length new file mode 120000 index 0000000000..b8d8ad742f --- /dev/null +++ b/Lang/Visual-Basic-.NET/String-length @@ -0,0 +1 @@ +../../Task/String-length/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Sum-and-product-of-an-array b/Lang/Visual-Basic-.NET/Sum-and-product-of-an-array new file mode 120000 index 0000000000..156f1de7b0 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Sum-and-product-of-an-array @@ -0,0 +1 @@ +../../Task/Sum-and-product-of-an-array/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Terminal-control-Clear-the-screen b/Lang/Visual-Basic-.NET/Terminal-control-Clear-the-screen new file mode 120000 index 0000000000..60828f60e9 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Terminal-control-Clear-the-screen @@ -0,0 +1 @@ +../../Task/Terminal-control-Clear-the-screen/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/The-Twelve-Days-of-Christmas b/Lang/Visual-Basic-.NET/The-Twelve-Days-of-Christmas new file mode 120000 index 0000000000..7436b8d4bc --- /dev/null +++ b/Lang/Visual-Basic-.NET/The-Twelve-Days-of-Christmas @@ -0,0 +1 @@ +../../Task/The-Twelve-Days-of-Christmas/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Trigonometric-functions b/Lang/Visual-Basic-.NET/Trigonometric-functions new file mode 120000 index 0000000000..e9fcbf9305 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Trigonometric-functions @@ -0,0 +1 @@ +../../Task/Trigonometric-functions/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Unicode-strings b/Lang/Visual-Basic-.NET/Unicode-strings new file mode 120000 index 0000000000..277580c91a --- /dev/null +++ b/Lang/Visual-Basic-.NET/Unicode-strings @@ -0,0 +1 @@ +../../Task/Unicode-strings/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Van-der-Corput-sequence b/Lang/Visual-Basic-.NET/Van-der-Corput-sequence new file mode 120000 index 0000000000..4bbefc541a --- /dev/null +++ b/Lang/Visual-Basic-.NET/Van-der-Corput-sequence @@ -0,0 +1 @@ +../../Task/Van-der-Corput-sequence/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Write-language-name-in-3D-ASCII b/Lang/Visual-Basic-.NET/Write-language-name-in-3D-ASCII new file mode 120000 index 0000000000..4f1a99931f --- /dev/null +++ b/Lang/Visual-Basic-.NET/Write-language-name-in-3D-ASCII @@ -0,0 +1 @@ +../../Task/Write-language-name-in-3D-ASCII/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic-.NET/Zero-to-the-zero-power b/Lang/Visual-Basic-.NET/Zero-to-the-zero-power new file mode 120000 index 0000000000..b9c139da49 --- /dev/null +++ b/Lang/Visual-Basic-.NET/Zero-to-the-zero-power @@ -0,0 +1 @@ +../../Task/Zero-to-the-zero-power/Visual-Basic-.NET \ No newline at end of file diff --git a/Lang/Visual-Basic/CRC-32 b/Lang/Visual-Basic/CRC-32 new file mode 120000 index 0000000000..c80a1a56ff --- /dev/null +++ b/Lang/Visual-Basic/CRC-32 @@ -0,0 +1 @@ +../../Task/CRC-32/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Count-the-coins b/Lang/Visual-Basic/Count-the-coins new file mode 120000 index 0000000000..fcfa256c4d --- /dev/null +++ b/Lang/Visual-Basic/Count-the-coins @@ -0,0 +1 @@ +../../Task/Count-the-coins/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Dot-product b/Lang/Visual-Basic/Dot-product new file mode 120000 index 0000000000..3b45d60632 --- /dev/null +++ b/Lang/Visual-Basic/Dot-product @@ -0,0 +1 @@ +../../Task/Dot-product/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Environment-variables b/Lang/Visual-Basic/Environment-variables new file mode 120000 index 0000000000..7ed02c64ef --- /dev/null +++ b/Lang/Visual-Basic/Environment-variables @@ -0,0 +1 @@ +../../Task/Environment-variables/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Factorial b/Lang/Visual-Basic/Factorial new file mode 120000 index 0000000000..2889498447 --- /dev/null +++ b/Lang/Visual-Basic/Factorial @@ -0,0 +1 @@ +../../Task/Factorial/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/File-size b/Lang/Visual-Basic/File-size new file mode 120000 index 0000000000..86925dcde7 --- /dev/null +++ b/Lang/Visual-Basic/File-size @@ -0,0 +1 @@ +../../Task/File-size/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Find-common-directory-path b/Lang/Visual-Basic/Find-common-directory-path new file mode 120000 index 0000000000..6c968076ff --- /dev/null +++ b/Lang/Visual-Basic/Find-common-directory-path @@ -0,0 +1 @@ +../../Task/Find-common-directory-path/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Greatest-common-divisor b/Lang/Visual-Basic/Greatest-common-divisor new file mode 120000 index 0000000000..b216dbabbd --- /dev/null +++ b/Lang/Visual-Basic/Greatest-common-divisor @@ -0,0 +1 @@ +../../Task/Greatest-common-divisor/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/HTTP b/Lang/Visual-Basic/HTTP new file mode 120000 index 0000000000..1d170129a4 --- /dev/null +++ b/Lang/Visual-Basic/HTTP @@ -0,0 +1 @@ +../../Task/HTTP/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/HTTPS b/Lang/Visual-Basic/HTTPS new file mode 120000 index 0000000000..ecc6337fb8 --- /dev/null +++ b/Lang/Visual-Basic/HTTPS @@ -0,0 +1 @@ +../../Task/HTTPS/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/HTTPS-Authenticated b/Lang/Visual-Basic/HTTPS-Authenticated new file mode 120000 index 0000000000..aa3a33d7dd --- /dev/null +++ b/Lang/Visual-Basic/HTTPS-Authenticated @@ -0,0 +1 @@ +../../Task/HTTPS-Authenticated/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Hello-world-Text b/Lang/Visual-Basic/Hello-world-Text new file mode 120000 index 0000000000..738f0a5a60 --- /dev/null +++ b/Lang/Visual-Basic/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Hostname b/Lang/Visual-Basic/Hostname new file mode 120000 index 0000000000..7d280d0e07 --- /dev/null +++ b/Lang/Visual-Basic/Hostname @@ -0,0 +1 @@ +../../Task/Hostname/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Identity-matrix b/Lang/Visual-Basic/Identity-matrix new file mode 120000 index 0000000000..11e2f884bf --- /dev/null +++ b/Lang/Visual-Basic/Identity-matrix @@ -0,0 +1 @@ +../../Task/Identity-matrix/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Levenshtein-distance b/Lang/Visual-Basic/Levenshtein-distance new file mode 120000 index 0000000000..07c3de3cfa --- /dev/null +++ b/Lang/Visual-Basic/Levenshtein-distance @@ -0,0 +1 @@ +../../Task/Levenshtein-distance/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Literals-Floating-point b/Lang/Visual-Basic/Literals-Floating-point new file mode 120000 index 0000000000..bb4bb9fd83 --- /dev/null +++ b/Lang/Visual-Basic/Literals-Floating-point @@ -0,0 +1 @@ +../../Task/Literals-Floating-point/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Literals-Integer b/Lang/Visual-Basic/Literals-Integer new file mode 120000 index 0000000000..7daa069c94 --- /dev/null +++ b/Lang/Visual-Basic/Literals-Integer @@ -0,0 +1 @@ +../../Task/Literals-Integer/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Literals-String b/Lang/Visual-Basic/Literals-String new file mode 120000 index 0000000000..f3d2b8af06 --- /dev/null +++ b/Lang/Visual-Basic/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Luhn-test-of-credit-card-numbers b/Lang/Visual-Basic/Luhn-test-of-credit-card-numbers new file mode 120000 index 0000000000..605dd799bc --- /dev/null +++ b/Lang/Visual-Basic/Luhn-test-of-credit-card-numbers @@ -0,0 +1 @@ +../../Task/Luhn-test-of-credit-card-numbers/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Matrix-transposition b/Lang/Visual-Basic/Matrix-transposition new file mode 120000 index 0000000000..c84c829611 --- /dev/null +++ b/Lang/Visual-Basic/Matrix-transposition @@ -0,0 +1 @@ +../../Task/Matrix-transposition/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Pi b/Lang/Visual-Basic/Pi new file mode 120000 index 0000000000..d71cbb31d0 --- /dev/null +++ b/Lang/Visual-Basic/Pi @@ -0,0 +1 @@ +../../Task/Pi/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Pythagorean-triples b/Lang/Visual-Basic/Pythagorean-triples new file mode 120000 index 0000000000..4dfc68da08 --- /dev/null +++ b/Lang/Visual-Basic/Pythagorean-triples @@ -0,0 +1 @@ +../../Task/Pythagorean-triples/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Read-entire-file b/Lang/Visual-Basic/Read-entire-file new file mode 120000 index 0000000000..8bf812786f --- /dev/null +++ b/Lang/Visual-Basic/Read-entire-file @@ -0,0 +1 @@ +../../Task/Read-entire-file/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Repeat-a-string b/Lang/Visual-Basic/Repeat-a-string new file mode 120000 index 0000000000..822a6aae74 --- /dev/null +++ b/Lang/Visual-Basic/Repeat-a-string @@ -0,0 +1 @@ +../../Task/Repeat-a-string/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/Reverse-a-string b/Lang/Visual-Basic/Reverse-a-string new file mode 120000 index 0000000000..09b41acca8 --- /dev/null +++ b/Lang/Visual-Basic/Reverse-a-string @@ -0,0 +1 @@ +../../Task/Reverse-a-string/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Basic/String-case b/Lang/Visual-Basic/String-case new file mode 120000 index 0000000000..b5612172f5 --- /dev/null +++ b/Lang/Visual-Basic/String-case @@ -0,0 +1 @@ +../../Task/String-case/Visual-Basic \ No newline at end of file diff --git a/Lang/Visual-Objects/Comments b/Lang/Visual-Objects/Comments new file mode 120000 index 0000000000..8074fc95be --- /dev/null +++ b/Lang/Visual-Objects/Comments @@ -0,0 +1 @@ +../../Task/Comments/Visual-Objects \ No newline at end of file diff --git a/Lang/Visual-Objects/Create-a-file b/Lang/Visual-Objects/Create-a-file new file mode 120000 index 0000000000..5994845da3 --- /dev/null +++ b/Lang/Visual-Objects/Create-a-file @@ -0,0 +1 @@ +../../Task/Create-a-file/Visual-Objects \ No newline at end of file diff --git a/Lang/Visual-Objects/Day-of-the-week b/Lang/Visual-Objects/Day-of-the-week new file mode 120000 index 0000000000..ac675c756a --- /dev/null +++ b/Lang/Visual-Objects/Day-of-the-week @@ -0,0 +1 @@ +../../Task/Day-of-the-week/Visual-Objects \ No newline at end of file diff --git a/Lang/X86-Assembly/Caesar-cipher b/Lang/X86-Assembly/Caesar-cipher new file mode 120000 index 0000000000..fee374bed5 --- /dev/null +++ b/Lang/X86-Assembly/Caesar-cipher @@ -0,0 +1 @@ +../../Task/Caesar-cipher/X86-Assembly \ No newline at end of file diff --git a/Lang/X86-Assembly/FizzBuzz b/Lang/X86-Assembly/FizzBuzz new file mode 120000 index 0000000000..4a664ecc7b --- /dev/null +++ b/Lang/X86-Assembly/FizzBuzz @@ -0,0 +1 @@ +../../Task/FizzBuzz/X86-Assembly \ No newline at end of file diff --git a/Lang/XPath-2.0/Tokenize-a-string b/Lang/XPath-2.0/Tokenize-a-string new file mode 120000 index 0000000000..178b3ad257 --- /dev/null +++ b/Lang/XPath-2.0/Tokenize-a-string @@ -0,0 +1 @@ +../../Task/Tokenize-a-string/XPath-2.0 \ No newline at end of file diff --git a/Lang/Xojo/00DESCRIPTION b/Lang/Xojo/00DESCRIPTION index b7efb3665f..911e33dec7 100644 --- a/Lang/Xojo/00DESCRIPTION +++ b/Lang/Xojo/00DESCRIPTION @@ -5,6 +5,10 @@ |parampass=both |gc=reference counting |safety=safe -|site=http://developer.apple.com/swift/}} +|site=http://docs.xojo.com}} {{language programming paradigm|Object-oriented}} -[[wp:Xojo|Xojo]] is an object-oriented, multi-platform language made by Xojo, Inc. Xojo uses its own IDE and has the ability to create native desktop apps for Windows, OS X and Linux; web apps (HTML5/JavaScript) and native iOS apps. \ No newline at end of file +[[wp:Xojo|Xojo]] is an object-oriented, multi-platform language made by Xojo, Inc. Xojo uses its own IDE and has the ability to create native desktop apps for Windows, OS X and Linux; web apps (HTML5/JavaScript) and native iOS apps. + +Prior to 2013, it was known as Real Studio and Realbasic. + +[[wp:Xojo|The Wikipedia article]] has lots of information about Xojo's history, capabilities, and features. \ No newline at end of file diff --git a/Lang/Xojo/100-doors b/Lang/Xojo/100-doors new file mode 120000 index 0000000000..2153c8814a --- /dev/null +++ b/Lang/Xojo/100-doors @@ -0,0 +1 @@ +../../Task/100-doors/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Bitmap b/Lang/Xojo/Bitmap new file mode 120000 index 0000000000..83497d95c8 --- /dev/null +++ b/Lang/Xojo/Bitmap @@ -0,0 +1 @@ +../../Task/Bitmap/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Comments b/Lang/Xojo/Comments new file mode 120000 index 0000000000..d94da8fd21 --- /dev/null +++ b/Lang/Xojo/Comments @@ -0,0 +1 @@ +../../Task/Comments/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Even-or-odd b/Lang/Xojo/Even-or-odd new file mode 120000 index 0000000000..2ec512cf00 --- /dev/null +++ b/Lang/Xojo/Even-or-odd @@ -0,0 +1 @@ +../../Task/Even-or-odd/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Fibonacci-sequence b/Lang/Xojo/Fibonacci-sequence new file mode 120000 index 0000000000..ba1d5b5109 --- /dev/null +++ b/Lang/Xojo/Fibonacci-sequence @@ -0,0 +1 @@ +../../Task/Fibonacci-sequence/Xojo \ No newline at end of file diff --git a/Lang/Xojo/FizzBuzz b/Lang/Xojo/FizzBuzz new file mode 120000 index 0000000000..ce4f712690 --- /dev/null +++ b/Lang/Xojo/FizzBuzz @@ -0,0 +1 @@ +../../Task/FizzBuzz/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Function-definition b/Lang/Xojo/Function-definition new file mode 120000 index 0000000000..13f71a9d8c --- /dev/null +++ b/Lang/Xojo/Function-definition @@ -0,0 +1 @@ +../../Task/Function-definition/Xojo \ No newline at end of file diff --git a/Lang/Xojo/LZW-compression b/Lang/Xojo/LZW-compression new file mode 120000 index 0000000000..7611325cbe --- /dev/null +++ b/Lang/Xojo/LZW-compression @@ -0,0 +1 @@ +../../Task/LZW-compression/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Literals-String b/Lang/Xojo/Literals-String new file mode 120000 index 0000000000..c8e0ad51d6 --- /dev/null +++ b/Lang/Xojo/Literals-String @@ -0,0 +1 @@ +../../Task/Literals-String/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Sieve-of-Eratosthenes b/Lang/Xojo/Sieve-of-Eratosthenes new file mode 120000 index 0000000000..62b7bb1ba2 --- /dev/null +++ b/Lang/Xojo/Sieve-of-Eratosthenes @@ -0,0 +1 @@ +../../Task/Sieve-of-Eratosthenes/Xojo \ No newline at end of file diff --git a/Lang/Xojo/Sorting-algorithms-Bubble-sort b/Lang/Xojo/Sorting-algorithms-Bubble-sort new file mode 120000 index 0000000000..f43d8b7e4f --- /dev/null +++ b/Lang/Xojo/Sorting-algorithms-Bubble-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bubble-sort/Xojo \ No newline at end of file diff --git a/Lang/Xojo/String-prepend b/Lang/Xojo/String-prepend new file mode 120000 index 0000000000..bcfeb4103e --- /dev/null +++ b/Lang/Xojo/String-prepend @@ -0,0 +1 @@ +../../Task/String-prepend/Xojo \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Create-a-two-dimensional-array-at-runtime b/Lang/ZX-Spectrum-Basic/Create-a-two-dimensional-array-at-runtime new file mode 120000 index 0000000000..a79dcb04c5 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Create-a-two-dimensional-array-at-runtime @@ -0,0 +1 @@ +../../Task/Create-a-two-dimensional-array-at-runtime/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Draw-a-clock b/Lang/ZX-Spectrum-Basic/Draw-a-clock new file mode 120000 index 0000000000..abce187318 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Draw-a-clock @@ -0,0 +1 @@ +../../Task/Draw-a-clock/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Extend-your-language b/Lang/ZX-Spectrum-Basic/Extend-your-language new file mode 120000 index 0000000000..ebb9b6b4eb --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Extend-your-language @@ -0,0 +1 @@ +../../Task/Extend-your-language/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Function-composition b/Lang/ZX-Spectrum-Basic/Function-composition new file mode 120000 index 0000000000..8dd2ea041c --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Function-composition @@ -0,0 +1 @@ +../../Task/Function-composition/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Hello-world-Text b/Lang/ZX-Spectrum-Basic/Hello-world-Text new file mode 120000 index 0000000000..bb7644f369 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Hello-world-Text @@ -0,0 +1 @@ +../../Task/Hello-world-Text/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Jensens-Device b/Lang/ZX-Spectrum-Basic/Jensens-Device new file mode 120000 index 0000000000..09886941f0 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Jensens-Device @@ -0,0 +1 @@ +../../Task/Jensens-Device/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Josephus-problem b/Lang/ZX-Spectrum-Basic/Josephus-problem new file mode 120000 index 0000000000..19d9e96563 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Josephus-problem @@ -0,0 +1 @@ +../../Task/Josephus-problem/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Bubble-sort b/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Bubble-sort new file mode 120000 index 0000000000..2e2932ac46 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Bubble-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Bubble-sort/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Cocktail-sort b/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Cocktail-sort new file mode 120000 index 0000000000..af5aaa50b7 --- /dev/null +++ b/Lang/ZX-Spectrum-Basic/Sorting-algorithms-Cocktail-sort @@ -0,0 +1 @@ +../../Task/Sorting-algorithms-Cocktail-sort/ZX-Spectrum-Basic \ No newline at end of file diff --git a/Task/100-doors/00META.yaml b/Task/100-doors/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/100-doors/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/100-doors/ARM-Assembly/100-doors-1.arm b/Task/100-doors/ARM-Assembly/100-doors-1.arm new file mode 100644 index 0000000000..5247fb3b74 --- /dev/null +++ b/Task/100-doors/ARM-Assembly/100-doors-1.arm @@ -0,0 +1,154 @@ +/* ARM assembly Raspberry PI */ +/* program 100doors.s */ + +/************************************/ +/* Constantes */ +/************************************/ +.equ STDOUT, 1 @ Linux output console +.equ EXIT, 1 @ Linux syscall +.equ WRITE, 4 @ Linux syscall +.equ NBDOORS, 100 +/*********************************/ +/* Initialized data */ +/*********************************/ +.data +sMessResult: .ascii "The door " +sMessValeur: .fill 11, 1, ' ' @ size => 11 + .asciz "is open.\n" + +/*********************************/ +/* UnInitialized data */ +/*********************************/ +.bss +stTableDoors: .skip 4 * NBDOORS +/*********************************/ +/* code section */ +/*********************************/ +.text +.global main +main: @ entry of program + push {fp,lr} @ saves 2 registers + @ display first line + ldr r3,iAdrstTableDoors @ table address + mov r5,#1 +1: + mov r4,r5 +2: @ begin loop + ldr r2,[r3,r4,lsl #2] @ read doors index r4 + cmp r2,#0 + moveq r2,#1 @ if r2 = 0 1 -> r2 + movne r2,#0 @ if r2 = 1 0 -> r2 + str r2,[r3,r4,lsl #2] @ store value of doors + add r4,r5 @ increment r4 with r5 value + cmp r4,#NBDOORS @ number of doors ? + ble 2b @ no -> loop + add r5,#1 @ increment the increment !! + cmp r5,#NBDOORS @ number of doors ? + ble 1b @ no -> loop + + @ loop display state doors + mov r4,#0 +3: + ldr r2,[r3,r4,lsl #2] @ read state doors r4 index + cmp r2,#0 + beq 4f + mov r0,r4 @ open -> display message + ldr r1,iAdrsMessValeur @ display value index + bl conversion10 @ call function + ldr r0,iAdrsMessResult + bl affichageMess @ display message +4: + add r4,#1 + cmp r4,#NBDOORS + ble 3b @ loop + + +100: @ standard end of the program + mov r0, #0 @ return code + pop {fp,lr} @restaur 2 registers + mov r7, #EXIT @ request to exit program + svc #0 @ perform the system call + +iAdrsMessValeur: .int sMessValeur +iAdrstTableDoors: .int stTableDoors +iAdrsMessResult: .int sMessResult + +/******************************************************************/ +/* display text with size calculation */ +/******************************************************************/ +/* r0 contains the address of the message */ +affichageMess: + push {r0,r1,r2,r7,lr} @ save registres + mov r2,#0 @ counter length +1: @ loop length calculation + ldrb r1,[r0,r2] @ read octet start position + index + cmp r1,#0 @ if 0 its over + addne r2,r2,#1 @ else add 1 in the length + bne 1b @ and loop + @ so here r2 contains the length of the message + mov r1,r0 @ address message in r1 + mov r0,#STDOUT @ code to write to the standard output Linux + mov r7, #WRITE @ code call system "write" + svc #0 @ call systeme + pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */ + bx lr @ return +/******************************************************************/ +/* Converting a register to a decimal unsigned */ +/******************************************************************/ +/* r0 contains value and r1 address area */ +/* r0 return size of result (no zero final in area) */ +/* area size => 11 bytes */ +.equ LGZONECAL, 10 +conversion10: + push {r1-r4,lr} @ save registers + mov r3,r1 + mov r2,#LGZONECAL + +1: @ start loop + bl divisionpar10U @unsigned r0 <- dividende. quotient ->r0 reste -> r1 + add r1,#48 @ digit + strb r1,[r3,r2] @ store digit on area + cmp r0,#0 @ stop if quotient = 0 + subne r2,#1 @ else previous position + bne 1b @ and loop + // and move digit from left of area + mov r4,#0 +2: + ldrb r1,[r3,r2] + strb r1,[r3,r4] + add r2,#1 + add r4,#1 + cmp r2,#LGZONECAL + ble 2b + // and move spaces in end on area + mov r0,r4 @ result length + mov r1,#' ' @ space +3: + strb r1,[r3,r4] @ store space in area + add r4,#1 @ next position + cmp r4,#LGZONECAL + ble 3b @ loop if r4 <= area size + +100: + pop {r1-r4,lr} @ restaur registres + bx lr @return + +/***************************************************/ +/* division par 10 unsigned */ +/***************************************************/ +/* r0 dividende */ +/* r0 quotient */ +/* r1 remainder */ +divisionpar10U: + push {r2,r3,r4, lr} + mov r4,r0 @ save value + //mov r3,#0xCCCD @ r3 <- magic_number lower @ for Raspberry pi 3 + //movt r3,#0xCCCC @ r3 <- magic_number upper @ for Raspberry pi 3 + ldr r3,iMagicNumber @ for Raspberry pi 1 2 + umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) + mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3 + add r2,r0,r0, lsl #2 @ r2 <- r0 * 5 + sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10) + pop {r2,r3,r4,lr} + bx lr @ leave function +iMagicNumber: .int 0xCCCCCCCD diff --git a/Task/100-doors/ARM-Assembly/100-doors-2.arm b/Task/100-doors/ARM-Assembly/100-doors-2.arm new file mode 100644 index 0000000000..49deabb2d4 --- /dev/null +++ b/Task/100-doors/ARM-Assembly/100-doors-2.arm @@ -0,0 +1,136 @@ +/*********************************************/ +/* optimized version */ +/*********************************************/ +/* ARM assembly Raspberry PI */ +/* program 100doors.s */ + +/************************************/ +/* Constantes */ +/************************************/ +.equ STDOUT, 1 @ Linux output console +.equ EXIT, 1 @ Linux syscall +.equ WRITE, 4 @ Linux syscall +.equ NBDOORS, 100 +/*********************************/ +/* Initialized data */ +/*********************************/ +.data +sMessResult: .ascii "The door " +sMessValeur: .fill 11, 1, ' ' @ size => 11 + .asciz "is open.\n" + +/*********************************/ +/* UnInitialized data */ +/*********************************/ +.bss +/*********************************/ +/* code section */ +/*********************************/ +.text +.global main +main: @ entry of program + push {fp,lr} @ saves 2 registers + @ display first line + mov r5,#3 @ start value of increment + mov r4,#1 @ start doors + @ loop display state doors +1: + mov r0,r4 @ open -> display message + ldr r1,iAdrsMessValeur @ display value index + bl conversion10 @ call function + ldr r0,iAdrsMessResult + bl affichageMess @ display message + add r4,r5 @ add increment + add r5,#2 @ new increment + cmp r4,#NBDOORS + ble 1b @ loop + + +100: @ standard end of the program + mov r0, #0 @ return code + pop {fp,lr} @ restaur 2 registers + mov r7, #EXIT @ request to exit program + svc #0 @ perform the system call + +iAdrsMessValeur: .int sMessValeur +iAdrsMessResult: .int sMessResult + +/******************************************************************/ +/* display text with size calculation */ +/******************************************************************/ +/* r0 contains the address of the message */ +affichageMess: + push {r0,r1,r2,r7,lr} @ save registres + mov r2,#0 @ counter length +1: @ loop length calculation + ldrb r1,[r0,r2] @ read octet start position + index + cmp r1,#0 @ if 0 its over + addne r2,r2,#1 @ else add 1 in the length + bne 1b @ and loop + @ so here r2 contains the length of the message + mov r1,r0 @ address message in r1 + mov r0,#STDOUT @ code to write to the standard output Linux + mov r7, #WRITE @ code call system "write" + svc #0 @ call systeme + pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */ + bx lr @ return +/******************************************************************/ +/* Converting a register to a decimal unsigned */ +/******************************************************************/ +/* r0 contains value and r1 address area */ +/* r0 return size of result (no zero final in area) */ +/* area size => 11 bytes */ +.equ LGZONECAL, 10 +conversion10: + push {r1-r4,lr} @ save registers + mov r3,r1 + mov r2,#LGZONECAL + +1: @ start loop + bl divisionpar10U @ unsigned r0 <- dividende. quotient ->r0 reste -> r1 + add r1,#48 @ digit + strb r1,[r3,r2] @ store digit on area + cmp r0,#0 @ stop if quotient = 0 + subne r2,#1 @ else previous position + bne 1b @ and loop + @ and move digit from left of area + mov r4,#0 +2: + ldrb r1,[r3,r2] + strb r1,[r3,r4] + add r2,#1 + add r4,#1 + cmp r2,#LGZONECAL + ble 2b + @ and move spaces in end on area + mov r0,r4 @ result length + mov r1,#' ' @ space +3: + strb r1,[r3,r4] @ store space in area + add r4,#1 @ next position + cmp r4,#LGZONECAL + ble 3b @ loop if r4 <= area size + +100: + pop {r1-r4,lr} @ restaur registres + bx lr @return + +/***************************************************/ +/* division par 10 unsigned */ +/***************************************************/ +/* r0 dividende */ +/* r0 quotient */ +/* r1 remainder */ +divisionpar10U: + push {r2,r3,r4, lr} + mov r4,r0 @ save value + //mov r3,#0xCCCD @ r3 <- magic_number lower @ for raspberry 3 + //movt r3,#0xCCCC @ r3 <- magic_number upper @ for raspberry 3 + ldr r3,iMagicNumber @ for raspberry 1 2 + umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) + mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3 + add r2,r0,r0, lsl #2 @ r2 <- r0 * 5 + sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10) + pop {r2,r3,r4,lr} + bx lr @ leave function +iMagicNumber: .int 0xCCCCCCCD diff --git a/Task/100-doors/B/100-doors.b b/Task/100-doors/B/100-doors.b new file mode 100644 index 0000000000..505f38949b --- /dev/null +++ b/Task/100-doors/B/100-doors.b @@ -0,0 +1,29 @@ +main() +{ + auto doors[100]; /* != 0 means open */ + auto pass, door; + + door = 0; + while( door<100 ) doors[door++] = 0; + + pass = 0; + while( pass<100 ) + { + door = pass; + while( door<100 ) + { + doors[door] = !doors[door]; + door =+ pass+1; + } + ++pass; + } + + door = 0; + while( door<100 ) + { + printf("door #%d is %s.*n", door+1, doors[door] ? "open" : "closed"); + ++door; + } + + return(0); +} diff --git a/Task/100-doors/BASIC/100-doors-10.basic b/Task/100-doors/BASIC/100-doors-10.basic new file mode 100644 index 0000000000..4229d9c86a --- /dev/null +++ b/Task/100-doors/BASIC/100-doors-10.basic @@ -0,0 +1,9 @@ +10 DIM D(100) +20 FOR I=1 TO 100 +30 FOR J=I TO 100 STEP I +40 LET D(J)=NOT D(J) +50 NEXT J +60 NEXT I +70 FOR I=1 TO 100 +80 IF D(I) THEN PRINT I, +90 NEXT I diff --git a/Task/100-doors/BASIC/100-doors-4.basic b/Task/100-doors/BASIC/100-doors-4.basic index dd92311c2f..651fdc503a 100644 --- a/Task/100-doors/BASIC/100-doors-4.basic +++ b/Task/100-doors/BASIC/100-doors-4.basic @@ -1,22 +1,13 @@ -REM "100 Doors" program for QB64 BASIC (http://www.qb64.net/), a QuickBASIC-like compiler. -REM Author: G. A. Tippery -REM Date: 12-Feb-2014 -REM -REM Unoptimized (naive) version, per specifications at http://rosettacode.org/wiki/100_doors - -DEFINT A-Z -CONST N = 100 -DIM door(N) - -FOR stride = 1 TO N - FOR index = stride TO N STEP stride - LET door(index) = NOT (door(index)) - NEXT index -NEXT stride - -PRINT "Open doors:" -FOR index = 1 TO N - IF door(index) THEN PRINT index -NEXT index - -END +100 PROGRAM "100doors.bas" +110 NUMERIC D(1 TO 100) +120 FOR I=1 TO 100 +130 LET D(I)=0 +140 NEXT +150 FOR I=1 TO 100 +160 FOR J=I TO 100 STEP I +170 LET D(J)=NOT D(J) +180 NEXT +190 NEXT +200 FOR I=1 TO 100 +210 IF D(I) THEN PRINT I +220 NEXT diff --git a/Task/100-doors/BASIC/100-doors-5.basic b/Task/100-doors/BASIC/100-doors-5.basic index f2179f24e0..72314e5010 100644 --- a/Task/100-doors/BASIC/100-doors-5.basic +++ b/Task/100-doors/BASIC/100-doors-5.basic @@ -1,16 +1,6 @@ -DIM doors(0 TO 99) -FOR pass = 0 TO 99 - FOR door = pass TO 99 STEP pass + 1 - PRINT doors(door) - PRINT NOT doors(door) - doors(door) = NOT doors(door) - NEXT door -NEXT pass -FOR i = 0 TO 99 - PRINT "Door #"; i + 1; " is "; - IF NOT doors(i) THEN - PRINT "closed" - ELSE - PRINT "open" - END IF -NEXT i +100 PROGRAM "100doors.bas" +110 LET NR=1:LET D=3 +120 DO +130 PRINT NR +140 LET NR=NR+D:LET D=D+2 +150 LOOP WHILE NR<=100 diff --git a/Task/100-doors/BASIC/100-doors-6.basic b/Task/100-doors/BASIC/100-doors-6.basic index ddaffaa2c1..dd92311c2f 100644 --- a/Task/100-doors/BASIC/100-doors-6.basic +++ b/Task/100-doors/BASIC/100-doors-6.basic @@ -1,12 +1,22 @@ -DIM doors(0 TO 99) -FOR door = 0 TO 99 - IF INT(SQR(door)) = SQR(door) THEN doors(door) = -1 -NEXT door -FOR i = 0 TO 99 - PRINT "Door #"; i + 1; " is "; - IF NOT doors(i) THEN - PRINT "closed" - ELSE - PRINT "open" - END IF -NEXT i +REM "100 Doors" program for QB64 BASIC (http://www.qb64.net/), a QuickBASIC-like compiler. +REM Author: G. A. Tippery +REM Date: 12-Feb-2014 +REM +REM Unoptimized (naive) version, per specifications at http://rosettacode.org/wiki/100_doors + +DEFINT A-Z +CONST N = 100 +DIM door(N) + +FOR stride = 1 TO N + FOR index = stride TO N STEP stride + LET door(index) = NOT (door(index)) + NEXT index +NEXT stride + +PRINT "Open doors:" +FOR index = 1 TO N + IF door(index) THEN PRINT index +NEXT index + +END diff --git a/Task/100-doors/BASIC/100-doors-7.basic b/Task/100-doors/BASIC/100-doors-7.basic index 14a02c2b80..f2179f24e0 100644 --- a/Task/100-doors/BASIC/100-doors-7.basic +++ b/Task/100-doors/BASIC/100-doors-7.basic @@ -1,10 +1,16 @@ -'lrcvs 04.11.12 -cls -x = 1 : y = 3 : z = 0 -print x + " Open" -do -z = x + y -print z + " Open" -x = z : y = y + 2 -until z >= 100 -end +DIM doors(0 TO 99) +FOR pass = 0 TO 99 + FOR door = pass TO 99 STEP pass + 1 + PRINT doors(door) + PRINT NOT doors(door) + doors(door) = NOT doors(door) + NEXT door +NEXT pass +FOR i = 0 TO 99 + PRINT "Door #"; i + 1; " is "; + IF NOT doors(i) THEN + PRINT "closed" + ELSE + PRINT "open" + END IF +NEXT i diff --git a/Task/100-doors/BASIC/100-doors-8.basic b/Task/100-doors/BASIC/100-doors-8.basic index 4229d9c86a..ddaffaa2c1 100644 --- a/Task/100-doors/BASIC/100-doors-8.basic +++ b/Task/100-doors/BASIC/100-doors-8.basic @@ -1,9 +1,12 @@ -10 DIM D(100) -20 FOR I=1 TO 100 -30 FOR J=I TO 100 STEP I -40 LET D(J)=NOT D(J) -50 NEXT J -60 NEXT I -70 FOR I=1 TO 100 -80 IF D(I) THEN PRINT I, -90 NEXT I +DIM doors(0 TO 99) +FOR door = 0 TO 99 + IF INT(SQR(door)) = SQR(door) THEN doors(door) = -1 +NEXT door +FOR i = 0 TO 99 + PRINT "Door #"; i + 1; " is "; + IF NOT doors(i) THEN + PRINT "closed" + ELSE + PRINT "open" + END IF +NEXT i diff --git a/Task/100-doors/BASIC/100-doors-9.basic b/Task/100-doors/BASIC/100-doors-9.basic new file mode 100644 index 0000000000..14a02c2b80 --- /dev/null +++ b/Task/100-doors/BASIC/100-doors-9.basic @@ -0,0 +1,10 @@ +'lrcvs 04.11.12 +cls +x = 1 : y = 3 : z = 0 +print x + " Open" +do +z = x + y +print z + " Open" +x = z : y = y + 2 +until z >= 100 +end diff --git a/Task/100-doors/Common-Lisp/100-doors-4.lisp b/Task/100-doors/Common-Lisp/100-doors-4.lisp index f0e2d0503c..7c6fd7ec9e 100644 --- a/Task/100-doors/Common-Lisp/100-doors-4.lisp +++ b/Task/100-doors/Common-Lisp/100-doors-4.lisp @@ -1,6 +1,6 @@ (defun doors (n) (loop for a from 1 to n collect - (if (zerop (mod (sqrt a) 1)) t nil))) + (zerop (mod (sqrt a) 1)))) > (doors 100) (T NIL NIL T NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL diff --git a/Task/100-doors/Component-Pascal/100-doors.component b/Task/100-doors/Component-Pascal/100-doors.component index d0c2a89707..0e11914244 100644 --- a/Task/100-doors/Component-Pascal/100-doors.component +++ b/Task/100-doors/Component-Pascal/100-doors.component @@ -6,7 +6,7 @@ VAR i,j: INTEGER; closed: ARRAY 101 OF BOOLEAN; BEGIN - (* initilization of close to true *) + (* initialization of closed to true *) FOR i := 0 TO LEN(closed) - 1 DO closed[i] := TRUE END; (* process *) FOR i := 1 TO LEN(closed) DO; diff --git a/Task/100-doors/Dart/100-doors-3.dart b/Task/100-doors/Dart/100-doors-3.dart new file mode 100644 index 0000000000..0dadd39438 --- /dev/null +++ b/Task/100-doors/Dart/100-doors-3.dart @@ -0,0 +1,26 @@ +import 'dart:io'; + +final numDoors = 100; +final List doorClosed = List(numDoors); + +String stateToString(String message) { + var res = ''; + for (var i = 0; i < numDoors; i++) { + res += (doorClosed[i] ? 'X' : '\u2610'); + } + return res + " " + message; +} + +main() { + for (var i = 0; i < numDoors; i++) { + doorClosed[i] = true; + } + stdout.writeln(stateToString("after initialization")); + for (var step = 1; step <= numDoors; step++) { + final start = step - 1; + for (var i = start; i < numDoors; i += step) { + doorClosed[i] = !doorClosed[i]; + } + stdout.writeln(stateToString("after toggling with step = $step")); + } +} diff --git a/Task/100-doors/Elena/100-doors.elena b/Task/100-doors/Elena/100-doors.elena index 1fd4bddfa8..f052ac4f83 100644 --- a/Task/100-doors/Elena/100-doors.elena +++ b/Task/100-doors/Elena/100-doors.elena @@ -1,22 +1,21 @@ -import system'routines. -import extensions. +import system'routines; +import extensions; -public program -[ - var Doors := Array new:100; populate(:n)( false ). +public program() +{ + var Doors := Array.allocate(100).populate:(n=>false); + for(int i := 0, i < 100, i := i + 1) + { + for(int j := i, j < 100, j := j + i + 1) + { + Doors[j] := Doors[j].Inverted + } + }; - 0 till:100 do(:i) - [ - i till:100 by(i + 1) do(:j) - [ - Doors[j] := Doors[j] not - ] - ]. + for(int i := 0, i < 100, i := i + 1) + { + console.printLine("Door #",i + 1," :",Doors[i].iif("Open","Closed")) + }; - 0 till:100 do(:i) - [ - console printLine("Door #",i + 1," :",Doors[i] iif("Open","Closed")) - ]. - - console readChar. -] + console.readChar() +} diff --git a/Task/100-doors/Elm/100-doors.elm b/Task/100-doors/Elm/100-doors.elm index d271fc95f6..e4e5e43d17 100644 --- a/Task/100-doors/Elm/100-doors.elm +++ b/Task/100-doors/Elm/100-doors.elm @@ -1,6 +1,7 @@ -- Unoptimized import List exposing (indexedMap, foldl, repeat, range) import Html exposing (text) +import Debug exposing (toString) type Door = Open | Closed @@ -8,7 +9,7 @@ toggle d = if d == Open then Closed else Open toggleEvery : Int -> List Door -> List Door toggleEvery k doors = indexedMap - (\i door -> if i % k == 0 then toggle door else door) + (\i door -> if modBy k (i+1) == 0 then toggle door else door) doors n = 100 diff --git a/Task/100-doors/Fish/100-doors.fish b/Task/100-doors/Fish/100-doors.fish new file mode 100644 index 0000000000..e4751b6fdd --- /dev/null +++ b/Task/100-doors/Fish/100-doors.fish @@ -0,0 +1,10 @@ +1001-p01. +>0101-p02. +>101-g001-g+:::aa*)?v101-p03. +>02-g?v1}02-p02. >05. + >0}02-p02. +>~~~0101-p001-g:1+001-paa*)?v02. + >07. +>0101-p08. +>101-g::02-g?v >1+:101-paa*=?; + >n" "o^ diff --git a/Task/100-doors/Free-Pascal/100-doors.free b/Task/100-doors/Free-Pascal/100-doors.free new file mode 100644 index 0000000000..44b6de437d --- /dev/null +++ b/Task/100-doors/Free-Pascal/100-doors.free @@ -0,0 +1,34 @@ +program OneHundredIsOpen; + +const + DoorCount = 100; + +var + IsOpen: array[1..DoorCount] of boolean; + Door, Jump: integer; + +begin + // Close all doors + for Door := 1 to DoorCount do + IsOpen[Door] := False; + // Iterations + for Jump := 1 to DoorCount do + begin + Door := Jump; + repeat + IsOpen[Door] := not IsOpen[Door]; + Door := Door + Jump; + until Door > DoorCount; + end; + // Show final status + for Door := 1 to DoorCount do + begin + Write(Door, ' '); + if IsOpen[Door] then + WriteLn('open') + else + WriteLn('closed'); + end; + // Wait for + Readln; +end. diff --git a/Task/100-doors/Futhark/100-doors.futhark b/Task/100-doors/Futhark/100-doors.futhark index 769b5e8e4c..75dcbd625e 100644 --- a/Task/100-doors/Futhark/100-doors.futhark +++ b/Task/100-doors/Futhark/100-doors.futhark @@ -1,11 +1,9 @@ -fun main(n: int): [n]bool = - let is_open = replicate n False - loop (is_open) = for i < n do +let main(n: i32): [n]bool = + loop is_open = replicate n false for i < n do let js = map (*i+1) (iota n) - let flips = map (fn j => + let flips = map (\j -> if j < n then unsafe !is_open[j] - else True -- Doesn't matter. + else true -- Doesn't matter. ) js - in write js flips is_open - in is_open + in scatter is_open js flips diff --git a/Task/100-doors/Go/100-doors-1.go b/Task/100-doors/Go/100-doors-1.go index 38b55b0949..e74412c9b3 100644 --- a/Task/100-doors/Go/100-doors-1.go +++ b/Task/100-doors/Go/100-doors-1.go @@ -3,7 +3,7 @@ package main import "fmt" func main() { - doors := make([]bool, 100) + doors := [100]bool{} // the 100 passes called for in the task description for pass := 1; pass <= 100; pass++ { diff --git a/Task/100-doors/Mercury/100-doors.mercury b/Task/100-doors/Mercury/100-doors.mercury index 5987a0b6b6..3a871297b7 100644 --- a/Task/100-doors/Mercury/100-doors.mercury +++ b/Task/100-doors/Mercury/100-doors.mercury @@ -1,33 +1,39 @@ :- module doors. :- interface. -:- import_module array, io, int. - -:- type door ---> open ; closed. -:- type doors == array(door). - -:- func toggle(door) = door. -:- pred walk(int::in, doors::in, doors::out) is semidet. -:- pred walks(int::in, int::in, doors::in, doors::out) is det. - +:- import_module io. :- pred main(io::di, io::uo) is det. - :- implementation. +:- import_module bitmap, bool, list, string, int. -toggle(open) = closed. -toggle(closed) = open. +:- func doors = bitmap. +doors = bitmap.init(100, no). -walk(N, !D) :- walk(N, N, !D). +:- pred walk(int, bitmap, bitmap). +:- mode walk(in, bitmap_di, bitmap_uo) is det. +walk(Pass, !Doors) :- + walk(Pass, Pass, !Doors). -:- pred walk(int::in, int::in, doors::in, doors::out) is semidet. -walk(At, By, !D) :- - semidet_lookup(!.D, At - 1, Door), - slow_set(At - 1, toggle(Door), !D), - ( walk(At + By, By, !D) -> true ; true ). +:- pred walk(int, int, bitmap, bitmap). +:- mode walk(in, in, bitmap_di, bitmap_uo) is det. +walk(At, By, !Doors) :- + ( if bitmap.in_range(!.Doors, At - 1) then + bitmap.unsafe_flip(At - 1, !Doors), + walk(At + By, By, !Doors) + else + true + ). -walks(N, End, !D) :- - ( N =< End, walk(N, !D) -> walks(N + 1, End, !D) ; true ). +:- pred report(bitmap, int, io, io). +:- mode report(bitmap_di, in, di, uo) is det. +report(Doors, N, !IO) :- + ( if is_set(Doors, N - 1) then + State = "open" + else + State = "closed" + ), + io.format("door #%d is %s\n", + [i(N), s(State)], !IO). main(!IO) :- - io.write(Doors1, !IO), io.nl(!IO), - array.init(100, closed, Doors0), - walks(1, 100, Doors0, Doors1). + list.foldl(walk, 1 .. 100, doors, Doors), + list.foldl(report(Doors), 1 .. 100, !IO). diff --git a/Task/100-doors/Ol/100-doors.ol b/Task/100-doors/Ol/100-doors.ol new file mode 100644 index 0000000000..c878d9ba40 --- /dev/null +++ b/Task/100-doors/Ol/100-doors.ol @@ -0,0 +1,13 @@ +(define (flip doors every) + (map (lambda (door num) + (mod (+ door (if (eq? (mod num every) 0) 1 0)) 2)) + doors + (iota (length doors) 1))) + +(define doors + (let loop ((doors (repeat 0 100)) (n 1)) + (if (eq? n 100) + doors + (loop (flip doors n) (+ n 1))))) + +(print "100th doors: " doors) diff --git a/Task/100-doors/PARI-GP/100-doors-3.pari b/Task/100-doors/PARI-GP/100-doors-3.pari new file mode 100644 index 0000000000..4a8182a457 --- /dev/null +++ b/Task/100-doors/PARI-GP/100-doors-3.pari @@ -0,0 +1,4 @@ +doors =vector(100); +print("open doors are : "); +for(i=1,100,for(j=i,100,doors[j]=!doors[j];j +=i-1)) +for(k=1,100,if(doors[k]==1,print1(" ",k))) diff --git a/Task/100-doors/Picat/100-doors-1.picat b/Task/100-doors/Picat/100-doors-1.picat new file mode 100644 index 0000000000..43c1e4e65a --- /dev/null +++ b/Task/100-doors/Picat/100-doors-1.picat @@ -0,0 +1,16 @@ +doors(N) => + Doors = new_array(N), + foreach(I in 1..N) Doors[I] := 0 end, + foreach(I in 1..N) + foreach(J in I..I..N) + Doors[J] := 1^Doors[J] + end, + if N <= 10 then + print_open(Doors) + end + end, + println(Doors), + print_open(Doors), + nl. + +print_open(Doors) => println([I : I in 1..Doors.length, Doors[I] == 1]). diff --git a/Task/100-doors/Picat/100-doors-2.picat b/Task/100-doors/Picat/100-doors-2.picat new file mode 100644 index 0000000000..07d4d43a39 --- /dev/null +++ b/Task/100-doors/Picat/100-doors-2.picat @@ -0,0 +1,6 @@ +doors_opt(N) => + foreach(I in 1..N) + Root = sqrt(I), + println([I, cond(Root == 1.0*round(Root), open, closed)]) + end, + nl. diff --git a/Task/100-doors/Picat/100-doors-3.picat b/Task/100-doors/Picat/100-doors-3.picat new file mode 100644 index 0000000000..dc63b938fd --- /dev/null +++ b/Task/100-doors/Picat/100-doors-3.picat @@ -0,0 +1,2 @@ +doors_opt2(N) => + println([I**2 : I in 1..N, I**2 <= N]). diff --git a/Task/100-doors/Pony/100-doors.pony b/Task/100-doors/Pony/100-doors.pony new file mode 100644 index 0000000000..ba9aa1e36b --- /dev/null +++ b/Task/100-doors/Pony/100-doors.pony @@ -0,0 +1,114 @@ +actor Toggler + let doors:Array[Bool] + let env: Env + new create(count:USize,_env:Env) => + var i:USize=0 + doors=Array[Bool](count) + env=_env + while doors.size() < count do + doors.push(false) + end + be togglin(interval : USize)=> + var i:USize=0 + try + while i < doors.size() do + doors.update(i,not doors(i)?)? + i=i+interval + end + else + env.out.print("Errored while togglin'!") + end + be printn(onlyOpen:Bool)=> + try + for i in doors.keys() do + if onlyOpen and not doors(i)? then + continue + end + env.out.print("Door " + i.string() + " is " + + if doors(i)? then + "Open" + else + "closed" + end) + end + else + env.out.print("Error!") + end + true + +actor OptimizedToggler + let doors:Array[Bool] + let env:Env + new create(count:USize,_env:Env)=> + env=_env + doors=Array[Bool](count) + while doors.size() + var i:USize=0 + if alreadydone then + return + end + try + doors.update(0,true)? + doors.update(1,true)? + while i < doors.size() do + i=i+1 + let z=i*i + let x=z*z + if z > doors.size() then + break + else + doors.update(z,true)? + end + if x < doors.size() then + doors.update(x,true)? + end + end + end + be printn(onlyOpen:Bool)=> + try + for i in doors.keys() do + if onlyOpen and not doors(i)? then + continue + end + env.out.print("Door " + i.string() + " is " + + if doors(i)? then + "Open" + else + "closed" + end) + end + else + env.out.print("Error!") + end + true +actor Main + new create(env:Env)=> + var count: USize =100 + try + let index=env.args.find("-n",0,0,{(l,r)=>l==r})? + try + match env.args(index+1)?.read_int[USize]()? + | (let x:USize, _)=>count=x + end + else + env.out.print("You either neglected to provide an argument after -n or that argument was not an integer greater than zero.") + return + end + end + if env.args.contains("optimized",{(l,r)=>r==l}) then + let toggler=OptimizedToggler(count,env) + var i:USize = 1 + toggler.togglin() + toggler.printn(env.args.contains("onlyopen", {(l,r)=>l==r})) + else + let toggler=Toggler(count,env) + var i:USize = 1 + while i < count do + toggler.togglin(i) + i=i+1 + end + toggler.printn(env.args.contains("onlyopen", {(l,r)=>l==r})) + end diff --git a/Task/100-doors/Pure-Data/100-doors.pure b/Task/100-doors/Pure-Data/100-doors.pure new file mode 100644 index 0000000000..a0d616d6cf --- /dev/null +++ b/Task/100-doors/Pure-Data/100-doors.pure @@ -0,0 +1,78 @@ +100Doors.pd + +#N canvas 241 375 414 447 10; +#X obj 63 256 expr doors[$f1] = doors[$f1] ^ 1; +#X msg 83 118 \; doors const 0; +#X msg 44 66 bang; +#X obj 44 92 t b b b; +#X obj 43 28 table doors 101; +#X obj 44 360 sel 0; +#X obj 44 336 expr if (doors[$f1] == 1 \, $f1 \, 0); +#X obj 63 204 t b f f; +#X text 81 66 run; +#X obj 71 384 print -n; +#X text 132 310 print results (open doors); +#X obj 63 179 loop 1 100 1; +#X obj 63 231 loop 1 100 1; +#X obj 44 310 loop 1 100 1; +#X text 148 28 create array; +#X text 151 180 100 passes; +#X text 179 123 set values to 0; +#X connect 2 0 3 0; +#X connect 3 0 13 0; +#X connect 3 1 11 0; +#X connect 3 2 1 0; +#X connect 5 1 9 0; +#X connect 6 0 5 0; +#X connect 7 0 12 0; +#X connect 7 1 12 1; +#X connect 7 2 12 3; +#X connect 11 0 7 0; +#X connect 12 0 0 0; +#X connect 13 0 6 0; + +loop.pd + +#N canvas 656 375 427 447 10; +#X obj 62 179 until; +#X obj 102 200 f; +#X obj 62 89 inlet; +#X obj 303 158 f \$3; +#X obj 270 339 outlet; +#X obj 223 89 inlet; +#X obj 138 89 inlet; +#X obj 324 89 inlet; +#X obj 117 158 f \$1; +#X text 323 68 step; +#X obj 202 158 f \$2; +#X obj 62 118 t b b b b; +#X obj 270 315 spigot; +#X obj 89 314 sel 0; +#X obj 137 206 +; +#X obj 102 237 expr $f1 \; if ($f3 > 0 \, if ($f1 > $f2 \, 0 \, 1) +\, if ($f3 < 0 \, if ($f1 < $f2 \, 0 \, 1) \, 0)), f 34; +#X text 63 68 run; +#X text 136 68 start; +#X text 227 68 end; +#X text 58 31 loop (abstraction); +#X connect 0 0 1 0; +#X connect 1 0 14 0; +#X connect 1 0 15 0; +#X connect 2 0 11 0; +#X connect 3 0 14 1; +#X connect 3 0 15 2; +#X connect 5 0 10 1; +#X connect 6 0 8 1; +#X connect 7 0 3 1; +#X connect 8 0 1 1; +#X connect 10 0 15 1; +#X connect 11 0 0 0; +#X connect 11 1 8 0; +#X connect 11 2 10 0; +#X connect 11 3 3 0; +#X connect 12 0 4 0; +#X connect 13 0 0 1; +#X connect 14 0 1 1; +#X connect 15 0 12 0; +#X connect 15 1 12 1; +#X connect 15 1 13 0; diff --git a/Task/100-doors/Spin/100-doors.spin b/Task/100-doors/Spin/100-doors.spin new file mode 100644 index 0000000000..3eba39f874 --- /dev/null +++ b/Task/100-doors/Spin/100-doors.spin @@ -0,0 +1,34 @@ +con + _clkmode = xtal1+pll16x + _clkfreq = 80_000_000 + +obj + ser : "FullDuplexSerial.spin" + +pub init + ser.start(31, 30, 0, 115200) + + doors + + waitcnt(_clkfreq + cnt) + ser.stop + cogstop(0) + +var + + byte door[101] ' waste one byte by using only door[1..100] + +pri doors | i,j + + repeat i from 1 to 100 + repeat j from i to 100 step i + not door[j] + + ser.str(string("Open doors: ")) + + repeat i from 1 to 100 + if door[i] + ser.dec(i) + ser.tx(32) + + ser.str(string(13,10)) diff --git a/Task/100-doors/Stata/100-doors.stata b/Task/100-doors/Stata/100-doors.stata index 35173a27fa..e030435295 100644 --- a/Task/100-doors/Stata/100-doors.stata +++ b/Task/100-doors/Stata/100-doors.stata @@ -3,7 +3,7 @@ set obs 100 gen doors=0 gen index=_n forvalues i=1/100 { - quietly replace doors=1-doors if mod(_n,`i')==0 + quietly replace doors=!doors if mod(_n,`i')==0 } list index if doors, noobs noheader diff --git a/Task/100-doors/Xojo/100-doors.xojo b/Task/100-doors/Xojo/100-doors.xojo new file mode 100644 index 0000000000..a7f302abeb --- /dev/null +++ b/Task/100-doors/Xojo/100-doors.xojo @@ -0,0 +1,7 @@ +// True=Open; False=Closed +Dim doors(100) As Boolean // Booleans default to false +For j As Integer = 1 To 100 + For i As Integer = 1 to 100 + If i Mod j = 0 Then doors(i) = Not doors(i) + Next +Next diff --git a/Task/24-game-Solve/00META.yaml b/Task/24-game-Solve/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/24-game-Solve/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/24-game-Solve/Ceylon/24-game-solve.ceylon b/Task/24-game-Solve/Ceylon/24-game-solve.ceylon new file mode 100644 index 0000000000..d20054ebc7 --- /dev/null +++ b/Task/24-game-Solve/Ceylon/24-game-solve.ceylon @@ -0,0 +1,133 @@ +import ceylon.random { + DefaultRandom +} + +shared sealed class Rational(numerator, denominator = 1) satisfies Numeric { + + shared Integer numerator; + shared Integer denominator; + + Integer gcd(Integer a, Integer b) => if (b == 0) then a else gcd(b, a % b); + + shared Rational inverted => Rational(denominator, numerator); + + shared Rational simplified => + let (largestFactor = gcd(numerator, denominator)) + Rational(numerator / largestFactor, denominator / largestFactor); + + divided(Rational other) => (this * other.inverted).simplified; + + negated => Rational(-numerator, denominator).simplified; + + plus(Rational other) => + let (top = numerator*other.denominator + other.numerator*denominator, + bottom = denominator * other.denominator) + Rational(top, bottom).simplified; + + times(Rational other) => + Rational(numerator * other.numerator, denominator * other.denominator).simplified; + + shared Integer integer => numerator / denominator; + shared Float float => numerator.float / denominator.float; + + string => denominator == 1 then numerator.string else "``numerator``/``denominator``"; + + shared actual Boolean equals(Object that) { + if (is Rational that) { + value simplifiedThis = this.simplified; + value simplifiedThat = that.simplified; + return simplifiedThis.numerator==simplifiedThat.numerator && + simplifiedThis.denominator==simplifiedThat.denominator; + } else { + return false; + } + } +} + +shared Rational? rational(Integer numerator, Integer denominator = 1) => + if (denominator == 0) + then null + else Rational(numerator, denominator).simplified; + +shared Rational numeratorOverOne(Integer numerator) => Rational(numerator); + +shared abstract class Operation(String lexeme) of addition | subtraction | multiplication | division { + shared formal Rational perform(Rational left, Rational right); + string => lexeme; +} + +shared object addition extends Operation("+") { + perform(Rational left, Rational right) => left + right; +} +shared object subtraction extends Operation("-") { + perform(Rational left, Rational right) => left - right; +} +shared object multiplication extends Operation("*") { + perform(Rational left, Rational right) => left * right; +} +shared object division extends Operation("/") { + perform(Rational left, Rational right) => left / right; +} + +shared Operation[] operations = `Operation`.caseValues; + +shared interface Expression of NumberExpression | OperationExpression { + shared formal Rational evaluate(); +} + +shared class NumberExpression(Rational number) satisfies Expression { + evaluate() => number; + string => number.string; +} +shared class OperationExpression(Expression left, Operation op, Expression right) satisfies Expression { + evaluate() => op.perform(left.evaluate(), right.evaluate()); + string => "(``left`` ``op`` ``right``)"; +} + +shared void run() { + + value twentyfour = numeratorOverOne(24); + + value random = DefaultRandom(); + + function buildExpressions({Rational*} numbers, Operation* ops) { + assert (is NumberExpression[4] numTuple = numbers.collect(NumberExpression).tuple()); + assert (is Operation[3] opTuple = ops.sequence().tuple()); + value [a, b, c, d] = numTuple; + value [op1, op2, op3] = opTuple; + value opExp = OperationExpression; // this is just to give it a shorter name + return [ + opExp(opExp(opExp(a, op1, b), op2, c), op3, d), + opExp(opExp(a, op1, opExp(b, op2, c)), op3, d), + opExp(a, op1, opExp(opExp(b, op2, c), op3, d)), + opExp(a, op1, opExp(b, op2, opExp(c, op3, d))) + ]; + } + + print("Please enter your 4 numbers to see how they form 24 or enter the letter r for random numbers."); + + if (exists line = process.readLine()) { + + Rational[] chosenNumbers; + + if (line.trimmed.uppercased == "R") { + chosenNumbers = random.elements(1..9).take(4).collect((Integer element) => numeratorOverOne(element)); + print("The random numbers are ``chosenNumbers``"); + } else { + chosenNumbers = line.split().map(Integer.parse).narrow().collect(numeratorOverOne); + } + + value expressions = { + for (numbers in chosenNumbers.permutations) + for (op1 in operations) + for (op2 in operations) + for (op3 in operations) + for (exp in buildExpressions(numbers, op1, op2, op3)) + if (exp.evaluate() == twentyfour) + exp + }; + + print("The solutions are:"); + expressions.each(print); + } +} diff --git a/Task/24-game-Solve/Nim/24-game-solve.nim b/Task/24-game-Solve/Nim/24-game-solve.nim new file mode 100644 index 0000000000..411441ca74 --- /dev/null +++ b/Task/24-game-Solve/Nim/24-game-solve.nim @@ -0,0 +1,56 @@ +import algorithm, sequtils, strformat + +type + Operation = enum + opAdd = "+" + opSub = "-" + opMul = "*" + opDiv = "/" + +const Ops = @[opAdd, opSub, opMul, opDiv] + +func opr(o: Operation, a, b: float): float = + case o + of opAdd: a + b + of opSub: a - b + of opMul: a * b + of opDiv: a / b + +func solve(nums: array[4, int]): string = + func `~=`(a, b: float): bool = + abs(a - b) <= 1e-5 + + result = "not found" + let sortedNums = nums.sorted.mapIt float it + for i in product Ops.repeat 3: + let (x, y, z) = (i[0], i[1], i[2]) + var nums = sortedNums + while true: + let (a, b, c, d) = (nums[0], nums[1], nums[2], nums[3]) + if x.opr(y.opr(a, b), z.opr(c, d)) ~= 24.0: + return fmt"({a:0} {y} {b:0}) {x} ({c:0} {z} {d:0})" + if x.opr(a, y.opr(b, z.opr(c, d))) ~= 24.0: + return fmt"{a:0} {x} ({b:0} {y} ({c:0} {z} {d:0}))" + if x.opr(y.opr(z.opr(c, d), b), a) ~= 24.0: + return fmt"(({c:0} {z} {d:0}) {y} {b:0}) {x} {a:0}" + if x.opr(y.opr(b, z.opr(c, d)), a) ~= 24.0: + return fmt"({b:0} {y} ({c:0} {z} {d:0})) {x} {a:0}" + if not nextPermutation(nums): break + +proc main() = + for nums in [ + [9, 4, 4, 5], + [1, 7, 2, 7], + [5, 7, 5, 4], + [1, 4, 6, 6], + [2, 3, 7, 3], + [8, 7, 9, 7], + [1, 6, 2, 6], + [7, 9, 4, 1], + [6, 4, 2, 2], + [5, 7, 9, 7], + [3, 3, 8, 8], # Difficult case requiring precise division + ]: + echo fmt"solve({nums}) -> {solve(nums)}" + +when isMainModule: main() diff --git a/Task/24-game-Solve/Perl-6/24-game-solve.pl6 b/Task/24-game-Solve/Perl-6/24-game-solve-1.pl6 similarity index 95% rename from Task/24-game-Solve/Perl-6/24-game-solve.pl6 rename to Task/24-game-Solve/Perl-6/24-game-solve-1.pl6 index 7d0af0d32d..bc8f94ed84 100644 --- a/Task/24-game-Solve/Perl-6/24-game-solve.pl6 +++ b/Task/24-game-Solve/Perl-6/24-game-solve-1.pl6 @@ -27,7 +27,7 @@ my @formats = ( ); # Brute force test the different permutations -for unique @digits.permutations -> @p { +(unique @digits.permutations).race.map: -> @p { for @ops -> @o { for @formats -> $format { my $string = sprintf $format, flat roundrobin(|@p; |@o); diff --git a/Task/24-game-Solve/Perl-6/24-game-solve-2.pl6 b/Task/24-game-Solve/Perl-6/24-game-solve-2.pl6 new file mode 100644 index 0000000000..b2d39b98ca --- /dev/null +++ b/Task/24-game-Solve/Perl-6/24-game-solve-2.pl6 @@ -0,0 +1,90 @@ +my %*SUB-MAIN-OPTS = :named-anywhere; + +sub MAIN (*@parameters, Int :$goal = 24) { + my @numbers; + if +@parameters == 1 { + @numbers = @parameters[0].comb(/\d/); + USAGE() and exit unless 2 < @numbers < 5; + } elsif +@parameters > 4 { + USAGE() and exit; + } elsif +@parameters == 3|4 { + @numbers = @parameters; + USAGE() and exit if @numbers.any ~~ /<-[-\d]>/; + } else { + USAGE(); + exit if +@parameters == 2; + @numbers = 3,3,8,8; + say 'Running demonstration with: ', |@numbers, "\n"; + } + solve @numbers, $goal +} + +sub solve (@numbers, $goal = 24) { + my @operators = < + - * / >; + my @ops = [X] @operators xx (@numbers - 1); + my @perms = @numbers.permutations.unique( :with(&[eqv]) ); + my @order = (^(@numbers - 1)).permutations; + my @sol; + @sol[250]; # preallocate some stack space + + my $batch = ceiling +@perms/4; + + my atomicint $i; + @perms.race(:batch($batch)).map: -> @p { + for @ops -> @o { + for @order -> @r { + my $result = evaluate(@p, @o, @r); + @sol[$i⚛++] = $result[1] if $result[0] and $result[0] == $goal; + } + } + } + @sol.=unique; + say @sol.join: "\n"; + my $pl = +@sol == 1 ?? '' !! 's'; + my $sg = $pl ?? '' !! 's'; + say +@sol, " equation{$pl} evaluate{$sg} to $goal using: {@numbers}"; +} + +sub evaluate ( @digit, @ops, @orders ) { + my @result = @digit.map: { [ $_, $_ ] }; + my @offset = 0 xx +@orders; + + for ^@orders { + my $this = @orders[$_]; + my $order = $this - @offset[$this]; + my $op = @ops[$this]; + my $result = op( $op, @result[$order;0], @result[$order+1;0] ); + return [ NaN, Str ] unless defined $result; + my $string = "({@result[$order;1]} $op {@result[$order+1;1]})"; + @result.splice: $order, 2, [ $[ $result, $string ] ]; + @offset[$_]++ if $order < $_ for ^@offset; + } + @result[0]; +} + +multi op ( '+', $m, $n ) { $m + $n } +multi op ( '-', $m, $n ) { $m - $n } +multi op ( '/', $m, $n ) { $n == 0 ?? fail() !! $m / $n } +multi op ( '*', $m, $n ) { $m * $n } + +my $txt = "\e[0;96m"; +my $cmd = "\e[0;92m> {$*EXECUTABLE-NAME} {$*PROGRAM-NAME}"; +sub USAGE { + say qq:to + '========================================================================' + {$txt}Supply 3 or 4 integers on the command line, and optionally a value + to equate to. + + Integers may be all one group: {$cmd} 2233{$txt} + Or, separated by spaces: {$cmd} 2 4 6 7{$txt} + + If you wish to supply multi-digit or negative numbers, you must + separate them with spaces: {$cmd} -2 6 12{$txt} + + If you wish to use a different equate value, + supply a new --goal parameter: {$cmd} --goal=17 2 -3 1 9{$txt} + + If you don't supply any parameters, will use 24 as the goal, will run a + demo and will show this message.\e[0m + ======================================================================== +} diff --git a/Task/24-game-Solve/Picat/24-game-solve-1.picat b/Task/24-game-Solve/Picat/24-game-solve-1.picat new file mode 100644 index 0000000000..298f7b8ffe --- /dev/null +++ b/Task/24-game-Solve/Picat/24-game-solve-1.picat @@ -0,0 +1,44 @@ +import util. + +main => + Target=24, + Nums = [5,6,7,8], + + All=findall(Expr, solve_num(Nums,Target,Expr)), + foreach(Expr in All) println(Expr.flatten()) end, + println(len=All.length), + nl. + +% A string based approach, inspired by - among others - the Perl6 solution. +solve_num(Nums, Target,Expr) => + Patterns = [ + "A X B Y C Z D", + "(A X B) Y C Z D", + "(A X B Y C) Z D", + "((A X B) Y C) Z D", + "(A X B) Y (C Z D)", + "A X (B Y C Z D)", + "A X (B Y (C Z D))" + ], + permutation(Nums,[A,B,C,D]), + Syms = [+,-,*,/], + member(X ,Syms), + member(Y ,Syms), + member(Z ,Syms), + member(Pattern,Patterns), + Expr = replace_all(Pattern, + "ABCDXYZ", + [A,B,C,D,X,Y,Z]), + catch(Target =:= Expr.eval(), E, ignore(E)). + +eval(Expr) = parse_term(Expr.flatten()).apply(). + +ignore(_E) => fail. % ignore zero_divisor errors + +% Replace all occurrences in S with From -> To. +replace_all(S,From,To) = Res => + R = S, + foreach({F,T} in zip(From,To)) + R := replace(R, F,T.to_string()) + end, + Res = R. diff --git a/Task/24-game-Solve/Picat/24-game-solve-2.picat b/Task/24-game-Solve/Picat/24-game-solve-2.picat new file mode 100644 index 0000000000..ab38413479 --- /dev/null +++ b/Task/24-game-Solve/Picat/24-game-solve-2.picat @@ -0,0 +1,47 @@ +import util. + +main => + Target=24, + Nums = [5,6,7,8], + _ = findall(Expr, solve_num2(Nums,Target)), + nl. + + +solve_num2(Nums, Target) => + Syms = [+,-,*,/], + Perms = permutations([I.to_string() : I in Nums]), + Seen = new_map(), % weed out duplicates + foreach(X in Syms,Y in Syms, Z in Syms) + foreach(P in Perms) + [A,B,C,D] = P, + if catch(check(A,X,B,Y,C,Z,D,Target,Expr),E,ignore(E)), + not Seen.has_key(Expr) then + println(Expr.flatten()=Expr.eval().round()), + Seen.put(Expr,1) + end + end + end. + +to_string2(Expr) = [E.to_string() : E in Expr].flatten(). + +ignore(_E) => fail. % ignore zero_divisor errors + +check(A,X,B,Y,C,Z,D,Target,Expr) ?=> + Expr = ["(",A,Y,B,")",X,"(",C,Z,D,")"].to_string2(), + Target =:= Expr.eval(). + +check(A,X,B,Y,C,Z,D,Target,Expr) ?=> + Expr = [A,X,"(",B,Y,"(",C,Z,D,")",")"].to_string2(), + Target =:= Expr.eval(). + +check(A,X,B,Y,C,Z,D,Target,Expr) ?=> + Expr = ["(","(",C,Z,D,")",Y,B,")",X,A].to_string2(), + Target =:= Expr.eval(). + +check(A,X,B,Y,C,Z,D,Target,Expr) ?=> + Expr = ["(",B,Y,"(",C,Z,D,")",")",X,A].to_string2(), + Target =:= Expr.eval(). + +check(A,X,B,Y,C,Z,D,Target,Expr) => + Expr = [A,X,"(","(",B,Y,C,")", Z,D,")"].to_string2(), + Target =:= Expr.eval(). diff --git a/Task/24-game-Solve/REXX/24-game-solve.rexx b/Task/24-game-Solve/REXX/24-game-solve.rexx index 9c70bc0157..d623e478df 100644 --- a/Task/24-game-Solve/REXX/24-game-solve.rexx +++ b/Task/24-game-Solve/REXX/24-game-solve.rexx @@ -1,99 +1,263 @@ -/*REXX program to help the user find solutions to the game of 24. */ -/* ┌──────────────────────────────────────────────────────────────────┐ - │ Argument is either of two forms: ssss ==or== ssss-ffff │ - │ │ - │ where one or both strings must be exactly four numerals (digits) │ - │ comprised soley of the numerals (digits) 1 ──► 9 (no zeroes). │ - │ │ - │ In SSSS-FFFF SSSS is the start, │ - │ FFFF is the start. │ - └──────────────────────────────────────────────────────────────────┘ */ -parse arg orig /*get the guess from the argument. */ -parse var orig start '-' finish /*get the start and finish (maybe). */ -start=space(start,0) /*remove any blanks from the START. */ -finish=space(finish,0) /*remove any blanks from the FINISH. */ -finish=word(finish start,1) /*if no FINISH specified, use START.*/ -digs=123456789 /*numerals (digits) that can be used. */ -call validate start -call validate finish -opers='+-*/' /*define the legal arithmetic operators*/ -ops=length(opers) /* ··· and the count of them (length). */ - do j=1 for ops /*define a version for fast execution. */ - o.j=substr(opers,j,1) - end /*j*/ -finds=0 /*number of found solutions (so far). */ -x.=0 /*a method to hold unique expressions. */ -indent=left('',30) /*used to indent display of solutions. */ - /*alternative: indent=copies(' ',30) */ -Lpar='(' /*a string to make REXX code prettier. */ -Rpar=')' /*ditto. */ +/*REXX program helps the user find solutions to the game of 24. */ +/* start-of-help +┌───────────────────────────────────────────────────────────────────────┐ +│ Argument is either of three forms: (blank) │~ +│ ssss │~ +│ ssss,tot │~ +│ ssss-ffff │~ +│ ssss-ffff,tot │~ +│ -ssss │~ +│ +ssss │~ +│ │~ +│ where SSSS and/or FFFF must be exactly four numerals (digits) │~ +│ comprised soley of the numerals (digits) 1 ──> 9 (no zeroes). │~ +│ │~ +│ SSSS is the start, │~ +│ FFFF is the start. │~ +│ │~ +│ │~ +│ If ssss has a leading plus (+) sign, it is used as the number, and │~ +│ the user is prompted to find a solution. │~ +│ │~ +│ If ssss has a leading minus (-) sign, a solution is looked for and │~ +│ the user is told there is a solution (but no solutions are shown). │~ +│ │~ +│ If no argument is specified, this program finds a four digits (no │~ +│ zeroes) which has at least one solution, and shows the digits to │~ +│ the user, requesting that they enter a solution. │~ +│ │~ +│ If tot is entered, it is the desired answer. The default is 24. │~ +│ │~ +│ A solution to be entered can be in the form of: │ +│ │ +│ digit1 operator digit2 operator digit3 operator digit4 │ +│ │ +│ where DIGITn is one of the digits shown (in any order), and │ +│ OPERATOR can be any one of: + - * / │ +│ │ +│ Parentheses () may be used in the normal manner for grouping, as │ +│ well as brackets [] or braces {}. Blanks can be used anywhere. │ +│ │ +│ I.E.: for the digits 3448 the following could be entered. │ +│ │ +│ 3*8 + (4-4) │ +└───────────────────────────────────────────────────────────────────────┘ + end-of-help */ +numeric digits 12 /*where rational arithmetic is needed. */ +parse arg orig /*get the guess from the command line*/ +orig= space(orig, 0) /*remove all blanks from ORIG. */ +negatory= left(orig,1)=='-' /*=1, suppresses showing. */ +pository= left(orig,1)=='+' /*=1, force $24 to use specific number.*/ +if pository | negatory then orig=substr(orig,2) /*now, just use the absolute vaue. */ +parse var orig orig ',' ?? /*get ?? (if specified, def=24). */ +parse var orig start '-' finish /*get start and finish (maybe). */ +opers= '*' || "/+-" /*legal arith. opers;order is important*/ +ops= length(opers) /*the number of arithmetic operators. */ +groupsym= '()[]{}' /*allowed grouping symbols. */ +indent= left('', 30) /*indents display of solutions. */ +show= 1 /*=1, shows solutions (semifore). */ +digs= 123456789 /*numerals/digs that can be used. */ +abuttals = 0 /*=1, allows digit abutal: 12+12 */ +if ??=='' then ??= 24 /*the name of the game. */ +??= ?? / 1 /*normalize the answer. */ +@abc= 'abcdefghijklmnopqrstuvwxyz' /*the Latin alphabet in order. */ +@abcu= @abc; upper @abcu /*an uppercase version of @abc. */ +x.= 0 /*method used to not re-interpret. */ + do j=1 for ops; o.j=substr(opers, j, 1) + end /*j*/ /*used for fast execution. */ +y= ?? +if \datatype(??,'N') then do; call ger "isn't numeric"; exit 13; end +if start\=='' & \pository then do; call ranger start,finish; exit 13; end +show= 0 /*stop SOLVE blabbing solutions. */ + do forever while \negatory /*keep truckin' until a solution. */ + x.= 0 /*way to hold unique expressions. */ + rrrr= random(1111, 9999) /*get a random set of digits. */ + if pos(0, rrrr)\==0 then iterate /*but don't the use of zeroes. */ + if solve(rrrr)\==0 then leave /*try to solve for these digits. */ + end /*forever*/ - do g=start to finish /*process a (possible) range of values.*/ - if pos(0,g)\==0 then iterate /*ignore values with zero in them. */ +if left(orig,1)=='+' then rrrr=start /*use what's specified. */ +show= 1 /*enable SOLVE to show solutions. */ +rrrr= sortc(rrrr) /*sort four elements. */ +rd.= 0 + do j=1 for 9 /*count for each digit in RRRR. */ + _= substr(rrrr, j, 1); rd._= countchars(rrrr, _) + end + do guesses=1; say + say 'Using the digits' rrrr", enter an expression that equals" ?? ' (? or QUIT):' + pull y; y= space(y, 0) + if countchars(y, @abcu)>2 then exit /*the user must be desperate. */ + helpstart= 0 + if y=='?' then do j=1 for sourceline() /*use a lazy way to show help. */ + _= sourceline(j) + if p(_)=='start-of-help' then do; helpstart=1; iterate; end + if p(_)=='end-of-help' then iterate guesses + if \helpstart then iterate + if right(_,1)=='~' then iterate + say ' ' _ + end - do _=1 for 4 /*define versions for faster execution.*/ - g._=substr(g,_,1) - end /*_*/ + _v= verify(y, digs || opers || groupsym) /*any illegal characters? */ + if _v\==0 then do; call ger 'invalid character:' substr(y, _v, 1); iterate; end + if y='' then do; call validate y; iterate; end - do i=1 for ops /*insert an operator after 1st number. */ - do j=1 for ops /*insert an operator after 2nd number. */ - do k=1 for ops /*insert an operator after 2nd number. */ - do m=0 for 4; L.= /*assume no left parenthesis so far. */ - do n=m+1 to 4 /*match left paren with a right paren. */ - L.m=Lpar /*define a left paren, m=0 means ignore*/ - R.= /*un-define all right parenthesis. */ - if m==1 & n==2 then L.= /*special case: (n)+ ··· */ - else if m\==0 then R.n=Rpar /*no (, no )*/ - e= L.1 g.1 o.i L.2 g.2 o.j L.3 g.3 R.3 o.k g.4 R.4 - e=space(e,0) /*remove all blanks from the expression*/ + do j=1 for length(y)-1 while \abuttals /*check for two digits adjacent. */ + if \datatype(substr(y,j,1), 'W') then iterate + if datatype(substr(y,j+1,1),'W') then do + call ger 'invalid use of digit abuttal' substr(y,j,2) + iterate guesses + end + end /*j*/ - /*(below) change expression: */ - /* /(yyy) ===> /div(yyy) */ - /*Enables to check for division by zero*/ - origE=e /*keep old version for the display. */ - if pos('/(',e)\==0 then e=changestr('/(', e, "/div(") - /*The above could be replaced by: */ - /* e=changestr('/(',e,"/div(") */ + yd= countchars(y, digs) /*count of legal digits 123456789 */ + if yd<4 then do; call ger 'not enough digits entered.'; iterate guesses; end + if yd>4 then do; call ger 'too many digits entered.' ; iterate guesses; end - /*INTERPRET stresses REXX's groin, so */ - /* try to avoid repeated heavy lifting.*/ - if x.e then iterate /*was the expression already used? */ - x.e=1 /*mark this expression as unique. */ - /*have REXX do the heavy lifting (ugh).*/ - interpret 'x=' e /*··· strain··· */ - x=x/1 /*remove trailing decimal points(maybe)*/ - if x\==24 then iterate /*Not correct? Try again. */ - finds=finds+1 /*bump number of found solutions. */ - _=translate(origE, '][', ")(") /*show [], not (). */ - say indent 'a solution:' _ /*display a solution. */ - end /*n*/ + do j=1 for length(groupsym) by 2 + if countchars(y,substr(groupsym,j ,1))\==, + countchars(y,substr(groupsym,j+1,1)) then do + call ger 'mismatched' substr(groupsym,j,2) + iterate guesses + end + end /*j*/ + + do k=1 for 2 /*check for ** and // */ + _= copies( substr( opers, k, 1), 2) + if pos(_, y)\==0 then do; call ger 'illegal operator:' _; iterate guesses; end + end /*k*/ + + do j=1 for 9; if rd.j==0 then iterate; _d= countchars(y, j) + if _d==rd.j then iterate + if _d /div(yyy) */ + origE= e /*keep original version for the display*/ + pd= pos('/(', e) /*find pos of /( in E. */ + if pd\==0 then do /*Found? Might have possible ÷ by zero*/ + eo= e + lr= lastpos(')', e) /*find last right ) */ + lm= pos('-', e, pd+1) /*find - after ( */ + if lm>pd & lm4 then call ger 'too many digits entered, must be 4' - when pos(0,y)\==0 then call ger "can't use the digit 0 (zero)" - when _v\==0 then call ger 'illegal character:' substr(y,_v,1) - otherwise nop - end /*select*/ -return \errCode + do j=1 for L /*very simple sort, it's a small array*/ + _= a.j + do k=j+1 to L + if a.k<_ then do; a.j= a.k; a.k= _; _= a.k; end + end /*k*/ + end /*j*/ + v= a.1 + do m=2 to L; v= v || a.m /*build a string of digs from A.m */ + end /*m*/ + return v +/*──────────────────────────────────────────────────────────────────────────────────────*/ +validate: parse arg y; errCode= 0; _v= verify(y, digs) + select + when y=='' then call ger 'no digits entered.' + when length(y)<4 then call ger 'not enough digits entered, must be 4' + when length(y)>4 then call ger 'too many digits entered, must be 4' + when pos(0,y)\==0 then call ger "can't use the digit 0 (zero)" + when _v\==0 then call ger 'illegal character:' substr(y,_v,1) + otherwise nop + end /*select*/ + return \errCode +/*──────────────────────────────────────────────────────────────────────────────────────*/ +div: procedure; parse arg q; if q=0 then q=1e9; return q /*tests if dividing by zero.*/ +ger: say= '***error*** for argument:' y; say arg(1); errCode= 1; return 0 +p: return word( arg(1), 1) +s: if arg(1)==1 then return arg(3); return word( arg(2) 's', 1) diff --git a/Task/24-game/00META.yaml b/Task/24-game/00META.yaml new file mode 100644 index 0000000000..9bdb64aab4 --- /dev/null +++ b/Task/24-game/00META.yaml @@ -0,0 +1,4 @@ +--- +category: +- Puzzles +- Games diff --git a/Task/24-game/Ceylon/24-game.ceylon b/Task/24-game/Ceylon/24-game.ceylon index f1f0e667ca..c469d01692 100644 --- a/Task/24-game/Ceylon/24-game.ceylon +++ b/Task/24-game/Ceylon/24-game.ceylon @@ -1,36 +1,47 @@ import ceylon.random { - DefaultRandom } class Rational(shared Integer numerator, shared Integer denominator = 1) satisfies Numeric { - assert(denominator != 0); + assert (denominator != 0); - Integer gcd(Integer a, Integer b) => if(b == 0) then a else gcd(b, a % b); + Integer gcd(Integer a, Integer b) => if (b == 0) then a else gcd(b, a % b); shared Rational inverted => Rational(denominator, numerator); shared Rational simplified => - let(largestFactor = gcd(numerator, denominator)) - Rational(numerator / largestFactor, denominator / largestFactor); + let (largestFactor = gcd(numerator, denominator)) + Rational(numerator / largestFactor, denominator / largestFactor); divided(Rational other) => (this * other.inverted).simplified; negated => Rational(-numerator, denominator).simplified; plus(Rational other) => - let(top = numerator * other.denominator + other.numerator * denominator, + let (top = numerator*other.denominator + other.numerator*denominator, bottom = denominator * other.denominator) Rational(top, bottom).simplified; times(Rational other) => - Rational(numerator * other.numerator, denominator * other.denominator).simplified; + Rational(numerator * other.numerator, denominator * other.denominator).simplified; shared Integer integer => numerator / denominator; shared Float float => numerator.float / denominator.float; string => denominator == 1 then numerator.string else "``numerator``/``denominator``"; + + shared actual Boolean equals(Object that) { + if (is Rational that) { + value simplifiedThis = this.simplified; + value simplifiedThat = that.simplified; + return simplifiedThis.numerator==simplifiedThat.numerator && + simplifiedThis.denominator==simplifiedThat.denominator; + } + else { + return false; + } + } } interface Expression { @@ -44,17 +55,17 @@ class NumberExpression(Rational number) satisfies Expression { class OperatorExpression(Expression left, Character operator, Expression right) satisfies Expression { shared actual Rational evaluate() { - switch(operator) - case('*') { + switch (operator) + case ('*') { return left.evaluate() * right.evaluate(); } - case('/') { + case ('/') { return left.evaluate() / right.evaluate(); } - case('-') { + case ('-') { return left.evaluate() - right.evaluate(); } - case('+') { + case ('+') { return left.evaluate() + right.evaluate(); } else { @@ -75,7 +86,7 @@ class PrattParser(String input) { shared Expression expression(Integer precedence = 0) { value token = advance(); variable value left = parseUnary(token); - while(precedence < getPrecedence(peek())) { + while (precedence < getPrecedence(peek())) { value nextToken = advance(); left = parseBinary(left, nextToken); } @@ -83,15 +94,15 @@ class PrattParser(String input) { } Integer getPrecedence(Character op) => - switch(op) - case('*' | '/') 2 - case('+' | '-') 1 + switch (op) + case ('*' | '/') 2 + case ('+' | '-') 1 else 0; Character advance(Character? expected = null) { index++; value token = tokens[index] else ' '; - if(exists expected, token != expected) { + if (exists expected, token != expected) { throw Exception("unknown character ``token``"); } return token; @@ -100,122 +111,127 @@ class PrattParser(String input) { Character peek() => tokens[index + 1] else ' '; Expression parseBinary(Expression left, Character operator) => - let(right = expression(getPrecedence(operator))) - OperatorExpression(left, operator, right); + let (right = expression(getPrecedence(operator))) + OperatorExpression(left, operator, right); Expression parseUnary(Character token) { - if(token.digit) { - assert(exists int = parseInteger(token.string)); + if (token.digit) { + assert (is Integer int = Integer.parse(token.string)); return NumberExpression(Rational(int)); - } else if(token == '(') { + } + else if (token == '(') { value exp = expression(); advance(')'); return exp; - } else { + } + else { throw Exception("unknown character ``token``"); } } } -"Run the module `twentyfourgame`." shared void run() { - - value random = DefaultRandom(); - - function random4Numbers() => - random.elements(1..9).take(4).sequence(); - - function isValidGuess(String input, {Integer*} allowedNumbers) { - value allowedOperators = set {*"()+-/*"}; - value extractedNumbers = input - .split((Character ch) => ch in allowedOperators || ch.whitespace) - .map((String element) => parseInteger(element)) - .coalesced; - if(extractedNumbers.any((Integer element) => element > 9)) { - print("number too big!"); - return false; - } - if(extractedNumbers.any((Integer element) => element < 1)) { - print("number too small!"); - return false; - } - if(extractedNumbers.sort(byIncreasing(Integer.magnitude)) != allowedNumbers.sort(byIncreasing(Integer.magnitude))) { - print("use all the numbers, please!"); - return false; - } - if(!input.every((Character element) => element in allowedOperators || element.digit || element.whitespace)) { - print("only digits and mathematical operators, please"); - return false; - } - variable value lefts = 0; - for(c in input) { - if(c == '(') { - lefts++; - } else if(c == ')') { - lefts--; - if(lefts < 0) { - break; - } - } - } - if(lefts != 0) { - print("unbalanced brackets!"); - return false; - } - return true; - } - - function evaluate(String input) => - let(parser = PrattParser(input), - exp = parser.expression()) - exp.evaluate(); - - print("Welcome to The 24 Game. - Create a mathematical equation with four random - numbers that evaluates to 24. - You must use all the numbers once and only once, - but in any order. - Also, only + - / * and parentheses are allowed. - For example: (1 + 2 + 3) * 4 - Also: enter n for new numbers and q to quit. - -----------------------------------------------"); - - while(true) { + + value random = DefaultRandom(); + + function random4Numbers() => + random.elements(1..9).take(4).sequence(); + + function isValidGuess(String input, {Integer*} allowedNumbers) { + value allowedOperators = set { *"()+-/*" }; + value extractedNumbers = input + .split((Character ch) => ch in allowedOperators || ch.whitespace) + .map((String element) => Integer.parse(element)) + .narrow(); + if (extractedNumbers.any((Integer element) => element > 9)) { + print("number too big!"); + return false; + } + if (extractedNumbers.any((Integer element) => element < 1)) { + print("number too small!"); + return false; + } + if (extractedNumbers.sort(increasing) != allowedNumbers.sort(increasing)) { + print("use all the numbers, please!"); + return false; + } + if (!input.every((Character element) => element in allowedOperators || element.digit || element.whitespace)) { + print("only digits and mathematical operators, please"); + return false; + } + variable value leftParens = 0; + for (c in input) { + if (c == '(') { + leftParens++; + } else if (c == ')') { + leftParens--; + if (leftParens < 0) { + break; + } + } + } + if (leftParens != 0) { + print("unbalanced brackets!"); + return false; + } + return true; + } + + function evaluate(String input) => + let (parser = PrattParser(input), + exp = parser.expression()) + exp.evaluate(); + + print("Welcome to The 24 Game. + Create a mathematical equation with four random + numbers that evaluates to 24. + You must use all the numbers once and only once, + but in any order. + Also, only + - / * and parentheses are allowed. + For example: (1 + 2 + 3) * 4 + Also: enter n for new numbers and q to quit. + -----------------------------------------------"); + + value twentyfour = Rational(24); + + while (true) { value chosenNumbers = random4Numbers(); void pleaseTryAgain() => print("Sorry, please try again. (Your numbers are ``chosenNumbers``)"); - + print("Your numbers are ``chosenNumbers``. Please turn them into 24."); - while(true) { - value line = process.readLine()?.trimmed; - if(exists line) { - if(line.uppercased == "Q") { - print("bye!"); - return; - } - if(line.uppercased == "N") { - break; - } - if(isValidGuess(line, chosenNumbers)) { - try { - value result = evaluate(line); - print("= ``result``"); - if(result.integer == 24) { - print("You did it!"); - break; - } else { - pleaseTryAgain(); - } - } catch(Exception e) { - print(e.message); - pleaseTryAgain(); - } - } else { - pleaseTryAgain(); - } - } - } + while (true) { + value line = process.readLine()?.trimmed; + if (exists line) { + if (line.uppercased == "Q") { // quit + print("bye!"); + return; + } + if (line.uppercased == "N") { // new game + break; + } + if (isValidGuess(line, chosenNumbers)) { + try { + value result = evaluate(line); + print("= ``result``"); + if (result == twentyfour) { + print("You did it!"); + break; + } + else { + pleaseTryAgain(); + } + } + catch (Exception e) { + print(e.message); + pleaseTryAgain(); + } + } + else { + pleaseTryAgain(); + } + } + } } - } diff --git a/Task/24-game/Elena/24-game.elena b/Task/24-game/Elena/24-game.elena index 5a5fdc386f..2581fba5d5 100644 --- a/Task/24-game/Elena/24-game.elena +++ b/Task/24-game/Elena/24-game.elena @@ -1,175 +1,203 @@ -import system'routines. -import system'collections. -import system'dynamic. -import extensions. +import system'routines; +import system'collections; +import system'dynamic; +import extensions; class ExpressionTree { - object theTree. + object theTree; - constructor new : aLiteral - [ - auto aLevel := Integer new:0. + constructor(s) + { + auto level := new Integer(0); - aLiteral forEach(:ch) - [ - var node := DynamicStruct new. + s.forEach:(ch) + { + var node := new DynamicStruct(); ch => - $43 [ node level := aLevel + 1. node operation := %add ]; // + - $45 [ node level := aLevel + 1. node operation := %subtract ]; // - - $42 [ node level := aLevel + 2. node operation := %multiply ]; // * - $47 [ node level := aLevel + 2. node operation := %divide ]; // / - $40 [ aLevel append(10). ^ self ]; // ( - $41 [ aLevel reduce(10). ^ self ]; // ) - ! [ - node leaf := ch literal; toReal. - node level := aLevel + 3. - ]. + $43 { node.Level := level + 1; node.Operation := __subj add } // + + $45 { node.Level := level + 1; node.Operation := __subj subtract } // - + $42 { node.Level := level + 2; node.Operation := __subj multiply } // * + $47 { node.Level := level + 2; node.Operation := __subj divide } // / + $40 { level.append(10); ^ self } // ( + $41 { level.reduce(10); ^ self } // ) + : { + node.Leaf := ch.toString().toReal(); + node.Level := level + 3 + }; if (nil == theTree) - [ theTree := node ]; - [ - if (theTree level >= node level) - [ - node left := theTree. - node right := nilValue. + { + theTree := node + } + else + { + if (theTree.Level >= node.Level) + { + node.Left := theTree; + node.Right := nilValue; - theTree := node - ]; - [ - var aTop := theTree. - while ((nilValue != aTop right)&&(aTop right; level < node level)) - [ aTop := aTop right ]. + theTree := node + } + else + { + var top := theTree; + while ((nilValue != top.Right)&&(top.Right.Level < node.Level)) + { top := top.Right }; - node left := aTop right. - node right := nilValue. + node.Left := top.Right; + node.Right := nilValue; - aTop right := node - ] - ] - ] - ] + top.Right := node + } + } + } + } - eval : aNode - [ - if (aNode containsProperty:%leaf) - [ ^ aNode leaf ]; - [ - var aLeft := self eval:(aNode left). - var aRight := self eval:(aNode right). + eval(node) + { + if (node.containsProperty(subjconst Leaf)) + { + ^ node.Leaf + } + else + { + var left := self.eval(node.Left); + var right := self.eval(node.Right); - ^ aLeft~(aNode operation) eval:aRight - ] - ] + var op := node.Operation; - value - <= eval:theTree. + ^ mixin op(left).eval:right + } + } - readLeaves : aList at:aNode - [ - if (nil == aNode) - [ InvalidArgumentException new; raise ]. + get Value() + <= eval(theTree); - if (aNode containsProperty:%leaf) - [ aList append(aNode leaf) ]; - [ - self readLeaves:aList at(aNode left). - self readLeaves:aList at(aNode right). - ]. - ] + readLeaves(list, node) + { + if (nil == node) + { InvalidArgumentException.raise() }; - readLeaves : aList - <= readLeaves:aList at:theTree. + var s := subjconst Leaf; + + if (node.containsProperty(subjconst Leaf)) + { + list.append(node.Leaf) + } + else + { + self.readLeaves(list, node.Left); + self.readLeaves(list, node.Right) + } + } + + readLeaves(list) + <= readLeaves(list,theTree); } class TwentyFourGame { - object theNumbers. + object theNumbers; - constructor new - [ - self newPuzzle. - ] + constructor() + { + self.newPuzzle(); + } - newPuzzle - [ - theNumbers := ( - 1 + randomGenerator eval:9, - 1 + randomGenerator eval:9, - 1 + randomGenerator eval:9, - 1 + randomGenerator eval:9). - ] + newPuzzle() + { + theNumbers := new object[] + { + 1 + randomGenerator.eval:9, + 1 + randomGenerator.eval:9, + 1 + randomGenerator.eval:9, + 1 + randomGenerator.eval:9 + } + } - help - [ + help() + { console - printLine:"------------------------------- Instructions ------------------------------"; - printLine:"Four digits will be displayed."; - printLine:"Enter an equation using all of those four digits that evaluates to 24"; - printLine:"Only * / + - operators and () are allowed"; - printLine:"Digits can only be used once, but in any order you need."; - printLine:"Digits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed"; - printLine:"Submit a blank line to skip the current puzzle."; - printLine:"Type 'q' to quit"; - writeLine; - printLine:"Example: given 2 3 8 2, answer should resemble 8*3-(2-2)"; - printLine:"------------------------------- --------------------------------------------". - ] + .printLine:"------------------------------- Instructions ------------------------------" + .printLine:"Four digits will be displayed." + .printLine:"Enter an equation using all of those four digits that evaluates to 24" + .printLine:"Only * / + - operators and () are allowed" + .printLine:"Digits can only be used once, but in any order you need." + .printLine:"Digits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed" + .printLine:"Submit a blank line to skip the current puzzle." + .printLine:"Type 'q' to quit" + .writeLine() + .printLine:"Example: given 2 3 8 2, answer should resemble 8*3-(2-2)" + .printLine:"------------------------------- --------------------------------------------" + } - prompt - [ - theNumbers forEach(:n) [ console print(n," ") ]. + prompt() + { + theNumbers.forEach:(n){ console.print(n," ") }; - console print:": " - ] + console.print:": " + } - resolve : aLine - [ - var exp := ExpressionTree new:aLine. + resolve(expr) + { + var tree := new ExpressionTree(expr); - var Leaves := ArrayList new. - exp readLeaves:Leaves. + var leaves := new ArrayList(); + tree.readLeaves:leaves; - ifnot (Leaves ascendant; sequenceEqual(theNumbers ascendant)) - [ console printLine:"Invalid input. Enter an equation using all of those four digits. Try again.". ^ self ]. + ifnot (leaves.ascendant().sequenceEqual(theNumbers.ascendant())) + { console.printLine:"Invalid input. Enter an equation using all of those four digits. Try again."; ^ self }; - var aResult := exp value. - if (aResult == 24) - [ - console printLine("Good work. ",aLine,"=",aResult). + var result := tree.Value; + if (result == 24) + { + console.printLine("Good work. ",expr,"=",result); - self newPuzzle. - ]; - [ console printLine("Incorrect. ",aLine,"=",aResult) ] - ] + self.newPuzzle() + } + else + { + console.printLine("Incorrect. ",expr,"=",result) + } + } } extension gameOp { - playRound : aLine - [ - if (aLine == "q") - [ ^ false ]; - [ - if (aLine == "") - [ console printLine:"Skipping this puzzle". self newPuzzle. ]; - [ - try(self resolve:aLine) - { - on(Exception e) [ - console writeLine:"An error occurred. Check your input and try again." - ] - } - ]. - ^ true - ]. - ] + playRound(expr) + { + if (expr == "q") + { + ^ false + } + else + { + if (expr == "") + { + console.printLine:"Skipping this puzzle"; self.newPuzzle() + } + else + { + try + { + self.resolve(expr) + } + catch(Exception e) + { + console.printLine:"An error occurred. Check your input and try again." + } + }; + + ^ true + } + } } -public program -[ - var aGame := TwentyFourGame new; help. +public program() +{ + var game := new TwentyFourGame().help(); - while (aGame prompt; playRound(console readLine)) []. -] + while (game.prompt().playRound(console.readLine())) {} +} diff --git a/Task/24-game/FreeBASIC/24-game.freebasic b/Task/24-game/FreeBASIC/24-game.freebasic new file mode 100644 index 0000000000..d2674a8669 --- /dev/null +++ b/Task/24-game/FreeBASIC/24-game.freebasic @@ -0,0 +1,108 @@ +' The 24 game en FreeBASIC + +Const operaciones = "*/+-" + +Declare Sub Encabezado +Declare Function escoge4() As String +Declare Function quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String +Declare Function evaluaEntrada(cadena As String) As Integer +Declare Function evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer + +Dim Shared As String serie, entrada, cadena +Dim As Integer resultado + +Sub Encabezado + Cls: Color 15 + Print "The 24 Game" + Print "============" + Chr(13) + Chr(10) + Print "Dados cuatro dígitos en el rango de 1 a 9, que pueden repetirse, " + Print "usando solo los operadores aritméticos suma (+), resta (-), " + Print "multiplicación (*) y división (/) intentar obtener un resultado de 24." + Chr(13) + Chr(10) + Print "Use la notación polaca inversa (primero los operandos y luego los operadores)." + Print "Por ejemplo: en lugar de 2 + 4, escriba 2 4 +" + Chr(13) + Chr(10) +End Sub + +Function escoge4() As String + Dim As Byte i + Dim As String a, b + + Print "Los dígitos a utilizar son: "; + For i = 1 To 4 + a = Str(Int(Rnd*9)+1) + Print a;" "; + b = b + a + Next i + escoge4 = b +End Function + +Function evaluaEntrada(cadena As String) As Integer + Dim As Byte oper1, oper2, n(4), i + Dim As String op + oper1 = 0: oper2 = 0: i = 0 + + While cadena <> "" + op = Left(cadena, 1) + entrada = Mid(cadena, 2) + If Instr(serie, op) Then + i = i + 1 + n(i) = Val(op) + Elseif Instr(operaciones, op) Then + oper2 = n(i) + n(i) = 0 + i = i - 1 + oper1 = n(i) + n(i) = evaluador(oper1, oper2, op) + Else + Print "Signo no v lido" + End If + Wend + evaluaEntrada = n(i) +End Function + +Function evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer + Dim As Integer t + + Select Case operacion + Case "+": t = oper1 + oper2 + Case "-": t = oper1 - oper2 + Case "*": t = oper1 * oper2 + Case "/": t = oper1 / oper2 + End Select + + evaluador = t +End Function + +Function quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String + Dim As Byte len1 = Len(subcadena1), len2 = Len(subcadena2) + Dim As Byte i + + i = Instr(cadena, subcadena1) + While i + cadena = Left(cadena, i - 1) & subcadena2 & Mid(cadena, i + len1) + i = Instr(i + len2, cadena, subcadena1) + Wend + quitaEspacios = cadena +End Function + +'--- Programa Principal --- +Randomize Timer +Do + Encabezado + serie = escoge4 + Print: Line Input "Introduzca su fórmula en notación polaca inversa: ", entrada + entrada = quitaEspacios(entrada, " ", "") + If (Len(entrada) <> 7) Then + Print "Error en la serie introducida." + Else + resultado = evaluaEntrada(entrada) + Print "El resultado es = "; resultado + If resultado = 24 Then + Print "¡Correcto!" + Else + Print "¡Error!" + End If + End If + Print "¿Otra ronda? (Pulsa S para salir, u otra tecla para continuar)" +Loop Until (Ucase(Input(1)) = "S") +End +'-------------------------- diff --git a/Task/24-game/Modula-2/24-game.mod2 b/Task/24-game/Modula-2/24-game.mod2 index f5421c8db6..bdb79b5e2a 100644 --- a/Task/24-game/Modula-2/24-game.mod2 +++ b/Task/24-game/Modula-2/24-game.mod2 @@ -131,7 +131,7 @@ BEGIN div : num := num / VAL(REAL,operand[index]); END;(*of CASE*) END;(*of FOR*) - END;(*of WIHT*) + END;(*of WITH*) END evaluateExpr; (**************************************************************generateNumbers*) diff --git a/Task/24-game/REXX/24-game-1.rexx b/Task/24-game/REXX/24-game-1.rexx index c5666bd51e..f78d5c32a6 100644 --- a/Task/24-game/REXX/24-game-1.rexx +++ b/Task/24-game/REXX/24-game-1.rexx @@ -1,118 +1,235 @@ -/*REXX program supports a human to play the game of 24 (twenty-four) with error checking*/ -parse arg yyy; yyy=space(yyy, 0) /*get optional CL args; elide blanks. */ -parse var yyy start '-' fin /*get the START and FINish (maybe). */ - fin= word(fin start, 1) /*if no FINish specified, use START.*/ - ops= '+-*/' ; Lops= length(0ps) /*define the legal arithmetic operators*/ -groupSym= '()[]{}' /*legal grouping symbols for this game.*/ - pad= left('', 30) /*used to indent display of solutions. */ - Lpar= '(' ; Rpar= ')' /*strings to make the output prettier.*/ - digs= 123456789 /*numerals (digits) that can be used. */ - show= 1 /*flag used show solutions (0 = not). */ - do j=1 for Lops; @.j=substr(ops,j,1); end /*for fast execution. */ -signal on syntax /*enable program to trap syntax errors.*/ -if yyy\=='' then do; sols=solve(start, fin) /*solve from START ───► FINish. */ - if sols <0 then exit 13 /*Was there a problem with the input? */ - if sols==0 then sols='No' /*Englishize the SOLS variable value*/ - say; say sols 'unique solution's(sols) "found for" yyy - exit /*S [↑] does pluralizations. */ - end -show=0 /*stop SOLVE from blabbing solutions.*/ - do forever; rrrr=random(1111, 9999) - if pos(0, rrrr)\==0 then iterate /*if it contains a zero, then ignore it*/ - if solve(rrrr) \==0 then leave /*if solved, then we can stop looking. */ +/*REXX program helps the user find solutions to the game of 24. + start─of─help +╔═════════════════════════════════════════════════════════════════════════════╗ +║ Argument is either of these forms: (blank) ║~ +║ ssss ║~ +║ ssss,total,limit ║~ +║ ssss-ffff ║~ +║ ssss-ffff,total,limit ║~ +║ -ssss ║~ +║ +ssss ║~ +║ ║~ +║ where SSSS and/or FFFF must be exactly four numerals (digits) ║~ +║ comprised soley of the numerals (digits) 1 ──> 9 (no zeroes). ║~ +║ ║~ +║ SSSS is the start, and FFFF is the end (inclusive). ║~ +║ ║~ +║ If ssss has a leading plus (+) sign, it is used as the digits, and ║~ +║ the user is prompted to enter a solution (using those decimal digits). ║~ +║ ║~ +║ If ssss has a leading minus (-) sign, a solution is looked for and ║~ +║ the user is told there is a solution (or not), but no solutions are shown). ║~ +║ ║~ +║ If no argument is specified, this program generates four digits (no zeros) ║~ +║ which has at least one solution, and shows the sorted digits to the user, ║~ +║ requesting that they enter a solution (the digits used may be in any order).║~ +║ ║~ +║ If TOTAL is entered, it is the desired answer. The default is 24. ║~ +║ If LIMIT is entered, it limits the number of solutions shown. ║~ +║ ║~ +║ A solution to be entered can be in the form of: ║ +║ ║ +║ digit1 operator digit2 operator digit3 operator digit4 ║ +║ ║ +║ where DIGITn is one of the digits shown (in any order), and ║ +║ OPERATOR can be any one of: + - * / ║ +║ ║ +║ Parentheses () may be used in the normal manner for grouping, as well as ║ +║ brackets [] or braces {}. Blanks can be used anywhere. ║ +║ ║ +║ I.E.: for the digits 3448 the following could be entered: 3*8 + (4-4) ║ +╚═════════════════════════════════════════════════════════════════════════════╝ + end─of─help */ +numeric digits 12 /*where rational arithmetic is needed. */ +parse arg orig; uargs= orig /*get the guess from the command line*/ +orig= space(orig, 0) /*remove all blanks from ORIG. */ +negatory= left(orig,1)=='-' /*=1, suppresses showing. */ +pository= left(orig,1)=='+' /*=1, force $24 to use specific number.*/ +if pository | negatory then orig=substr(orig,2) /*now, just use the absolute vaue. */ +parse var orig orig ',' $ "," limit /*get optional total ($) and/or limit*/ +parse var orig start '-' finish /*get start and finish (maybe). */ +opers= '*' || "/+-" /*arithmetic opers; order is important.*/ +ops= length(opers) /*the number of arithmetic operators. */ +groupsym= space(' ( ) [ ] { } « » ', 0) /*the allowable grouping symbols. */ +indent= left('', 30) /*indents the display of solutions. */ +show= 1 /*=1, shows solutions (a semifore). */ +digs= 123456789 /*numerals/digits that can be used. */ +abuttals = 0 /*=1, allows digit abutal: 12+12 */ +if $=='' then $= 24 /*the name of the game: (24) */ +if limit=='' then limit= 1 /*=1, shows only one solution. */ + do j=1 for ops; o.j=substr(opers, j, 1) /*these are used for fast execution. */ + end /*j*/ +if \datatype(limit, 'N') then do; call ger limit "isn't numeric"; exit 13; end +limit= limit / 1 /*normalize the number for limit. */ +if \datatype($, 'N') then do; call ger $ "isn't numeric"; exit 13; end +$= $ / 1 /*normalize the number for total. */ +if start\=='' & \pository then do; call ranger start,finish; exit 1; end +show= 0 /*stop blabbing solutions in SOLVE. */ + do forever while \negatory /*keep truckin' until a solution. */ + x.= 0 /*way to hold unique expressions. */ + rrrr= random(1111, 9999) /*get a random set of digits. */ + if pos(0, rrrr)\==0 then iterate /*but don't the use of zeroes. */ + if solve(rrrr)\==0 then leave /*try to solve for these digits. */ end /*forever*/ -show=1 /*enable SOLVE to display solutions. */ -rrrr=sort(rrrr); Lrrrr=length(rrrr) /*sort four digits (for consistency). */ -$.=0 - do j=1 for Lrrrr; _=substr(rrrr,j,1) /*digit count for each digit in RRRR. */ - $._= countDigs(rrrr, _) /*define the count for this digit. */ - end /*j*/ /* [↑] counts duplicates twice, no harm*/ - __ = copies('─', 9) /*used for output highlighting. */ -prompt= 'Using the digits ' rrrr", enter an expression that equals 24 (or QUIT):" - /* [↓] ITERATE needs a variable name.*/ - do prompter=0 by 0; say; say __ prompt /*display blank line and the prompt (P)*/ - pull y; y=space(y, 0) /*get Y from CL, then remove all blanks*/ - if abbrev('QUIT', y, 1) then exit 0 /*Does the user want to quit this game?*/ - _v=verify(y, digs || ops || groupSym); a=substr(y, max(1,_v), 1) - if _v\==0 then do; call ger "invalid character:" a; iterate; end - if pos('**', y) then do; call ger "invalid ** operator"; iterate; end - if pos('//', y) then do; call ger "invalid // operator"; iterate; end - Ly=length(y) - if y=='' then do; call validate y; iterate; end - do j=1 for Ly-1; if \datatype(substr(y,j ,1), 'W') then iterate - if \datatype(substr(y,j+1,1), 'W') then iterate - call ger 'invalid use of "digit abuttal".' - iterate prompter - end /*j*/ - yd=countDigs(y,digs) /*count of the digits 1──►9 (123456789)*/ - if yd<4 then do; call ger 'not enough digits entered.'; iterate /*prompter*/; end - if yd>4 then do; call ger 'too many digits entered.' ; iterate /*prompter*/; end - do j=1 for 9; if $.j==0 then iterate - _d=countDigs(y, j); if $.j==_d then iterate - if _d<$.j then call ger 'not enough' j "digits, must be" $.j - else call ger 'too many' j "digits, must be" $.j - iterate prompter - end /*j*/ - interpret 'ans=' translate(y, '()()', "[]{}"); ans=ans/1 - if ans==24 then leave prompter; say 'incorrect, ' y"="ans - end /*prompter*/ +show= 1 /*enable SOLVE to show solutions. */ +if pository then rrrr=start /*use what's specified. */ +rrrr= sortc(rrrr) /*sort four elements. */ +rd.= 0 + do j=1 for 9; _= substr(rrrr, j, 1); rd._= #chars(rrrr, _) + end /*j*/ /* [↑] count for each digit in RRRR. */ + do guesses=1; say; @prompt= copies('─', 8) "Using the digits " + say @prompt rrrr", enter an expression that equals" $ ' (or ? or QUIT):' + pull y; uargs= y; y= space(y, 0) /*obtain the user's response. */ + if abbrev('QUIT', y, 1) then exit 0 /*does the user want to quit this game?*/ + helpstart= 0 + if y=='?' then do j=1 for sourceline(); _= sourceline(j) /*get a line of program.*/ + if p(_)=='start─of─help' then do; helpstart= 1; iterate; end + if p(_)=='end─of─help' then iterate guesses + if \helpstart | right(_, 1)=='~' then iterate + say ' ' _ + end /*j*/ /* [↑] use an in─line way to show help*/ + _v= verify(y, digs || opers || groupsym) /*any illegal characters? */ + if _v\==0 then do; call ger 'invalid character:' substr(y, _v, 1); iterate; end + if y='' then do; call validate y; iterate; end -say; say center('┌─────────────────────┐', 79) - say center('│ │', 79) - say center('│ congratulations ! │', 79) - say center('│ │', 79) - say center('└─────────────────────┘', 79) + do j=1 for length(y)-1 while \abuttals /*check for two adjacent decimal digits*/ + if datatype( substr(y, j, 1), 'W') & datatype( substr(y, j+1, 1), 'W') then + do; call ger 'invalid use of digit abuttal' substr(y,j,2) + iterate guesses + end + end /*j*/ + + yd= #chars(y, digs) /*count of legal digits 123456789 */ + if yd<4 then do; call ger 'not enough digits entered.'; iterate guesses; end + if yd>4 then do; call ger 'too many digits entered.' ; iterate guesses; end + + do j=1 for length(groupsym) by 2 + if #chars(y,substr(groupsym,j ,1))\==, + #chars(y,substr(groupsym,j+1,1)) then do; @mis= 'mismatched' + call ger @mis substr(groupsym, j, 2) + iterate guesses + end + end /*j*/ + + do k=1 for 2 /*check for ** and // */ + _= copies( substr( opers, k, 1), 2) /*only examine the first two operators.*/ + if pos(_, y)\==0 then do; call ger 'illegal operator:' _; iterate guesses; end + end /*k*/ + + do j=1 for 9; if rd.j==0 then iterate; _d= #chars(y, j) + if _d==rd.j then iterate + if _dpd & lm4 then call ger "too many" DE - when pos(0,y)\==0 then call ger "can't use the digit 0 (zero)." - when _v\==0 then call ger "illegal character: " substr(y, _v, 1) - otherwise nop - end /*select*/; return OK +sortc: procedure; arg nnnn; @.= /*sorts the digits of NNNN */ + do i=1 for length(nnnn); _= substr(nnnn, i, 1); @._= @._||_; end /*i*/ + return @.0 || @.1 || @.2 || @.3 || @.4 || @.5 || @.6 || @.7 || @.8 || @.9 +/*──────────────────────────────────────────────────────────────────────────────────────*/ +validate: parse arg y; errCode= 0; _v= verify(y, digs) + select + when y=='' then call ger 'no digits entered.' + when length(y)<4 then call ger 'not enough digits entered, must be 4' + when length(y)>4 then call ger 'too many digits entered, must be 4' + when pos(0,y)\==0 then call ger "can't use the digit 0 (zero)" + when _v\==0 then call ger 'illegal character:' substr(y, _v, 1) + otherwise nop + end /*select*/ + return \errCode diff --git a/Task/24-game/Red/24-game.red b/Task/24-game/Red/24-game.red new file mode 100644 index 0000000000..7afddc99e2 --- /dev/null +++ b/Task/24-game/Red/24-game.red @@ -0,0 +1,34 @@ +Red [] +print "Evaluation from left to right with no precedence, unless you use parenthesis." print "" +a: "123456789" +guess: "" +valid: "" +sucess: false +random/seed now/time +loop 4 [append valid last random a] +print ["The numbers are: " valid/1 ", " valid/2 ", " valid/3 " and " valid/4] +sort valid +insert valid " " + +expr: [term ["+" | "-"] expr | term] +term: [primary ["*" | "/"] term | primary] +primary: [some digit | "(" expr ")"] +digit: charset valid + +while [not sucess] [ + guess: ask "Enter your expression: " + if guess = "q" [halt] + numbers: copy guess + sort numbers + numbers: take/last/part numbers 4 + insert numbers " " + either (parse guess expr) and (valid = numbers) [ + repeat i length? guess [insert at guess (i * 2) " "] + result: do guess + print ["The result of your expression is: " result] + if (result = 24) [sucess: true] + ][ + print "Something is wrong with the expression, try again." + ] +] +print "You got it right!" diff --git a/Task/9-billion-names-of-God-the-integer/00META.yaml b/Task/9-billion-names-of-God-the-integer/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/9-billion-names-of-God-the-integer/Crystal/9-billion-names-of-god-the-integer.crystal b/Task/9-billion-names-of-God-the-integer/Crystal/9-billion-names-of-god-the-integer.crystal new file mode 100644 index 0000000000..0a930ae9f6 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Crystal/9-billion-names-of-god-the-integer.crystal @@ -0,0 +1,8 @@ +def g(n,g) + return 1 unless 1 < g && g < n-1 + (2..g).reduce(1){|res,q| res + (q > n-g ? 0 : g(n-g,q))} +end + +(1..25).each {|n| + puts (1..n).map {|g| "%4s" % g(n,g)}.join +} diff --git a/Task/9-billion-names-of-God-the-integer/Go/9-billion-names-of-god-the-integer.go b/Task/9-billion-names-of-God-the-integer/Go/9-billion-names-of-god-the-integer.go index a932733ef3..75db20085f 100644 --- a/Task/9-billion-names-of-God-the-integer/Go/9-billion-names-of-god-the-integer.go +++ b/Task/9-billion-names-of-God-the-integer/Go/9-billion-names-of-god-the-integer.go @@ -1,24 +1,30 @@ package main import ( - f "fmt" - "math" - m "math/big" + "fmt" + "math/big" ) func main() { - var cache = make([][]m.Int, 0) - cache = append(cache, append([]m.Int{}, *m.NewInt(1))) - cumu := func(n int) []m.Int { - for l := len(cache); l <= n; l++ { - r := make([]m.Int, 0) - r = append(r, *m.NewInt(0)) - for x := 1; x <= l; x++ { - cacheValue := &cache[l-x][int(math.Min(float64(x), float64(l-x)))] - r = append(r, *m.NewInt(0).Add(&r[len(r)-1], cacheValue)) + intMin := func(a, b int) int { + if a < b { + return a + } else { + return b + } + } + + var cache = [][]*big.Int{{big.NewInt(1)}} + + cumu := func(n int) []*big.Int { + for y := len(cache); y <= n; y++ { + row := []*big.Int{big.NewInt(0)} + for x := 1; x <= y; x++ { + cacheValue := cache[y-x][intMin(x, y-x)] + row = append(row, big.NewInt(0).Add(row[len(row)-1], cacheValue)) } - cache = append(cache, r) + cache = append(cache, row) } return cache[n] } @@ -26,20 +32,20 @@ func main() { row := func(n int) { e := cumu(n) for i := 0; i < n; i++ { - f.Printf(" %v ", (*m.NewInt(0).Sub(&e[i+1], &e[i])).Text(10)) + fmt.Printf(" %v ", (big.NewInt(0).Sub(e[i+1], e[i])).Text(10)) } - f.Print("\n") + fmt.Println() } - f.Print("rows:\n") + fmt.Println("rows:") for x := 1; x < 11; x++ { row(x) } - f.Print("\n sums:\n") - nums := []int{23, 123, 1234,12345} - for _, num := range nums { + fmt.Println() + + fmt.Println("sums:") + for _, num := range [...]int{23, 123, 1234, 12345} { r := cumu(num) - f.Printf("%d %v \n", num, r[len(r)-1].Text(10)) + fmt.Printf("%d %v\n", num, r[len(r)-1].Text(10)) } - } diff --git a/Task/9-billion-names-of-God-the-integer/Julia/9-billion-names-of-god-the-integer.julia b/Task/9-billion-names-of-God-the-integer/Julia/9-billion-names-of-god-the-integer.julia new file mode 100644 index 0000000000..f401a9c8b2 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Julia/9-billion-names-of-god-the-integer.julia @@ -0,0 +1,38 @@ +using Combinatorics, StatsBase + +namesofline(n) = counts([x[1] for x in integer_partitions(n)]) + +function centerjustpyramid(n) + maxwidth = length(string(namesofline(n))) + for i in 1:n + s = string(namesofline(i)) + println(" " ^ div(maxwidth - length(s), 2), s) + end +end + +centerjustpyramid(25) + +const cachecountpartitions = Dict{BigInt,BigInt}() +function countpartitions(n::BigInt) + if n < 0 + 0 + elseif n < 2 + 1 + elseif (np = get(cachecountpartitions, n, 0)) > 0 + np + else + np = 0 + sgn = 1 + for k = 1:n + np += sgn * (countpartitions(n - (k*(3k-1)) >> 1) + countpartitions(n - (k*(3k+1)) >> 1)) + sgn = -sgn + end + cachecountpartitions[n] = np + end +end + +G(n) = countpartitions(BigInt(n)) + +for g in [23, 123, 1234, 12345] + @time println("\nG($g) is $(G(g))") +end diff --git a/Task/9-billion-names-of-God-the-integer/Maple/9-billion-names-of-god-the-integer.maple b/Task/9-billion-names-of-God-the-integer/Maple/9-billion-names-of-god-the-integer.maple new file mode 100644 index 0000000000..ec2b89ce9a --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Maple/9-billion-names-of-god-the-integer.maple @@ -0,0 +1,7 @@ +TriangleLine(n) := map(rhs, Statistics :- Tally(map(x -> x[-1], combinat:-partition(n)))): +Triangle := proc(m) + local i; + for i from 1 to m do + print(op(TriangleLine(i))); + end do + end proc: diff --git a/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-1.phix b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-1.phix new file mode 100644 index 0000000000..36bbf19889 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-1.phix @@ -0,0 +1,32 @@ +-- demo\rosetta\9billionnames.exw + +sequence cache = {{1}} +function cumu(integer n) +sequence r + for l=length(cache) to n do + r = {0} + for x=1 to l do + r = append(r,r[-1]+cache[l-x+1][min(x,l-x)+1]) + end for + cache = append(cache,r) + end for + return cache[n] +end function + +function row(integer n) +sequence r = cumu(n+1) +sequence res = repeat(0,n) + for i=1 to n do + res[i] = r[i+1]-r[i] + end for + return res +end function + +for i=1 to 25 do + puts(1,repeat(' ',50-2*i)) + sequence r = row(i) + for j=1 to i do + printf(1,"%4d",r[j]) + end for + puts(1,"\n") +end for diff --git a/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-2.phix b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-2.phix new file mode 100644 index 0000000000..d9ecee0550 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-2.phix @@ -0,0 +1,30 @@ +include mpfr.e + +sequence p + +procedure calc(integer n) + n += 1 + for k=1 to n-1 do + integer d = n - k * (3 * k - 1) / 2; + if d<1 then exit end if + if and_bits(k,1) then mpz_add(p[n],p[n],p[d]) + else mpz_sub(p[n],p[n],p[d]) end if + d -= k; + if d<1 then exit end if + if and_bits(k,1) then mpz_add(p[n],p[n],p[d]) + else mpz_sub(p[n],p[n],p[d]) end if + end for +end procedure + +constant cx = {23, 123, 1234, 12345} +puts(1,"sums:\n") +integer at = 1 +p = mpz_inits(cx[$]+1) +mpz_set_si(p[1],1) +for i=1 to cx[$] do + calc(i) + if i=cx[at] then + printf(1,"%2d:%s\n",{i,mpz_get_str(p[i+1])}) + at += 1 + end if +end for diff --git a/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-3.phix b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-3.phix new file mode 100644 index 0000000000..43f80870e0 --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer-3.phix @@ -0,0 +1,30 @@ +include pGUI.e +IupOpen() +IupControlsOpen() +Ihandle plot = IupPlot("MENUITEMPROPERTIES=Yes, SIZE=640x320") +IupSetAttribute(plot, "TITLE", "9 Billion Names"); +IupSetAttribute(plot, "TITLEFONTSIZE", "10"); +IupSetAttribute(plot, "TITLEFONTSTYLE", "ITALIC"); +IupSetAttribute(plot, "GRIDLINESTYLE", "DOTTED"); +IupSetAttribute(plot, "GRID", "YES"); +IupSetAttribute(plot, "AXS_XLABEL", "x"); +IupSetAttribute(plot, "AXS_YLABEL", "G(x)"); +IupSetAttribute(plot, "AXS_XFONTSTYLE", "ITALIC"); +IupSetAttribute(plot, "AXS_YFONTSTYLE", "ITALIC"); +IupSetAttribute(plot, "AXS_XSCALE", "LOG10"); +IupSetAttribute(plot, "AXS_YSCALE", "LOG10"); +IupSetAttribute(plot, "AXS_YTICKSIZEAUTO", "NO"); +IupSetAttribute(plot, "AXS_YTICKMAJORSIZE", "8"); +IupSetAttribute(plot, "AXS_YTICKMINORSIZE", "0"); +IupPlotBegin(plot) +for x=1 to 999 do + IupPlotAdd(plot, x, sum(row(x))) -- (row() from part 1) +end for +{} = IupPlotEnd(plot) +Ihandle dlg = IupDialog(plot) +IupCloseOnEscape(dlg) +IupSetAttribute(dlg, "TITLE", "9 Billion Names") +IupMap(dlg) +IupShowXY(dlg,IUP_CENTER,IUP_CENTER) +IupMainLoop() +IupClose() diff --git a/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer.phix b/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer.phix deleted file mode 100644 index d649ec5068..0000000000 --- a/Task/9-billion-names-of-God-the-integer/Phix/9-billion-names-of-god-the-integer.phix +++ /dev/null @@ -1,52 +0,0 @@ --- --- Phix does not have a bignum library, and I have not attempted any formatting. --- sum(1234) shows 1.5697879723e+35, not 156978797223733228787865722354959930, --- and I did not wait to see if sum(12345) would finish. [for sum read cumu[$]] --- If you want to try plotting things, then demo\arwendemo\demo_curve_fit.exw --- might get you started. - -function min(atom a, atom b) - if a<=b then return a end if - return b -end function - -sequence cache = {{1}} -function cumu(integer n) -sequence r - for l=length(cache) to n do - r = {0} - for x=1 to l do - r = append(r,r[-1]+cache[l-x+1][min(x,l-x)+1]) - end for - cache = append(cache,r) - end for - return cache[n] -end function - -function row(integer n) -sequence r = cumu(n+1) -sequence res = repeat(0,n) - for i=1 to n do - res[i] = r[i+1]-r[i] - end for - return res -end function - -constant cx = {23, 123, 1234} --, 12345} -procedure nine_billion_names() - - puts(1,"rows:\n") - for x=1 to 25 do - printf(1,"%2d:",x) - ?row(x) - end for - - puts(1,"sums:\n") - for i=1 to length(cx) do - printf(1,"%2d:",cx[i]) - ?cumu(cx[i]+1)[$] - end for - if getc(0) then end if -end procedure - - nine_billion_names() diff --git a/Task/9-billion-names-of-God-the-integer/VBA/9-billion-names-of-god-the-integer.vba b/Task/9-billion-names-of-God-the-integer/VBA/9-billion-names-of-god-the-integer.vba new file mode 100644 index 0000000000..ea43e009fd --- /dev/null +++ b/Task/9-billion-names-of-God-the-integer/VBA/9-billion-names-of-god-the-integer.vba @@ -0,0 +1,16 @@ +Public Sub nine_billion_names() + Dim p(25, 25) As Long + p(1, 1) = 1 + For i = 2 To 25 + For j = 1 To i + p(i, j) = p(i - 1, j - 1) + p(i - j, j) + Next j + Next i + For i = 1 To 25 + Debug.Print String$(50 - 2 * i, " "); + For j = 1 To i + Debug.Print String$(4 - Len(CStr(p(i, j))), " ") & p(i, j); + Next j + Debug.Print + Next i +End Sub diff --git a/Task/99-Bottles-of-Beer/00META.yaml b/Task/99-Bottles-of-Beer/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/99-Bottles-of-Beer/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/99-Bottles-of-Beer/ALGOL-M/99-bottles-of-beer.algol-m b/Task/99-Bottles-of-Beer/ALGOL-M/99-bottles-of-beer.algol-m new file mode 100644 index 0000000000..046bb2d7bd --- /dev/null +++ b/Task/99-Bottles-of-Beer/ALGOL-M/99-bottles-of-beer.algol-m @@ -0,0 +1,32 @@ +BEGIN + +COMMENT PRINT LYRICS TO "99 BOTTLES OF BEER ON THE WALL"; + +STRING FUNCTION BOTTLE(N); % GIVE CORRECT GRAMMATICAL FORM % +INTEGER N; +BEGIN + IF N = 1 THEN + BOTTLE := " BOTTLE" + ELSE + BOTTLE := " BOTTLES"; +END; + +INTEGER N; + +N := 99; +WHILE N > 0 DO + BEGIN + WRITE(N, BOTTLE(N), " OF BEER ON THE WALL,"); + WRITEON(N, BOTTLE(N), " OF BEER"); + WRITE("TAKE ONE DOWN AND PASS IT AROUND, "); + N := N - 1; + IF N = 0 THEN + WRITEON("NO MORE") + ELSE + WRITEON(N); + WRITEON(BOTTLE(N), " OF BEER ON THE WALL"); + WRITE(" "); % BLANK LINE BETWEEN STANZAS % + END; +WRITE("THANKS FOR SINGING ALONG!"); + +END diff --git a/Task/99-Bottles-of-Beer/Astro/99-bottles-of-beer.astro b/Task/99-Bottles-of-Beer/Astro/99-bottles-of-beer.astro index 90aad36c81..c36a79ab93 100644 --- a/Task/99-Bottles-of-Beer/Astro/99-bottles-of-beer.astro +++ b/Task/99-Bottles-of-Beer/Astro/99-bottles-of-beer.astro @@ -1,12 +1,12 @@ -fun bottles(n): - | 0 => "No more bottles" - | 1 => "1 bottle" - | _ => "$n bottles" +fun bottles(n): match __args__: + (0) => "No more bottles" + (1) => "1 bottle" + (_) => "$n bottles" for n in 99..-1..1: - print """ - ${bottles n} of beer on the wall - ${bottles n} of beer + print @format""" + {bottles n} of beer on the wall + {bottles n} of beer Take one down, pass it around - ${bottles n-1} of beer on the wall\n + {bottles n-1} of beer on the wall\n """ diff --git a/Task/99-Bottles-of-Beer/Bc/99-bottles-of-beer.bc b/Task/99-Bottles-of-Beer/Bc/99-bottles-of-beer.bc index 50271dd870..3c0702a9ee 100644 --- a/Task/99-Bottles-of-Beer/Bc/99-bottles-of-beer.bc +++ b/Task/99-Bottles-of-Beer/Bc/99-bottles-of-beer.bc @@ -1,5 +1,5 @@ i = 99; -while (i > -1) { +while ( 1 ) { print i , " bottles of beer on the wall\n"; print i , " bottles of beer\nTake one down, pass it around\n"; if (i == 2) { diff --git a/Task/99-Bottles-of-Beer/Clojure/99-bottles-of-beer-1.clj b/Task/99-Bottles-of-Beer/Clojure/99-bottles-of-beer-1.clj index a0f52a6878..3c4bb0a5e2 100644 --- a/Task/99-Bottles-of-Beer/Clojure/99-bottles-of-beer-1.clj +++ b/Task/99-Bottles-of-Beer/Clojure/99-bottles-of-beer-1.clj @@ -1,12 +1,13 @@ -(defn sing - [start] - (doseq [n (range start 0 -1)] - (printf "%d bottles of beer on the wall, -%d bottles of beer, -Take one down, pass it around, -%d bottles of beer on the wall.\n\n" - n - n - (dec n)))) +(defn paragraph [num] + (str num " bottles of beer on the wall\n" + num " bottles of beer\n" + "Take one down, pass it around\n" + (dec num) " bottles of beer on the wall.\n")) -(sing 99) +(defn lyrics [] + (let [numbers (range 99 0 -1) + paragraphs (map paragraph numbers)] + (clojure.string/join "\n" paragraphs))) + + +(print (lyrics)) 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 db355327c0..362e502616 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 @@ -1,35 +1,35 @@ -import system'routines. -import extensions. -import extensions'routines. -import extensions'text. +import system'routines; +import extensions; +import extensions'routines; +import extensions'text; extension bottleOp { - bottleDescription - = self literal + (self != 1) iif(" bottles"," bottle"). + bottleDescription() + = self.Printable + (self != 1).iif(" bottles"," bottle"); - bottleEnumerator = Variable new:self; doWith(:n) - [ - ^ Enumerator:: + bottleEnumerator() = new Variable(self).doWith:(n) + { + ^ new Enumerator: { - bool next = n > 0. + bool next() = n > 0; - get = StringWriter new; - printLine(n bottleDescription," of beer on the wall"); - printLine(n bottleDescription," of beer"); - printLine("Take one down, pass it around"); - printLine((n reduce:1) bottleDescription," of beer on the wall"). + get() = new StringWriter() + .printLine(n.bottleDescription()," of beer on the wall") + .printLine(n.bottleDescription()," of beer") + .printLine("Take one down, pass it around") + .printLine((n.reduce:1).bottleDescription()," of beer on the wall"); - reset [] + reset() {} - enumerable = target. + enumerable() = __target; } - ]. + }; } -public program -[ - var bottles := 99. +public program() +{ + var bottles := 99; - bottles bottleEnumerator; forEach:printingLn. -] + bottles.bottleEnumerator().forEach:printingLn +} diff --git a/Task/99-Bottles-of-Beer/Go/99-bottles-of-beer-1.go b/Task/99-Bottles-of-Beer/Go/99-bottles-of-beer-1.go index ac31ac13b1..f167273d1f 100644 --- a/Task/99-Bottles-of-Beer/Go/99-bottles-of-beer-1.go +++ b/Task/99-Bottles-of-Beer/Go/99-bottles-of-beer-1.go @@ -3,16 +3,21 @@ package main import "fmt" func main() { - cardinality := func (i int) string { - if i!=1 { - return "s" + bottles := func(i int) string { + switch i { + case 0: + return "No more bottles" + case 1: + return "1 bottle" + default: + return fmt.Sprintf("%d bottles", i) } - return "" } + for i := 99; i > 0; i-- { - fmt.Printf("%d bottle%s of beer on the wall\n", i, cardinality(i)) - fmt.Printf("%d bottle%s of beer\n", i, cardinality(i)) + fmt.Printf("%s of beer on the wall\n", bottles(i)) + fmt.Printf("%s of beer\n", bottles(i)) fmt.Printf("Take one down, pass it around\n") - fmt.Printf("%d bottle%s of beer on the wall\n", i-1, cardinality(i-1)) + fmt.Printf("%s of beer on the wall\n", bottles(i-1)) } } diff --git a/Task/99-Bottles-of-Beer/Golo/99-bottles-of-beer.golo b/Task/99-Bottles-of-Beer/Golo/99-bottles-of-beer.golo new file mode 100644 index 0000000000..a666ff2aac --- /dev/null +++ b/Task/99-Bottles-of-Beer/Golo/99-bottles-of-beer.golo @@ -0,0 +1,19 @@ +module Bottles + +augment java.lang.Integer { + function bottles = |self| -> match { + when self == 0 then "No bottles" + when self == 1 then "One bottle" + otherwise self + " bottles" + } +} + +function main = |args| { + 99: downTo(1, |i| { + println(i: bottles() + " of beer on the wall,") + println(i: bottles() + " of beer!") + println("Take one down, pass it around,") + println((i - 1): bottles() + " of beer on the wall!") + println("--------------------------------------") + }) +} diff --git a/Task/99-Bottles-of-Beer/Haskell/99-bottles-of-beer-4.hs b/Task/99-Bottles-of-Beer/Haskell/99-bottles-of-beer-4.hs index 5e59f70915..e07cb59771 100644 --- a/Task/99-Bottles-of-Beer/Haskell/99-bottles-of-beer-4.hs +++ b/Task/99-Bottles-of-Beer/Haskell/99-bottles-of-beer-4.hs @@ -1,27 +1,23 @@ -incant :: Int -> String -incant n = - let inventory = unwords . (: [locate]) . asset - in case n of - 0 -> solve - _ -> unlines [inventory n, asset n, distribute, inventory (n - 1)] - -asset :: Int -> String -asset n = - unwords - [ show n - , (reverse . concat) $ - (case n of - 1 -> [] - _ -> ['s']) : - [drink] - ] - -[locate, distribute, solve, drink] = +location, distribution, solution :: String +[location, distribution, solution] = [ "on the wall" , "Take one down, pass it around" , "Better go to the store to buy some more" - , "elttob" ] +asset :: Int -> String +asset n = + let suffix n + | 1 == n = [] + | otherwise = ['s'] + in unwords [show n, (reverse . concat) $ suffix n : ["elttob"]] + +incantation :: Int -> String +incantation n = + let inventory = unwords . (: [location]) . asset + in case n of + 0 -> solution + _ -> unlines [inventory n, asset n, distribution, inventory $ pred n] + main :: IO () -main = putStrLn $ unlines (incant <$> [99,98 .. 0]) +main = putStrLn $ unlines (incantation <$> [99,98 .. 0]) diff --git a/Task/99-Bottles-of-Beer/HolyC/99-bottles-of-beer.holyc b/Task/99-Bottles-of-Beer/HolyC/99-bottles-of-beer.holyc new file mode 100644 index 0000000000..a7ef196d4e --- /dev/null +++ b/Task/99-Bottles-of-Beer/HolyC/99-bottles-of-beer.holyc @@ -0,0 +1,29 @@ +U0 BottlesOfBeer (I64 initial=99) { + // This is made I64 rather than U64 + // Because, a U64 would overflow + // At the end of the loop, thus it would loop forever (i-- would be 0-1 so it overflows and is always greater than or equal to 0) + I64 i = initial; + + for (; i >= 0; i--) { + if (i == 1) { + // Just a string on it's own will pass it to an inbuilt HolyC function that puts it to terminal + "1 Bottle of Beer on the wall, 1 bottle of beer.\n"; + "Take one down and pass it around, no more bottles of beer on the wall.\n"; + } else if (i == 0) { + "No more bottles of beer on the wall, no more bottles of beer.\n"; + "Go to the store and buy some more, 99 bottles of beer on the wall.\n"; + } else { + "%d bottles of beer on the wall, %d bottles of beer.\n",i,i; + "Take one down and pass it around, %d bottle",(i-1); + // Only add the s if it's not 1 + if ((i-1) != 1) { + "s"; + } + + " of beer on the wall.\n"; + } + } +} + +// Calls the function, which goes to the default parameters +BottlesOfBeer; diff --git a/Task/99-Bottles-of-Beer/Neko/99-bottles-of-beer.neko b/Task/99-Bottles-of-Beer/Neko/99-bottles-of-beer.neko new file mode 100644 index 0000000000..815cd04526 --- /dev/null +++ b/Task/99-Bottles-of-Beer/Neko/99-bottles-of-beer.neko @@ -0,0 +1,31 @@ +/** + +

Rosetta Code, 99 bottles of beer on the wall, in Neko

+ + 
+ Tectonics:
+   nekoc 99bottles.neko
+   neko 99bottles
+
+ +**/ + +var message = " of beer on the wall\n"; +var beers = 99; + +var plural = function(n) { + return if (n == 1) " bottle" else " bottles"; +} + +var nonesome = function(n) { + return if (n > 0) n else "No more"; +} + +while (beers > 0) { + $print(nonesome(beers), plural(beers), message); + $print(nonesome(beers), plural(beers), " of beer\n"); + $print("Take one down, pass it around\n"); + beers -= 1; + $print(nonesome(beers), plural(beers), message); + if (beers > 0) $print("\n"); +} diff --git a/Task/99-Bottles-of-Beer/PHP/99-bottles-of-beer-6.php b/Task/99-Bottles-of-Beer/PHP/99-bottles-of-beer-6.php new file mode 100644 index 0000000000..7cb0fd4999 --- /dev/null +++ b/Task/99-Bottles-of-Beer/PHP/99-bottles-of-beer-6.php @@ -0,0 +1,15 @@ + 0 ) { + printf( $lyrics, $x != 1 ? 's' : '', $x--, $x != 1 ? 's' : '', $x > 0 ? $x : 'No more' ); +} diff --git a/Task/99-Bottles-of-Beer/Picat/99-bottles-of-beer.picat b/Task/99-Bottles-of-Beer/Picat/99-bottles-of-beer.picat new file mode 100644 index 0000000000..869ea9238a --- /dev/null +++ b/Task/99-Bottles-of-Beer/Picat/99-bottles-of-beer.picat @@ -0,0 +1,25 @@ +beer1(N) => + Beer = N, + while (Beer > 0) + printf("%d bottles of beer on the wall,\n", Beer), + printf("%d bottles of beer.\n", Beer), + printf("Take one down, pass it around.\n"), + printf("%d bottles of beer.\n", Beer-1), + Beer := Beer -1 + end, + print("0 more bottles of beer on the wall.\n"), + nl. + +% With plurals. +beer2(B) = S => + BS = B.to_string(), + BB = " bottle", + BT = BB, + if B > 1 then BB := BB ++ "s" end, + OB = " of beer", + NL = "\n", + BW = OB ++ " on the wall." ++ NL, + T = "Take one down, pass it around." ++ NL, + S1 = BS ++ BT ++ BW ++ BS ++ BT ++ OB ++ T ++ + cond(B > 0, (B-1).to_string() ++ BT ++ BW ++ NL, ""), + S = S1. diff --git a/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-3.py b/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-3.py new file mode 100644 index 0000000000..f9acc3e2d1 --- /dev/null +++ b/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-3.py @@ -0,0 +1,111 @@ +'''99 Units of Disposable Asset''' + + +from itertools import chain + + +# main :: IO () +def main(): + '''Modalised asset dispersal procedure.''' + + # localisation :: (String, String, String) + localisation = ( + 'on the wall', + 'Take one down, pass it around', + 'Better go to the store to buy some more' + ) + + print(unlines(map( + incantation(localisation), + enumFromThenTo(99)(98)(0) + ))) + + +# incantation :: (String, String, String) -> Int -> String +def incantation(localisation): + '''Versification of asset disposal + and inventory update.''' + + location, distribution, solution = localisation + + def inventory(n): + return unwords([asset(n), location]) + return lambda n: solution if 0 == n else ( + unlines([ + inventory(n), + asset(n), + distribution, + inventory(pred(n)) + ]) + ) + + +# asset :: Int -> String +def asset(n): + '''Quantified asset.''' + def suffix(n): + return [] if 1 == n else 's' + return unwords([ + str(n), + concat(reversed(concat(cons(suffix(n))(["elttob"])))) + ]) + + +# GENERIC ------------------------------------------------- + +# concat :: [[a]] -> [a] +# concat :: [String] -> String +def concat(xxs): + '''The concatenation of all the elements in a list.''' + xs = list(chain.from_iterable(xxs)) + unit = '' if isinstance(xs, str) else [] + return unit if not xs else ( + ''.join(xs) if isinstance(xs[0], str) else xs + ) + + +# cons :: a -> [a] -> [a] +def cons(x): + '''Construction of a list from x as head, + and xs as tail.''' + return lambda xs: [x] + xs if ( + isinstance(xs, list) + ) else chain([x], xs) + + +# enumFromThenTo :: Int -> Int -> Int -> [Int] +def enumFromThenTo(m): + '''Integer values enumerated from m to n + with a step defined by nxt-m.''' + def go(nxt, n): + d = nxt - m + return list(range(m, d + n, d)) + return lambda nxt: lambda n: ( + go(nxt, n) + ) + + +# pred :: Enum a => a -> a +def pred(x): + '''The predecessor of a value. For numeric types, (- 1).''' + return x - 1 if isinstance(x, int) else ( + chr(ord(x) - 1) + ) + + +# unlines :: [String] -> String +def unlines(xs): + '''A single string derived by the intercalation + of a list of strings with the newline character.''' + return '\n'.join(xs) + + +# unwords :: [String] -> String +def unwords(xs): + '''A space-separated string derived from + a list of words.''' + return ' '.join(xs) + + +if __name__ == '__main__': + main() diff --git a/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-4.py b/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-4.py new file mode 100644 index 0000000000..2effd00e49 --- /dev/null +++ b/Task/99-Bottles-of-Beer/Python/99-bottles-of-beer-4.py @@ -0,0 +1,93 @@ +"""99 Bottles of Beer on the Wall made functional""" +from functools import partial +from typing import Callable + + +def regular_plural(noun: str) -> str: + """Regular rule to get the plural form of a word""" + return noun + "s" + + +def beer_song(*, + location: str = 'on the wall', + distribution: str = 'Take one down, pass it around', + solution: str = 'Better go to the store to buy some more!', + container: str = 'bottle', + plurifier: Callable[[str], str] = regular_plural, + liquid: str = "beer", + initial_count: int = 99) -> None: + """ + Displays the lyrics of the beer song + :param location: initial location of the drink + :param distribution: specifies the process of its distribution + :param solution: what happens when we run out of drinks + :param container: bottle/barrel/flask or other containers + :param plurifier: function converting a word to its plural form + :param liquid: the name of the drink in the given container + :param initial_count: how many containers available initially + """ + verse = partial(get_verse, + location=location, + distribution=distribution, + solution=solution, + container=container, + plurifier=plurifier, + liquid=liquid) + verses = map(verse, range(initial_count, -1, -1)) + print(*verses, sep='\n\n') + + +def get_verse(count: int, + *, + location: str, + distribution: str, + solution: str, + container: str, + plurifier: Callable[[str], str], + liquid: str) -> str: + """Returns the verse for the given initial amount of drinks""" + inventory = partial(get_inventory, + location=location) + asset = partial(get_asset, + container=container, + plurifier=plurifier, + liquid=liquid) + initial_asset = asset(count) + final_asset = asset(count - 1) + standard_verse = '\n'.join([inventory(initial_asset), + initial_asset, + distribution, + inventory(final_asset)]) + return solution if count == 0 else standard_verse + + +def get_inventory(asset: str, + *, + location: str) -> str: + """ + Used to return the first or the fourth line of the verse + + >>> get_inventory("10 bottles of beer", location="on the wall") + "10 bottles of beer on the wall" + """ + return ' '.join([asset, location]) + + +def get_asset(count: int, + *, + container: str, + plurifier: Callable[[str], str], + liquid: str) -> str: + """ + Quantified asset + + >>> get_asset(0, container="jar", plurifier=regular_plural, liquid='milk') + "No more jars of milk" + """ + containers = container if count == 1 else plurifier(container) + spelled_out_quantity = "No more" if count == 0 else str(count) + return ' '.join([spelled_out_quantity, containers, "of", liquid]) + + +if __name__ == '__main__': + beer_song() diff --git a/Task/99-Bottles-of-Beer/Q/99-bottles-of-beer.q b/Task/99-Bottles-of-Beer/Q/99-bottles-of-beer.q new file mode 100644 index 0000000000..bc2704ab60 --- /dev/null +++ b/Task/99-Bottles-of-Beer/Q/99-bottles-of-beer.q @@ -0,0 +1,2 @@ +bobw:{[n] {x," bottles of beer on the wall\n",x," bottles of beer\nTake one down, pass it around\n",y," bottles of beer on the wall\n\n"} . string (n;n-1)} +-1 bobw each reverse 1 + til 99 diff --git a/Task/99-Bottles-of-Beer/RPG/99-bottles-of-beer.rpg b/Task/99-Bottles-of-Beer/RPG/99-bottles-of-beer.rpg new file mode 100644 index 0000000000..622d2a5f7d --- /dev/null +++ b/Task/99-Bottles-of-Beer/RPG/99-bottles-of-beer.rpg @@ -0,0 +1,90 @@ + H/TITLE 99 Bottles of Beer on the Wall - RPGIII (IBM System/38) + F******************************************************************** + F* + F* Lines with an asterisk in column 7 (such as this one) are comments. + F* + F* The character in column 6 specifies the form type. Before the first + F* use of each form type is a comment with the template for the form. + F* + F******************************************************************** + F* File Description Specifications + F* + F* Specify a default printer file for output, program described, + F* 132 columns wide, and an overflow indicator OV. The overflow + F* indicator is turned on when data is output to the last usable + F* line (line 60, for the default printer file QSYSPRT). + F* + F*ilenameIPEAF....RlenLK1AIOvKlocEDevice+......KExit++Entry+A....U1 + FQSYSPRT O F 132 OV PRINTER + F* + C******************************************************************** + C* If there were an input file, the RPG cycle would automatically + C* execute the output lines; since there is no input file, output + C* lines are produced as "exception" output with the EXCPT opcode. + C* + C* Calculation Specifications + C* vvvvvvvvv-- conditionally executes lines if indicators are on/off + C*0N01N02N03Factor1+++OpcdeFactor2+++ResultLenDHHiLoEqComments+++++++ + C* + C* Zero, then add 99 to a variable named #BOTLS, which is defined + C* as packed decimal, 3 positions, 0 decimal places. + C Z-ADD99 #BOTLS 30 + C* + C* Do until #BOTLS = 0. Each loop produces one complete verse. + C #BOTLS DOUEQ0 + C* + C* When the overflow indicator is turned on, start a new page. + C* The indicator is automatically turned on when the overflow + C* line is printed on, and it is automatically turned off + C* when the heading is printed. + C OV EXCPTNEWPAG + C* + C* Print exception lines with names "LYRIC1" and "LYRIC2". + C EXCPTLYRIC1 + C EXCPTLYRIC2 + C* + C* Subtract 1 from #BOTLS, and turn on indicator LR (Last Record) + C* if the result is equal to zero (Eq); if LR is on, the program + C* will terminate at the end of the current cycle. + C SUB 1 #BOTLS LR + C* + C* Compare #BOTLS to 1, and turn on indicator 01 if equal. + C #BOTLS COMP 1 01 + C* + C* Print exception lines with name "LYRIC1". + C EXCPTLYRIC1 + C* + C* If LR is not on, print exception lines with name "SKIPLN" + C* (which, in this case, will produce a blank line between verses). + C NLR EXCPTSKIPLN + C* + C END end do + C* + O******************************************************************** + O* Output Specifications + O* .-- E means "Exception" ("H" Header, "D" Detail, "T" Total) + O* v vv-- before printing, skip to line # 1 (of the next page) + O*ame++++DFBASbSaN01N02N03Excnam........................................... + OQSYSPRT E 1 NEWPAG + O* v-- space 1 line after printing + O E 1 LYRIC1 + O* + O* .........-- conditionally print lines if indicators on/off + O* vvvvvvvvv v-- edit code Z (suppress leading Zeroes) + O*...............N01N02N03Field+YBEnd+PConstant/editword+++++++++ + O #BOTLSZ 3 + O N01NLR 11 'bottles' + O N01NLR 31 'of beer on the wall' + O 01NLR 10 'bottle' + O 01NLR 30 'of beer on the wall' + O LR 16 'No more bottles' + O LR 36 'of beer on the wall' + O E 1 LYRIC2 + O #BOTLSZ 3 + O N01 19 'bottles of beer' + O 01 18 'bottle of beer' + O E 1 LYRIC2 + O 14 'Take one down' + O E 1 LYRIC2 + O 15 'Pass it around' + O E 1 SKIPLN diff --git a/Task/99-Bottles-of-Beer/Retro/99-bottles-of-beer.retro b/Task/99-Bottles-of-Beer/Retro/99-bottles-of-beer.retro index da53f38f4a..fee6852f9b 100644 --- a/Task/99-Bottles-of-Beer/Retro/99-bottles-of-beer.retro +++ b/Task/99-Bottles-of-Beer/Retro/99-bottles-of-beer.retro @@ -1,16 +1,28 @@ -[ dup "%d bottles" puts ] -[ "1 bottle" puts ] -[ "no more bottles" puts ] -create bottles , , , +# 99 Bottles -: .bottles dup 2 ^math'min bottles + @ do ; -: .beer .bottles " of beer" puts ; -: .wall .beer " on the wall" puts ; -: .take "Take one down, pass it around" puts ; -: .verse .wall cr .beer cr - 1- .take cr .wall cr ; -: ?dup dup 0; ; -: verses [ cr .verse dup 0 <> ] while drop ; +Display the text for the *99 Bottles of Beer* song. -99 verses -bye +~~~ +{ 'bottle 'bottles 'of 'beer 'on 'the 'wall 'no 'more + 'Take 'one 'down, 'pass 'it 'around } +[ dup ':%s_'%s_s:put_sp_; s:format s:evaluate ] a:for-each + +{ [ no more bottles ] + [ #1 n:put sp bottle ] + [ dup n:put sp bottles ] +} 'BOTTLES const + +:number-bottles + dup #2 n:min BOTTLES swap a:fetch call ; + +:display-verse + number-bottles of beer on the wall nl + number-bottles of beer nl + n:dec Take one down, pass it around nl + number-bottles of beer on the wall nl ; + +:verses (n-) + repeat 0; nl display-verse again ; + +#99 verses +~~~ diff --git a/Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-1.rust b/Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-1.rust new file mode 100644 index 0000000000..92dafd70bc --- /dev/null +++ b/Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-1.rust @@ -0,0 +1,18 @@ +fn main() { + for n in (0..100).rev() { + match n { + 0 => { + println!("No more bottles of beer on the wall, no more bottles of beer."); + println!("Go to the store and buy some more, 99 bottles of beer on the wall."); + }, + 1 => { + println!("1 bottle of beer on the wall, 1 bottle of beer."); + println!("Take one down and pass it around, no more bottles of beer on the wall.\n"); + }, + _ => { + println!("{0:?} bottles of beer on the wall, {0:?} bottles of beer.", n); + println!("Take one down and pass it around, {} bottles of beer on the wall.\n", n-1); + }, + } + } +} diff --git a/Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer.rust b/Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-2.rust similarity index 100% rename from Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer.rust rename to Task/99-Bottles-of-Beer/Rust/99-bottles-of-beer-2.rust diff --git a/Task/99-Bottles-of-Beer/SmileBASIC/99-bottles-of-beer.smilebasic b/Task/99-Bottles-of-Beer/SmileBASIC/99-bottles-of-beer.smilebasic new file mode 100644 index 0000000000..8035ded5bd --- /dev/null +++ b/Task/99-Bottles-of-Beer/SmileBASIC/99-bottles-of-beer.smilebasic @@ -0,0 +1,49 @@ +DEF NUM(N) + IF N==-1 THEN + RETURN "99" + ELSEIF N==0 THEN + RETURN "No more" + ELSE + RETURN STR$(N) + ENDIF +END + +DEF BTL(N) + IF N==1 THEN + RETURN " bottle" + ELSE + RETURN " bottles" + ENDIF +END + +DEF ACT(N) + IF N==0 THEN + RETURN "Go to the store, buy some more," + ELSEIF N==1 THEN + RETURN "Take it down, pass it around," + ELSE + RETURN "Take one down, pass it around," + ENDIF +END + +DEF WAITPLAY TUNE + BGMPLAY TUNE + WHILE BGMCHK(0):WEND +END + +BGMSET 128,"T180@6E-8E-8E-8>B-8B-8B-8A+8A+8A+8 0) { + song.push(` + ${nbottles(beer)} of beer on the wall, + ${nbottles(beer)} of beer! + Take one down, pass it around + ${nbottles(--beer)} of beer on the wall + `); + } + return song.join(''); +} + +console.log(beerSong()); diff --git a/Task/99-Bottles-of-Beer/V/99-bottles-of-beer.v b/Task/99-Bottles-of-Beer/V/99-bottles-of-beer.v index f620fe2da9..67c9827af0 100644 --- a/Task/99-Bottles-of-Beer/V/99-bottles-of-beer.v +++ b/Task/99-Bottles-of-Beer/V/99-bottles-of-beer.v @@ -1,5 +1,5 @@ [bottles - [newline '' puts]. + [newline '' puts]. [beer [0 =] ['No more bottles of beer' put] if [1 =] ['One bottle of beer' put] if diff --git a/Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer.xslt b/Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-1.xslt similarity index 100% rename from Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer.xslt rename to Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-1.xslt diff --git a/Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-2.xslt b/Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-2.xslt new file mode 100644 index 0000000000..28855fedef --- /dev/null +++ b/Task/99-Bottles-of-Beer/XSLT/99-bottles-of-beer-2.xslt @@ -0,0 +1,20 @@ + + + + + + + + + + + + + {$currentBottles} bottle{if ($currentBottles ne 1) then 's' else ()} of beer on the wall + {$currentBottles} bottle{if ($currentBottles ne 1) then 's' else ()} of beer + Take one down, pass it around + {$newBottles} bottle{if ($newBottles ne 1) then 's' else ()} of beer on the wall + + + diff --git a/Task/A+B/00DESCRIPTION b/Task/A+B/00DESCRIPTION index 89a587458e..0fef6f396b 100644 --- a/Task/A+B/00DESCRIPTION +++ b/Task/A+B/00DESCRIPTION @@ -2,7 +2,7 @@ ;Task: -Given two integer,   '''A''' and '''B'''. +Given two integers,   '''A''' and '''B'''. Their sum needs to be calculated. diff --git a/Task/A+B/BASIC/a+b-10.basic b/Task/A+B/BASIC/a+b-10.basic index 8d90974d9f..f062141fdb 100644 --- a/Task/A+B/BASIC/a+b-10.basic +++ b/Task/A+B/BASIC/a+b-10.basic @@ -1,2 +1,9 @@ -input, n$ -print eval(word$(n$,1);" + ";word$(n$,2)) +100 DO +110 INPUT PROMPT "Ener two integers separated by a comma: ":A,B +120 IF ABS(A)>1000 OR ABS(B)>1000 OR IP(A)<>A OR IP(B)<>B THEN +130 PRINT "Both integers must be in the interval [-1000..1000] - try again.":PRINT +140 ELSE +150 PRINT "Their sum is";A+B +160 EXIT DO +170 END IF +180 LOOP diff --git a/Task/A+B/BASIC/a+b-11.basic b/Task/A+B/BASIC/a+b-11.basic index 564d38244c..8d90974d9f 100644 --- a/Task/A+B/BASIC/a+b-11.basic +++ b/Task/A+B/BASIC/a+b-11.basic @@ -1,6 +1,2 @@ -10 INPUT A$ -20 LET I=1 -30 IF A$(I)=" " THEN GOTO 60 -40 LET I=I+1 -50 GOTO 30 -60 PRINT VAL A$( TO I-1)+VAL A$(I+1 TO ) +input, n$ +print eval(word$(n$,1);" + ";word$(n$,2)) diff --git a/Task/A+B/BASIC/a+b-12.basic b/Task/A+B/BASIC/a+b-12.basic new file mode 100644 index 0000000000..564d38244c --- /dev/null +++ b/Task/A+B/BASIC/a+b-12.basic @@ -0,0 +1,6 @@ +10 INPUT A$ +20 LET I=1 +30 IF A$(I)=" " THEN GOTO 60 +40 LET I=I+1 +50 GOTO 30 +60 PRINT VAL A$( TO I-1)+VAL A$(I+1 TO ) diff --git a/Task/A+B/BASIC/a+b-4.basic b/Task/A+B/BASIC/a+b-4.basic index 568af72ac5..49bc7cb413 100644 --- a/Task/A+B/BASIC/a+b-4.basic +++ b/Task/A+B/BASIC/a+b-4.basic @@ -1,4 +1,4 @@ dim a(2) -input "Enter two numbers seperated by a space?", t$ +input "Enter two numbers separated by a space?", t$ a = explode(t$," ") print t$ + " " + (a[0] + a[1]) diff --git a/Task/A+B/Elena/a+b-1.elena b/Task/A+B/Elena/a+b-1.elena index aab3069454..666edf0544 100644 --- a/Task/A+B/Elena/a+b-1.elena +++ b/Task/A+B/Elena/a+b-1.elena @@ -1,9 +1,9 @@ -import extensions. +import extensions; -public program -[ - var A := Integer new. - var B := Integer new. +public program() +{ + var A := new Integer(); + var B := new Integer(); - console readLine(A,B); writeLine(A + B) -] + console.loadLine(A,B).printLine(A + B) +} diff --git a/Task/A+B/Elena/a+b-2.elena b/Task/A+B/Elena/a+b-2.elena index 4b158dd2e7..d6017ce933 100644 --- a/Task/A+B/Elena/a+b-2.elena +++ b/Task/A+B/Elena/a+b-2.elena @@ -1,10 +1,10 @@ -import system'routines. -import extensions. +import system'routines; +import extensions; -public program -[ - console writeLine(console readLine; - split; - selectBy(%"convertorOp.toInt[0]"); - summarize) -] +public program() +{ + console.printLine(console.readLine() + .split() + .selectBy(__mssg toInt[0]) + .summarize()) +} diff --git a/Task/A+B/Golo/a+b.golo b/Task/A+B/Golo/a+b.golo new file mode 100644 index 0000000000..771dc9531b --- /dev/null +++ b/Task/A+B/Golo/a+b.golo @@ -0,0 +1,27 @@ +#!/usr/bin/env golosh +---- +This module asks for two numbers, adds them, and prints the result. +---- +module Aplusb + +import gololang.IO + +function main = |args| { + + let line = readln("Please enter two numbers (just leave a space in between them) ") + let numbers = line: split("[ ]+"): asList() + + require(numbers: size() == 2, "we need two numbers") + + try { + + let a, b = numbers: map(|i| -> i: toInt()) + + require(a >= -1000 and a <= 1000 and b >= -1000 and b <= 1000, "both numbers need to be between -1000 and 1000") + + println(a + b) + + } catch (e) { + println("they both need to be numbers for this to work") + } +} diff --git a/Task/A+B/Julia/a+b-1.julia b/Task/A+B/Julia/a+b-1.julia index a6513cfc2e..a3b78f39cd 100644 --- a/Task/A+B/Julia/a+b-1.julia +++ b/Task/A+B/Julia/a+b-1.julia @@ -1,6 +1,2 @@ -#A+B -function AB() - input = sum(map(int,split(readline(STDIN)," "))) - println(input) -end -AB() +input = parse.(Int, split(readline(stdin))) +println(stdout, sum(input)) diff --git a/Task/A+B/Julia/a+b-2.julia b/Task/A+B/Julia/a+b-2.julia index bb1d50e25f..105b7ab30d 100644 --- a/Task/A+B/Julia/a+b-2.julia +++ b/Task/A+B/Julia/a+b-2.julia @@ -1,3 +1,3 @@ -julia> int(readuntil(STDIN, ' ')) + int(readuntil(STDIN, '\n')) +julia> println(parse(Int, readuntil(stdin, ' ')) + parse(Int, readuntil(stdin, '\n'))) 1 2 3 diff --git a/Task/A+B/Neko/a+b.neko b/Task/A+B/Neko/a+b.neko new file mode 100644 index 0000000000..eb2c199e7b --- /dev/null +++ b/Task/A+B/Neko/a+b.neko @@ -0,0 +1,65 @@ +/** + A+B, Rosetta Code, in Neko + Tectonics: + nekoc a+b.neko + echo '4 5' | neko a+b.n +*/ + +/* load some primitives */ +var regexp_new = $loader.loadprim("regexp@regexp_new", 1) +var regexp_match = $loader.loadprim("regexp@regexp_match", 4) +var regexp_matched = $loader.loadprim("regexp@regexp_matched", 2) + +var stdin = $loader.loadprim("std@file_stdin", 0)() +var file_read_char = $loader.loadprim("std@file_read_char", 1) + +/* Read a line from file f into string s returning length without any newline */ +var NEWLINE = 10 +var readline = function(f, s) { + var len = 0 + var ch + while true { + try ch = file_read_char(f) catch a break; + if ch == NEWLINE break; + if $sset(s, len, ch) == null break; else len += 1 + } + return len +} + +/* Trim a string of trailing NUL and spaces, returning substring */ +var SPACE = 32 +var trim = function(s) { + var len = $ssize(s) + var ch + while len > 0 { + ch = $sget(s, len - 1) + if ch != 0 && ch != SPACE break; else len -= 1 + } + return $ssub(s, 0, len) +} + +/* The A+B task */ +var RECL = 132 +try { + /* whitespace(s), digit(s), whitespace(s), digit(s) */ + var twonums = regexp_new("^\\s*(\\d+)\\s+(\\d+)\\b") + var s = $smake(RECL) + var len = readline(stdin, s) + s = trim(s) + + var valid = regexp_match(twonums, s, 0, $ssize(s)) + if valid { + var first = regexp_matched(twonums, 1) + var second = regexp_matched(twonums, 2) + + first = $int(first) + second = $int(second) + + if first < -1000 || first > 1000 $throw("First value out of range -1000,1000") + if second < -1000 || second > 1000 $throw("Second value out of range -1000,1000") + + $print($int(first) + $int(second), "\n") + + } else $print("Need two numbers, separated by whitespace\n") + +} catch with $print("Exception: ", with, "\n") diff --git a/Task/A+B/Pascal/a+b-3.pascal b/Task/A+B/Pascal/a+b-3.pascal new file mode 100644 index 0000000000..86bc85e09f --- /dev/null +++ b/Task/A+B/Pascal/a+b-3.pascal @@ -0,0 +1,18 @@ +{ Task: A + B +Sum of A + B while A, B >= -1000 and A,B <= 1000 +Author: Sinuhe Masan (2019) } +program APlusB; + +var + A, B : integer; + +begin + repeat + write('Enter two numbers betwen -1000 and 1000 separated by space: '); + readln(A, B); + + until ((abs(A) < 1000) and (abs(B) < 1000)); + + writeln('The sum is: ', A + B); + +end. diff --git a/Task/A+B/Phix/a+b.phix b/Task/A+B/Phix/a+b.phix index 842f95a2ab..1172c63cab 100644 --- a/Task/A+B/Phix/a+b.phix +++ b/Task/A+B/Phix/a+b.phix @@ -1,65 +1,9 @@ --- longhand version, input is echoed, full error handling -string text -integer idx = 0 -integer ch - -procedure nextch() - idx += 1 - if idx>length(text) then - idx = 0 - ch = 0 - else - ch = text[idx] - end if -end procedure - -function getNumber() -integer sign = 0 -integer res = 0 - while find(ch," \t\r\n") do - nextch() - end while - if idx=0 then - puts(1,"\nenter another number\n") - text = gets(0) - idx = 0 - nextch() - end if - if ch='-' then - sign = 1 - nextch() - end if - if idx=0 or ch<'0' or ch>'9' then - idx = 0 - else - while 1 do - res = res*10+ch-'0' - nextch() - if idx=0 or ch<'0' or ch>'9' then exit end if - end while - if sign then - res = -res - end if - end if - return res -end function - -procedure twoNumbers() -integer a, b - text = gets(0) - idx = 0 - nextch() - if idx!=0 then - a = getNumber() - if idx!=0 and a>=-1000 and a<=1000 then - b = getNumber() - if idx!=0 and b>=-1000 and b<=1000 then - printf(1," %d\n",{a+b}) - return - end if - end if - end if - puts(1," some error\n") -end procedure - -twoNumbers() +-- demo\rosetta\AplusB.exw +string s = prompt_string("Enter two numbers separated by a space : ") +sequence r = scanf(s,"%d %d") +if length(r)=1 then + integer {a,b} = r[1], c = a+b + printf(1,"%d + %d = %d\n",{a,b,c}) +else + printf(1,"invalid input\n") +end if diff --git a/Task/A+B/Pony/a+b.pony b/Task/A+B/Pony/a+b.pony new file mode 100644 index 0000000000..a749510857 --- /dev/null +++ b/Task/A+B/Pony/a+b.pony @@ -0,0 +1,24 @@ +actor Main + let _env:Env + new create(env:Env)=> + _env=env + env.input(object iso is InputNotify + let _e:Main=this + fun ref apply(data:Array[U8] iso)=> + _e(consume data) + fun ref dispose()=> + None + end, + 512) + be apply(s:Array[U8] iso)=> + let c=String.from_iso_array(consume s) + let parts:Array[String]=c.split(" ",0) + var sum:I32=0 + try + for v in parts.values() do + sum=sum+match v.read_int[I32](0)? + |(let x:I32,_)=>x + end + end + end + _env.out.print(sum.string()) diff --git a/Task/A+B/REXX/a+b-4.rexx b/Task/A+B/REXX/a+b-4.rexx index fa55e73dfc..05e988dfb5 100644 --- a/Task/A+B/REXX/a+b-4.rexx +++ b/Task/A+B/REXX/a+b-4.rexx @@ -2,11 +2,10 @@ numeric digits 1000 /*just in case the user gets ka-razy. */ say 'enter some numbers to be summed:' /*display a prompt message to terminal.*/ parse pull y /*obtain all numbers from input stream.*/ -many=words(y) /*obtain the number of numbers entered.*/ -$=0 /*initialize the sum to zero. */ +many= words(y) /*obtain the number of numbers entered.*/ +$= 0 /*initialize the sum to zero. */ do j=1 for many /*process each of the numbers. */ - $=$ + word(y, j) /*add one number to the sum. */ + $= $ + word(y, j) /*add one number to the sum. */ end /*j*/ - -say 'sum of ' many " numbers = " $/1 /*display normalized sum $ to terminal.*/ /*stick a fork in it, we're all done. */ +say 'sum of ' many " numbers = " $/1 /*display normalized sum $ to terminal.*/ diff --git a/Task/A+B/REXX/a+b-5.rexx b/Task/A+B/REXX/a+b-5.rexx new file mode 100644 index 0000000000..3aed91ea3f --- /dev/null +++ b/Task/A+B/REXX/a+b-5.rexx @@ -0,0 +1,8 @@ +/*REXX program obtains some numbers from the input stream (the console), shows their sum*/ +numeric digits 1000 /*just in case the user gets ka-razy. */ +say 'enter some numbers to be summed:' /*display a prompt message to terminal.*/ +parse pull y /*obtain all numbers from input stream.*/ +y=space(y) +y=translate(y,'+',' ') +Interpret 's='y +say 'sum of ' many " numbers = " s/1 /*display normalized sum s to terminal.*/ diff --git a/Task/A+B/Retro/a+b-1.retro b/Task/A+B/Retro/a+b-1.retro index 2a9a5b9a82..7dc3c99985 100644 --- a/Task/A+B/Retro/a+b-1.retro +++ b/Task/A+B/Retro/a+b-1.retro @@ -1 +1 @@ -: try ( "-n ) getToken toNumber getToken toNumber + putn ; +:try ("-n) s:get s:to-number s:get s:to-number + n:put ; diff --git a/Task/A+B/Retro/a+b-2.retro b/Task/A+B/Retro/a+b-2.retro index 9c8fc3156e..bdf0d785a8 100644 --- a/Task/A+B/Retro/a+b-2.retro +++ b/Task/A+B/Retro/a+b-2.retro @@ -1 +1,3 @@ -try 1 2 +try +1 +2 diff --git a/Task/A+B/Robotic/a+b.robotic b/Task/A+B/Robotic/a+b.robotic new file mode 100644 index 0000000000..5c0d746a69 --- /dev/null +++ b/Task/A+B/Robotic/a+b.robotic @@ -0,0 +1,6 @@ +input string "Input A:" +set "A" to "input" +input string "Input B:" +set "B" to "input" +* "('A' + 'B')" +end diff --git a/Task/A+B/Ruby/a+b.rb b/Task/A+B/Ruby/a+b.rb index fec22cc7e5..740a1d564a 100644 --- a/Task/A+B/Ruby/a+b.rb +++ b/Task/A+B/Ruby/a+b.rb @@ -1 +1 @@ -puts gets.split.map(&:to_i).inject(:+) +puts gets.split.sum(&:to_i) diff --git a/Task/A+B/ZX-Spectrum-Basic/a+b.zx b/Task/A+B/ZX-Spectrum-Basic/a+b-1.zx similarity index 100% rename from Task/A+B/ZX-Spectrum-Basic/a+b.zx rename to Task/A+B/ZX-Spectrum-Basic/a+b-1.zx diff --git a/Task/A+B/ZX-Spectrum-Basic/a+b-2.zx b/Task/A+B/ZX-Spectrum-Basic/a+b-2.zx new file mode 100644 index 0000000000..bd131535cd --- /dev/null +++ b/Task/A+B/ZX-Spectrum-Basic/a+b-2.zx @@ -0,0 +1,9 @@ +10 PRINT "Input two numbers separated by"'"space(s) " +20 INPUT LINE a$ +30 LET ll=10e10: LET ls=0: LET i=1 +40 IF a$(i)=" " THEN LET ls=i: GO TO 60 +50 LET ll=i +60 IF ls>ll THEN GO TO 80 +70 LET i=i+1: GO TO 40 +80 LET a=VAL a$( TO i): LET b=VAL a$(i TO ) +90 PRINT a;" + ";b;" = ";a+b diff --git a/Task/ABC-Problem/00META.yaml b/Task/ABC-Problem/00META.yaml new file mode 100644 index 0000000000..9bdb64aab4 --- /dev/null +++ b/Task/ABC-Problem/00META.yaml @@ -0,0 +1,4 @@ +--- +category: +- Puzzles +- Games diff --git a/Task/ABC-Problem/Astro/abc-problem.astro b/Task/ABC-Problem/Astro/abc-problem.astro index 93196c9d5e..317c2e5dbd 100644 --- a/Task/ABC-Problem/Astro/abc-problem.astro +++ b/Task/ABC-Problem/Astro/abc-problem.astro @@ -1,13 +1,12 @@ -fun abc(str, list): - if list.isempty: +fun abc(s, ls): + if ls.isempty: return true for i in indices(list) where s[end] in list[i]: - return abc(str[end-1:], remove(val list, i)) + return abc(s[:end-1], remove!(copy(list), at: i)) false let test = ["A", "BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"] -let list = ["BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS", -"JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"] +let ls = ["BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS", "JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"] -for str in test: - print "$|>8|{s} | ${abc(s, list)}" +for s in test: + print "($|>8|{s} ${abc(s, list)})" diff --git a/Task/ABC-Problem/Elena/abc-problem.elena b/Task/ABC-Problem/Elena/abc-problem.elena index aea653d4db..2239dd7787 100644 --- a/Task/ABC-Problem/Elena/abc-problem.elena +++ b/Task/ABC-Problem/Elena/abc-problem.elena @@ -1,37 +1,45 @@ -import system'routines. -import system'collections. -import extensions. -import extensions'routines. +import system'routines; +import system'collections; +import extensions; +import extensions'routines; extension op { - canMakeWordFrom:blocks - [ - var list := ArrayList new:blocks. + canMakeWordFrom(blocks) + { + var list := ArrayList.load(blocks); - ^ nil == self literal; upperCase; seekEach(:ch) - [ - var index := list indexOfElement - ((:word)(word indexOf:ch at:0 != -1) asComparator). + ^ nil == (cast string(self)).upperCase().seekEach:(ch) + { + var index := list.indexOfElement + ((word => word.indexOf(0, ch) != -1).asComparator()); if (index>=0) - [ list removeAt:index. ^ false ]; - [ ^ true ] - ] - ] + { + list.removeAt(index); ^ false + } + else + { + ^ true + } + } + } } -public program -[ - var blocks := ("BO", "XK", "DQ", "CP", "NA", +public program() +{ + var blocks := new object[] {"BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS", "JW", "HU", "VI", "AN", "OB", - "ER", "FS", "LY", "PC", "ZM"). + "ER", "FS", "LY", "PC", "ZM"}; - var words := ("", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"). + var words := new object[] {"", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"}; - words forEach(:word) - [ - console printLine("can make '",word,"' : ",word canMakeWordFrom:blocks). - ] -] + Enumerator e := words.enumerator(); + e.next(); + + words.forEach:(word) + { + console.printLine("can make '",word,"' : ",word.canMakeWordFrom(blocks)); + } +} diff --git a/Task/ABC-Problem/Factor/abc-problem.factor b/Task/ABC-Problem/Factor/abc-problem.factor new file mode 100644 index 0000000000..d53d4c65cd --- /dev/null +++ b/Task/ABC-Problem/Factor/abc-problem.factor @@ -0,0 +1,45 @@ +USING: assocs combinators.short-circuit formatting grouping io +kernel math math.statistics qw sequences sets unicode ; +IN: rosetta-code.abc-problem + +! === CONSTANTS ================================================ + +CONSTANT: blocks qw{ + BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM +} + +CONSTANT: input qw{ A BARK BOOK TREAT COMMON SQUAD CONFUSE } + +! === PROGRAM LOGIC ============================================ + +: pare ( str -- seq ) + [ blocks ] dip [ intersects? ] curry filter ; + +: enough-blocks? ( str -- ? ) dup pare [ length ] bi@ <= ; + +: enough-letters? ( str -- ? ) + [ blocks concat ] dip dup [ within ] dip + [ histogram values ] bi@ [ - ] 2map [ neg? ] any? not ; + +: can-make-word? ( str -- ? ) + >upper { [ enough-blocks? ] [ enough-letters? ] } 1&& ; + +! === OUTPUT =================================================== + +: show-blocks ( -- ) + "Available blocks:" print blocks [ 1 cut "(%s %s)" sprintf ] + map 5 group [ [ write bl ] each nl ] each nl ; + +: header ( -- ) + "Word" "Can make word from blocks?" "%-7s %s\n" printf + "======= ==========================" print ; + +: result ( str -- ) + dup can-make-word? "Yes" "No" ? "%-7s %s\n" printf ; + +! === MAIN ===================================================== + +: abc-problem ( -- ) + show-blocks header input [ result ] each ; + +MAIN: abc-problem diff --git a/Task/ABC-Problem/FreeBASIC/abc-problem.freebasic b/Task/ABC-Problem/FreeBASIC/abc-problem.freebasic new file mode 100644 index 0000000000..2b6520c3b5 --- /dev/null +++ b/Task/ABC-Problem/FreeBASIC/abc-problem.freebasic @@ -0,0 +1,43 @@ +' version 28-01-2019 +' compile with: fbc -s console + +Dim As String blocks(1 To 20, 1 To 2) => {{"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"}} + +Dim As UInteger i, x, y, b() +Dim As String word, char +Dim As boolean possible + +Do + Read word + If word = "" Then Exit Do + word = UCase(word) + ReDim b(1 To 20) + possible = TRUE + + For i = 1 To Len(word) + char = Mid(word, i, 1) + + For x = 1 To 20 + If b(x) = 0 Then + If blocks(x, 1) = char Or blocks(x, 2) = char Then + b(x) = 1 + Exit For + End If + End If + Next + If x = 21 Then possible = FALSE + Next + + Print word, possible +Loop + +Data "A", "Bark", "Book", "Treat", "Common", "Squad", "Confuse", "" + +' empty keyboard buffer +While InKey <> "" : Wend +Print : Print "hit any key to end program" +Sleep +End diff --git a/Task/ABC-Problem/Haskell/abc-problem-2.hs b/Task/ABC-Problem/Haskell/abc-problem-2.hs index a7c5dd40c0..69af2f90e1 100644 --- a/Task/ABC-Problem/Haskell/abc-problem-2.hs +++ b/Task/ABC-Problem/Haskell/abc-problem-2.hs @@ -1,16 +1,13 @@ import Data.List (delete) import Data.Char (toUpper) --- Any block sequences found spellWith :: [String] -> String -> [[String]] spellWith _ [] = [[]] spellWith blocks (x:xs) = - foldMap - (\b -> - if x `elem` b - then foldMap (return . (b :)) (spellWith (delete b blocks) xs) - else []) - blocks + let go b + | x `elem` b = (b :) <$> spellWith (delete b blocks) xs + | otherwise = [] + in blocks >>= go blocks :: [String] blocks = words "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM" @@ -18,5 +15,5 @@ blocks = words "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM" main :: IO () main = mapM_ - (print . ((,) <*>) (not . null . spellWith blocks . (toUpper <$>))) + (print . ((,) <*>) (not . null . spellWith blocks . fmap toUpper)) ["", "A", "BARK", "BoOK", "TrEAT", "COmMoN", "SQUAD", "conFUsE"] diff --git a/Task/ABC-Problem/Mercury/abc-problem.mercury b/Task/ABC-Problem/Mercury/abc-problem.mercury new file mode 100644 index 0000000000..3a5541fa8a --- /dev/null +++ b/Task/ABC-Problem/Mercury/abc-problem.mercury @@ -0,0 +1,34 @@ +:- module abc. +:- interface. +:- import_module io. +:- pred main(io::di, io::uo) is det. +:- implementation. +:- import_module list, string, char. + +:- type block == {char, char}. + +:- pred take(char, list(block), list(block)). +:- mode take(in, in, out) is nondet. +take(C, !Blocks) :- + list.delete(!.Blocks, {A, B}, !:Blocks), + ( A = C ; B = C ). + +:- pred can_make_word(list(char)::in, list(block)::in) is semidet. +can_make_word([], _). +can_make_word([C|Cs], !.Blocks) :- + take(C, !Blocks), + can_make_word(Cs, !.Blocks). + +main(!IO) :- + 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'} + ], + Words = ["A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"], + foldl((pred(W::in, !.IO::di, !:IO::uo) is det :- + P = can_make_word(to_char_list(W), Blocks), + io.format("can_make_word(""%s"") :- %s.\n", + [s(W), s(if P then "true" else "fail")], !IO)), + Words, !IO). diff --git a/Task/AKS-test-for-primes/C++/aks-test-for-primes.cpp b/Task/AKS-test-for-primes/C++/aks-test-for-primes.cpp new file mode 100644 index 0000000000..4bf4d71701 --- /dev/null +++ b/Task/AKS-test-for-primes/C++/aks-test-for-primes.cpp @@ -0,0 +1,88 @@ +#include +#include +using namespace std; + +const int pasTriMax = 61; + +uint64_t pasTri[pasTriMax + 1]; + +void pascalTriangle(unsigned long n) +// Calculate the n'th line 0.. middle +{ + unsigned long j, k; + + pasTri[0] = 1; + j = 1; + while (j <= n) + { + j++; + k = j / 2; + pasTri[k] = pasTri[k - 1]; + for ( ;k >= 1; k--) + pasTri[k] += pasTri[k - 1]; + } +} + +bool isPrime(unsigned long n) +{ + if (n > pasTriMax) + { + cout << n << " is out of range" << endl; + exit(1); + } + + pascalTriangle(n); + bool res = true; + int i = n / 2; + while (res && (i > 1)) + { + res = res && (pasTri[i] % n == 0); + i--; + } + return res; +} + +void expandPoly(unsigned long n) +{ + const char vz[] = {'+', '-'}; + + if (n > pasTriMax) + { + cout << n << " is out of range" << endl; + exit(1); + } + + switch (n) + { + case 0: + cout << "(x-1)^0 = 1" << endl; + break; + case 1: + cout << "(x-1)^1 = x-1" << endl; + break; + default: + pascalTriangle(n); + cout << "(x-1)^" << n << " = "; + cout << "x^" << n; + bool bVz = true; + int nDiv2 = n / 2; + for (unsigned long j = n - 1; j > nDiv2; j--, bVz = !bVz) + cout << vz[bVz] << pasTri[n - j] << "*x^" << j; + for (unsigned long j = nDiv2; j > 1; j--, bVz = !bVz) + cout << vz[bVz] << pasTri[j] << "*x^" << j; + cout << vz[bVz] << pasTri[1] << "*x"; + bVz = !bVz; + cout << vz[bVz] << pasTri[0] << endl; + break; + } +} + +int main() +{ + for (unsigned long n = 0; n <= 9; n++) + expandPoly(n); + for (unsigned long n = 2; n <= pasTriMax; n++) + if (isPrime(n)) + cout << setw(3) << n; + cout << endl; +} diff --git a/Task/AKS-test-for-primes/Crystal/aks-test-for-primes.crystal b/Task/AKS-test-for-primes/Crystal/aks-test-for-primes.crystal new file mode 100644 index 0000000000..55699096de --- /dev/null +++ b/Task/AKS-test-for-primes/Crystal/aks-test-for-primes.crystal @@ -0,0 +1,20 @@ +def x_minus_1_to_the(p) + p.times.reduce([1]) do |ex, _| + ([0_i64] + ex).zip(ex + [0]).map { |x,y| x - y } + end +end + +def prime?(p) + return false if p < 2 + coeff = x_minus_1_to_the(p)[1..p/2] # only need half of coeff terms + coeff.all?{ |n| n%p == 0 } +end + +8.times do |n| + puts "(x-1)^#{n} = " + + x_minus_1_to_the(n).map_with_index{ |c, p| + p.zero? ? c.to_s : (c < 0 ? " - " : " + ") + (c.abs == 1 ? "x" : "#{c.abs}x") + (p == 1 ? "" : "^#{p}") + }.join +end + +puts "\nPrimes below 50:", 50.times.select {|n| prime? n}.join(',') 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 7227c0ffac..42169edf1f 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 @@ -1,82 +1,72 @@ -import extensions. +import extensions; singleton AksTest { - static Array c := V(100). + static long[] c := new long[](100); coef(int n) - [ - int i := 0. - int j := 0. + { + int i := 0; + int j := 0; - if ((n < 0) || (n > 63)) [ AbortException new; raise ]. // gracefully deal with range issue + if ((n < 0) || (n > 63)) { AbortException.raise() }; // gracefully deal with range issue - c[i] := 1l. - while(i < n) - [ - j := i. - c[1 + j] := 1l. - while (j > 0) - [ - c[j] := c[j - 1] - c[j]. - - j -= 1 - ]. - - c[0] := c[0] negative. - i += 1 - ]. - - var t := c. - ] + c[i] := 1l; + for (int i := 0, i < n, i += 1) { + c[1 + i] := 1l; + for (int j := i, j > 0, j -= 1) { + c[j] := c[j - 1] - c[j] + }; + c[0] := c[0].Negative + } + } bool is_prime(int n) - [ - int i := n. + { + int i := n; - self coef(n). - (c[0]) += 1. - (c[i]) -= 1. + self.coef(n); + c[0] := c[0] + 1; + c[i] := c[i] - 1; - i -= 1. - while ((i + 1 != 0) && (c[i+1] mod(n) == 0)) - [ + i -= 1; + while (i + 1 != 0 && c[i+1].mod(n) == 0) + { i -= 1 - ]. + }; ^ i < 0 - ] + } show(int n) - [ - int i := n. - i += 1. + { + int i := n; + i += 1; while(i != 0) - [ - i -= 1. - console print("+",c[i],"x^",i). - ] - ] + { + i -= 1; + console.print("+",c[i],"x^",i) + } + } } -public program -[ - 0 till:10 do(:n) - [ - AksTest coef(n). +public program() +{ + for (int n := 0, n < 10, n += 1) { + AksTest.coef(n); - console print("(x-1)^",n," = "). - AksTest show(n). - console printLine. - ]. - console print("Primes:"). - 1 to(63) do(:n) - [ - if (AksTest is_prime(n)) - [ - console print(n," "). - ] - ]. + console.print("(x-1)^",n," = "); + AksTest.show(n); + console.printLine() + }; - console printLine; readChar -] + console.print("Primes:"); + for (int n := 1, n <= 63, n += 1) { + if (AksTest.is_prime(n)) + { + console.print(n," ") + } + }; + + console.printLine().readChar() +} diff --git a/Task/AKS-test-for-primes/Factor/aks-test-for-primes.factor b/Task/AKS-test-for-primes/Factor/aks-test-for-primes.factor new file mode 100644 index 0000000000..d4aa545810 --- /dev/null +++ b/Task/AKS-test-for-primes/Factor/aks-test-for-primes.factor @@ -0,0 +1,39 @@ +USING: combinators formatting io kernel make math math.parser +math.polynomials prettyprint sequences ; +IN: rosetta-code.aks-test + +! Polynomials are represented by the math.polynomials vocabulary +! as sequences with the highest exponent on the right. Hence +! { -1 1 } represents x - 1. +: (x-1)^ ( n -- seq ) { -1 1 } swap p^ ; + +: choose-exp ( n -- str ) + { { 0 [ "" ] } { 1 [ "x" ] } [ "x^%d" sprintf ] } case ; + +: choose-coeff ( n -- str ) + [ dup neg? [ neg "- " ] [ "+ " ] if % # ] "" make ; + +: terms ( coeffs-seq -- terms-seq ) + [ [ choose-coeff ] [ choose-exp append ] bi* ] map-index ; + +: (.p) ( n -- str ) (x-1)^ terms " " join 3 tail ; + +: .p ( n -- ) dup zero? [ drop "1" ] [ (.p) ] if print ; + +: show-poly ( n -- ) [ "(x-1)^%d = " printf ] [ .p ] bi ; + +: part1 ( -- ) 8 [ show-poly ] each ; + +: (prime?) ( n -- ? ) + (x-1)^ rest but-last dup first [ mod 0 = not ] curry find + nip not ; + +: prime? ( n -- ? ) dup 2 < [ drop f ] [ (prime?) ] if ; + +: part2 ( -- ) + "Primes up to 50 via AKS:" print + 50 [ prime? ] filter . ; + +: aks-test ( -- ) part1 nl part2 ; + +MAIN: aks-test diff --git a/Task/AKS-test-for-primes/Liberty-BASIC/aks-test-for-primes.liberty b/Task/AKS-test-for-primes/Liberty-BASIC/aks-test-for-primes.liberty new file mode 100644 index 0000000000..bf6fe4c6ea --- /dev/null +++ b/Task/AKS-test-for-primes/Liberty-BASIC/aks-test-for-primes.liberty @@ -0,0 +1,79 @@ +global pasTriMax +pasTriMax = 61 +dim pasTri(pasTriMax + 1) + +for n = 0 to 9 + call expandPoly n +next n +for n = 2 to pasTriMax + if isPrime(n) <> 0 then + print using("###", n); + end if +next n +print +end + +sub expandPoly n + n = int(n) + dim vz$(1) + vz$(0) = "+" + vz$(1) = "-" + if n > pasTriMax then + print n; " is out of range" + end + end if + select case n + case 0 + print "(x-1)^0 = 1" + case 1 + print "(x-1)^1 = x-1" + case else + call pascalTriangle n + print "(x-1)^"; n; " = "; + print "x^"; n; + bVz = 1 + nDiv2 = int(n / 2) + for j = n - 1 to nDiv2 + 1 step -1 + print vz$(bVz); pasTri(n - j); "*x^"; j; + bVz = abs(1 - bVz) + next j + for j = nDiv2 to 2 step -1 + print vz$(bVz); pasTri(j); "*x^"; j; + bVz = abs(1 - bVz) + next j + print vz$(bVz); pasTri(1); "*x"; + bVz = abs(1 - bVz) + print vz$(bVz); pasTri(0) + end select +end sub + +function isPrime(n) + n = int(n) + if n > pasTriMax then + print n; " is out of range" + end + end if + call pascalTriangle n + res = 1 + i = int(n / 2) + while res and (i > 1) + res = res and (pasTri(i) mod n = 0) + i = i - 1 + wend + isPrime = res +end function + +sub pascalTriangle n + rem Calculate the n'th line 0.. middle + n = int(n) + pasTri(0) = 1 + j = 1 + while j <= n + j = j + 1 + k = int(j / 2) + pasTri(k) = pasTri(k - 1) + for k = k to 1 step -1 + pasTri(k) = pasTri(k) + pasTri(k - 1) + next k + wend +end sub diff --git a/Task/AKS-test-for-primes/Pascal/aks-test-for-primes.pascal b/Task/AKS-test-for-primes/Pascal/aks-test-for-primes.pascal index 048f436b40..8849a29649 100644 --- a/Task/AKS-test-for-primes/Pascal/aks-test-for-primes.pascal +++ b/Task/AKS-test-for-primes/Pascal/aks-test-for-primes.pascal @@ -1,108 +1,93 @@ const pasTriMax = 61; + type - tpasTri =array[0..pasTriMax] of UInt64; + TPasTri = array[0 .. pasTriMax] of UInt64; var - pasTri : tpasTri; + pasTri: TPasTri; -procedure pastriangle(n:longInt); -//calculate the n'th line 0.. middle +procedure PascalTriangle(n: LongWord); +// Calculate the n'th line 0.. middle var - j,k: longWord; + j, k: LongWord; begin pasTri[0] := 1; j := 1; - while (j<=n) do + while j <= n do begin - inc(j); - k := j SHR 1; - pasTri[k] :=pasTri[k-1]; - For k := k downto 1 do - inc(pasTri[k],pasTri[k-1]); + Inc(j); + k := j div 2; + pasTri[k] := pasTri[k - 1]; + for k := k downto 1 do + Inc(pasTri[k], pasTri[k - 1]); end; end; -function CheckPrime(n:longWord):boolean; +function IsPrime(n: LongWord): Boolean; var - i : integer; - res: boolean; -Begin - - IF n > pasTriMax then + i: Integer; +begin + if n > pasTriMax then begin - writeln(n,' is out of range '); - EXIT; + WriteLn(n, ' is out of range'); + Halt; end; - pastriangle(n); - res := true; - i := n shr 1; - while res AND (i >1) do - Begin - res := res AND(pasTri[i] mod n = 0); - dec(i); + PascalTriangle(n); + Result := true; + i := n div 2; + while Result and (i > 1) do + begin + Result := Result and (pasTri[i] mod n = 0); + Dec(i); end; - CheckPrime := res; end; -procedure ExpandPoly(n:longWord); +procedure ExpandPoly(n: LongWord); const - Vz :array[boolean] of char = ('+','-'); + Vz: array[Boolean] of Char = ('+', '-'); var - j,k: longWord; + j: LongWord; bVz: Boolean; -Begin - IF n < 2 then - Begin - IF n = 0 then - writeln('(x-1)^0 = 1') - else - writeln('(x-1)^1 = x-1'); - EXIT; - end; - - IF n > pasTriMax then +begin + if n > pasTriMax then begin - writeln(n,' is out of range '); - EXIT; + WriteLn(n,' is out of range'); + Halt; end; - pastriangle(n); - write('(x-1)^',n,' = '); - k := 0; - j := n; - bVz := false; - repeat - IF j=n then - write('x^',j) - else - write(Vz[bVz],pasTri[k],'*x^',j); - bVz := Not(bVz); - inc(k); - dec(j); - until k>= j; - k := j; - while k > 0 do - Begin - IF j <> 1 then - write(Vz[bVz],pasTri[k],'*x^',j) - else - write(Vz[bVz],pasTri[k],'*x'); - bVz := Not(bVz); - dec(k); - dec(j); + case n of + 0: WriteLn('(x-1)^0 = 1'); + 1: WriteLn('(x-1)^1 = x-1'); + else + PascalTriangle(n); + Write('(x-1)^', n, ' = '); + Write('x^', n); + bVz := true; + for j := n - 1 downto n div 2 + 1 do + begin + Write(vz[bVz], pasTri[n - j], '*x^', j); + bVz := not bVz; + end; + for j := n div 2 downto 2 do + begin + Write(vz[bVz], pasTri[j], '*x^', j); + bVz := not bVz; + end; + Write(vz[bVz], pasTri[1], '*x'); + bVz := not bVz; + WriteLn(vz[bVz], pasTri[0]); end; - write(Vz[bVz],pasTri[0]); - writeln; end; var n: LongWord; -Begin - For n := 0 to 9 do +begin + for n := 0 to 9 do ExpandPoly(n); - For n := 2 to pasTriMax do - IF CheckPrime(n) then - write(n:3); + for n := 2 to pasTriMax do + if IsPrime(n) then + Write(n:3); + WriteLn; end. diff --git a/Task/AKS-test-for-primes/Python/aks-test-for-primes-1.py b/Task/AKS-test-for-primes/Python/aks-test-for-primes-1.py index 69ad8f5ca7..75a5acc709 100644 --- a/Task/AKS-test-for-primes/Python/aks-test-for-primes-1.py +++ b/Task/AKS-test-for-primes/Python/aks-test-for-primes-1.py @@ -1,8 +1,8 @@ def expand_x_1(n): # This version uses a generator and thus less computations c =1 - for i in range(n/2+1): - c = c*(n-i)/(i+1) + for i in range(n//2+1): + c = c*(n-i)//(i+1) yield c def aks(p): diff --git a/Task/AKS-test-for-primes/Python/aks-test-for-primes-2.py b/Task/AKS-test-for-primes/Python/aks-test-for-primes-2.py index da7833f1ec..70b7c52cb0 100644 --- a/Task/AKS-test-for-primes/Python/aks-test-for-primes-2.py +++ b/Task/AKS-test-for-primes/Python/aks-test-for-primes-2.py @@ -1,20 +1,7 @@ -def expand_x_1(p): - ex = [1] - for i in range(p): - ex.append(ex[-1] * -(p-i) / (i+1)) - return ex[::-1] - -def aks_test(p): - if p < 2: return False - ex = expand_x_1(p) - ex[0] += 1 - return not any(mult % p for mult in ex[0:-1]) - - -print('# p: (x-1)^p for small p') -for p in range(12): - print('%3i: %s' % (p, ' '.join('%+i%s' % (e, ('x^%i' % n) if n else '') - for n,e in enumerate(expand_x_1(p))))) - -print('\n# small primes using the aks test') -print([p for p in range(101) if aks_test(p)]) +def aks(p): + if p==2:return True + c=1 + for i in range(p//2+1): + c=c*(p-i)//(i+1) + if c%p:return False + return True diff --git a/Task/AKS-test-for-primes/Python/aks-test-for-primes-3.py b/Task/AKS-test-for-primes/Python/aks-test-for-primes-3.py index 4e7140c616..da7833f1ec 100644 --- a/Task/AKS-test-for-primes/Python/aks-test-for-primes-3.py +++ b/Task/AKS-test-for-primes/Python/aks-test-for-primes-3.py @@ -1,15 +1,20 @@ -print(''' -{| class="wikitable" style="text-align:left;" -|+ Polynomial Expansions and AKS prime test -|- -! p -! (x-1)^p -|-''') +def expand_x_1(p): + ex = [1] + for i in range(p): + ex.append(ex[-1] * -(p-i) / (i+1)) + return ex[::-1] + +def aks_test(p): + if p < 2: return False + ex = expand_x_1(p) + ex[0] += 1 + return not any(mult % p for mult in ex[0:-1]) + + +print('# p: (x-1)^p for small p') for p in range(12): - print('! %i\n| %s\n| %r\n|-' - % (p, - ' '.join('%s%s' % (('%+i' % e) if (e != 1 or not p or (p and not n) ) else '+', - (('x^{%i}' % n) if n > 1 else 'x') if n else '') - for n,e in enumerate(expand_x_1(p))), - aks_test(p))) -print('|}') + print('%3i: %s' % (p, ' '.join('%+i%s' % (e, ('x^%i' % n) if n else '') + for n,e in enumerate(expand_x_1(p))))) + +print('\n# small primes using the aks test') +print([p for p in range(101) if aks_test(p)]) diff --git a/Task/AKS-test-for-primes/Python/aks-test-for-primes-4.py b/Task/AKS-test-for-primes/Python/aks-test-for-primes-4.py new file mode 100644 index 0000000000..4e7140c616 --- /dev/null +++ b/Task/AKS-test-for-primes/Python/aks-test-for-primes-4.py @@ -0,0 +1,15 @@ +print(''' +{| class="wikitable" style="text-align:left;" +|+ Polynomial Expansions and AKS prime test +|- +! p +! (x-1)^p +|-''') +for p in range(12): + print('! %i\n| %s\n| %r\n|-' + % (p, + ' '.join('%s%s' % (('%+i' % e) if (e != 1 or not p or (p and not n) ) else '+', + (('x^{%i}' % n) if n > 1 else 'x') if n else '') + for n,e in enumerate(expand_x_1(p))), + aks_test(p))) +print('|}') 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 a74f05877c..f2aa00be60 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,6 +1,7 @@ /*REXX program calculates primes via the Agrawal─Kayal─Saxena (AKS) primality test.*/ -parse arg Z .; if Z=='' | Z=="," then Z=200 /*Z not specified? Then use default.*/ -OZ=Z; tell= Z<0; Z=abs(Z) /*Is Z negative? Then show expression.*/ +parse arg Z . /*obtain optional argument from the CL.*/ +if Z=='' | Z=="," then Z= 200 /*Not specified? Then use the default.*/ +OZ=Z; tell= Z<0; Z= abs(Z) /*Is Z negative? Then show expression.*/ numeric digits max(9, Z % 3) /*define a dynamic # of decimal digits.*/ call AKS /*invoke the AKS funtion for coef. bld.*/ if left(OZ,1)=='+' then do; say Z isAksp(); exit /*display if Z is or isn't a prime.*/ @@ -10,10 +11,8 @@ say; if \datatype(#, 'W') then exit /* [↓] the digit length of a say 'Found ' words(#) " primes and the largest coefficient has " length(@.pm.h) @dd exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ -isAKSp: if z==word(#,words(#)) then return ' is a prime.'; else return " isn't a prime." -/*──────────────────────────────────────────────────────────────────────────────────────*/ -AKS: $.0= '-'; $.1= "+"; @.=1 /*$.x: sign char; default coefficients.*/ - q.=1; q.1=0; q.4=0 /*sparse array for faster comparisons. */ +AKS: $.0= '-'; $.1= "+"; @. = 1 /*$.x: sign char; default coefficients.*/ + q.= 1; q.1= 0; q.4= 0 /*sparse array for faster comparisons. */ #=; L= length(Z) /*define list of prime numbers (so far)*/ do p=3 for Z; pm=p - 1; pp=p + 1 /*PM & PP: used as a coding convenience*/ do m=2 for pp % 2 - 1; mm=m - 1 /*calculate coefficients for a power. */ @@ -23,20 +22,22 @@ AKS: $.0= '-'; $.1= "+"; @.=1 /*$.x: sign char; default coeff end /*p*/ /* sides in the same loop. */ if tell then say '(x-1)^'right(0, L)": 1" /*possibly display the first expression*/ @dd= 'decimal digits.' /* [↓] test for primality by division.*/ - do n=2 for Z; nh=n % 2; d=n - 1 /*create expressions; find the primes.*/ - do k=3 to nh while @.n.k//d==0 /*are coefficients divisible by N-1 ? */ + do n=2 for Z; nh=n % 2; d= n - 1 /*create expressions; find the primes.*/ + do k=3 to nh while @.n.k//d == 0 /*are coefficients divisible by N-1 ? */ end /*k*/ /* [↑] skip the 1st & 2nd coefficients*/ - if k>nh then if q.d then #=# d /*add a number to the prime list. */ + if k>nh then if q.d then #= # d /*add a number to the prime list. */ if \tell then iterate /*Don't tell? Don't show expressions.*/ - y='(x-1)^'right(d, L)": " /*define the 1st part of the expression*/ + y= '(x-1)^'right(d, L)":" /*define the 1st part of the expression*/ s=1 /*S: is the sign indicator (-1│+1).*/ do j=n for n-1 by -1 /*create the higher powers first. */ if j==2 then xp= 'x' /*if power=1, then don't show the power*/ - else xp= 'x^' || (j-1) /* ··· else show power with ^ */ + else xp= 'x^' || j-1 /* ··· else show power with ^ */ if j==n then y=y xp /*no sign (+│-) for the 1st expression.*/ else y=y $.s || @.n.j'∙'xp /*build the expression with sign (+|-).*/ s= \s /*flip the sign for the next expression*/ end /*j*/ /* [↑] the sign (now) is either 0 │ 1,*/ say y $.s'1' /*just show the first N expressions, */ end /*n*/ /* [↑] ··· but only for negative Z. */ - if #=='' then #='none'; return # /*if null, return "none"; else return #*/ + if #=='' then #= "none"; return # /*if null, return "none"; else return #*/ +/*──────────────────────────────────────────────────────────────────────────────────────*/ +isAKSp: if z==word(#,words(#)) then return ' is a prime.'; else return " isn't a prime." diff --git a/Task/AKS-test-for-primes/Ruby/aks-test-for-primes-2.rb b/Task/AKS-test-for-primes/Ruby/aks-test-for-primes-2.rb index f73a774b9c..75d6a42ae3 100644 --- a/Task/AKS-test-for-primes/Ruby/aks-test-for-primes-2.rb +++ b/Task/AKS-test-for-primes/Ruby/aks-test-for-primes-2.rb @@ -6,20 +6,15 @@ end def prime?(p) return false if p < 2 - coeff = x_minus_1_to_the(p) - coeff[0] += coeff.pop - coeff.all?{|n| n%p==0} + coeff = x_minus_1_to_the(p)[1..p/2] # only need half of coeff terms + coeff.all?{ |n| n%p == 0 } end 8.times do |n| puts "(x-1)^#{n} = " + - x_minus_1_to_the(n). - each_with_index. - map { |c, p| - if p.zero? then c.to_s - else - (c<0 ? " - " : " + ") + (c.abs==1 ? "x" : "#{c.abs}x") + (p==1 ? "" : "^#{p}") - end + x_minus_1_to_the(n).map.with_index { |c, p| + p.zero? ? c.to_s : + (c < 0 ? " - " : " + ") + (c.abs == 1 ? "x" : "#{c.abs}x") + (p == 1 ? "" : "^#{p}") }.join end diff --git a/Task/AKS-test-for-primes/Scheme/aks-test-for-primes.ss b/Task/AKS-test-for-primes/Scheme/aks-test-for-primes.ss new file mode 100644 index 0000000000..e9200152e8 --- /dev/null +++ b/Task/AKS-test-for-primes/Scheme/aks-test-for-primes.ss @@ -0,0 +1,56 @@ +;; implement mod m arithmetic with polnomials in x +;; as lists of coefficients, x^0 first. +;; +;; so x^3 + 5 is represented as (5 0 0 1) + +(define (+/m m a b) + ;; add two polynomials + (cond ((null? a) b) + ((null? b) a) + (else (cons (modulo (+ (car a) (car b)) m) + (+/m m (cdr a) (cdr b)))))) + +(define (*c/m m c a) + ;; multiplication by a constant + (map (lambda (v) (modulo (* c v) m)) a)) + +(define (*/m m a b) + ;; multiply two polynomials + (let loop ((a a)) + (if (null? a) + '() + (+/m m (*c/m m (car a) b) + (cons 0 (*/m m (cdr a) b)))))) + +(define (x^n/m m n) + (if (= n 0) + '(1) + (cons 0 (x^n/m m (- n 1))))) + +(define (^n/m m a n) + ;; calculate the n'th power of polynomial a + (cond ((= n 0) '(1)) + ((= n 1) a) + (else (*/m m a (^n/m m a (- n 1)))))) + +;; test case +;; +;; ? lift(Mod((x^3 + 5)*(4 + 3*x + x^2),6)) +;; %13 = x^5 + 3*x^4 + 4*x^3 + 5*x^2 + 3*x + 2 +;; +;; > (*/m 6 '(5 0 0 1) '(4 3 1)) +;; '(2 3 5 4 3 1) +;; +;; working correctly + +(define (rosetta-aks-test p) + (if (or (= p 0) (= p 1)) + #f + ;; u = (x - 1)^p + ;; v = (x^p - 1) + (let ((u (^n/m p (list -1 1) p)) + (v (+/m p (x^n/m p p) (list -1)))) + (every zero? (+/m p u (*c/m p -1 v)))))) + +;; > (filter rosetta-aks-test (iota 50)) +;; '(2 3 5 7 11 13 17 19 23 29 31 37 41 43 47) diff --git a/Task/AKS-test-for-primes/VBA/aks-test-for-primes.vba b/Task/AKS-test-for-primes/VBA/aks-test-for-primes.vba new file mode 100644 index 0000000000..066a7f0575 --- /dev/null +++ b/Task/AKS-test-for-primes/VBA/aks-test-for-primes.vba @@ -0,0 +1,75 @@ +'-- Does not work for primes above 97, which is actually beyond the original task anyway. +'-- Translated from the C version, just about everything is (working) out-by-1, what fun. +'-- This updated VBA version utilizes the Decimal datatype to handle numbers requiring +'-- more than 32 bits. +Const MAX = 99 +Dim c(MAX + 1) As Variant +Private Sub coef(n As Integer) +'-- out-by-1, ie coef(1)==^0, coef(2)==^1, coef(3)==^2 etc. + c(n) = CDec(1) 'converts c(n) from Variant to Decimal, a 12 byte data type + For i = n - 1 To 2 Step -1 + c(i) = c(i) + c(i - 1) + Next i +End Sub +Private Function is_prime(fn As Variant) As Boolean + fn = CDec(fn) + Call coef(fn + 1) '-- (I said it was out-by-1) + For i = 2 To fn - 1 '-- (technically "to n" is more correct) + If c(i) - fn * Int(c(i) / fn) <> 0 Then 'c(i) Mod fn <> 0 Then --Mod works upto 32 bit numbers + is_prime = False: Exit Function + End If + Next i + is_prime = True +End Function +Private Sub show(n As Integer) +'-- (As per coef, this is (working) out-by-1) + Dim ci As Variant + For i = n To 1 Step -1 + ci = c(i) + If ci = 1 Then + If (n - i) Mod 2 = 0 Then + If i = 1 Then + If n = 1 Then + ci = "1" + Else + ci = "+1" + End If + Else + ci = "" + End If + Else + ci = "-1" + End If + Else + If (n - i) Mod 2 = 0 Then + ci = "+" & ci + Else + ci = "-" & ci + End If + End If + If i = 1 Then '-- ie ^0 + Debug.Print ci + Else + If i = 2 Then '-- ie ^1 + Debug.Print ci & "x"; + Else + Debug.Print ci & "x^" & i - 1; + End If + End If + Next i +End Sub +Public Sub AKS_test_for_primes() + Dim n As Integer + For n = 1 To 10 '-- (0 to 9 really) + coef n + Debug.Print "(x-1)^" & n - 1 & " = "; + show n + Next n + Debug.Print "primes (<="; MAX; "):" + coef 2 '-- (needed to reset c, if we want to avoid saying 1 is prime...) + For n = 2 To MAX + If is_prime(n) Then + Debug.Print n; + End If + Next n +End Sub diff --git a/Task/Abstract-type/C/abstract-type-2.c b/Task/Abstract-type/C/abstract-type-2.c index 471032a607..f725db06d7 100644 --- a/Task/Abstract-type/C/abstract-type-2.c +++ b/Task/Abstract-type/C/abstract-type-2.c @@ -1,6 +1,7 @@ #ifndef SILLY_H #define SILLY_H #include "intefaceAbs.h" +#include typedef struct sillyStruct *Silly; extern Silly NewSilly( double, const char *); diff --git a/Task/Abstract-type/C/abstract-type-3.c b/Task/Abstract-type/C/abstract-type-3.c index d53c69665d..0b1c4d0243 100644 --- a/Task/Abstract-type/C/abstract-type-3.c +++ b/Task/Abstract-type/C/abstract-type-3.c @@ -1,6 +1,5 @@ #include "silly.h" #include -#include #include struct sillyStruct { diff --git a/Task/Abstract-type/Crystal/abstract-type.crystal b/Task/Abstract-type/Crystal/abstract-type.crystal new file mode 100644 index 0000000000..e55bf0a1ac --- /dev/null +++ b/Task/Abstract-type/Crystal/abstract-type.crystal @@ -0,0 +1,40 @@ +abstract class Animal # only abstract class can have abstract methods + abstract def move + abstract def think + + # abstract class can have normal fields and methods + def initialize(@name : String) + end + + def process + think + move + end +end + +# WalkingAnimal still have to be declared abstract because `think` was not implemented +abstract class WalkingAnimal < Animal + def move + puts "#{@name} walks" + end +end + +class Human < WalkingAnimal + property in_car = false + + def move + if in_car + puts "#{@name} drives a car" + else + super + end + end + + def think + puts "#{@name} thinks" + end +end + +# Animal.new # => can't instantiate abstract class +he = Human.new("Andrew") # ok +he.process diff --git a/Task/Abstract-type/Mercury/abstract-type.mercury b/Task/Abstract-type/Mercury/abstract-type.mercury new file mode 100644 index 0000000000..44450b61e2 --- /dev/null +++ b/Task/Abstract-type/Mercury/abstract-type.mercury @@ -0,0 +1,26 @@ +:- module eq. +:- interface. + +:- typeclass eq(T) where [ + pred (T::in) == (T::in) is semidet, + pred (T::in) \= (T::in) is semidet +]. + +:- pred f(T::in) is semidet <= eq(T). + +:- type foo + ---> foo( + x :: int, + str :: string + ). + +:- instance eq(foo). + +:- implementation. + +f(X) :- X == X. + +:- instance eq(foo) where [ + A == B :- (A^x = B^x, A^str = B^str), + A \= B :- not A == B +]. diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/00META.yaml b/Task/Abundant,-deficient-and-perfect-number-classifications/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/00META.yaml @@ -0,0 +1 @@ +--- {} 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 new file mode 100644 index 0000000000..7f31df9a87 --- /dev/null +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Ada/abundant,-deficient-and-perfect-number-classifications.ada @@ -0,0 +1,38 @@ +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); + + Results: array (Class_Type) of Natural := (others => 0); + Sum: Natural; + + 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 + Sum := Divisor_Sum.Process(N); + if Sum < N then + Results(Deficient) := Results(Deficient)+1; + elsif Sum = N then + Results(Perfect) := Results(Perfect)+1; + else + Results(Abundant) := Results(Abundant)+1; + end if; + end loop; + Sum := 0; + 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(Sum, 8); + Ada.Text_IO.New_Line; + Ada.Text_IO.Put_Line("===================="); +end ADB_Classification; diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Elena/abundant,-deficient-and-perfect-number-classifications.elena b/Task/Abundant,-deficient-and-perfect-number-classifications/Elena/abundant,-deficient-and-perfect-number-classifications.elena index 2eb688c5b3..f3cc8f8e2e 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/Elena/abundant,-deficient-and-perfect-number-classifications.elena +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Elena/abundant,-deficient-and-perfect-number-classifications.elena @@ -1,41 +1,51 @@ -import extensions. +import extensions; -classifyNumbers = +classifyNumbers(int bound, ref int abundant, ref int deficient, ref int perfect) { - eval(int bound, ref abundant, ref deficient, ref perfect) - [ - int a := 0. - int d := 0. - int p := 0. - Array sum := V(bound + 1). + int a := 0; + int d := 0; + int p := 0; + int[] sum := new int[](bound + 1); - 1 to(bound / 2) do(:divisor) - [ - (divisor + divisor) to:bound by:divisor do(:i) - [ - (sum[i]) += divisor - ]. - ]. - 1 to:bound do(:i) - [ - int t := sum[i]. + for(int divisor := 1, divisor <= bound / 2, divisor += 1) + { + for(int i := divisor + divisor, i <= bound, i += divisor) + { + sum[i] := sum[i] + divisor + } + }; - if (sum[i]i) [ a += 1 ]; - [ p += 1 ] - ]. + for(int i := 1, i <= bound, i += 1) + { + int t := sum[i]; - abundant value := a. - deficient value := d. - perfect value := p - ] -}. + if (sum[i]i) + { + a += 1 + } + else + { + p += 1 + } + } + }; -public program -[ - int abundant := 0. - int deficient := 0. - int perfect := 0. - classifyNumbers eval(20000, &abundant, &deficient, &perfect). - console printLine("Abundant: ",abundant,", Deficient: ",deficient,", Perfect: ",perfect) -] + abundant := a; + deficient := d; + perfect := p +} + +public program() +{ + int abundant := 0; + int deficient := 0; + int perfect := 0; + classifyNumbers(20000, ref abundant, ref deficient, ref perfect); + console.printLine("Abundant: ",abundant,", Deficient: ",deficient,", Perfect: ",perfect) +} diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Go/abundant,-deficient-and-perfect-number-classifications.go b/Task/Abundant,-deficient-and-perfect-number-classifications/Go/abundant,-deficient-and-perfect-number-classifications.go index c99712033c..616a1869a0 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/Go/abundant,-deficient-and-perfect-number-classifications.go +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Go/abundant,-deficient-and-perfect-number-classifications.go @@ -2,38 +2,29 @@ package main import "fmt" -import "math" +func pfacSum(i int) int { + sum := 0 + for p := 1; p <= i/2; p++ { + if i%p == 0 { + sum += p + } + } + return sum +} func main() { - -var d,a,p,i=0,0,0,1 - -for i=1;i<=20000;i++{ - -if pfac_sum(i)x;:1;:[s 1, gather for 2 .. x.sqrt.floor -> \d { - my \y = x div d; - if y * d == x { take d; take y unless y == d } - }) + my @l = 1 if x > 1; + (2 .. x.sqrt.floor).map: -> \d { + unless x % d { @l.push: d; my \y = x div d; @l.push: y if y != d } + } + sum @l } -say bag map { propdivsum($_) <=> $_ }, 1..20000 +say bag (1..20000).map: { propdivsum($_) <=> $_ } diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-1.pl b/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-1.pl index 90d9289a70..ad57cd7bb9 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-1.pl +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-1.pl @@ -1,2 +1,6 @@ use ntheory qw/divisor_sum/; -say join " ", map { divisor_sum($_)-$_ <=> $_ } 1..30; +my @type = ; +say join "\n", map { sprintf "%2d %s", $_, $type[divisor_sum($_)-$_ <=> $_] } 1..12; +my %h; +$h{divisor_sum($_)-$_ <=> $_}++ for 1..20000; +say "Perfect: $h{0} Deficient: $h{-1} Abundant: $h{1}"; diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-2.pl b/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-2.pl index 5eae5bf393..ff50188233 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-2.pl +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Perl/abundant,-deficient-and-perfect-number-classifications-2.pl @@ -1,4 +1,12 @@ -use ntheory qw/divisor_sum/; +sub div_sum { + my($n) = @_; + my $sum = 0; + map { $sum += $_ unless $n % $_ } 1 .. $n-1; + $sum; +} + +my @type = ; +say join "\n", map { sprintf "%2d %s", $_, $type[div_sum($_) <=> $_] } 1..12; my %h; -$h{divisor_sum($_)-$_ <=> $_}++ for 1..20000; +$h{div_sum($_) <=> $_}++ for 1..20000; say "Perfect: $h{0} Deficient: $h{-1} Abundant: $h{1}"; diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/PicoLisp/abundant,-deficient-and-perfect-number-classifications.l b/Task/Abundant,-deficient-and-perfect-number-classifications/PicoLisp/abundant,-deficient-and-perfect-number-classifications.l index f25dcd64f0..2df8d4b62e 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/PicoLisp/abundant,-deficient-and-perfect-number-classifications.l +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/PicoLisp/abundant,-deficient-and-perfect-number-classifications.l @@ -3,6 +3,11 @@ (con @ (inc (cdr @))) (push Var (cons Key 1)) ) Key ) +(de **sum (L) + (let S 1 + (for I (cdr L) + (inc 'S (** (car L) I)) ) + S ) ) (de factor-sum (N) (if (=1 N) 0 @@ -20,12 +25,7 @@ (inc 'D (pop 'L)) ) ) (accud 'R N1) (for I R - (one D) - (one M) - (for J (cdr I) - (setq M (* M (car I))) - (inc 'D M) ) - (setq S (* S D)) ) + (setq S (* S (**sum I))) ) (- S N) ) ) ) (bench (let diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-1.rexx b/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-1.rexx index e95fba0aad..076015bcfb 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-1.rexx +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-1.rexx @@ -1,12 +1,12 @@ /*REXX program counts the number of abundant/deficient/perfect numbers within a range.*/ parse arg low high . /*obtain optional arguments from the CL*/ -high=word(high low 20000,1); low=word(low 1,1) /*obtain the LOW and HIGH values.*/ +high=word(high low 20000,1); low= word(low 1,1) /*obtain the LOW and HIGH values.*/ say center('integers from ' low " to " high, 45, "═") /*display a header.*/ -!.=0 /*define all types of sums to zero. */ - do j=low to high; $=sigma(j) /*get sigma for an integer in a range. */ - if $j then !.a=!.a+1 /*Greater? " " abundant " */ - else !.p=!.p+1 /*Equal? " " perfect " */ +!.= 0 /*define all types of sums to zero. */ + do j=low to high; $= sigma(j) /*get sigma for an integer in a range. */ + if $j then !.a= !.a + 1 /*Greater? " " abundant " */ + else !.p= !.p + 1 /*Equal? " " perfect " */ end /*j*/ /* [↑] IFs are coded as per likelihood*/ say ' the number of perfect numbers: ' right(!.p, length(high) ) @@ -15,10 +15,9 @@ say ' the number of deficient numbers: ' right(!.d, length(high) ) exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ sigma: procedure; parse arg x; if x<2 then return 0; odd=x // 2 /* // ◄──remainder.*/ - s=1 /* [↓] only use EVEN or ODD integers.*/ - do j=2+odd by 1+odd while j*jj then !.a=!.a+1 /*Greater? " " abundant " */ - else !.p=!.p+1 /*Equal? " " perfect " */ +!.= 0 /*define all types of sums to zero. */ + do j=low to high; $= sigma(j) /*get sigma for an integer in a range. */ + if $j then !.a= !.a + 1 /*Greater? " " abundant " */ + else !.p= !.p + 1 /*Equal? " " perfect " */ end /*j*/ /* [↑] IFs are coded as per likelihood*/ say ' the number of perfect numbers: ' right(!.p, length(high) ) @@ -14,13 +14,12 @@ say ' the number of abundant numbers: ' right(!.a, length(high) ) say ' the number of deficient numbers: ' right(!.d, length(high) ) exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ -sigma: procedure; parse arg x 1 z; if x<5 then return max(0,x-1); odd=x//2 /*is X odd?*/ - q=1; do while q<=z; q=q*4; end /* ◄──↓ compute integer sqrt of Z (=R)*/ +sigma: procedure; parse arg x 1 z; if x<5 then return max(0, x-1) /*sets X&Z to arg1.*/ + q=1; do while q<=z; q= q * 4; end /* ◄──↓ compute integer sqrt of Z (=R)*/ r=0; do while q>1; q=q%4; _=z-r-q; r=r%2; if _>=0 then do; z=_; r=r+q; end; end - /* [↓] only use EVEN | ODD ints. ___*/ - s=1; do j=2+odd by 1+odd to r /*divide by all integers up to √ x */ - if x//j==0 then s=s+j+ x%j /*add the two divisors to (sigma) sum. */ - end /*j*/ /* [↑] % is the REXX integer division*/ - /* [↓] adjust for a square. ___*/ - if r*r==x then s=s-j /*Was X a square? If so, subtract √ x */ - return s /*return (sigma) sum of the divisors. */ + odd= x//2 /* [↓] only use EVEN | ODD ints. ___*/ + s= 1; do k=2+odd by 1+odd to r /*divide by all integers up to √ x */ + if x//k==0 then s=s + k + x%k /*add the two divisors to (sigma) sum. */ + end /*k*/ /* [↑] % is the REXX integer division*/ + if r*r==x then return s - k /*Was X a square? If so, subtract √ x */ + return s /*return (sigma) sum of the divisors. */ diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-3.rexx b/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-3.rexx index f8136ed195..e2df0a6f1f 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-3.rexx +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/REXX/abundant,-deficient-and-perfect-number-classifications-3.rexx @@ -1,3 +1,4 @@ +/* REXX */ Call time 'R' cnt.=0 Do x=1 To 20000 diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Seed7/abundant,-deficient-and-perfect-number-classifications.seed7 b/Task/Abundant,-deficient-and-perfect-number-classifications/Seed7/abundant,-deficient-and-perfect-number-classifications.seed7 new file mode 100644 index 0000000000..dd16c86c1e --- /dev/null +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Seed7/abundant,-deficient-and-perfect-number-classifications.seed7 @@ -0,0 +1,39 @@ +$ include "seed7_05.s7i"; + +const func integer: sumProperDivisors (in integer: number) is func + result + var integer: sum is 0; + local + var integer: num is 0; + begin + if number >= 2 then + for num range 1 to number div 2 do + if number rem num = 0 then + sum +:= num; + end if; + end for; + end if; + end func; + +const proc: main is func + local + var integer: sum is 0; + var integer: deficient is 0; + var integer: perfect is 0; + var integer: abundant is 0; + var integer: number is 0; + begin + for number range 1 to 20000 do + sum := sumProperDivisors(number); + if sum < number then + incr(deficient); + elsif sum = number then + incr(perfect); + else + incr(abundant); + end if; + end for; + writeln("Deficient: " <& deficient); + writeln("Perfect: " <& perfect); + writeln("Abundant: " <& abundant); + end func; diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Sidef/abundant,-deficient-and-perfect-number-classifications.sidef b/Task/Abundant,-deficient-and-perfect-number-classifications/Sidef/abundant,-deficient-and-perfect-number-classifications.sidef index 371eac9a23..2d40cecd14 100644 --- a/Task/Abundant,-deficient-and-perfect-number-classifications/Sidef/abundant,-deficient-and-perfect-number-classifications.sidef +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Sidef/abundant,-deficient-and-perfect-number-classifications.sidef @@ -1,11 +1,5 @@ -func propdivsum(x) { - gather { - for d in (2 .. x.isqrt) { - take(d, x/d) if (d `divides` x) - } - }.uniq.sum(x > 1 ? 1 : 0) -} -  +func propdivsum(n) { n.sigma - n } + var h = Hash() {|i| ++(h{propdivsum(i) <=> i} := 0) } << 1..20000 say "Perfect: #{h{0}} Deficient: #{h{-1}} Abundant: #{h{1}}" diff --git a/Task/Abundant,-deficient-and-perfect-number-classifications/Visual-Basic-.NET/abundant,-deficient-and-perfect-number-classifications.visual b/Task/Abundant,-deficient-and-perfect-number-classifications/Visual-Basic-.NET/abundant,-deficient-and-perfect-number-classifications.visual new file mode 100644 index 0000000000..1af6ab3647 --- /dev/null +++ b/Task/Abundant,-deficient-and-perfect-number-classifications/Visual-Basic-.NET/abundant,-deficient-and-perfect-number-classifications.visual @@ -0,0 +1,33 @@ +Module Module1 + + Function SumProperDivisors(number As Integer) As Integer + If number < 2 Then Return 0 + Dim sum As Integer = 0 + For i As Integer = 1 To number \ 2 + If number Mod i = 0 Then sum += i + Next + Return sum + End Function + + Sub Main() + Dim sum, deficient, perfect, abundant As Integer + + For n As Integer = 1 To 20000 + sum = SumProperDivisors(n) + If sum < n Then + deficient += 1 + ElseIf sum = n Then + perfect += 1 + Else + abundant += 1 + End If + Next + + Console.WriteLine("The classification of the numbers from 1 to 20,000 is as follows : ") + Console.WriteLine() + Console.WriteLine("Deficient = {0}", deficient) + Console.WriteLine("Perfect = {0}", perfect) + Console.WriteLine("Abundant = {0}", abundant) + End Sub + +End Module diff --git a/Task/Accumulator-factory/Aime/accumulator-factory-1.aime b/Task/Accumulator-factory/Aime/accumulator-factory-1.aime new file mode 100644 index 0000000000..cc820e6acd --- /dev/null +++ b/Task/Accumulator-factory/Aime/accumulator-factory-1.aime @@ -0,0 +1,17 @@ +af(list l, object o) +{ + l[0] = l[0] + o; +} + +main(void) +{ + object (*f)(object); + + f = af.apply(list(1)); + + f(5); + af.apply(list(3)); + o_(f(2.3), "\n"); + + 0; +} diff --git a/Task/Accumulator-factory/Aime/accumulator-factory-2.aime b/Task/Accumulator-factory/Aime/accumulator-factory-2.aime new file mode 100644 index 0000000000..79ad9500cd --- /dev/null +++ b/Task/Accumulator-factory/Aime/accumulator-factory-2.aime @@ -0,0 +1,11 @@ + f = af.apply(list(5)); + + f(-6); + f(7); + o_form("~: ~\n", f(0).__type, f(0)); + + f = af.apply(list(8)); + + f(-6.6); + f(4.2); + o_form("~: /d1/\n", f(0).__type, f(0)); diff --git a/Task/Accumulator-factory/Astro/accumulator-factory.astro b/Task/Accumulator-factory/Astro/accumulator-factory.astro index 64f5488404..7701b063cc 100644 --- a/Task/Accumulator-factory/Astro/accumulator-factory.astro +++ b/Task/Accumulator-factory/Astro/accumulator-factory.astro @@ -1,7 +1,7 @@ -fun accumulator(sum): n => sum += n +fun accumulator(var sum): :: Real -> _ + n => sum += n -let f = accumulator(5.) - -print f(5) # 10.0 -print f(10) # 20.0 +let f = accumulator!(5) +print f(5) # 10 +print f(10) # 20 print f(2.4) # 22.4 diff --git a/Task/Accumulator-factory/Elena/accumulator-factory.elena b/Task/Accumulator-factory/Elena/accumulator-factory.elena index a44ae1f558..221fb0d382 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). + = (n => acc.append:n); accumulator(n) - = function(Variable new(n)). + = function(new Variable(n)); -public program -[ - var x := accumulator(1). +public program() +{ + var x := accumulator(1); - x(5). + x(5); - var y := accumulator(3). + var y := accumulator(3); - console write(x(2.3r)) -] + console.write(x(2.3r)) +} diff --git a/Task/Accumulator-factory/Golo/accumulator-factory.golo b/Task/Accumulator-factory/Golo/accumulator-factory.golo index be83ad3f91..d7d479c7ae 100644 --- a/Task/Accumulator-factory/Golo/accumulator-factory.golo +++ b/Task/Accumulator-factory/Golo/accumulator-factory.golo @@ -1,16 +1,19 @@ -module accumulatorfactory +#!/usr/bin/env golosh +---- +An accumulator factory example for Rosetta Code. +This one uses the box function to create an AtomicReference. +---- +module rosetta.AccumulatorFactory function accumulator = |n| { - let number = DynamicVariable(n) - return |i| { - number: value(number: value() + i) - return number: value() - } + let number = box(n) + return |i| -> number: accumulateAndGet(i, |a, b| -> a + b) } function main = |args| { - let x = accumulator(1) - x(5) - accumulator(3) - println(x(2.3)) + let acc = accumulator(3) + println(acc(1)) + println(acc(1.1)) + println(acc(10)) + println(acc(100.101)) } diff --git a/Task/Accumulator-factory/Mercury/accumulator-factory-1.mercury b/Task/Accumulator-factory/Mercury/accumulator-factory-1.mercury new file mode 100644 index 0000000000..6e67eabc8c --- /dev/null +++ b/Task/Accumulator-factory/Mercury/accumulator-factory-1.mercury @@ -0,0 +1,30 @@ +:- module accum. +:- interface. + +:- typeclass addable(T) where [ + func T + T = T +]. + +:- impure func gen(T) = (impure (func(T)) = T) <= addable(T). + +:- implementation. +:- import_module bt_array, univ, int. + +:- mutable(states, bt_array(univ), make_empty_array(0), ground, [untrailed]). + +gen(N) = F :- + some [!S] ( + semipure get_states(!:S), + size(!.S, Size), + resize(!.S, 0, Size + 1, univ(N), !:S), + impure set_states(!.S) + ), + F = (impure (func(Add)) = M :- + some [!SF] ( + semipure get_states(!:SF), + !.SF ^ elem(Size) = U, + det_univ_to_type(U, M0), + M = M0 + Add, + !SF ^ elem(Size) := univ(M), + impure set_states(!.SF) + )). diff --git a/Task/Accumulator-factory/Mercury/accumulator-factory-2.mercury b/Task/Accumulator-factory/Mercury/accumulator-factory-2.mercury new file mode 100644 index 0000000000..7d4f460d44 --- /dev/null +++ b/Task/Accumulator-factory/Mercury/accumulator-factory-2.mercury @@ -0,0 +1,25 @@ +:- module accumuser. +:- interface. +:- import_module io. +:- pred main(io::di, io::uo) is det. +:- implementation. +:- import_module accum, list, string, int, float. + +:- instance addable(int) where [ + A + B = int.(A + B) +]. + +:- instance addable(float) where [ + A + B = float.(A + B) +]. + +:- pragma promise_pure main/2. +main(!IO) :- + impure F = accum.gen(1), + impure N1 = impure_apply(F, 1), + impure N2 = impure_apply(F, 1), + impure G = accum.gen(500.0), + impure R1 = impure_apply(G, -10.0), + impure R2 = impure_apply(G, -50.0), + io.format("%d, %d\n", [i(N1), i(N2)], !IO), + io.format("%.0f, %.0f\n", [f(R1), f(R2)], !IO). diff --git a/Task/Accumulator-factory/Mercury/accumulator-factory-3.mercury b/Task/Accumulator-factory/Mercury/accumulator-factory-3.mercury new file mode 100644 index 0000000000..2b00ccbc6d --- /dev/null +++ b/Task/Accumulator-factory/Mercury/accumulator-factory-3.mercury @@ -0,0 +1,29 @@ +:- module accum2. +:- interface. + +:- typeclass addable(T) where [ + func T + T = T +]. + +:- type accum(T). + + % init(N) = Acc + % Return an accumulator with initial value of N + % +:- func init(T) = accum(T) + <= addable(T). + + % bump(By, N, !Acc) + % Add By to accumulator !Acc, yielding the next number as N + % +:- pred bump(T::in, T::out, accum(T)::in, accum(T)::out) is det + <= addable(T). + +:- implementation. + +:- type accum(T) == T. + +init(N) = N. + +bump(X, N, N0, N) :- + N = X + N0. diff --git a/Task/Accumulator-factory/Mercury/accumulator-factory-4.mercury b/Task/Accumulator-factory/Mercury/accumulator-factory-4.mercury new file mode 100644 index 0000000000..89c7fd964f --- /dev/null +++ b/Task/Accumulator-factory/Mercury/accumulator-factory-4.mercury @@ -0,0 +1,28 @@ +:- module accumuser2. +:- interface. +:- import_module io. +:- pred main(io::di, io::uo) is det. +:- implementation. +:- import_module accum2, list, string, int, float. + +:- instance addable(int) where [ + A + B = int.(A + B) +]. + +:- instance addable(float) where [ + A + B = float.(A + B) +]. + +main(!IO) :- + some [!A1] ( + !:A1 = accum2.init(1), + accum2.bump(1, N1, !A1), + accum2.bump(1, N2, !.A1, _) + ), + some [!A2] ( + !:A2 = accum2.init(500.0), + accum2.bump(-10.0, R1, !A2), + accum2.bump(-50.0, R2, !.A2, _) + ), + io.format("%d, %d\n", [i(N1), i(N2)], !IO), + io.format("%.0f, %.0f\n", [f(R1), f(R2)], !IO). diff --git a/Task/Accumulator-factory/Phix/accumulator-factory.phix b/Task/Accumulator-factory/Phix/accumulator-factory.phix new file mode 100644 index 0000000000..138bf8afb5 --- /dev/null +++ b/Task/Accumulator-factory/Phix/accumulator-factory.phix @@ -0,0 +1,33 @@ +sequence accumulators = {} + +function accumulate(integer id, atom v) + accumulators[id] += v + return accumulators[id] +end function +constant r_accumulate = routine_id("accumulate") + +function accumulator_factory(atom initv=0) + accumulators = append(accumulators,initv) + return {r_accumulate,length(accumulators)} +end function + +function call_function(object rid, object args) + if sequence(rid) then + {rid, integer id} = rid + args = id&args + end if + return call_func(rid,args) +end function + +function standard_function() + return "standard function" +end function +constant r_standard_function = routine_id("standard_function") + +constant x = accumulator_factory(1), + y = accumulator_factory(3) +{} = call_function(x,5) +{} = call_function(y,3) +?call_function(x,2.3) +?call_function(y,4) +?call_function(r_standard_function,{}) diff --git a/Task/Accumulator-factory/Pony/accumulator-factory.pony b/Task/Accumulator-factory/Pony/accumulator-factory.pony new file mode 100644 index 0000000000..1d83820b19 --- /dev/null +++ b/Task/Accumulator-factory/Pony/accumulator-factory.pony @@ -0,0 +1,34 @@ +use "assert" +class Accumulator + var value:(I64|F64) + new create(v:(I64|F64))=> + value=v + fun ref apply(v:(I64|F64)=I64(0)):(I64|F64)=> + value=match value + | let x:I64=>match v + | let y:I64=>x+y + | let y:F64=>x.f64()+y + end + | let x:F64=>match v + | let y:I64=>x+y.f64() + | let y:F64=>x+y + end + end + value + +actor Main + new create(env:Env)=> + var r:Accumulator=Accumulator(I64(0)) + r(I64(5)) + r(I64(2)) + try + Fact(match r() + |let x:I64=>x==7 + |let y:F64=>y==7.0 + end)? + env.out.print("The value I have so far is " + r().string()) + else + env.out.print("An error of some sort happened!") + end + r(F64(5.5)) + env.out.print("This is okay..." + r().string()) diff --git a/Task/Accumulator-factory/Retro/accumulator-factory.retro b/Task/Accumulator-factory/Retro/accumulator-factory-1.retro similarity index 100% rename from Task/Accumulator-factory/Retro/accumulator-factory.retro rename to Task/Accumulator-factory/Retro/accumulator-factory-1.retro diff --git a/Task/Accumulator-factory/Retro/accumulator-factory-2.retro b/Task/Accumulator-factory/Retro/accumulator-factory-2.retro new file mode 100644 index 0000000000..ceb402d4de --- /dev/null +++ b/Task/Accumulator-factory/Retro/accumulator-factory-2.retro @@ -0,0 +1,2 @@ +:acc (ns-) + d:create , [ [ fetch ] [ v:inc ] bi ] does ; diff --git a/Task/Ackermann-function/360-Assembly/ackermann-function.360 b/Task/Ackermann-function/360-Assembly/ackermann-function.360 index 719afe3af3..2e6ea3723f 100644 --- a/Task/Ackermann-function/360-Assembly/ackermann-function.360 +++ b/Task/Ackermann-function/360-Assembly/ackermann-function.360 @@ -1,4 +1,26 @@ * Ackermann function 07/09/2015 +&LAB XDECO ®,&TARGET +.*-----------------------------------------------------------------* +.* THIS MACRO DISPLAYS THE REGISTER CONTENTS AS A TRUE * +.* DECIMAL VALUE. XDECO IS NOT PART OF STANDARD S360 MACROS! * +*------------------------------------------------------------------* + AIF (T'® EQ 'O').NOREG + AIF (T'&TARGET EQ 'O').NODEST +&LAB B I&SYSNDX BRANCH AROUND WORK AREA +W&SYSNDX DS XL8 CONVERSION WORK AREA +I&SYSNDX CVD ®,W&SYSNDX CONVERT TO DECIMAL + MVC &TARGET,=XL12'402120202020202020202020' + ED &TARGET,W&SYSNDX+2 MAKE FIELD PRINTABLE + BC 2,*+12 BYPASS NEGATIVE + MVI &TARGET+12,C'-' INSERT NEGATIVE SIGN + B *+8 BYPASS POSITIVE + MVI &TARGET+12,C'+' INSERT POSITIVE SIGN + MEXIT +.NOREG MNOTE 8,'INPUT REGISTER OMITTED' + MEXIT +.NODEST MNOTE 8,'TARGET FIELD OMITTED' + MEXIT + MEND ACKERMAN CSECT USING ACKERMAN,R12 r12 : base register LR R12,R15 establish base register diff --git a/Task/Ackermann-function/BASIC/ackermann-function-1.basic b/Task/Ackermann-function/BASIC/ackermann-function-1.basic new file mode 100644 index 0000000000..35c955be2d --- /dev/null +++ b/Task/Ackermann-function/BASIC/ackermann-function-1.basic @@ -0,0 +1,24 @@ +100 DIM R%(2900),M(2900),N(2900) +110 FOR M = 0 TO 3 +120 FOR N = 0 TO 4 +130 GOSUB 200"ACKERMANN +140 PRINT "ACK("M","N") = "ACK +150 NEXT N, M +160 END + +200 M(SP) = M +210 N(SP) = N + +REM A(M - 1, A(M, N - 1)) +220 IF M > 0 AND N > 0 THEN N = N - 1 : R%(SP) = 0 : SP = SP + 1 : GOTO 200 + +REM A(M - 1, 1) +230 IF M > 0 THEN M = M - 1 : N = 1 : R%(SP) = 1 : SP = SP + 1 : GOTO 200 + +REM N + 1 +240 ACK = N + 1 + +REM RETURN +250 M = M(SP) : N = N(SP) : IF SP = 0 THEN RETURN +260 FOR SP = SP - 1 TO 0 STEP -1 : IF R%(SP) THEN M = M(SP) : N = N(SP) : NEXT SP : SP = 0 : RETURN +270 M = M - 1 : N = ACK : R%(SP) = 1 : SP = SP + 1 : GOTO 200 diff --git a/Task/Ackermann-function/BASIC/ackermann-function-2.basic b/Task/Ackermann-function/BASIC/ackermann-function-2.basic new file mode 100644 index 0000000000..43af40969f --- /dev/null +++ b/Task/Ackermann-function/BASIC/ackermann-function-2.basic @@ -0,0 +1,33 @@ +dim stack(5000, 3) # BASIC-256 lacks functions (as of ver. 0.9.6.66) +stack[0,0] = 3 # M +stack[0,1] = 7 # N +lev = 0 + +gosub ackermann +print "A("+stack[0,0]+","+stack[0,1]+") = "+stack[0,2] +end + +ackermann: + if stack[lev,0]=0 then + stack[lev,2] = stack[lev,1]+1 + return + end if + if stack[lev,1]=0 then + lev = lev+1 + stack[lev,0] = stack[lev-1,0]-1 + stack[lev,1] = 1 + gosub ackermann + stack[lev-1,2] = stack[lev,2] + lev = lev-1 + return + end if + lev = lev+1 + stack[lev,0] = stack[lev-1,0] + stack[lev,1] = stack[lev-1,1]-1 + gosub ackermann + stack[lev,0] = stack[lev-1,0]-1 + stack[lev,1] = stack[lev,2] + gosub ackermann + stack[lev-1,2] = stack[lev,2] + lev = lev-1 + return diff --git a/Task/Ackermann-function/BASIC/ackermann-function-3.basic b/Task/Ackermann-function/BASIC/ackermann-function-3.basic new file mode 100644 index 0000000000..2cba1997b2 --- /dev/null +++ b/Task/Ackermann-function/BASIC/ackermann-function-3.basic @@ -0,0 +1,19 @@ +# BASIC256 since 0.9.9.1 supports functions +for m = 0 to 3 + for n = 0 to 4 + print m + " " + n + " " + ackermann(m,n) + next n +next m +end + +function ackermann(m,n) + if m = 0 then + ackermann = n+1 + else + if n = 0 then + ackermann = ackermann(m-1,1) + else + ackermann = ackermann(m-1,ackermann(m,n-1)) + endif + end if +end function diff --git a/Task/Ackermann-function/BASIC/ackermann-function-4.basic b/Task/Ackermann-function/BASIC/ackermann-function-4.basic new file mode 100644 index 0000000000..f9d288f262 --- /dev/null +++ b/Task/Ackermann-function/BASIC/ackermann-function-4.basic @@ -0,0 +1,7 @@ + PRINT FNackermann(3, 7) + END + + DEF FNackermann(M%, N%) + IF M% = 0 THEN = N% + 1 + IF N% = 0 THEN = FNackermann(M% - 1, 1) + = FNackermann(M% - 1, FNackermann(M%, N%-1)) diff --git a/Task/Ackermann-function/BASIC/ackermann-function.basic b/Task/Ackermann-function/BASIC/ackermann-function-5.basic similarity index 100% rename from Task/Ackermann-function/BASIC/ackermann-function.basic rename to Task/Ackermann-function/BASIC/ackermann-function-5.basic diff --git a/Task/Ackermann-function/Crystal/ackermann-function.crystal b/Task/Ackermann-function/Crystal/ackermann-function.crystal new file mode 100644 index 0000000000..4825cff113 --- /dev/null +++ b/Task/Ackermann-function/Crystal/ackermann-function.crystal @@ -0,0 +1,14 @@ +def ack(m, n) + if m == 0 + n + 1 + elsif n == 0 + ack(m-1, 1) + else + ack(m-1, ack(m, n-1)) + end +end + +#Example: +(0..3).each do |m| + puts (0..6).map { |n| ack(m, n) }.join(' ') +end diff --git a/Task/Ackermann-function/Dc/ackermann-function.dc b/Task/Ackermann-function/Dc/ackermann-function.dc new file mode 100644 index 0000000000..d49cbb56ee --- /dev/null +++ b/Task/Ackermann-function/Dc/ackermann-function.dc @@ -0,0 +1,23 @@ +[ # todo: n 0 -- n+1 and break 2 levels + + 1 + # n+1 + q +] s1 + +[ # todo: m 0 -- A(m-1,1) and break 2 levels + + 1 - # m-1 + 1 # m-1 1 + lA x # A(m-1,1) + q +] s2 + +[ # todo: m n -- A(m,n) + r d 0=1 # n m(!=0) + r d 0=2 # m(!=0) n(!=0) + Sn # m(!=0) + d 1 - r # m-1 m + Ln 1 - # m-1 m n-1 + lA x # m-1 A(m,n-1) + lA x # A(m-1,A(m,n-1)) +] sA + +3 9 lA x f diff --git a/Task/Ackermann-function/Elena/ackermann-function.elena b/Task/Ackermann-function/Elena/ackermann-function.elena index 2d23faeec2..c63030fef5 100644 --- a/Task/Ackermann-function/Elena/ackermann-function.elena +++ b/Task/Ackermann-function/Elena/ackermann-function.elena @@ -1,30 +1,30 @@ -import extensions. +import extensions; ackermann(m,n) -[ - if((n < 0)||(m < 0)) - [ - InvalidArgumentException new; raise - ]. +{ + if(n < 0 || m < 0) + { + InvalidArgumentException.raise() + }; m => - 0 [ ^n + 1 ]; - ! [ + 0 { ^n + 1 } + : { n => - 0 [ ^ackermann(m - 1,1) ]; - ! [ ^ackermann(m - 1,ackermann(m,n-1)) ] - ] -] + 0 { ^ackermann(m - 1,1) } + : { ^ackermann(m - 1,ackermann(m,n-1)) } + } +} -public program -[ - 0 to:3 do(:i) - [ - 0 to:5 do(:j) - [ - console printLine("A(",i,",",j,")=",ackermann(i,j)) - ] - ]. +public program() +{ + for(int i:=0, i <= 3, i += 1) + { + for(int j := 0, j <= 5, j += 1) + { + console.printLine("A(",i,",",j,")=",ackermann(i,j)) + } + }; - console readChar -] + console.readChar() +} diff --git a/Task/Ackermann-function/Emacs-Lisp/ackermann-function.l b/Task/Ackermann-function/Emacs-Lisp/ackermann-function.l new file mode 100644 index 0000000000..cf6cce77b9 --- /dev/null +++ b/Task/Ackermann-function/Emacs-Lisp/ackermann-function.l @@ -0,0 +1,5 @@ +(defun ackermann (m n) + (cond ((zerop m) (1+ n)) + ((zerop n) (ackermann (1- m) 1)) + (t (ackermann (1- m) + (ackermann m (1- n)))))) diff --git a/Task/Ackermann-function/Gambas/ackermann-function.gambas b/Task/Ackermann-function/Gambas/ackermann-function.gambas index 1e13833386..81a21b0558 100644 --- a/Task/Ackermann-function/Gambas/ackermann-function.gambas +++ b/Task/Ackermann-function/Gambas/ackermann-function.gambas @@ -1,21 +1,18 @@ -Public Function ackermann (m as Float, n as Float) as Float - If m = 0 then - return n + 1 - end If - If n = 0 then - return ackermann(m - 1, 1) - end If -return ackermann(m - 1, ackermann(m, n - 1)) - +Public Function Ackermann(m As Float, n As Float) As Float + If m = 0 Then + Return n + 1 + End If + If n = 0 Then + Return Ackermann(m - 1, 1) + End If + Return Ackermann(m - 1, Ackermann(m, n - 1)) End - Public Sub Main() -Dim m, n as Float -For m = 0 to 3 - For n = 0 to 4 - print "Ackerman(";m;",";n;")=";ackermann(m, n) - Next -Next - + Dim m, n As Float + For m = 0 To 3 + For n = 0 To 4 + Print "Ackermann("; m; ", "; n; ") = "; Ackermann(m, n) + Next + Next End diff --git a/Task/Ackermann-function/Java/ackermann-function-5.java b/Task/Ackermann-function/Java/ackermann-function-5.java new file mode 100644 index 0000000000..dbc1aeda44 --- /dev/null +++ b/Task/Ackermann-function/Java/ackermann-function-5.java @@ -0,0 +1,389 @@ +/* + * Source https://stackoverflow.com/a/51092690/5520417 + */ + +package matematicas; + +import java.math.BigInteger; +import java.util.HashMap; +import java.util.Stack; + +/** + * @author rodri + * + */ + +public class IterativeAckermannMemoryOptimization extends Thread { + + /** + * Max percentage of free memory that the program will use. Default is 10% since + * the majority of the used devices are mobile and therefore it is more likely + * that the user will have more opened applications at the same time than in a + * desktop device + */ + private static Double SYSTEM_MEMORY_LIMIT_PERCENTAGE = 0.1; + + /** + * Attribute of the type IterativeAckermann + */ + private IterativeAckermann iterativeAckermann; + + /** + * @param iterativeAckermann + */ + public IterativeAckermannMemoryOptimization(IterativeAckermann iterativeAckermann) { + super(); + this.iterativeAckermann = iterativeAckermann; + } + + /** + * @return + */ + public IterativeAckermann getIterativeAckermann() { + return iterativeAckermann; + } + + /** + * @param iterativeAckermann + */ + public void setIterativeAckermann(IterativeAckermann iterativeAckermann) { + this.iterativeAckermann = iterativeAckermann; + } + + public static Double getSystemMemoryLimitPercentage() { + return SYSTEM_MEMORY_LIMIT_PERCENTAGE; + } + + /** + * Principal method of the thread. Checks that the memory used doesn't exceed or + * equal the limit, and informs the user when that happens. + */ + @Override + public void run() { + String operating_system = System.getProperty("os.name").toLowerCase(); + if ( operating_system.equals("windows") || operating_system.equals("linux") || operating_system.equals("macintosh") ) { + SYSTEM_MEMORY_LIMIT_PERCENTAGE = 0.25; + } + + while ( iterativeAckermann.getConsumed_heap() >= SYSTEM_MEMORY_LIMIT_PERCENTAGE * Runtime.getRuntime().freeMemory() ) { + try { + wait(); + } + catch ( InterruptedException e ) { + // TODO Auto-generated catch block + e.printStackTrace(); + } + } + if ( ! iterativeAckermann.isAlive() ) + iterativeAckermann.start(); + else + notifyAll(); + + } + +} + + +public class IterativeAckermann extends Thread { + + /* + * Adjust parameters conveniently + */ + /** + * + */ + private static final int HASH_SIZE_LIMIT = 636; + + /** + * + */ + private BigInteger m; + + /** + * + */ + private BigInteger n; + + /** + * + */ + private Integer hash_size; + + /** + * + */ + private Long consumed_heap; + + /** + * @param m + * @param n + * @param invalid + * @param invalid2 + */ + public IterativeAckermann(BigInteger m, BigInteger n, Integer invalid, Long invalid2) { + super(); + this.m = m; + this.n = n; + this.hash_size = invalid; + this.consumed_heap = invalid2; + } + + /** + * + */ + public IterativeAckermann() { + // TODO Auto-generated constructor stub + super(); + m = null; + n = null; + hash_size = 0; + consumed_heap = 0l; + } + + /** + * @return + */ + public static BigInteger getLimit() { + return LIMIT; + } + + /** + * @author rodri + * + * @param + * @param + */ + /** + * @author rodri + * + * @param + * @param + */ + static class Pair { + + /** + * + */ + /** + * + */ + T1 x; + + /** + * + */ + /** + * + */ + T2 y; + + /** + * @param x_ + * @param y_ + */ + /** + * @param x_ + * @param y_ + */ + Pair(T1 x_, T2 y_) { + x = x_; + y = y_; + } + + /** + * + */ + /** + * + */ + @Override + public int hashCode() { + return x.hashCode() ^ y.hashCode(); + } + + /** + * + */ + /** + * + */ + @Override + public boolean equals(Object o_) { + + if ( o_ == null ) { + return false; + } + if ( o_.getClass() != this.getClass() ) { + return false; + } + Pair o = (Pair) o_; + return x.equals(o.x) && y.equals(o.y); + } + } + + /** + * + */ + private static final BigInteger LIMIT = new BigInteger("6"); + + /** + * @param m + * @param n + * @return + */ + + /** + * + */ + @Override + public void run() { + while ( hash_size >= HASH_SIZE_LIMIT ) { + try { + this.wait(); + } + catch ( InterruptedException e ) { + // TODO Auto-generated catch block + e.printStackTrace(); + } + } + for ( BigInteger i = BigInteger.ZERO; i.compareTo(LIMIT) == - 1; i = i.add(BigInteger.ONE) ) { + for ( BigInteger j = BigInteger.ZERO; j.compareTo(LIMIT) == - 1; j = j.add(BigInteger.ONE) ) { + IterativeAckermann iterativeAckermann = new IterativeAckermann(i, j, null, null); + System.out.printf("Ackmermann(%d, %d) = %d\n", i, j, iterativeAckermann.iterative_ackermann(i, j)); + + } + } + } + + /** + * @return + */ + public BigInteger getM() { + return m; + } + + /** + * @param m + */ + public void setM(BigInteger m) { + this.m = m; + } + + /** + * @return + */ + public BigInteger getN() { + return n; + } + + /** + * @param n + */ + public void setN(BigInteger n) { + this.n = n; + } + + /** + * @return + */ + public Integer getHash_size() { + return hash_size; + } + + /** + * @param hash_size + */ + public void setHash_size(Integer hash_size) { + this.hash_size = hash_size; + } + + /** + * @return + */ + public Long getConsumed_heap() { + return consumed_heap; + } + + /** + * @param consumed_heap + */ + public void setConsumed_heap(Long consumed_heap) { + this.consumed_heap = consumed_heap; + } + + /** + * @param m + * @param n + * @return + */ + public BigInteger iterative_ackermann(BigInteger m, BigInteger n) { + if ( m.compareTo(BigInteger.ZERO) != - 1 && m.compareTo(BigInteger.ZERO) != - 1 ) + try { + HashMap, BigInteger> solved_set = new HashMap, BigInteger>(900000); + Stack> to_solve = new Stack>(); + to_solve.push(new Pair(m, n)); + + while ( ! to_solve.isEmpty() ) { + Pair head = to_solve.peek(); + if ( head.x.equals(BigInteger.ZERO) ) { + solved_set.put(head, head.y.add(BigInteger.ONE)); + to_solve.pop(); + } + else if ( head.y.equals(BigInteger.ZERO) ) { + Pair next = new Pair(head.x.subtract(BigInteger.ONE), BigInteger.ONE); + BigInteger result = solved_set.get(next); + if ( result == null ) { + to_solve.push(next); + } + else { + solved_set.put(head, result); + to_solve.pop(); + } + } + else { + Pair next0 = new Pair(head.x, head.y.subtract(BigInteger.ONE)); + BigInteger result0 = solved_set.get(next0); + if ( result0 == null ) { + to_solve.push(next0); + } + else { + Pair next = new Pair(head.x.subtract(BigInteger.ONE), result0); + BigInteger result = solved_set.get(next); + if ( result == null ) { + to_solve.push(next); + } + else { + solved_set.put(head, result); + to_solve.pop(); + } + } + } + } + this.hash_size = solved_set.size(); + System.out.println("Hash Size: " + hash_size); + consumed_heap = (Runtime.getRuntime().totalMemory() / (1024 * 1024)); + System.out.println("Consumed Heap: " + consumed_heap + "m"); + setHash_size(hash_size); + setConsumed_heap(consumed_heap); + return solved_set.get(new Pair(m, n)); + + } + catch ( OutOfMemoryError e ) { + // TODO: handle exception + e.printStackTrace(); + } + throw new IllegalArgumentException("The arguments must be non-negative integers."); + } + + /** + * @param args + */ + /** + * @param args + */ + public static void main(String[] args) { + IterativeAckermannMemoryOptimization iterative_ackermann_memory_optimization = new IterativeAckermannMemoryOptimization( + new IterativeAckermann()); + iterative_ackermann_memory_optimization.start(); + } +} diff --git a/Task/Ackermann-function/Phix/ackermann-function-1.phix b/Task/Ackermann-function/Phix/ackermann-function-1.phix new file mode 100644 index 0000000000..bacce2d293 --- /dev/null +++ b/Task/Ackermann-function/Phix/ackermann-function-1.phix @@ -0,0 +1,34 @@ +function ack(integer m, integer n) + if m=0 then + return n+1 + elsif m=1 then + return n+2 + elsif m=2 then + return 2*n+3 + elsif m=3 then + return power(2,n+3)-3 + elsif m>0 and n=0 then + return ack(m-1,1) + else + return ack(m-1,ack(m,n-1)) + end if +end function + +constant limit = 23, + fmtlens = {1,2,2,2,3,3,3,4,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8} + +atom t0 = time() +printf(1," 0") +for j=1 to limit do + string fmt = sprintf(" %%%dd",fmtlens[j+1]) + printf(1,fmt,j) +end for +printf(1,"\n") +for i=0 to 5 do + printf(1,"%d:",i) + for j=0 to iff(i>=4?5-i:limit) do + string fmt = sprintf(" %%%dd",fmtlens[j+1]) + printf(1,fmt,{ack(i,j)}) + end for + printf(1,"\n") +end for diff --git a/Task/Ackermann-function/Phix/ackermann-function-2.phix b/Task/Ackermann-function/Phix/ackermann-function-2.phix new file mode 100644 index 0000000000..c1fc1b5837 --- /dev/null +++ b/Task/Ackermann-function/Phix/ackermann-function-2.phix @@ -0,0 +1,82 @@ +-- demo\rosetta\Ackermann.exw +include mpfr.e + +procedure ack(integer m, mpz n) + if m=0 then + mpz_add_ui(n, n, 1) -- return n+1 + elsif m=1 then + mpz_add_ui(n, n, 2) -- return n+2 + elsif m=2 then + mpz_mul_si(n, n, 2) + mpz_add_ui(n, n, 3) -- return 2*n+3 + elsif m=3 then + if not mpz_fits_integer(n) then + -- As per Go: 2^MAXINT would most certainly run out of memory. + -- (think about it: a million digits is fine but pretty daft; + -- however a billion digits requires > addressable memory.) + integer bn = mpz_sizeinbase(n, 2) + throw(sprintf("A(m,n) had n of %d bits; too large",bn)) + end if + integer ni = mpz_get_integer(n) + mpz_set_si(n, 8) + mpz_mul_2exp(n, n, ni) -- (n:=8*2^ni) + mpz_sub_ui(n, n, 3) -- return power(2,n+3)-3 + elsif mpz_cmp_si(n,0)=0 then + mpz_set_si(n, 1) + ack(m-1,n) -- return ack(m-1,1) + else + mpz_sub_ui(n, n, 1) + ack(m,n) + ack(m-1,n) -- return ack(m-1,ack(m,n-1)) + end if +end procedure + +constant limit = 23, + fmtlens = {1,2,2,2,3,3,3,4,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8}, + extras = {{3,100},{3,1e6},{4,2},{4,3}} + +procedure ackermann_tests() + atom t0 = time() + atom n = mpz_init() + printf(1," 0") + for j=1 to limit do + string fmt = sprintf(" %%%dd",fmtlens[j+1]) + printf(1,fmt,j) + end for + printf(1,"\n") + for i=0 to 5 do + printf(1,"%d:",i) + for j=0 to iff(i>=4?5-i:limit) do + mpz_set_si(n, j) + ack(i,n) + string fmt = sprintf(" %%%ds",fmtlens[j+1]) + printf(1,fmt,{mpz_get_str(n)}) + end for + printf(1,"\n") + end for + printf(1,"\n") + for i=1 to length(extras) do + integer {em, en} = extras[i] + mpz_set_si(n, en) + string res + try + ack(em,n) + res = mpz_get_str(n) + integer lr = length(res) + if lr>50 then + res[21..-21] = "..." + res &= sprintf(" (%d digits)",lr) + end if + catch e + -- ack(4,3), ack(5,1) and ack(6,0) all fail, + -- just as they should do + res = "***ERROR***: "&e[E_USER] + end try + printf(1,"ack(%d,%d) %s\n",{em,en,res}) + end for + n = mpz_free(n) + printf(1,"\n") + printf(1,"ackermann_tests completed (%s)\n\n",{elapsed(time()-t0)}) +end procedure + +ackermann_tests() diff --git a/Task/Ackermann-function/Phix/ackermann-function.phix b/Task/Ackermann-function/Phix/ackermann-function.phix deleted file mode 100644 index 015221f858..0000000000 --- a/Task/Ackermann-function/Phix/ackermann-function.phix +++ /dev/null @@ -1,37 +0,0 @@ --- --- Ackermann.exw --- ============= --- --- optimised. still no bignum library, so ack(4,2), which is power(2,65536)-3, which is --- apparently 19729 digits, and any above, are beyond (the CPU/FPU hardware) and this. --- (replaced ack(atom,atom) with ack(int,int) since the former fares no better.) - -function ack(integer m, integer n) - if m=0 then - return n+1 - elsif m=1 then - return n+2 - elsif m=2 then - return 2*n+3 - elsif m=3 then - return power(2,n+3)-3 - elsif m>0 and n=0 then - return ack(m-1,1) - else - return ack(m-1,ack(m,n-1)) - end if -end function - -procedure Ackermann() - for i=0 to 3 do - for j=0 to 10 do - printf(1,"%5d",ack(i,j)) - end for - puts(1,"\n") - end for - printf(1,"ack(4,1) %5d\n",ack(4,1)) --- printf(1,"ack(4,2) %5d\n",ack(4,2)) -- power function overflow - if getc(0) then end if -end procedure - - Ackermann() diff --git a/Task/Ackermann-function/Prolog/ackermann-function.pro b/Task/Ackermann-function/Prolog/ackermann-function.pro index 73d8af0421..370ffbb0b5 100644 --- a/Task/Ackermann-function/Prolog/ackermann-function.pro +++ b/Task/Ackermann-function/Prolog/ackermann-function.pro @@ -1,3 +1,5 @@ +:- table ack/3. % memoization reduces the execution time of ack(4,1,X) from several + % minutes to about one second on a typical desktop computer. ack(0, N, Ans) :- Ans is N+1. ack(M, 0, Ans) :- M>0, X is M-1, ack(X, 1, Ans). ack(M, N, Ans) :- M>0, N>0, X is M-1, Y is N-1, ack(M, Y, Ans2), ack(X, Ans2, Ans). diff --git a/Task/Ackermann-function/Python/ackermann-function-2.py b/Task/Ackermann-function/Python/ackermann-function-2.py index 1e1658ebab..a2968422e0 100644 --- a/Task/Ackermann-function/Python/ackermann-function-2.py +++ b/Task/Ackermann-function/Python/ackermann-function-2.py @@ -1,3 +1,6 @@ +from functools import lru_cache + +@lru_cache(None) def ack2(M, N): if M == 0: return N + 1 diff --git a/Task/Ackermann-function/Scala/ackermann-function-2.scala b/Task/Ackermann-function/Scala/ackermann-function-2.scala index 7c2af8c321..c7535e8744 100644 --- a/Task/Ackermann-function/Scala/ackermann-function-2.scala +++ b/Task/Ackermann-function/Scala/ackermann-function-2.scala @@ -1,2 +1,4 @@ -scala> for ( m <- 0 to 3; n <- 0 to 6 ) yield ack(m,n) -res0: Seq.Projection[BigInt] = RangeG(1, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 7, 8, 3, 5, 7, 9, 11, 13, 15, 5, 13, 29, 61, 125, 253, 509) +val ackMap = new mutable.HashMap[(BigInt,BigInt),BigInt] +def ackMemo(m: BigInt, n: BigInt): BigInt = { + ackMap.getOrElseUpdate((m,n), ack(m,n)) +} diff --git a/Task/Ackermann-function/Scheme/ackermann-function.ss b/Task/Ackermann-function/Scheme/ackermann-function-1.ss similarity index 100% rename from Task/Ackermann-function/Scheme/ackermann-function.ss rename to Task/Ackermann-function/Scheme/ackermann-function-1.ss diff --git a/Task/Ackermann-function/Scheme/ackermann-function-2.ss b/Task/Ackermann-function/Scheme/ackermann-function-2.ss new file mode 100644 index 0000000000..1741101237 --- /dev/null +++ b/Task/Ackermann-function/Scheme/ackermann-function-2.ss @@ -0,0 +1,29 @@ +(define (A m n) + (letrec ((A-stream + (cons-stream + (ints-from 1) ;; m = 0 + (cons-stream + (ints-from 2) ;; m = 1 + (cons-stream + ;; m = 2 + (stream-map (lambda (n) + (1+ (* 2 (1+ n)))) + (ints-from 0)) + (cons-stream + ;; m = 3 + (stream-map (lambda (n) + (- (knuth-up-arrow 2 (- m 2) (+ n 3)) 3)) + (ints-from 0)) + ;; m = 4... + (stream-tail A-stream 3))))))) + (stream-ref (stream-ref A-stream m) n))) + +(define (ints-from n) + (letrec ((ints-rec (cons-stream n (stream-map 1+ ints-rec)))) + ints-rec)) + +(define (knuth-up-arrow a n b) + (let loop ((n n) (b b)) + (cond ((= b 0) 1) + ((= n 1) (expt a b)) + (else (loop (-1+ n) (loop n (-1+ b))))))) diff --git a/Task/Ackermann-function/SmileBASIC/ackermann-function.smilebasic b/Task/Ackermann-function/SmileBASIC/ackermann-function.smilebasic new file mode 100644 index 0000000000..727fb92012 --- /dev/null +++ b/Task/Ackermann-function/SmileBASIC/ackermann-function.smilebasic @@ -0,0 +1,9 @@ +DEF ACK(M,N) + IF M==0 THEN + RETURN N+1 + ELSEIF M>0 AND N==0 THEN + RETURN ACK(M-1,1) + ELSE + RETURN ACK(M-1,ACK(M,N-1)) + ENDIF +END diff --git a/Task/Ackermann-function/VBA/ackermann-function.vba b/Task/Ackermann-function/VBA/ackermann-function.vba new file mode 100644 index 0000000000..245cbc1cb3 --- /dev/null +++ b/Task/Ackermann-function/VBA/ackermann-function.vba @@ -0,0 +1,29 @@ +Private Function Ackermann_function(m As Variant, n As Variant) As Variant + Dim result As Variant + Debug.Assert m >= 0 + Debug.Assert n >= 0 + If m = 0 Then + result = CDec(n + 1) + Else + If n = 0 Then + result = Ackermann_function(m - 1, 1) + Else + result = Ackermann_function(m - 1, Ackermann_function(m, n - 1)) + End If + End If + Ackermann_function = CDec(result) +End Function +Public Sub main() + Debug.Print " n=", + For j = 0 To 7 + Debug.Print j, + Next j + Debug.Print + For i = 0 To 3 + Debug.Print "m=" & i, + For j = 0 To 7 + Debug.Print Ackermann_function(i, j), + Next j + Debug.Print + Next i +End Sub diff --git a/Task/Active-Directory-Connect/Go/active-directory-connect.go b/Task/Active-Directory-Connect/Go/active-directory-connect.go new file mode 100644 index 0000000000..221da6f33a --- /dev/null +++ b/Task/Active-Directory-Connect/Go/active-directory-connect.go @@ -0,0 +1,26 @@ +package main + +import ( + "log" + "github.com/jtblin/go-ldap-client" +) + +func main() { + client := &ldap.LDAPClient{ + Base: "dc=example,dc=com", + Host: "ldap.example.com", + Port: 389, + UseSSL: false, + BindDN: "uid=readonlyuser,ou=People,dc=example,dc=com", + BindPassword: "readonlypassword", + UserFilter: "(uid=%s)", + GroupFilter: "(memberUid=%s)", + Attributes: []string{"givenName", "sn", "mail", "uid"}, + } + defer client.Close() + err := client.Connect() + if err != nil { + log.Fatalf("Failed to connect : %+v", err) + } + // Do something +} diff --git a/Task/Active-Directory-Connect/Perl-6/active-directory-connect.pl6 b/Task/Active-Directory-Connect/Perl-6/active-directory-connect.pl6 new file mode 100644 index 0000000000..ffb53d83a5 --- /dev/null +++ b/Task/Active-Directory-Connect/Perl-6/active-directory-connect.pl6 @@ -0,0 +1,3 @@ +use LMDB; + +my %DB := LMDB::DB.open(:path, %connection-parameters); diff --git a/Task/Active-Directory-Connect/Rust/active-directory-connect.rust b/Task/Active-Directory-Connect/Rust/active-directory-connect.rust new file mode 100644 index 0000000000..8353fabf66 --- /dev/null +++ b/Task/Active-Directory-Connect/Rust/active-directory-connect.rust @@ -0,0 +1,2 @@ +let conn = ldap3::LdapConn::new("ldap://ldap.example.com")?; +conn.simple_bind("bind_dn", "bind_pass")?.success()?; diff --git a/Task/Active-Directory-Search-for-a-user/Go/active-directory-search-for-a-user.go b/Task/Active-Directory-Search-for-a-user/Go/active-directory-search-for-a-user.go new file mode 100644 index 0000000000..1ad4f1aecc --- /dev/null +++ b/Task/Active-Directory-Search-for-a-user/Go/active-directory-search-for-a-user.go @@ -0,0 +1,25 @@ +package main + +import ( + "log" + "github.com/jtblin/go-ldap-client" +) + +func main() { + client := &ldap.LDAPClient{ + Base: "dc=example,dc=com", + Host: "ldap.example.com", + Port: 389, + GroupFilter: "(memberUid=%s)", + } + defer client.Close() + err := client.Connect() + if err != nil { + log.Fatalf("Failed to connect : %+v", err) + } + groups, err := client.GetGroupsOfUser("username") + if err != nil { + log.Fatalf("Error getting groups for user %s: %+v", "username", err) + } + log.Printf("Groups: %+v", groups) +} diff --git a/Task/Active-Directory-Search-for-a-user/Perl-6/active-directory-search-for-a-user.pl6 b/Task/Active-Directory-Search-for-a-user/Perl-6/active-directory-search-for-a-user.pl6 new file mode 100644 index 0000000000..f8a462e5ff --- /dev/null +++ b/Task/Active-Directory-Search-for-a-user/Perl-6/active-directory-search-for-a-user.pl6 @@ -0,0 +1,32 @@ +#!/usr/bin/env perl6 + +# 20190718 Perl 6 programming solution +# https://github.com/perl6/doc/issues/2898 +# https://www.facebook.com/groups/perl6/permalink/2379873082279037/ + +# Reference: +# https://github.com/Altai-man/cro-ldap +# https://www.forumsys.com/tutorials/integration-how-to/ldap/online-ldap-test-server/ + +use v6.d; +use Cro::LDAP::Client; + +my $client = await Cro::LDAP::Client.connect('ldap://ldap.forumsys.com'); + +my $bind = await $client.bind( + name=>'cn=read-only-admin,dc=example,dc=com',password=>'password' +); +die $bind.error-message if $bind.result-code; + +my $resp = $client.search( + :dn, base=>"ou=mathematicians", filter=>'(&(uid=gauss))' +); + +react { + whenever $resp -> $entry { + for $entry.attributes.kv -> $k, $v { + my $value-str = $v ~~ Blob ?? $v.decode !! $v.map(*.decode); + note "$k -> $value-str"; + } + } +} diff --git a/Task/Active-object/Groovy/active-object.groovy b/Task/Active-object/Groovy/active-object.groovy new file mode 100644 index 0000000000..2c5f0d2613 --- /dev/null +++ b/Task/Active-object/Groovy/active-object.groovy @@ -0,0 +1,70 @@ +/** + * Integrates input function K over time + * S + (t1 - t0) * (K(t1) + K(t0)) / 2 + */ +class Integrator { + interface Function { + double apply(double timeSinceStartInSeconds) + } + + private final long start + private volatile boolean running + + private Function func + private double t0 + private double v0 + private double sum + + Integrator(Function func) { + this.start = System.nanoTime() + setFunc(func) + new Thread({ this.&integrate() }).start() + } + + void setFunc(Function func) { + this.func = func + def temp = func.apply(0.0.toDouble()) + v0 = temp + t0 = 0.0.doubleValue() + } + + double getOutput() { + return sum + } + + void stop() { + running = false + } + + private void integrate() { + running = true + while (running) { + try { + Thread.sleep(1) + update() + } catch (InterruptedException ignored) { + return + } + } + } + + private void update() { + double t1 = (System.nanoTime() - start) / 1.0e9 + double v1 = func.apply(t1) + double rect = (t1 - t0) * (v0 + v1) / 2.0 + this.sum += rect + t0 = t1 + v0 = v1 + } + + static void main(String[] args) { + Integrator integrator = new Integrator({ t -> Math.sin(Math.PI * t) }) + Thread.sleep(2000) + + integrator.setFunc({ t -> 0.0.toDouble() }) + Thread.sleep(500) + + integrator.stop() + System.out.println(integrator.getOutput()) + } +} diff --git a/Task/Active-object/Perl-6/active-object.pl6 b/Task/Active-object/Perl-6/active-object.pl6 new file mode 100644 index 0000000000..f2aced360b --- /dev/null +++ b/Task/Active-object/Perl-6/active-object.pl6 @@ -0,0 +1,45 @@ +class Integrator { + has $.f is rw = sub ($t) { 0 }; + has $.now is rw; + has $.value is rw = 0; + has $.integrator is rw; + + method init() { + self.value = &(self.f)(0); + self.integrator = Thread.new( + :code({ + loop { + my $t1 = now; + self.value += (&(self.f)(self.now) + &(self.f)($t1)) * ($t1 - self.now) / 2; + self.now = $t1; + sleep .001; + } + }), + :app_lifetime(True) + ).run + } + + method Input (&f-of-t) { + self.f = &f-of-t; + self.now = now; + self.init; + } + + method Output { self.value } +} + +my $a = Integrator.new; + +$a.Input( sub ($t) { sin(2 * π * .5 * $t) } ); + +say "Initial value: ", $a.Output; + +sleep 2; + +say "After 2 seconds: ", $a.Output; + +$a.Input( sub ($t) { 0 } ); + +sleep .5; + +say "f(0): ", $a.Output; diff --git a/Task/Active-object/Phix/active-object.phix b/Task/Active-object/Phix/active-object.phix new file mode 100644 index 0000000000..bb7513cb95 --- /dev/null +++ b/Task/Active-object/Phix/active-object.phix @@ -0,0 +1,63 @@ +sequence x = {} +enum TERMINATE, INTERVAL, KFUN, VALUE, T0, K0, ID, ISIZE=$ +integer xlock = init_cs() + +function zero(atom /*t*/) return 0 end function +function sine(atom t) return sin(2*PI*0.5*t) end function + +procedure update(integer dx) + enter_cs(xlock) + atom t1 = time(), + k1 = call_func(x[dx][KFUN],{t1}) + x[dx][VALUE] += (k1 + x[dx][K0]) * (t1 - x[dx][T0]) / 2 + x[dx][T0] = t1 + x[dx][K0] = k1 + leave_cs(xlock) +end procedure + +procedure tick(integer dx) + while not x[dx][TERMINATE] do + sleep(x[dx][INTERVAL]) + update(dx) + end while +end procedure + +function new_integrator(integer rid, atom interval) + x = append(x,repeat(0,ISIZE)) + integer dx = length(x) + x[dx][TERMINATE] = false + x[dx][INTERVAL] = interval + x[dx][KFUN] = rid + x[dx][T0] = time() + update(dx) + x[dx][ID] = create_thread(routine_id("tick"),{dx}) + return dx +end function + +procedure set_input(integer dx, rid) + enter_cs(xlock) + x[dx][KFUN] = rid + x[dx][K0] = 0 + leave_cs(xlock) +end procedure + +function get_output(integer dx) + enter_cs(xlock) + atom v = x[dx][VALUE] + leave_cs(xlock) + return v +end function + +procedure stop_integrator(integer dx) + x[dx][TERMINATE] = true + wait_thread(x[dx][ID]) +end procedure + +puts(1,"") +integer dx = new_integrator(routine_id("sine"),0.01) +sleep(2) +printf(1,"%f\n",get_output(dx)) +set_input(dx,routine_id("zero")) +sleep(0.5) +printf(1,"%f\n",get_output(dx)) +stop_integrator(dx) diff --git a/Task/Active-object/Rust/active-object.rust b/Task/Active-object/Rust/active-object.rust new file mode 100644 index 0000000000..69af75428e --- /dev/null +++ b/Task/Active-object/Rust/active-object.rust @@ -0,0 +1,172 @@ +#![feature(mpsc_select)] + +extern crate num; +extern crate schedule_recv; + +use num::traits::Zero; +use num::Float; +use schedule_recv::periodic_ms; +use std::f64::consts::PI; +use std::ops::Mul; +use std::sync::mpsc::{self, SendError, Sender}; +use std::sync::{Arc, Mutex}; +use std::thread; +use std::time::Duration; + +pub type Actor = Sender S + Send>>; +pub type ActorResult = Result<(), SendError S + Send>>>; + +/// Rust supports both shared-memory and actor models of concurrency, and the `Integrator` utilizes +/// both. We use an `Actor` to send the `Integrator` new functions, while we use a `Mutex` +/// (shared-memory concurrency) to hold the result of the integration. +/// +/// Note that these are not the only options here--there are many, many ways you can deal with +/// concurrent access. But when in doubt, a plain old `Mutex` is often a good bet. For example, +/// this might look like a good situation for a `RwLock`--after all, there's no reason for a read +/// in the main task to block writes. Unfortunately, unless you have significantly more reads than +/// writes (which is certainly not the case here), a `Mutex` will usually outperform a `RwLock`. +pub struct Integrator { + input: Actor, + output: Arc>, +} + +/// In Rust, time durations are strongly typed. This is usually exactly what you want, but for a +/// problem like this--where the integrated value has unusual (unspecified?) units--it can actually +/// be a bit tricky. Right now, `Duration`s can only be multiplied or divided by `i32`s, so in +/// order to be able to actually do math with them we say that the type parameter `S` (the result +/// of the function being integrated) must yield `T` (the type of the integrated value) when +/// multiplied by `f64`. We could possibly replace `f64` with a generic as well, but it would make +/// things a bit more complex. +impl Integrator +where + S: Mul + Float + Zero, + T: 'static + Clone + Send + Float, +{ + pub fn new(frequency: u32) -> Integrator { + // We create a pipe allowing functions to be sent from tx (the sending end) to input (the + // receiving end). In order to change the function we are integrating from the task in + // which the Integrator lives, we simply send the function through tx. + let (tx, input) = mpsc::channel(); + // The easiest way to do shared-memory concurrency in Rust is to use atomic reference + // counting, or Arc, around a synchronized type (like Mutex). Arc gives you a guarantee + // that memory will not be freed as long as there is at least one reference to it. + // It is similar to C++'s shared_ptr, but it is guaranteed to be safe and is never + // incremented unless explicitly cloned (by default, it is moved). + let s: Arc> = Arc::new(Mutex::new(Zero::zero())); + let integrator = Integrator { + input: tx, + // Here is the aforementioned clone. We have to do it before s enters the closure, + // because once that happens it is moved into the closure (and later, the new task) and + // becomes inaccessible to the outside world. + output: Arc::clone(&s), + }; + thread::spawn(move || -> () { + // The frequency is how often we want to "tick" as we update our integrated total. In + // Rust, timers can yield Receivers that are periodically notified with an empty + // message (where the period is the frequency). This is useful because it lets us wait + // on either a tick or another type of message (in this case, a request to change the + // function we are integrating). + let periodic = periodic_ms(frequency); + let mut t = 0; + let mut k: Box S + Send> = Box::new(|_| Zero::zero()); + let mut k_0: S = Zero::zero(); + loop { + // Here's the selection we talked about above. Note that we are careful to call + // the *non*-failing function, recv(), here. The reason we do this is because + // recv() will return Err when the sending end of a channel is dropped. While + // this is unlikely to happen for the timer (so again, you could argue for failure + // there), it's normal behavior for the sending end of input to be dropped, since + // it just happens when the Integrator falls out of scope. So we handle it cleanly + // and break out of the loop, rather than failing. + select! { + res = periodic.recv() => match res { + Ok(_) => { + t += frequency; + let k_1: S = k(t); + // Rust Mutexes are a bit different from Mutexes in many other + // languages, in that the protected data is actually encapsulated by + // the Mutex. The reason for this is that Rust is actually capable of + // enforcing (via its borrow checker) the invariant that the contents + // of a Mutex may only be read when you have acquired its lock. This + // is enforced by way of a MutexGuard, the return value of lock(), + // which implements some special traits (Deref and DerefMut) that allow + // access to the inner element "through" the guard. The element so + // acquired has a lifetime bounded by that of the MutexGuard, the + // MutexGuard can only be acquired by taking a lock, and the only way + // to release the lock is by letting the MutexGuard fall out of scope, + // so it's impossible to access the data incorrectly. There are some + // additional subtleties around the actual implementation, but that's + // the basic idea. + let mut s = s.lock().unwrap(); + *s = *s + (k_1 + k_0) * (f64::from(frequency) / 2.); + k_0 = k_1; + } + Err(_) => break, + }, + res = input.recv() => match res { + Ok(k_new) => k = k_new, + Err(_) => break, + } + } + } + }); + integrator + } + + pub fn input(&self, k: Box S + Send>) -> ActorResult { + // The meat of the work is done in the other thread, so to set the + // input we just send along the Sender we set earlier... + self.input.send(k) + } + + pub fn output(&self) -> T { + // ...and to read the input, we simply acquire a lock on the output Mutex and return a + // copy. Why do we have to copy it? Because, as mentioned above, Rust won't let us + // retain access to the interior of the Mutex unless we have possession of its lock. There + // are ways and circumstances in which one can avoid this (e.g. by using atomic types) but + // a copy is a perfectly reasonable solution as well, and a lot easier to reason about :) + *self.output.lock().unwrap() + } +} + +/// This function is fairly straightforward. We create the integrator, set its input function k(t) +/// to 2pi * f * t, and then wait as described in the Rosetta stone problem. +fn integrate() -> f64 { + let object = Integrator::new(10); + object + .input(Box::new(|t: u32| { + let two_seconds_ms = 2 * 1000; + let f = 1. / f64::from(two_seconds_ms); + (2. * PI * f * f64::from(t)).sin() + })) + .expect("Failed to set input"); + thread::sleep(Duration::from_secs(2)); + object.input(Box::new(|_| 0.)).expect("Failed to set input"); + thread::sleep(Duration::from_millis(500)); + object.output() +} + +fn main() { + println!("{}", integrate()); +} + +/// Will fail on a heavily loaded machine +#[test] +#[ignore] +fn solution() { + // We should just be able to call integrate, but can't represent the closure properly due to + // rust-lang/rust issue #17060 if we make frequency or period a variable. + // FIXME(pythonesque): When unboxed closures are fixed, fix integrate() to take two arguments. + let object = Integrator::new(10); + object + .input(Box::new(|t: u32| { + let two_seconds_ms = 2 * 1000; + let f = 1. / (two_seconds_ms / 10) as f64; + (2. * PI * f * t as f64).sin() + })) + .expect("Failed to set input"); + thread::sleep(Duration::from_millis(200)); + object.input(Box::new(|_| 0.)).expect("Failed to set input"); + thread::sleep(Duration::from_millis(100)); + assert_eq!(object.output() as u32, 0) +} diff --git a/Task/Add-a-variable-to-a-class-instance-at-runtime/00DESCRIPTION b/Task/Add-a-variable-to-a-class-instance-at-runtime/00DESCRIPTION index eb4dcaedfe..9bf8e67c64 100644 --- a/Task/Add-a-variable-to-a-class-instance-at-runtime/00DESCRIPTION +++ b/Task/Add-a-variable-to-a-class-instance-at-runtime/00DESCRIPTION @@ -1,4 +1,3 @@ -{{omit from|Rust}} Demonstrate how to dynamically add variables to an object (a class instance) at runtime. This is useful when the methods/variables of an instance are based on a data file that isn't available until runtime. Hal Fulton gives an example of creating an OO CSV parser at [http://www.devsource.com/article2/0,1759,1928562,00.asp An Exercise in Metaprogramming with Ruby]. This is referred to as "monkeypatching" by Pythonistas and some others. diff --git a/Task/Add-a-variable-to-a-class-instance-at-runtime/Elena/add-a-variable-to-a-class-instance-at-runtime.elena b/Task/Add-a-variable-to-a-class-instance-at-runtime/Elena/add-a-variable-to-a-class-instance-at-runtime.elena index cd43de70fd..ebd5235ea9 100644 --- a/Task/Add-a-variable-to-a-class-instance-at-runtime/Elena/add-a-variable-to-a-class-instance-at-runtime.elena +++ b/Task/Add-a-variable-to-a-class-instance-at-runtime/Elena/add-a-variable-to-a-class-instance-at-runtime.elena @@ -1,25 +1,25 @@ -import extensions. +import extensions; -class Extender :: BaseExtender +class Extender : BaseExtender { - object prop foo :: theField. + prop object foo; - constructor new : anObject - [ - theObject := anObject. - ] + constructor(object) + { + theObject := object + } } -public program -[ - var anObject := 234. +public program() +{ + var object := 234; // extending an object with a field - anObject := Extender new(anObject). + object := new Extender(object); - anObject foo := "bar". + object.foo := "bar"; - console printLine(anObject,".foo=",anObject foo). + console.printLine(object,".foo=",object.foo); - console readChar -] + console.readChar() +} diff --git a/Task/Add-a-variable-to-a-class-instance-at-runtime/Go/add-a-variable-to-a-class-instance-at-runtime.go b/Task/Add-a-variable-to-a-class-instance-at-runtime/Go/add-a-variable-to-a-class-instance-at-runtime.go new file mode 100644 index 0000000000..af45aaa6c7 --- /dev/null +++ b/Task/Add-a-variable-to-a-class-instance-at-runtime/Go/add-a-variable-to-a-class-instance-at-runtime.go @@ -0,0 +1,49 @@ +package main + +import ( + "bufio" + "fmt" + "log" + "os" +) + +type SomeStruct struct { + runtimeFields map[string]string +} + +func check(err error) { + if err != nil { + log.Fatal(err) + } +} + +func main() { + ss := SomeStruct{make(map[string]string)} + scanner := bufio.NewScanner(os.Stdin) + fmt.Println("Create two fields at runtime: ") + for i := 1; i <= 2; i++ { + fmt.Printf(" Field #%d:\n", i) + fmt.Print(" Enter name : ") + scanner.Scan() + name := scanner.Text() + fmt.Print(" Enter value : ") + scanner.Scan() + value := scanner.Text() + check(scanner.Err()) + ss.runtimeFields[name] = value + fmt.Println() + } + for { + fmt.Print("Which field do you want to inspect ? ") + scanner.Scan() + name := scanner.Text() + check(scanner.Err()) + value, ok := ss.runtimeFields[name] + if !ok { + fmt.Println("There is no field of that name, try again") + } else { + fmt.Printf("Its value is '%s'\n", value) + return + } + } +} diff --git a/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-1.applesoft b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-1.applesoft new file mode 100644 index 0000000000..5086eb4d83 --- /dev/null +++ b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-1.applesoft @@ -0,0 +1 @@ +N = N : PRINT PEEK (131) + PEEK (132) * 256 diff --git a/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-2.applesoft b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-2.applesoft new file mode 100644 index 0000000000..013431a8cd --- /dev/null +++ b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-2.applesoft @@ -0,0 +1,3 @@ +0 DEF FN F(X) = 0 +1 FOR A = PEEK(105) + PEEK(106) * 256 TO PEEK(107) + PEEK(108) * 256 STEP 7 : IF PEEK(A) <> ASC("F") + 128 OR PEEK(A + 1) <> 0 THEN NEXT A : A = 0 : PRINT "FN F NOT FOUND" +2 IF A THEN PRINT A diff --git a/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-3.applesoft b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-3.applesoft new file mode 100644 index 0000000000..d8da4b96c8 --- /dev/null +++ b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-3.applesoft @@ -0,0 +1,2 @@ +LOMEM: 4096 +I% = I% : PRINT PEEK (131) + PEEK (132) * 256 diff --git a/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-4.applesoft b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-4.applesoft new file mode 100644 index 0000000000..8aaa7408f9 --- /dev/null +++ b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-4.applesoft @@ -0,0 +1,4 @@ +S$ = "HELLO" : POKE 768, PEEK (131) : POKE 769, PEEK (132) : A = PEEK(768) + PEEK(769) * 256 +PRINT S$ : PRINT A "- " PEEK(A) " " PEEK(A + 1) + PEEK(A + 2) * 256 +POKE 768, ASC("H") : POKE 769, ASC("I") : POKE A, 2: POKE A + 1, 0 : POKE A + 2, 3 +PRINT S$ : PRINT A "- " PEEK(A) " " PEEK(A + 1) + PEEK(A + 2) * 256 diff --git a/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-5.applesoft b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-5.applesoft new file mode 100644 index 0000000000..1c3394f11f --- /dev/null +++ b/Task/Address-of-a-variable/Applesoft-BASIC/address-of-a-variable-5.applesoft @@ -0,0 +1,10 @@ +0 DEF FN F(X) = 1 +1 DEF FN B(X) = 2 +2 N$ = "F" : GOSUB 8 : FA = A +3 N$ = "B" : GOSUB 8 : BA = A +4 PRINT FN F(0) +5 POKE FA, PEEK(BA) : POKE FA + 1, PEEK(BA + 1) +6 PRINT FN F(0) +7 END +8 FOR A = PEEK(105) + PEEK(106) * 256 TO PEEK(107) + PEEK(108) * 256 STEP 7 : IF PEEK(A) = ASC(LEFT$(N$,1)) + 128 AND PEEK(A + 1) = ASC(MID$(N$ + CHR$(0), 2, 1)) THEN A = A + 2 : RETURN +9 NEXT A : PRINT "FN " N$ " NOT FOUND" diff --git a/Task/Address-of-a-variable/Delphi/address-of-a-variable-1.delphi b/Task/Address-of-a-variable/Delphi/address-of-a-variable-1.delphi new file mode 100644 index 0000000000..021fb3add3 --- /dev/null +++ b/Task/Address-of-a-variable/Delphi/address-of-a-variable-1.delphi @@ -0,0 +1,7 @@ +var + i: integer; + p: ^integer; +begin + p := @i; + writeLn(p^); +end; diff --git a/Task/Address-of-a-variable/Delphi/address-of-a-variable-2.delphi b/Task/Address-of-a-variable/Delphi/address-of-a-variable-2.delphi new file mode 100644 index 0000000000..0e5020a1ad --- /dev/null +++ b/Task/Address-of-a-variable/Delphi/address-of-a-variable-2.delphi @@ -0,0 +1,4 @@ +var + crtMode: integer absolute $0040; + str: string[100]; + strLen: byte absolute str; diff --git a/Task/Address-of-a-variable/Retro/address-of-a-variable-1.retro b/Task/Address-of-a-variable/Retro/address-of-a-variable-1.retro index bca5b9c95e..07f21e665a 100644 --- a/Task/Address-of-a-variable/Retro/address-of-a-variable-1.retro +++ b/Task/Address-of-a-variable/Retro/address-of-a-variable-1.retro @@ -1,2 +1,2 @@ -variable a +'a var &a diff --git a/Task/Address-of-a-variable/Retro/address-of-a-variable-2.retro b/Task/Address-of-a-variable/Retro/address-of-a-variable-2.retro index 6765643040..1e29afc88b 100644 --- a/Task/Address-of-a-variable/Retro/address-of-a-variable-2.retro +++ b/Task/Address-of-a-variable/Retro/address-of-a-variable-2.retro @@ -1,2 +1,2 @@ -variable b -100 @last !d->xt +'b var +#100 @Dictionary d:xt store diff --git a/Task/Address-of-a-variable/Retro/address-of-a-variable-3.retro b/Task/Address-of-a-variable/Retro/address-of-a-variable-3.retro index d68d53b890..5d1e2a5c08 100644 --- a/Task/Address-of-a-variable/Retro/address-of-a-variable-3.retro +++ b/Task/Address-of-a-variable/Retro/address-of-a-variable-3.retro @@ -1,2 +1,2 @@ -needs bad' -^bad'pool @ +'example/ByteAddressing.forth include +#100 b:fetch diff --git a/Task/Address-of-a-variable/Retro/address-of-a-variable-4.retro b/Task/Address-of-a-variable/Retro/address-of-a-variable-4.retro index adfa652a62..2c70213be1 100644 --- a/Task/Address-of-a-variable/Retro/address-of-a-variable-4.retro +++ b/Task/Address-of-a-variable/Retro/address-of-a-variable-4.retro @@ -1 +1 @@ -100 ^bad'pool ! +$e #100 b:store diff --git a/Task/Align-columns/360-Assembly/align-columns.360 b/Task/Align-columns/360-Assembly/align-columns.360 new file mode 100644 index 0000000000..aeb05b11bf --- /dev/null +++ b/Task/Align-columns/360-Assembly/align-columns.360 @@ -0,0 +1,180 @@ +* Align columns 12/04/2019 +ALICOL CSECT + USING ALICOL,R13 base register + B 72(R15) skip savearea + DC 17F'0' savearea + SAVE (14,12) save previous context + ST R13,4(R15) link backward + ST R15,8(R13) link forward + LR R13,R15 set addressability + LA R8,1 i=1 + DO WHILE=(C,R8,LE,=A(NI)) do r=1 to hbound(t) + LA R7,1 j=1 + LA R6,L'T i=length(t) + DO WHILE=(C,R6,GE,=A(1)) do i=length(t) to 1 by -1 + LR R1,R8 r + MH R1,=AL2(L'T) ~ + LA R4,T-L'T(R1) t(r) + BCTR R4,0 -1 + AR R4,R6 +i + MVC CI,0(R4) ci=substr(t(r),i,1) + CLI CI,C' ' if ci=' ' + BE ITERI1 then iterate i + CLI CI,C'$' if ci='$' + BE ITERI1 then iterate i + LR R7,R6 j=i + B LEAVEI1 leave i +ITERI1 BCTR R6,0 i-- + ENDDO , enddo i +LEAVEI1 LR R1,R8 r + MH R1,=AL2(L'T) ~ + LA R4,T-L'T(R1) @t(r) + LA R2,WT @wt + LR R5,R7 j + ICM R5,B'1000',=C' ' padding + LA R3,L'T length(wt) + MVCL R2,R4 wt=substr(t(r),1,j) + LA R0,1 1 + ST R0,I0 i0=1 + SR R9,R9 c=0 + LA R6,1 i=1 + DO WHILE=(CR,R6,LE,R7) do i=1 to j + LA R4,WT-1 @wt + AR R4,R6 i + MVC CI(1),0(R4) ci=substr(wt,i,1) + IF CLI,CI,EQ,C'$' THEN if ci='$' then + BAL R14,SEQ call seq + LR R2,R6 i + LA R2,1(R2) +1 + ST R2,I0 i0=i+1 + ENDIF , endif + LA R6,1(R6) i++ + ENDDO , enddo i + BAL R14,SEQ call seq + IF C,R9,GT,COLS THEN if c>cols then + ST R9,COLS cols=c + ENDIF , endif + LA R8,1(R8) r++ + ENDDO , enddo r + LR R2,R8 r + BCTR R2,0 -1 + ST R2,ROWS rows=r-1 + LA R7,1 j=1 + DO WHILE=(C,R7,LE,=A(3)) do j=1 to 3 + XPRNT =C'--',2 print + LA R8,1 r=1 + DO WHILE=(C,R8,LE,ROWS) do r=1 to rows + MVC PG,=CL120' ' pg=' ' + LA R0,1 1 + ST R0,IB ib=1 + LA R9,1 c=1 + DO WHILE=(C,R9,LE,COLS) do c=1 to cols + LR R1,R8 r + BCTR R1,0 -1 + MH R1,=AL2(NJ) ~ + AR R1,R9 c + MH R1,=AL2(L'WOR) ~ + LA R4,WOR-L'WOR(R1) @wor(r,c) + MVC W,0(R4) w=wor(r,c) + LA R6,L'W i=length(w) + DO WHILE=(C,R6,GE,=A(1)) do i=length(w) to 1 by -1 + LA R4,W-1 @w + AR R4,R6 i + MVC CI,0(R4) ci=substr(w,i,1) + CLI CI,C' ' if ci^=' ' + BNE LEAVEI2 then goto leavei2; + BCTR R6,0 i-- + ENDDO , enddo i +LEAVEI2 EQU * ~ + IF LTR,R6,Z,R6 THEN if i=0 then + LA R10,1 l=1 + ELSE , else + LR R10,R6 l=i + ENDIF , endif + IF C,R7,EQ,=F'1' THEN if j=1 then + L R11,IB ibx=ib + ENDIF , endif + IF C,R7,EQ,=F'2' THEN if j=2 then + LR R1,R9 c + SLA R1,2 ~ + L R11,WID-L'WID(R1) wid(c) + A R11,IB +ib + SR R11,R10 ibx=ib+wid(c)-l + ENDIF , endif + IF C,R7,EQ,=F'3' THEN if j=3 then + LR R1,R9 c + SLA R1,2 ~ + L R11,WID-L'WID(R1) wid(c) + SR R11,R10 -l + SRA R11,1 /2 + A R11,IB ibx=ib+(wid(c)-l)/2 + ENDIF , endif + LA R2,PG-1 @pg + AR R2,R11 +ibx + LR R3,R10 l + LA R4,W @w + LR R5,R10 l + MVCL R2,R4 substr(pg,ibx,l)=substr(w,1,l) + LR R1,R9 c + SLA R1,2 ~ + L R2,WID-L'WID(R1) wid(c) + A R2,IB +ib + LA R2,1(R2) +1 + ST R2,IB ib=ib+wid(c)+1 + LA R9,1(R9) c++ + ENDDO , enddo c + XPRNT PG,L'PG print + LA R8,1(R8) r++ + ENDDO , enddo r + LA R7,1(R7) j++ + ENDDO , enddo j + L R13,4(0,R13) restore previous savearea pointer + RETURN (14,12),RC=0 restore registers from calling sav +SEQ EQU * --begin seq + LA R9,1(R9) c=c+1 + LR R10,R6 i + S R10,I0 l=i-i0 + LA R4,WT-1 @wt + A R4,I0 +i0 + LR R5,R10 l + ICM R5,B'1000',=C' ' padding + LR R1,R8 r + BCTR R1,0 -1 + MH R1,=AL2(NJ) ~ + AR R1,R9 +c + MH R1,=AL2(L'WOR) ~ + LA R2,WOR-L'WOR(R1) @wor(r,c) + LA R3,L'WOR length(wor) + MVCL R2,R4 wor(r,c)=substr(wt,i0,l) + LR R1,R9 c + SLA R1,2 ~ + L R2,WID-L'WID(R1) wid(c) + IF CR,R2,LT,R10 THEN if l>wid(c) then + LR R1,R9 c + SLA R1,2 ~ + ST R10,WID-L'WID(R1) wid(c)=l + ENDIF , endif + BR R14 --end seq +NI EQU 6 ni +NJ EQU 12 nj +T DC CL68'Given$a$text$file$of$many$lines,$where$fields$within$a$line$' + DC CL68'are$delineated$by$a$single$''dollar''$character,$write$a$progX + ramm' + DC CL68'that$aligns$each$column$of$fields$by$ensuring$that$words$in$eX + ach$' + DC CL68'column$are$separated$by$at$least$one$space.' + DC CL68'Further,$allow$for$each$word$in$a$column$to$be$either$left$' + DC CL68'justified,$right$justified,$or$center$justified$within$its$coX + lumn.' +WOR DC (NI*NJ)CL10' ' wor(ni,nj) char(10) +WID DC 16F'0' wid(16) +COLS DC F'0' +ROWS DC F'0' +WT DS CL(L'T) +W DS CL(L'WOR) +CI DS CL1 +I0 DS F +IB DS F +PG DS CL120 + REGEQU + END ALICOL diff --git a/Task/Align-columns/AutoHotkey/align-columns.ahk b/Task/Align-columns/AutoHotkey/align-columns.ahk index cd312098a6..5b7ebc9cdd 100644 --- a/Task/Align-columns/AutoHotkey/align-columns.ahk +++ b/Task/Align-columns/AutoHotkey/align-columns.ahk @@ -1,50 +1,48 @@ -lines = -( -|$|$|$|$|$|$|$|$|$|$|$| -Given$a$text$file$of$many$lines,$where$fields$within$a$line$ -are$delineated$by$a$single$'dollar'$character,$write$a$program -that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$ -column$are$separated$by$at$least$one$space. -Further,$allow$for$each$word$in$a$column$to$be$either$left$ -justified,$right$justified,$or$center$justified$within$its$column. +Alignment := "L" ; Options: L, R, C +Text = +( LTrim + Given$a$text$file$of$many$lines,$where$fields$within$a$line$ + are$delineated$by$a$single$'dollar'$character,$write$a$program + that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$ + column$are$separated$by$at$least$one$space. + Further,$allow$for$each$word$in$a$column$to$be$either$left$ + justified,$right$justified,$or$center$justified$within$its$column. ) -Clipboard := ColumnJustify(lines, "l") +Loop, Parse, Text ; calculate column's width + If A_LoopField in $,`n + If (N > W) + W := N, N := 0 + Else + N := 0 + Else + ++N +Width := ++W -MsgBox, , Column Justify, The clipboard now contains the justified text. Paste it into a text editor to see it. - -ColumnJustify(lines, lcr = "l", del="$") +Loop, Parse, Text, `n ; process each line { - Loop, Parse, lines, `n, `r - Loop, Parse, A_LoopField, %del% - { - If ((t := StrLen(A_LoopField)) > c%A_Index% ) - c%A_Index% := t - If (t > max) - max := t - } - blank := Fill( " ", max ) - If (lcr = "l") ;left-justify - Loop, Parse, lines, `n, `r - Loop, Parse, A_LoopField, %del% - out .= (A_Index = 1 ? "`n" : " ") SubStr(A_LoopField blank, 1, c%A_Index%) - Else If (lcr = "r") ;right-justify - Loop, Parse, lines, `n, `r - Loop, Parse, A_LoopField, %del% - out .= (A_Index = 1 ? "`n" : " ") SubStr(blank A_LoopField, -c%A_Index%+1) - Else If (lcr = "c") ;center-justify - Loop, Parse, lines, `n, `r - Loop, Parse, A_LoopField, %del% - out .= (A_Index = 1 ? "`n" : " ") SubStr(blank A_LoopField blank - , (Ceil((max * 2 + StrLen(A_LoopField))/2) - Ceil(c%A_Index%/2) + 1) - , c%A_Index%) - return SubStr(out, 2) + Words := StrSplit(A_LoopField, "$") + For i, Word in Words ; process each word + Line .= Align(Word, Alignment, Width) + Result .= RTrim(Line) . "`n" + Line := "" } -Fill(chr, len) -{ - static y - if !y - VarSetCapacity(x, 64), VarSetCapacity(x, 0), y := True - return x, VarSetCapacity(x, len, Asc(chr)) +Clipboard := Result ; present results +MsgBox, The results are in the Clipboard + +Align(Pal, How, Width) { ; function for alignment + Length := StrLen(Pal) + If (How = "L") + Return Pal . Spc(Width - Length) + Else If (How = "R") + Return Spc(Width - Length) . Pal + Else If (How = "C") + Return Spc((Width - Length)//2) . Pal . Spc(Width - Length - (Width - Length)//2) +} + +Spc(Number) { ; function to concatenate space characters + Loop, %Number% + Ret .= A_Space + Return Ret } diff --git a/Task/Align-columns/COBOL/align-columns-1.cobol b/Task/Align-columns/COBOL/align-columns-1.cobol new file mode 100644 index 0000000000..9228acbc68 --- /dev/null +++ b/Task/Align-columns/COBOL/align-columns-1.cobol @@ -0,0 +1,83 @@ + identification division. + program-id. AlignColumns. + + data division. + working-storage section. + *>-> Constants + 78 MAX-LINES value 6. + 78 MAX-LINE-SIZE value 66. + 78 MAX-COLUMNS value 12. + 78 MAX-COLUMN-SIZE value 16. + *>-> Indexes + 01 w-idx pic is 9(2). + 01 w-idy pic is 9(2). + 01 w-pos pic is 9(3). + *>-> Data structures + 01 w-lines. + 05 w-line pic is x(MAX-LINE-SIZE) occurs MAX-LINES. + 01 w-column-sizes. + 05 w-column-size pic is 99 occurs MAX-COLUMNS value zeros. + 01 w-matrix. + 05 filler occurs MAX-LINES. + 10 filler occurs MAX-COLUMNS. + 15 w-content pic is x(MAX-COLUMN-SIZE). + *>-> Output + 01 w-line-out pic is x(120). + *>-> Data alignment + 01 w-alignment pic is x(1). + 88 alignment-left value is "L". + 88 alignment-center value is "C". + 88 alignment-right value is "R". + + procedure division. + main. + move "Given$a$text$file$of$many$lines,$where$fields$within$a$line$" to w-line(1) + move "are$delineated$by$a$single$'dollar'$character,$write$a$program" to w-line(2) + move "that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$" to w-line(3) + move "column$are$separated$by$at$least$one$space." to w-line(4) + move "Further,$allow$for$each$word$in$a$column$to$be$either$left$" to w-line(5) + move "justified,$right$justified,$or$center$justified$within$its$column." to w-line(6) + perform calculate-size-columns + set alignment-left to true + perform show-content + set alignment-center to true + perform show-content + set alignment-right to true + perform show-content + goback + . + calculate-size-columns. + perform + varying w-idx from 1 by 1 + until w-idx > MAX-LINES + unstring w-line(w-idx) delimited by "$" into w-content(w-idx, 1), w-content(w-idx, 2), + w-content(w-idx, 3), w-content(w-idx, 4), w-content(w-idx, 5), w-content(w-idx, 6), + w-content(w-idx, 7), w-content(w-idx, 8), w-content(w-idx, 9), w-content(w-idx, 10), + w-content(w-idx, 11), w-content(w-idx, 12), + perform + varying w-idy from 1 by 1 + until w-idy > MAX-COLUMNS + if function stored-char-length(w-content(w-idx, w-idy)) > w-column-size(w-idy) + move function stored-char-length(w-content(w-idx, w-idy)) to w-column-size(w-idy) + end-if + end-perform + end-perform + . + show-content. + move all "-" to w-line-out + display w-line-out + perform + varying w-idx from 1 by 1 + until w-idx > MAX-LINES + move spaces to w-line-out + move 1 to w-pos + perform + varying w-idy from 1 by 1 + until w-idy > MAX-COLUMNS + call "C$JUSTIFY" using w-content(w-idx, w-idy)(1:w-column-size(w-idy)), w-alignment + move w-content(w-idx, w-idy) to w-line-out(w-pos:w-column-size(w-idy)) + compute w-pos = w-pos + w-column-size(w-idy) + 1 + end-perform + display w-line-out + end-perform + . diff --git a/Task/Align-columns/COBOL/align-columns-2.cobol b/Task/Align-columns/COBOL/align-columns-2.cobol new file mode 100644 index 0000000000..9e71439879 --- /dev/null +++ b/Task/Align-columns/COBOL/align-columns-2.cobol @@ -0,0 +1,21 @@ +------------------------------------------------------------------------------------------------------------------------ +Given a text file of many lines, where fields within a line +are delineated by a single 'dollar' character, write a program +that aligns each column of fields by ensuring that words in each +column are separated by at least one space. +Further, allow for each word in a column to be either left +justified, right justified, or center justified within its column. +------------------------------------------------------------------------------------------------------------------------ + Given a text file of many lines, where fields within a line + are delineated by a single 'dollar' character, write a program + that aligns each column of fields by ensuring that words in each + column are separated by at least one space. + Further, allow for each word in a column to be either left +justified, right justified, or center justified within its column. +------------------------------------------------------------------------------------------------------------------------ + Given a text file of many lines, where fields within a line + are delineated by a single 'dollar' character, write a program + that aligns each column of fields by ensuring that words in each + column are separated by at least one space. + Further, allow for each word in a column to be either left +justified, right justified, or center justified within its column. diff --git a/Task/Align-columns/Harbour/align-columns-1.harbour b/Task/Align-columns/Harbour/align-columns-1.harbour new file mode 100644 index 0000000000..d1394ee4bf --- /dev/null +++ b/Task/Align-columns/Harbour/align-columns-1.harbour @@ -0,0 +1,40 @@ +PROCEDURE Main() + LOCAL a := { "Given$a$text$file$of$many$lines,$where$fields$within$a$line$",; + "are$delineated$by$a$single$'dollar'$character,$write$a$program",; + "that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$",; + "column$are$separated$by$at$least$one$space.",; + "Further,$allow$for$each$word$in$a$column$to$be$either$left$",; + "justified,$right$justified,$or$center$justified$within$its$column." } + LOCAL e, nMax + + // remove trailing dollars + AEval( a, {|e,n| Iif( Right(e,1)=="$", a[n] := hb_StrShrink( e, 1 ), NIL ) } ) + + // find max word length + nMax := 0 + AEval( a, {|e| AEval( hb_Atokens( e, "$"), {|i| nMax := Max( nMax, Len(i) )} ) } ) + nMax++ + + // start printing, padding words as needed + ? + ? "----Left aligned columns----" + FOR EACH e IN a + ? + AEval( hb_Atokens( e, "$"), {|i| QQout( PadR(i, nMax) )} ) + NEXT + + ? + ? "----Center aligned columns----" + FOR EACH e IN a + ? + AEval( hb_Atokens( e, "$"), {|i| QQout( PadC(i, nMax) )} ) + NEXT + + ? + ? "----Right aligned columns----" + FOR EACH e IN a + ? + AEval( hb_Atokens( e, "$"), {|i| QQout( PadL(i, nMax) )} ) + NEXT + + RETURN diff --git a/Task/Align-columns/Harbour/align-columns-2.harbour b/Task/Align-columns/Harbour/align-columns-2.harbour new file mode 100644 index 0000000000..174a4f38ec --- /dev/null +++ b/Task/Align-columns/Harbour/align-columns-2.harbour @@ -0,0 +1,23 @@ +----Left aligned columns---- +Given a text file of many lines, where fields within a line +are delineated by a single 'dollar' character, write a program +that aligns each column of fields by ensuring that words in each +column are separated by at least one space. +Further, allow for each word in a column to be either left +justified, right justified, or center justified within its column. + +----Center aligned columns---- + Given a text file of many lines, where fields within a line + are delineated by a single 'dollar' character, write a program + that aligns each column of fields by ensuring that words in each + column are separated by at least one space. + Further, allow for each word in a column to be either left +justified, right justified, or center justified within its column. + +----Right aligned columns---- + Given a text file of many lines, where fields within a line + are delineated by a single 'dollar' character, write a program + that aligns each column of fields by ensuring that words in each + column are separated by at least one space. + Further, allow for each word in a column to be either left + justified, right justified, or center justified within its column. diff --git a/Task/Align-columns/Python/align-columns-2.py b/Task/Align-columns/Python/align-columns-2.py index 6f409cc691..ac4daedcdb 100644 --- a/Task/Align-columns/Python/align-columns-2.py +++ b/Task/Align-columns/Python/align-columns-2.py @@ -1,21 +1,18 @@ -txt = """Given$a$txt$file$of$many$lines,$where$fields$within$a$line$ +''' +cat <<'EOF' > align_columns.dat +Given$a$text$file$of$many$lines,$where$fields$within$a$line$ are$delineated$by$a$single$'dollar'$character,$write$a$program that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$ column$are$separated$by$at$least$one$space. Further,$allow$for$each$word$in$a$column$to$be$either$left$ -justified,$right$justified,$or$center$justified$within$its$column.""" +justified,$right$justified,$or$center$justified$within$its$column. +EOF +''' -parts = [line.rstrip("$").split("$") for line in txt.splitlines()] - -max_widths = {} -for line in parts: - for i, word in enumerate(line): - max_widths[i] = max(max_widths.get(i, 0), len(word)) - -for i, justify in enumerate([str.ljust, str.center, str.rjust]): - print ["Left", "Center", "Right"][i], " column-aligned output:\n" - for line in parts: - for j, word in enumerate(line): - print justify(word, max_widths[j]), - print - print "- " * 52 +for align in '<^>': + rows = [ line.strip().split('$') for line in open('align_columns.dat') ] + fmts = [ '{:%s%d}' % (align, max( len(row[i]) if i < len(row) else 0 for row in rows )) + for i in range(max(map(len, rows))) ] + for row in rows: + print(' '.join(fmts).format(*(row + [''] * len(fmts)))) + print('') diff --git a/Task/Align-columns/Python/align-columns-3.py b/Task/Align-columns/Python/align-columns-3.py index ac4daedcdb..6f409cc691 100644 --- a/Task/Align-columns/Python/align-columns-3.py +++ b/Task/Align-columns/Python/align-columns-3.py @@ -1,18 +1,21 @@ -''' -cat <<'EOF' > align_columns.dat -Given$a$text$file$of$many$lines,$where$fields$within$a$line$ +txt = """Given$a$txt$file$of$many$lines,$where$fields$within$a$line$ are$delineated$by$a$single$'dollar'$character,$write$a$program that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$ column$are$separated$by$at$least$one$space. Further,$allow$for$each$word$in$a$column$to$be$either$left$ -justified,$right$justified,$or$center$justified$within$its$column. -EOF -''' +justified,$right$justified,$or$center$justified$within$its$column.""" -for align in '<^>': - rows = [ line.strip().split('$') for line in open('align_columns.dat') ] - fmts = [ '{:%s%d}' % (align, max( len(row[i]) if i < len(row) else 0 for row in rows )) - for i in range(max(map(len, rows))) ] - for row in rows: - print(' '.join(fmts).format(*(row + [''] * len(fmts)))) - print('') +parts = [line.rstrip("$").split("$") for line in txt.splitlines()] + +max_widths = {} +for line in parts: + for i, word in enumerate(line): + max_widths[i] = max(max_widths.get(i, 0), len(word)) + +for i, justify in enumerate([str.ljust, str.center, str.rjust]): + print ["Left", "Center", "Right"][i], " column-aligned output:\n" + for line in parts: + for j, word in enumerate(line): + print justify(word, max_widths[j]), + print + print "- " * 52 diff --git a/Task/Align-columns/Python/align-columns-4.py b/Task/Align-columns/Python/align-columns-4.py new file mode 100644 index 0000000000..64061d0e0c --- /dev/null +++ b/Task/Align-columns/Python/align-columns-4.py @@ -0,0 +1,75 @@ +'''Variously aligned columns + from delimited text. +''' + +from functools import reduce +from itertools import repeat + + +# TEST ---------------------------------------------------- +# main :: IO () +def main(): + '''Test of three alignments.''' + + txt = '''Given$a$text$file$of$many$lines,$where$fields$within$a$line$ +are$delineated$by$a$single$'dollar'$character,$write$a$program +that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$ +column$are$separated$by$at$least$one$space. +Further,$allow$for$each$word$in$a$column$to$be$either$left$ +justified,$right$justified,$or$center$justified$within$its$column.''' + + rows = [x.split('$') for x in txt.splitlines()] + table = paddedRows(max(map(len, rows)))('')(rows) + + print('\n\n'.join(map( + alignedTable(table)(' '), + [-1, 0, 1] # Left, Center, Right + ))) + + +# alignedTable :: [[String]] -> Alignment -> String -> String +def alignedTable(rows): + '''Tabulation of rows of cells, with cell alignment + specified by: + eAlign -1 = left + eAlign 0 = center + eAlign 1 = right + and separator between columns + supplied by the `sep` argument. + ''' + def go(sep, eAlign): + lcr = ['ljust', 'center', 'rjust'][1 + eAlign] + + # nextAlignedCol :: [[String]] -> [String] -> [[String]] + def nextAlignedCol(cols, col): + w = max(len(cell) for cell in col) + return cols + [ + [getattr(s, lcr)(w, ' ') for s in col] + ] + + return '\n'.join([ + sep.join(cells) for cells in + zip(*reduce(nextAlignedCol, zip(*rows), [])) + ]) + return lambda sep: lambda eAlign: go(sep, eAlign) + + +# GENERIC ------------------------------------------------- + +# paddedRows :: Int -> a -> [[a]] -> [[a]] +def paddedRows(n): + '''A list of rows of even length, + in which each may be padded (but + not truncated) to length n with + appended copies of value v.''' + def go(v, xs): + def pad(x): + d = n - len(x) + return (x + list(repeat(v, d))) if 0 < d else x + return [pad(row) for row in xs] + return lambda v: lambda xs: go(v, xs) if xs else [] + + +# MAIN --- +if __name__ == '__main__': + main() diff --git a/Task/Align-columns/VBScript/align-columns.vb b/Task/Align-columns/VBScript/align-columns.vb new file mode 100644 index 0000000000..902397b02e --- /dev/null +++ b/Task/Align-columns/VBScript/align-columns.vb @@ -0,0 +1,62 @@ +' Align columns - RC - VBScript + Const nr=16, nc=16 + ReDim d(nc),t(nr), wor(nr,nc) + i=i+1: t(i) = "Given$a$text$file$of$many$lines,$where$fields$within$a$line$" + i=i+1: t(i) = "are$delineated$by$a$single$'dollar'$character,$write$a$program" + i=i+1: t(i) = "that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$" + i=i+1: t(i) = "column$are$separated$by$at$least$one$space." + i=i+1: t(i) = "Further,$allow$for$each$word$in$a$column$To$be$either$left$" + i=i+1: t(i) = "justified,$right$justified,$or$center$justified$within$its$column." + For r=1 to nr + If t(r)="" Then Exit For + w=xRTrim(t(r),"$") + m=Split(w,"$") + For c=1 To UBound(m)+1 + wor(r,c)=m(c-1) + If Len(wor(r,c))>d(c) Then d(c)=Len(wor(r,c)) + Next 'c + If c>cols Then cols=c + Next 'r + rows=r-1 + tt=Array("Left","Right","Center") + For n=1 To 3 + Wscript.Echo + Wscript.Echo "*****" & tt(n-1) & "*****" + For r=1 To rows + w="" + For c=1 To cols + x=wor(r,c): s=Space(d(c)) + Select Case n + Case 1: w=w &" "& Left (x & s,d(c)) + Case 2: w=w &" "& Right (s & x,d(c)) + Case 3: w=w &" "& xCentre(x,d(c)," ") + End Select 'n + Next 'c + Wscript.Echo Mid(w,2) + Next 'r + Next 'n + +Function xCentre(c, n, Pad) + Dim j + If n > Len(c) Then + j = (n - Len(c)) \ 2 + If (n - Len(c)) Mod 2 <> 0 Then j = j + 1 + xCentre = Mid(String(j, Pad) & c & String(j, Pad), 1, n) + Else + xCentre = c + End If +End Function 'xCentre + +Function xRTrim(c, Pad) + Dim i2, l, cc + cc = "": l = Len(c) + If l > 0 Then + i2 = l + Do While (Mid(c, i2, 1) = Pad And i2 > 1) + i2 = i2 - 1 + Loop + If i2 = 1 And Mid(c, i2, 1) = Pad Then i2 = 0 + If i2 > 0 Then cc = Mid(c, 1, i2) + End If + xRTrim = cc +End Function 'xRTrim diff --git a/Task/Aliquot-sequence-classifications/00META.yaml b/Task/Aliquot-sequence-classifications/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/Aliquot-sequence-classifications/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/Aliquot-sequence-classifications/Perl-6/aliquot-sequence-classifications.pl6 b/Task/Aliquot-sequence-classifications/Perl-6/aliquot-sequence-classifications.pl6 index b38aea8768..a013c87cff 100644 --- a/Task/Aliquot-sequence-classifications/Perl-6/aliquot-sequence-classifications.pl6 +++ b/Task/Aliquot-sequence-classifications/Perl-6/aliquot-sequence-classifications.pl6 @@ -1,9 +1,9 @@ sub propdivsum (\x) { - my @l = x > 1, gather for 2 .. x.sqrt.floor -> \d { - my \y = x div d; - if y * d == x { take d; take y unless y == d } + my @l = x > 1; + (2 .. x.sqrt.floor).map: -> \d { + unless x % d { my \y = x div d; y == d ?? @l.push: d !! @l.append: d,y } } - [+] gather @l.deepmap(*.take); + sum @l; } multi quality (0,1) { 'perfect ' } @@ -24,8 +24,7 @@ sub aliquotidian ($x) { } %seen{$this} = $to; } - "$x non-terminating"; - + "$x non-terminating\t[{@seq}]"; } aliquotidian($_).say for flat diff --git a/Task/Almost-prime/ARM-Assembly/almost-prime.arm b/Task/Almost-prime/ARM-Assembly/almost-prime.arm new file mode 100644 index 0000000000..e58d7e0cd3 --- /dev/null +++ b/Task/Almost-prime/ARM-Assembly/almost-prime.arm @@ -0,0 +1,221 @@ +/* ARM assembly Raspberry PI */ +/* program kprime.s */ + +/************************************/ +/* Constantes */ +/************************************/ +.equ STDOUT, 1 @ Linux output console +.equ EXIT, 1 @ Linux syscall +.equ WRITE, 4 @ Linux syscall + +.equ MAXI, 10 +.equ MAXIK, 5 +/*********************************/ +/* Initialized data */ +/*********************************/ +.data +sMessDeb: .ascii "k=" +sMessValeurDeb: .fill 11, 1, ' ' @ size => 11 + +sMessResult: .ascii " " +sMessValeur: .fill 11, 1, ' ' @ size => 11 + +szCarriageReturn: .asciz "\n" + + +/*********************************/ +/* UnInitialized data */ +/*********************************/ +.bss +/*********************************/ +/* code section */ +/*********************************/ +.text +.global main +main: @ entry of program + mov r3,#1 @ k +1: @ start loop k + mov r0,r3 + ldr r1,iAdrsMessValeurDeb + bl conversion10 @ call conversion decimal + ldr r0,iAdrsMessValeurDeb + mov r1,#':' + strb r1,[r0,#2] @ write : after k value + mov r1,#0 + strb r1,[r0,#3] @ final zéro + ldr r0,iAdrsMessDeb + bl affichageMess @ display message + mov r4,#2 @ n + mov r5,#0 @ result counter +2: @ start loop n + mov r0,r4 + mov r1,r3 + bl kprime @ is kprine ? + cmp r0,#0 + beq 3f @ no + mov r0,r4 + ldr r1,iAdrsMessValeur + bl conversion10 @ call conversion decimal + ldr r0,iAdrsMessValeur + mov r1,#0 + strb r1,[r0,#4] @ final zéro + ldr r0,iAdrsMessResult + bl affichageMess @ display message + add r5,#1 @ increment counter +3: + add r4,#1 @ increment n + cmp r5,#MAXI @ maxi ? + blt 2b @ no -> loop + ldr r0,iAdrszCarriageReturn + bl affichageMess @ display carriage return + add r3,#1 @ increment k + cmp r3,#MAXIK @ maxi ? + ble 1b @ no -> loop + +100: @ standard end of the program + mov r0, #0 @ return code + mov r7, #EXIT @ request to exit program + svc #0 @ perform the system call + +iAdrsMessValeur: .int sMessValeur +iAdrszCarriageReturn: .int szCarriageReturn +iAdrsMessResult: .int sMessResult +iAdrsMessValeurDeb: .int sMessValeurDeb +iAdrsMessDeb: .int sMessDeb +/******************************************************************/ +/* compute kprime (n,k) */ +/******************************************************************/ +/* r0 contains n */ +/* r1 contains k */ +kprime: + push {r1-r7,lr} @ save registers + mov r5,r0 @ save n + mov r7,r1 @ save k + mov r4,#0 @ counter product + mov r1,#2 @ divisor +1: @ start loop + cmp r4,r7 @ counter >= k + bge 4f @ yes -> end + mul r6,r1,r1 @ compute product + cmp r6,r5 @ > n + bgt 4f @ yes -> end +2: @ start loop division + mov r0,r5 @ dividende + bl division @ by r1 + cmp r3,#0 @ remainder = 0 ? + bne 3f @ no + mov r5,r2 @ yes -> n = n / r1 + add r4,#1 @ increment counter + b 2b @ and loop +3: + add r1,#1 @ increment divisor + b 1b @ and loop +4: @ end compute + cmp r5,#1 @ n > 1 + addgt r4,#1 @ yes increment counter + cmp r4,r7 @ counter = k ? + movne r0,#0 @ no -> no kprime + moveq r0,#1 @ yes -> kprime +100: + pop {r1-r7,lr} @ restaur registers + bx lr @return +/******************************************************************/ +/* display text with size calculation */ +/******************************************************************/ +/* r0 contains the address of the message */ +affichageMess: + push {r0,r1,r2,r7,lr} @ save registres + mov r2,#0 @ counter length +1: @ loop length calculation + ldrb r1,[r0,r2] @ read octet start position + index + cmp r1,#0 @ if 0 its over + addne r2,r2,#1 @ else add 1 in the length + bne 1b @ and loop + @ so here r2 contains the length of the message + mov r1,r0 @ address message in r1 + mov r0,#STDOUT @ code to write to the standard output Linux + mov r7, #WRITE @ code call system "write" + svc #0 @ call systeme + pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */ + bx lr @ return +/******************************************************************/ +/* Converting a register to a decimal unsigned */ +/******************************************************************/ +/* r0 contains value and r1 address area */ +/* r0 return size of result (no zero final in area) */ +/* area size => 11 bytes */ +.equ LGZONECAL, 10 +conversion10: + push {r1-r4,lr} @ save registers + mov r3,r1 + mov r2,#LGZONECAL +1: @ start loop + bl divisionpar10U @ unsigned r0 <- dividende. quotient ->r0 reste -> r1 + add r1,#48 @ digit + strb r1,[r3,r2] @ store digit on area + cmp r0,#0 @ stop if quotient = 0 + subne r2,#1 @ else previous position + bne 1b @ and loop + @ and move digit from left of area + mov r4,#0 +2: + ldrb r1,[r3,r2] + strb r1,[r3,r4] + add r2,#1 + add r4,#1 + cmp r2,#LGZONECAL + ble 2b + @ and move spaces in end on area + mov r0,r4 @ result length + mov r1,#' ' @ space +3: + strb r1,[r3,r4] @ store space in area + add r4,#1 @ next position + cmp r4,#LGZONECAL + ble 3b @ loop if r4 <= area size + +100: + pop {r1-r4,lr} @ restaur registres + bx lr @return + +/***************************************************/ +/* division par 10 unsigned */ +/***************************************************/ +/* r0 dividende */ +/* r0 quotient */ +/* r1 remainder */ +divisionpar10U: + push {r2,r3,r4, lr} + mov r4,r0 @ save value + ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2 + umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) + mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3 + add r2,r0,r0, lsl #2 @ r2 <- r0 * 5 + sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10) + pop {r2,r3,r4,lr} + bx lr @ leave function +iMagicNumber: .int 0xCCCCCCCD +/***************************************************/ +/* integer division unsigned */ +/***************************************************/ +division: + /* r0 contains dividend */ + /* r1 contains divisor */ + /* r2 returns quotient */ + /* r3 returns remainder */ + push {r4, lr} + mov r2, #0 @ init quotient + mov r3, #0 @ init remainder + mov r4, #32 @ init counter bits + b 2f +1: @ loop + movs r0, r0, LSL #1 @ r0 <- r0 << 1 updating cpsr (sets C if 31st bit of r0 was 1) + adc r3, r3, r3 @ r3 <- r3 + r3 + C. This is equivalent to r3 ? (r3 << 1) + C + cmp r3, r1 @ compute r3 - r1 and update cpsr + subhs r3, r3, r1 @ if r3 >= r1 (C=1) then r3 <- r3 - r1 + adc r2, r2, r2 @ r2 <- r2 + r2 + C. This is equivalent to r2 <- (r2 << 1) + C +2: + subs r4, r4, #1 @ r4 <- r4 - 1 + bpl 1b @ if r4 >= 0 (N=0) then loop + pop {r4, lr} + bx lr diff --git a/Task/Almost-prime/Futhark/almost-prime.futhark b/Task/Almost-prime/Futhark/almost-prime.futhark index b9e10b95c9..9f6a3d1c37 100644 --- a/Task/Almost-prime/Futhark/almost-prime.futhark +++ b/Task/Almost-prime/Futhark/almost-prime.futhark @@ -1,18 +1,18 @@ -fun kprime(n: int, k: int): bool = +let kprime(n: i32, k: i32): bool = let (p,f) = (2, 0) - loop ((n, p, f)) = while f < k && p*p <= n do - loop ((n,f)) = while 0 == n % p do + let (n,_,f) = loop (n, p, f) while f < k && p*p <= n do + let (n,f) = loop (n, f) while 0 == n % p do (n/p, f+1) in (n, p+1, f) in f + (if n > 1 then 1 else 0) == k -fun main(m: int): [][]int = - map (fn k: [10]int => - let ps = replicate 10 0 - loop ((i,c,ps) = (2,0,ps)) = while c < 10 do - if kprime(i,k) then - unsafe let ps[c] = i - in (i+1, c+1, ps) - else (i+1, c, ps) - in ps) - (map (1+) (iota m)) +let main(m: i32): [][]i32 = + let f k = + let ps = replicate 10 0 + let (_,_,ps) = loop (i,c,ps) = (2,0,ps) while c < 10 do + if kprime(i,k) then + unsafe let ps[c] = i + in (i+1, c+1, ps) + else (i+1, c, ps) + in ps + in map f (1...m) diff --git a/Task/Almost-prime/Julia/almost-prime.julia b/Task/Almost-prime/Julia/almost-prime-1.julia similarity index 100% rename from Task/Almost-prime/Julia/almost-prime.julia rename to Task/Almost-prime/Julia/almost-prime-1.julia diff --git a/Task/Almost-prime/Julia/almost-prime-2.julia b/Task/Almost-prime/Julia/almost-prime-2.julia new file mode 100644 index 0000000000..29287e2ccc --- /dev/null +++ b/Task/Almost-prime/Julia/almost-prime-2.julia @@ -0,0 +1,17 @@ +using Primes + +isalmostprime(n::Integer, k::Integer) = sum(values(factor(n))) == k + +function almostprimes(N::Integer, k::Integer) # return first N almost-k primes + P = Vector{typeof(k)}(undef,N) + i = 0; n = 2 + while i < N + if isalmostprime(n, k) P[i += 1] = n end + n += 1 + end + return P +end + +for k in 1:5 + println("$k-Almost-primes: ", join(almostprimes(10, k), ", "), "...") +end diff --git a/Task/Almost-prime/Liberty-BASIC/almost-prime.liberty b/Task/Almost-prime/Liberty-BASIC/almost-prime.liberty new file mode 100644 index 0000000000..1c420c6a9b --- /dev/null +++ b/Task/Almost-prime/Liberty-BASIC/almost-prime.liberty @@ -0,0 +1,26 @@ +for k = 1 to 5 + print "k = "; k; ": "; + i = 2 + c = 0 + while c < 10 + if kPrime(i, k) then + print using("###", i); " "; + c = c + 1 + end if + i = i + 1 + wend + print +next k +end + +function kPrime(n, k) + f = 0 + for i = 2 to n + while n mod i = 0 + if f = k then kPrime = 0: exit function + f = f + 1 + n = int(n / i) + wend + next i + kPrime = abs(f = k) +end function diff --git a/Task/Almost-prime/Python/almost-prime.py b/Task/Almost-prime/Python/almost-prime-1.py similarity index 100% rename from Task/Almost-prime/Python/almost-prime.py rename to Task/Almost-prime/Python/almost-prime-1.py diff --git a/Task/Almost-prime/Python/almost-prime-2.py b/Task/Almost-prime/Python/almost-prime-2.py new file mode 100644 index 0000000000..e9d62b7533 --- /dev/null +++ b/Task/Almost-prime/Python/almost-prime-2.py @@ -0,0 +1,37 @@ +# k-Almost-primes +# Python 3.6.3 +# no imports + +def prime_factors(m=2): + + for i in range(2, m): + r, q = divmod(m, i) + if not q: + return [i] + prime_factors(r) + return [m] + +def k_almost_primes(n, k=2): + multiples = set() + lists = list() + for x in range(k+1): + lists.append([]) + + for i in range(2, n+1): + if i not in multiples: + if len(lists[1]) < 10: + lists[1].append(i) + multiples.update(range(i*i, n+1, i)) + print("k=1: {}".format(lists[1])) + + for j in range(2, k+1): + for m in multiples: + l = prime_factors(m) + ll = len(l) + if ll == j and len(lists[j]) < 10: + lists[j].append(m) + + print("k={}: {}".format(j, lists[j])) + +k_almost_primes(200, 5) +# try: +#k_almost_primes(6000, 10) diff --git a/Task/Almost-prime/Ruby/almost-prime-1.rb b/Task/Almost-prime/Ruby/almost-prime-1.rb index 0e578dd9ff..1952cc24a1 100644 --- a/Task/Almost-prime/Ruby/almost-prime-1.rb +++ b/Task/Almost-prime/Ruby/almost-prime-1.rb @@ -2,11 +2,7 @@ require 'prime' def almost_primes(k=2) return to_enum(:almost_primes, k) unless block_given? - n = 0 - loop do - n += 1 - yield n if n.prime_division.map( &:last ).inject( &:+ ) == k - end + 1.step {|n| yield n if n.prime_division.sum( &:last ) == k } end (1..5).each{|k| puts almost_primes(k).take(10).join(", ")} diff --git a/Task/Almost-prime/Seed7/almost-prime.seed7 b/Task/Almost-prime/Seed7/almost-prime.seed7 new file mode 100644 index 0000000000..030ff9386a --- /dev/null +++ b/Task/Almost-prime/Seed7/almost-prime.seed7 @@ -0,0 +1,37 @@ +$ include "seed7_05.s7i"; + +const func boolean: kprime (in var integer: number, in integer: k) is func + result + var boolean: kprime is FALSE; + local + var integer: p is 2; + var integer: f is 0; + begin + while f < k and p * p <= number do + while number rem p = 0 do + number := number div p; + incr(f); + end while; + incr(p); + end while; + kprime := f + ord(number > 1) = k; + end func; + +const proc: main is func + local + var integer: k is 0; + var integer: number is 0; + var integer: count is 0; + begin + for k range 1 to 5 do + write("k = " <& k <& ":"); + count := 0; + for number range 2 to integer.last until count >= 10 do + if kprime(number, k) then + write(" " <& number); + incr(count); + end if; + end for; + writeln; + end for; + end func; diff --git a/Task/Almost-prime/VBA/almost-prime.vba b/Task/Almost-prime/VBA/almost-prime.vba new file mode 100644 index 0000000000..e28e5b3d17 --- /dev/null +++ b/Task/Almost-prime/VBA/almost-prime.vba @@ -0,0 +1,32 @@ +Private Function kprime(ByVal n As Integer, k As Integer) As Boolean + Dim p As Integer, factors As Integer + p = 2 + factors = 0 + Do While factors < k And p * p <= n + Do While n Mod p = 0 + n = n / p + factors = factors + 1 + Loop + p = p + 1 + Loop + factors = factors - (n > 1) 'true=-1 + kprime = factors = k +End Function + +Private Sub almost_primeC() + Dim nextkprime As Integer, count As Integer + Dim k As Integer + For k = 1 To 5 + Debug.Print "k ="; k; ":"; + nextkprime = 2 + count = 0 + Do While count < 10 + If kprime(nextkprime, k) Then + Debug.Print " "; Format(CStr(nextkprime), "@@@@@"); + count = count + 1 + End If + nextkprime = nextkprime + 1 + Loop + Debug.Print + Next k +End Sub diff --git a/Task/Almost-prime/Visual-Basic-.NET/almost-prime.visual b/Task/Almost-prime/Visual-Basic-.NET/almost-prime.visual new file mode 100644 index 0000000000..10be6916b9 --- /dev/null +++ b/Task/Almost-prime/Visual-Basic-.NET/almost-prime.visual @@ -0,0 +1,44 @@ +Module Module1 + + Class KPrime + Public K As Integer + + Public Function IsKPrime(number As Integer) As Boolean + Dim primes = 0 + Dim p = 2 + While p * p <= number AndAlso primes < K + While number Mod p = 0 AndAlso primes < K + number = number / p + primes = primes + 1 + End While + p = p + 1 + End While + If number > 1 Then + primes = primes + 1 + End If + Return primes = K + End Function + + Public Function GetFirstN(n As Integer) As List(Of Integer) + Dim result As New List(Of Integer) + Dim number = 2 + While result.Count < n + If IsKPrime(number) Then + result.Add(number) + End If + number = number + 1 + End While + Return result + End Function + End Class + + Sub Main() + For Each k In Enumerable.Range(1, 5) + Dim kprime = New KPrime With { + .K = k + } + Console.WriteLine("k = {0}: {1}", k, String.Join(" ", kprime.GetFirstN(10))) + Next + End Sub + +End Module diff --git a/Task/Amb/00META.yaml b/Task/Amb/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/Amb/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/Amb/Elena/amb.elena b/Task/Amb/Elena/amb.elena index 3497ddca76..880f9ca7d0 100644 --- a/Task/Amb/Elena/amb.elena +++ b/Task/Amb/Elena/amb.elena @@ -1,75 +1,81 @@ -import system'routines. -import extensions. -import extensions'routines. +import system'routines; +import extensions; +import extensions'routines; -joinable(former,later) = (former[former length - 1] == later[0]). +joinable(former,later) = (former[former.Length - 1] == later[0]); dispatcher = { eval(object a, Func2 f) - [ - ^ f(a[0],a[1]). - ] + { + ^ f(a[0],a[1]) + } eval(object a, Func3 f) - [ - ^ f(a[0], a[1],a[2]). - ] + { + ^ f(a[0], a[1],a[2]) + } eval(object a, Func4 f) - [ - ^ f(a[0],a[1],a[2],a[3]). - ] + { + ^ f(a[0],a[1],a[2],a[3]) + } eval(object a, Func5 f) - [ - ^ f(a[0],a[1],a[2],a[3],a[4]). - ] -}. + { + ^ f(a[0],a[1],a[2],a[3],a[4]) + } +}; class AmbValueCollection { - object theCombinator. + object theCombinator; - generic constructor new(V args) - [ - theCombinator := SequentialEnumerator new(args). - ] + constructor new(params object[] args) + { + theCombinator := SequentialEnumerator.new(params args) + } - seek : cond - [ - theCombinator reset. + seek(cond) + { + theCombinator.reset(); - theCombinator seekEach(:v)(dispatcher eval(v,cond)) - ] + theCombinator.seekEach:(v => dispatcher.eval(v,cond)) + } - do : aFunction - [ - var aResult := theCombinator get. - if (nil != aResult) - [ dispatcher eval(aResult,aFunction) ]; - [ InvalidArgumentException new; raise ] - ] + do(f) + { + var result := theCombinator.get(); + if (nil != result) + { + dispatcher.eval(result,f) + } + else + { + InvalidArgumentException.raise() + } + } } -ambOperator = +singleton ambOperator { - generic for(V args) - = AmbValueCollection new(args). -}. + for(params object[] args) + = AmbValueCollection.new(params args); +} -public program -[ - try(ambOperator - for(("the","that","a"),("frog", "elephant", "thing"),("walked", "treaded", "grows"),("slowly", "quickly")); - seek(:a:b:c:d) ( joinable(a,b) && joinable(b,c) && joinable(c,d) ); - do(:a:b:c:d) [ console printLine(a," ",b," ",c," ",d) ]) +public program() +{ + try { - on(Exception e) - [ - console printLine:"AMB is angry" - ] - }. + ambOperator + .for(new {"the","that","a"},new {"frog", "elephant", "thing"},new {"walked", "treaded", "grows"}, new {"slowly", "quickly"}) + .seek:(a,b,c,d => joinable(a,b) && joinable(b,c) && joinable(c,d) ) + .do:(a,b,c,d) { console.printLine(a," ",b," ",c," ",d) } + } + catch(Exception e) + { + console.printLine:"AMB is angry" + }; - console readChar -] + console.readChar() +} diff --git a/Task/Amb/Haskell/amb.hs b/Task/Amb/Haskell/amb-1.hs similarity index 100% rename from Task/Amb/Haskell/amb.hs rename to Task/Amb/Haskell/amb-1.hs diff --git a/Task/Amb/Haskell/amb-2.hs b/Task/Amb/Haskell/amb-2.hs new file mode 100644 index 0000000000..6055604bd1 --- /dev/null +++ b/Task/Amb/Haskell/amb-2.hs @@ -0,0 +1,53 @@ +joins :: String -> String -> Bool +joins left right = last left == head right + +-- First desugaring (dropping the do notation) +-- in terms of the bind operator (>>=) for the list monad + +exampleBind :: String +exampleBind = + ["the", "that", "a"] >>= + (\w1 -> + ["frog", "elephant", "thing"] >>= + \w2 -> + ["walked", "treaded", "grows"] >>= + \w3 -> + ["slowly", "quickly"] >>= + (\w4 -> + if joins w1 w2 + then (if joins w2 w3 + then (if joins w3 w4 + then unwords [w1, w2, w3, w4] + else []) + else []) + else [])) + +-- Second desugaring (still dropping the do notation) +-- in terms of the concatMap, which is >>= with its arguments flipped + +exampleConcatMap :: String +exampleConcatMap = + concatMap + (\w1 -> + concatMap + (\w2 -> + concatMap + (\w3 -> + concatMap + (\w4 -> + if joins w1 w2 + then (if joins w2 w3 + then (if joins w3 w4 + then unwords [w1, w2, w3, w4] + else []) + else []) + else []) + ["slowly", "quickly"]) + ["walked", "treaded", "grows"]) + ["frog", "elephant", "thing"]) + ["the", "that", "a"] + +main :: IO () +main = do + print exampleBind + print exampleConcatMap diff --git a/Task/Amb/Haskell/amb-3.hs b/Task/Amb/Haskell/amb-3.hs new file mode 100644 index 0000000000..d6cc24e6fd --- /dev/null +++ b/Task/Amb/Haskell/amb-3.hs @@ -0,0 +1,22 @@ +example :: [String] +example = + ["the", "that", "a"] >>= + \w1 -> + when True ["frog", "elephant", "thing"] >>= + \w2 -> + when (joins w1 w2) ["walked", "treaded", "grows"] >>= + \w3 -> + when (joins w2 w3) ["slowly", "quickly"] >>= + \w4 -> when (joins w3 w4) [w1, w2, w3, w4] + +joins :: String -> String -> Bool +joins left right = last left == head right + +when :: Bool -> [a] -> [a] +when p xs = + if p + then xs + else [] + +main :: IO () +main = print $ unwords example diff --git a/Task/Amb/Haskell/amb-4.hs b/Task/Amb/Haskell/amb-4.hs new file mode 100644 index 0000000000..3ba1fd2117 --- /dev/null +++ b/Task/Amb/Haskell/amb-4.hs @@ -0,0 +1,16 @@ +joins :: String -> String -> Bool +joins left right = last left == head right + +example :: [String] +example = + [ unwords [w1, w2, w3, w4] + | w1 <- ["the", "that", "a"] + , w2 <- ["frog", "elephant", "thing"] + , w3 <- ["walked", "treaded", "grows"] + , w4 <- ["slowly", "quickly"] + , joins w1 w2 + , joins w2 w3 + , joins w3 w4 ] + +main :: IO () +main = print example diff --git a/Task/Amb/JavaScript/amb.js b/Task/Amb/JavaScript/amb-1.js similarity index 100% rename from Task/Amb/JavaScript/amb.js rename to Task/Amb/JavaScript/amb-1.js diff --git a/Task/Amb/JavaScript/amb-2.js b/Task/Amb/JavaScript/amb-2.js new file mode 100644 index 0000000000..cde1f561b1 --- /dev/null +++ b/Task/Amb/JavaScript/amb-2.js @@ -0,0 +1,55 @@ +(() => { + 'use strict'; + + // amb :: [a] -> (a -> [b]) -> [b] + const amb = xs => f => + xs.reduce((a, x) => a.concat(f(x)), []); + + // when :: Bool -> [a] -> [a] + const when = p => + xs => p ? ( + xs + ) : []; + + + // TEST ----------------------------------------------- + const main = () => { + + // joins :: String -> String -> Bool + const joins = (a, b) => + b[0] === last(a); + + console.log( + amb(['the', 'that', 'a']) + (w1 => when(true)( + + amb(['frog', 'elephant', 'thing']) + (w2 => when(joins(w1, w2))( + + amb(['walked', 'treaded', 'grows']) + (w3 => when(joins(w2, w3))( + + amb(['slowly', 'quickly']) + (w4 => when(joins(w3, w4))( + + unwords([w1, w2, w3, w4]) + + )) + )) + )) + )) + ); + }; + + // GENERIC FUNCTIONS ---------------------------------- + + // last :: [a] -> a + const last = xs => + 0 < xs.length ? xs.slice(-1)[0] : undefined; + + // unwords :: [String] -> String + const unwords = xs => xs.join(' '); + + // MAIN --- + return main(); +})(); diff --git a/Task/Amb/Python/amb.py b/Task/Amb/Python/amb-1.py similarity index 100% rename from Task/Amb/Python/amb.py rename to Task/Amb/Python/amb-1.py diff --git a/Task/Amb/Python/amb-2.py b/Task/Amb/Python/amb-2.py new file mode 100644 index 0000000000..58c3283785 --- /dev/null +++ b/Task/Amb/Python/amb-2.py @@ -0,0 +1,15 @@ +# joins :: String -> String -> Bool +def joins(a, b): + return a[-1] == b[0] + + +print ( + [ + ' '.join([w1, w2, w3, w4]) + for w1 in ['the', 'that', 'a'] + for w2 in ['frog', 'elephant', 'thing'] + for w3 in ['walked', 'treaded', 'grows'] + for w4 in ['slowly', 'quickly'] + if joins(w1, w2) and joins(w2, w3) and joins(w3, w4) + ] +) diff --git a/Task/Amb/Python/amb-3.py b/Task/Amb/Python/amb-3.py new file mode 100644 index 0000000000..b7c00fb188 --- /dev/null +++ b/Task/Amb/Python/amb-3.py @@ -0,0 +1,37 @@ +def main(): + print ( + unlines([ + unwords([w1, w2, w3, w4]) + + for w1 in ['the', 'that', 'a'] + if True + + for w2 in ['frog', 'elephant', 'thing'] + if joins(w1, w2) + + for w3 in ['walked', 'treaded', 'grows'] + if joins(w2, w3) + + for w4 in ['slowly', 'quickly'] + if joins(w3, w4) + ]) + ) + + +# joins :: String -> String -> Bool +def joins(a, b): + return a[-1] == b[0] + + +# unlines :: [String] -> String +def unlines(xs): + return '\n'.join(xs) + + +# unwords :: [String] -> String +def unwords(xs): + return ' '.join(xs) + + +if __name__ == '__main__': + main() diff --git a/Task/Amb/Python/amb-4.py b/Task/Amb/Python/amb-4.py new file mode 100644 index 0000000000..ec045a8ca8 --- /dev/null +++ b/Task/Amb/Python/amb-4.py @@ -0,0 +1,79 @@ +from itertools import chain + + +# amb :: [a] -> (a -> [b]) -> [b] +def amb(xs): + return lambda f: list( + chain.from_iterable( + map(f, xs) + ) + ) + + +# main :: IO () +def main(): + + xs = enumFromTo(1)(10) + print ('Pythagorean triples from integers 1-10:') + print ( + amb(xs)( + lambda x: amb(xs) + (lambda y: amb(xs) + (lambda z: when( + x * x + y * y == z * z + )( + (x, y, z) + ) + )) + ) + ) + + # joins :: String -> String -> Bool + def joins(a, b): + return a[-1] == b[0] + + print ('\nRC problem given above:') + print ( + amb(['the', 'that', 'a'])( + lambda w1: amb( + ['frog', 'elephant', 'thing'] + )(lambda w2: amb( + ['walked', 'treaded', 'grows'] + )(lambda w3: amb( + ['slowly', 'quickly'] + )(lambda w4: when( + joins(w1, w2) and joins(w2, w3) and joins(w3, w4) + )( + (w1, w2, w3, w4) + )))) + ) + ) + print('\nAdditional problem reference in procedural version above:') + print( + amb([1, 2, 3]) + ( + lambda x: amb([4, 5, 6]) + ( + lambda y: when(x * y != 8) + ( + (x, y) + ) + ) + ) + ) + +# GENERIC ------------------------------------------------- + + +# enumFromTo :: (Int, Int) -> [Int] +def enumFromTo(m): + return lambda n: list(range(m, 1 + n)) + + +# when :: Bool -> [a] -> [a] +def when(p): + return lambda x: [x] if p else [] + +# MAIN --- +if __name__ == '__main__': + main() diff --git a/Task/Amb/Python/amb-5.py b/Task/Amb/Python/amb-5.py new file mode 100644 index 0000000000..67f125afb2 --- /dev/null +++ b/Task/Amb/Python/amb-5.py @@ -0,0 +1,42 @@ +from itertools import chain + + +# amb :: [a] -> (a -> [b]) -> [b] +def amb(xs): + return lambda f: list( + chain.from_iterable( + map(f, xs) + ) + ) + + +# when :: Bool -> [a] -> [a] +def when(p): + return lambda xs: xs if p else [] + + +# TEST ---------------------------------------------------- + +# joins :: String -> String -> Bool +def joins(a, b): + return a[-1] == b[0] + + +print ( + amb(['the', 'that', 'a'])( + lambda w1: when(True) + + (amb(['frog', 'elephant', 'thing']) + (lambda w2: when(joins(w1, w2)) + + (amb(['walked', 'treaded', 'grows']) + (lambda w3: when(joins(w2, w3)) + + (amb(['slowly', 'quickly']) + (lambda w4: when(joins(w3, w4))( + + [w1, w2, w3, w4] + )))))) + ) + ) +) diff --git a/Task/Amb/REXX/amb-1.rexx b/Task/Amb/REXX/amb-1.rexx index 7b4a0231a7..2fc8d2aaac 100644 --- a/Task/Amb/REXX/amb-1.rexx +++ b/Task/Amb/REXX/amb-1.rexx @@ -1,22 +1,20 @@ /*REXX program demonstrates the Amd operator, choosing a word from each set. */ -@.=; @.1 = "the that a" - @.2 = "frog elephant thing" - @.3 = "walked treaded grows" - @.4 = "slowly quickly" + @.1 = "the that a" + @.2 = "frog elephant thing" + @.3 = "walked treaded grows" + @.4 = "slowly quickly" + @.0 = 4 /*define the number of sets being ised.*/ call Amb 1 /*find all word combinations that works*/ exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ -Amb: procedure expose @.; parse arg # x; arg . u /*ARG uppercases U values. */ - do j=1 until @.j=='' /*locate a null string. */ - end /*j*/ - t= j-1 /*define number of sets. */ - if #>t then do; y=word(u, 1) /*Y: is a uppercased U. */ - do n=2 to words(u); ?=word(u, n) - if left(?, 1) \== right(y, 1) then return; y=? - end /*n*/ - say space(x) /*¬show superfluous blanks.*/ - end - - do k=1 for words(@.#); call Amb #+1 x word(@.#, k) - end /*k*/ /* [↑] generate all combs */ - return /* recursively. */ +Amb: procedure expose @.; parse arg # x; arg . u /*ARG uppercases U value. */ + if #>@.0 then do; y= word(u, 1) /*Y: is a uppercased U. */ + do n=2 to words(u); ?= word(u, n) + if left(?, 1) \== right(y, 1) then return; y= ? + end /*n*/ + say strip(x) /*¬show superfluous blanks.*/ + end + /* [↓] generate all combos recursively*/ + do j=1 for words(@.#); call Amb #+1 x word(@.#, j) + end /*j*/ + return diff --git a/Task/Amicable-pairs/00META.yaml b/Task/Amicable-pairs/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/Amicable-pairs/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/Amicable-pairs/Ada/amicable-pairs.ada b/Task/Amicable-pairs/Ada/amicable-pairs.ada index 71563fcf06..fd196d5998 100644 --- a/Task/Amicable-pairs/Ada/amicable-pairs.ada +++ b/Task/Amicable-pairs/Ada/amicable-pairs.ada @@ -1,32 +1,20 @@ -with Ada.Text_IO; use Ada.Text_IO; +with Ada.Text_IO, Generic_Divisors; use Ada.Text_IO; -procedure Amicable is +procedure Amicable_Pairs is - function Sum_Of_Factors(Num : Integer) return Integer is - Sum : Integer := 1; - Test_Nr : Integer := 2; - begin - loop - if Num mod Test_Nr = 0 then - Sum := Sum + Test_Nr; - if Test_Nr * Test_Nr /= Num then - Sum := Sum + Num / Test_Nr; - end if; - end if; - Test_Nr := Test_Nr + 1; - exit when Test_Nr ** 2 > Num; - end loop; - return Sum; - end Sum_Of_Factors; + function Same(P: Positive) return Positive is (P); + + package Divisor_Sum is new Generic_Divisors + (Result_Type => Natural, None => 0, One => Same, Add => "+"); Num2 : Integer; begin for Num1 in 4 .. 20_000 loop - Num2 := Sum_Of_Factors(Num1); + Num2 := Divisor_Sum.Process(Num1); if Num1 < Num2 then - if Num1 = Sum_Of_Factors(Num2) then + if Num1 = Divisor_Sum.Process(Num2) then Put_Line(Integer'Image(Num1) & "," & Integer'Image(Num2)); end if; end if; end loop; -end Amicable; +end Amicable_Pairs; diff --git a/Task/Amicable-pairs/Elena/amicable-pairs-1.elena b/Task/Amicable-pairs/Elena/amicable-pairs-1.elena index ea7f3e6fe7..3f51512276 100644 --- a/Task/Amicable-pairs/Elena/amicable-pairs-1.elena +++ b/Task/Amicable-pairs/Elena/amicable-pairs-1.elena @@ -1,32 +1,37 @@ -import extensions. -import system'routines. -import system'math. +import extensions; +import system'routines; +import system'math; -const int Limit = 20000. +const int N = 20000; extension op { - properDivisors - = Range new(1,self / 2); filterBy(:n)(self mod:n == 0). + ProperDivisors + = Range.new(1,self / 2).filterBy:(n => self.mod:n == 0); - amicablePairs - [ - var divsums := Range new(0, self); selectBy(:i)(i properDivisors; summarize(Integer new)); toArray. + get AmicablePairs() + { + var divsums := Range + .new(0, self + 1) + .selectBy:(i => i.ProperDivisors.summarize(new Integer())) + .toArray(); - ^ 1 repeatTill(divsums length); - filterBy(:i) - [ - var sum := divsums[i]. - ^ (i < sum) && (sum < divsums length) && (divsums[sum] == i) - ]; - selectBy(:i)({ item1 = i. item2 = divsums[i]. }). - ] + ^ 1.repeatTill(divsums.Length) + .filterBy:(i) + { + var ii := i; + + var sum := divsums[i]; + ^ (i < sum) && (sum < divsums.Length) && (divsums[sum] == i) + } + .selectBy:(i => new:{ Item1 = i; Item2 = divsums[i]; }) + } } -public program = -[ - Limit amicablePairs; forEach(:pair) - [ - console printLine(pair item1, " ", pair item2). - ] -]. +public program() +{ + N.AmicablePairs.forEach:(pair) + { + console.printLine(pair.Item1, " ", pair.Item2) + } +} diff --git a/Task/Amicable-pairs/Elena/amicable-pairs-2.elena b/Task/Amicable-pairs/Elena/amicable-pairs-2.elena index 4244b052c8..ea80601dd3 100644 --- a/Task/Amicable-pairs/Elena/amicable-pairs-2.elena +++ b/Task/Amicable-pairs/Elena/amicable-pairs-2.elena @@ -1,33 +1,33 @@ -import extensions. -import system'routines'stex. -import system'math. -import system'collections. +import extensions; +import system'routines'stex; +import system'math; +import system'collections; -const int Limit = 20000. +const int N = 20000; -extension op +extension op : IntNumber { - properDivisors - = Range new(1,self / 2); filterBy(:n)(self mod:n == 0). + Enumerator ProperDivisors + = new Range(1,self / 2).filterBy:(int n => self.mod:n == 0); - amicablePairs - [ - auto divsums := List(Range new(0, self); selectBy(:i)(i properDivisors; summarize)). + get AmicablePairs() + { + auto divsums := new List(cast Enumerator(new Range(0, self).selectBy:(int i => i.ProperDivisors.summarize(0)))); - ^ Range from:1 till(divsums length); - filterBy(:i) - [ - var sum := divsums[i]. - ^ (i < sum) && (sum < divsums length) && (divsums[sum] == i) - ]; - selectBy(:i)>(Tuple(i,divsums[i])). - ] + ^ new Range(0, divsums.Length) + .filterBy:(int i) + { + auto sum := divsums[i]; + ^ (i < sum) && (sum < divsums.Length) && (divsums[sum] == i) + } + .selectBy:(int i => new Tuple(i,divsums[i])); + } } -public program -[ - Limit amicablePairs; forEach(:pair)> - [ - console printLine(pair item1, " ", pair item2). - ] -] +public program() +{ + N.AmicablePairs.forEach:(var Tuple pair) + { + console.printLine(pair.Item1, " ", pair.Item2) + } +} diff --git a/Task/Amicable-pairs/Frink/amicable-pairs.frink b/Task/Amicable-pairs/Frink/amicable-pairs.frink new file mode 100644 index 0000000000..3d13186079 --- /dev/null +++ b/Task/Amicable-pairs/Frink/amicable-pairs.frink @@ -0,0 +1,16 @@ +n = 1 +seen = new set + +do +{ + n = n + 1 + if seen.contains[n] + next + + sum = sum[allFactors[n, true, false, false]] + if sum != n and sum[allFactors[sum, true, false, false]] == n + { + println["$n, $sum"] + seen.put[sum] + } +} while n <= 20000 diff --git a/Task/Amicable-pairs/Perl-6/amicable-pairs.pl6 b/Task/Amicable-pairs/Perl-6/amicable-pairs.pl6 index e11694268f..8403e41869 100644 --- a/Task/Amicable-pairs/Perl-6/amicable-pairs.pl6 +++ b/Task/Amicable-pairs/Perl-6/amicable-pairs.pl6 @@ -1,12 +1,12 @@ sub propdivsum (\x) { - my @l = x > 1, gather for 2 .. x.sqrt.floor -> \d { - my \y = x div d; - if y * d == x { take d; take y unless y == d } + my @l = 1 if x > 1; + (2 .. x.sqrt.floor).map: -> \d { + unless x % d { @l.push: d; my \y = x div d; @l.push: y if y != d } } - [+] gather @l.deepmap(*.take); + sum @l } -for 1..20000 -> $i { +(1..20000).race.map: -> $i { my $j = propdivsum($i); say "$i $j" if $j > $i and $i == propdivsum($j); } diff --git a/Task/Amicable-pairs/PicoLisp/amicable-pairs.l b/Task/Amicable-pairs/PicoLisp/amicable-pairs.l index f54cb5f610..fad62bb8f6 100644 --- a/Task/Amicable-pairs/PicoLisp/amicable-pairs.l +++ b/Task/Amicable-pairs/PicoLisp/amicable-pairs.l @@ -3,6 +3,11 @@ (con @ (inc (cdr @))) (push Var (cons Key 1)) ) Key ) +(de **sum (L) + (let S 1 + (for I (cdr L) + (inc 'S (** (car L) I)) ) + S ) ) (de factor-sum (N) (if (=1 N) 0 @@ -20,12 +25,7 @@ (inc 'D (pop 'L)) ) ) (accud 'R N1) (for I R - (one D) - (one M) - (for J (cdr I) - (setq M (* M (car I))) - (inc 'D M) ) - (setq S (* S D)) ) + (setq S (* S (**sum I))) ) (- S N) ) ) ) (bench (for I 20000 diff --git a/Task/Amicable-pairs/Sidef/amicable-pairs.sidef b/Task/Amicable-pairs/Sidef/amicable-pairs.sidef index 06dc02f01c..8fe28c3eec 100644 --- a/Task/Amicable-pairs/Sidef/amicable-pairs.sidef +++ b/Task/Amicable-pairs/Sidef/amicable-pairs.sidef @@ -1,14 +1,8 @@ -func propdivsum(x) { - gather { - for d in (2 .. x.isqrt) { - if (d.divides(x)) { - take(d, x/d) - } - } - }.uniq.sum(x > 0 ? 1 : 0) +func propdivsum(n) { + n.sigma - n } -for i (1..20000) { +for i in (1..20000) { var j = propdivsum(i) say "#{i} #{j}" if (j>i && i==propdivsum(j)) } diff --git a/Task/Anagrams-Deranged-anagrams/00DESCRIPTION b/Task/Anagrams-Deranged-anagrams/00DESCRIPTION index e44b83f87a..2057482e1a 100644 --- a/Task/Anagrams-Deranged-anagrams/00DESCRIPTION +++ b/Task/Anagrams-Deranged-anagrams/00DESCRIPTION @@ -4,7 +4,7 @@ By analogy with [[Permutations/Derangements|derangements]] we define a ''derang {{task heading}} -Use the word list at [http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict] to find and display the longest deranged anagram. +Use the word list at [http://wiki.puzzlers.org/pub/wordlists/unixdict.txt unixdict] to find and display the longest deranged anagram. {{task heading|Related tasks}} diff --git a/Task/Anagrams-Deranged-anagrams/00META.yaml b/Task/Anagrams-Deranged-anagrams/00META.yaml new file mode 100644 index 0000000000..2fbf0ffd71 --- /dev/null +++ b/Task/Anagrams-Deranged-anagrams/00META.yaml @@ -0,0 +1 @@ +--- {} diff --git a/Task/Anagrams-Deranged-anagrams/Python/anagrams-deranged-anagrams-2.py b/Task/Anagrams-Deranged-anagrams/Python/anagrams-deranged-anagrams-2.py index 7103b05318..feeaf69d8b 100644 --- a/Task/Anagrams-Deranged-anagrams/Python/anagrams-deranged-anagrams-2.py +++ b/Task/Anagrams-Deranged-anagrams/Python/anagrams-deranged-anagrams-2.py @@ -1,25 +1,87 @@ -from itertools import izip, ifilter from collections import defaultdict +from itertools import combinations +from pathlib import Path +from typing import (Callable, + Dict, + Iterable, + Iterator, + List, + Optional, + Tuple, + TypeVar) + +WORDS_FILE = 'unixdict.txt' + +T1 = TypeVar('T1') +T2 = TypeVar('T2') -def find_deranged(words): - return [(w1, w2) for i, w1 in enumerate(words) - for w2 in words[i + 1:] - if all(a != b for a,b in izip(w1, w2))] def main(): - wclasses = [[] for _ in xrange(30)] - for word in open("unixdict.txt").read().split(): - wclasses[-len(word)].append(word) + words = read_words(Path(WORDS_FILE)) + anagram = longest_deranged_anagram(words) + if anagram: + print('The longest deranged anagram is: {}, {}'.format(*anagram)) + else: + print('No deranged anagrams were found') - print "Longest deranged anagrams:" - for words in ifilter(None, wclasses): - anags = defaultdict(list) - for w in words: - anags["".join(sorted(w))].append(w) - anas = (find_deranged(a) for a in anags.itervalues() if len(a)>1) - pairs = filter(None, anas) - if pairs: - print " %s, %s" % (pairs[0][0]) - break -main() +def read_words(path: Path) -> Iterator[str]: + """Yields words from file at specified path""" + with path.open() as file: + for word in file: + yield word.strip() + + +def longest_deranged_anagram(words: Iterable[str] + ) -> Optional[Tuple[str, str]]: + """ + Returns the longest pair of words + that have no character in the same position + """ + words_by_lengths = mapping_by_function(len, words) + decreasing_lengths = sorted(words_by_lengths, reverse=True) + for length in decreasing_lengths: + words = words_by_lengths[length] + anagrams_by_letters = mapping_by_function(sort_str, words) + for anagrams in anagrams_by_letters.values(): + deranged_pair = next(deranged_word_pairs(anagrams), None) + if deranged_pair is not None: + return deranged_pair + return None + + +def mapping_by_function(function: Callable[..., T2], + iterable: Iterable[T1]) -> Dict[T2, List[T1]]: + """ + Constructs a dictionary with keys + obtained from applying an input function + to items of an iterable, + and the values filled from the same iterable + """ + mapping = defaultdict(list) + for item in iterable: + mapping[function(item)].append(item) + return mapping + + +def sort_str(string: str) -> str: + """Sorts input string alphabetically""" + return ''.join(sorted(string)) + + +def deranged_word_pairs(words: Iterable[str]) -> Iterator[Tuple[str, str]]: + """Yields deranged words from an input list of words""" + pairs = combinations(words, 2) # type: Iterator[Tuple[str, str]] + yield from filter(is_deranged, pairs) + + +def is_deranged(word_pair: Tuple[str, str]) -> bool: + """ + Checks if all corresponding letters are different, + assuming that words have the same length + """ + return all(a != b for a, b in zip(*word_pair)) + + +if __name__ == '__main__': + main() diff --git a/Task/Anagrams-Deranged-anagrams/REXX/anagrams-deranged-anagrams.rexx b/Task/Anagrams-Deranged-anagrams/REXX/anagrams-deranged-anagrams.rexx index a34ddb1020..75c97d012d 100644 --- a/Task/Anagrams-Deranged-anagrams/REXX/anagrams-deranged-anagrams.rexx +++ b/Task/Anagrams-Deranged-anagrams/REXX/anagrams-deranged-anagrams.rexx @@ -1,41 +1,42 @@ /*REXX program finds the largest deranged word (within an identified dictionary). */ iFID= 'unixdict.txt'; words=0 /*input file ID; number of words so far*/ wL.=0 /*number of words of length L. so far*/ - do j=1 while lines(iFID)\==0 /*read each word in the file (word=X).*/ - x=space( linein( iFID), 0) /*pick off a word from the input line. */ - L=length(x); if L<3 then iterate /*onesies & twosies can't possible win.*/ - words= words + 1 /*bump the count of (useable) words. */ - #.words=L /*the length of the word found. */ - @.words=x /*save the word in an array. */ - wL.L=wL.L+1; _=wL.L /*bump counter of words of length L. */ + do while lines(iFID)\==0 /*read each word in the file (word=X).*/ + x= strip( linein( iFID) ) /*pick off a word from the input line. */ + L= length(x); if L<3 then iterate /*onesies & twosies can't possible win.*/ + words= words + 1 /*bump the count of (usable) words. */ + #.words= L /*the length of the word found. */ + @.words= x /*save the word in an array. */ + wL.L= wL.L+1; _= wL.L /*bump counter of words of length L. */ @@.L._= x /*array of words of length L. */ - /*sort the letters*/ do ja=1 for L; !.ja=substr(x, ja, 1); end /*ja*/ - !.0=L; call esort; z=; do jb=1 for L; z=z || !.jb; end /*jb*/ + do i=1 while x\==''; parse var x !.i +1 x; end /*i*/ + call eSort L; z=; do j=1 for L; z= z || !.j; end /*j*/ @@s.L._= z /*store the sorted word (letters). */ @s.words= @@s.L._ /*store the sorted length L version. */ - end /*j*/ + end /*while*/ a.= /*all the anagrams for word X. */ -say copies('─', 30) words 'words in the dictionary file: ' iFID -m=0; n.=0 /*# anagrams for word X; m=max L. */ +say copies('─', 30) words 'usable words in the dictionary file: ' iFID +m= 0; n.= 0 /*# anagrams for word X; m=max L. */ do j=1 for words /*process usable words that were found.*/ - x=@.j; Lx=#.j; xs=@s.j /*get some vital statistics for X */ - if m\==0 & Lx @.k then say @.k a.k - end /*k*/ /* [↑] REXX has no short-circuits. */ + do k=1 for words /*now, search all words for the maximum*/ + if #.k==m then if n.k\==0 then if word(a.k, 1) > @.k then say @.k a.k + end /*k*/ /* [↑] REXX has no short-circuits. */ exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ -esort: procedure expose !.; h=!.0; do while h>1; h=h%2; do i=1 for !.0-h; j=i; k=h+i +eSort: procedure expose !.; parse arg ho 1 h /*obtain number of elements; also copy.*/ + do while h>1; h=h % 2; do i=1 for ho-h; j= i; k= h+i do while !.k=j then leave; j=j-h; k=k-h - end /*while !.k1*/; return + end /*while !.k···*/; end /*i*/; end /*while h>1*/; return diff --git a/Task/Anagrams-Deranged-anagrams/Rust/anagrams-deranged-anagrams.rust b/Task/Anagrams-Deranged-anagrams/Rust/anagrams-deranged-anagrams.rust new file mode 100644 index 0000000000..cfebc84f0f --- /dev/null +++ b/Task/Anagrams-Deranged-anagrams/Rust/anagrams-deranged-anagrams.rust @@ -0,0 +1,75 @@ +//! Deranged anagrams +use std::cmp::Ordering; +use std::collections::HashMap; +use std::fs::File; +use std::io; +use std::io::BufReader; +use std::io::BufRead; +use std::usize::MAX; + +/// Get words from unix dictionary file +pub fn get_words() -> Result, io::Error> { + let mut words = vec!(); + // open file + let f = File::open("data/unixdict.txt")?; + // read line by line + let reader = BufReader::new(&f); + for line in reader.lines() { + words.push(line?) + } + Ok(words) +} + +/// Get the longest deranged anagram in the given list of word if any +pub fn longest_deranged(v: &mut Vec) -> Option<(String,String)>{ + // sort by length descending then by alphabetical order + v.sort_by(|s1, s2| { + let mut c = s2.len().cmp(&s1.len()); + if c == Ordering::Equal { + c = s1.cmp(s2); + } + c + }); + // keep all strings keyed by sorted characters (since anagrams have the same list of sorted characters) + let mut signatures : HashMap, Vec<&String>> = HashMap::new(); + // save on memory by only keeping in the map strings of the current processed length + let mut previous_length = MAX; + for s in v { + // length change, clear the map + if s.len()>(); + sorted_chars.sort(); + let anagrams = signatures.entry(sorted_chars).or_insert(vec!()); + // find if any anagram (string with the same sorted character vector) is deranged + if let Some(a) = anagrams.iter().filter(|anagram| is_deranged(anagram, s)).next(){ + return Some(((*a).clone(), s.clone())); + } + anagrams.push(s); + } + None +} + +/// check if two strings do NOT have the same character in the same position +pub fn is_deranged(s1: &String, s2: &String) -> bool { + // we zip the character iterators and check we find no position with the same two characters + s1.chars().zip(s2.chars()).filter(|(a,b)| a == b).next().is_none() +} + +/// an example main method printing the results +fn main() { + let r = get_words(); + match r { + Ok(mut v) => { + let od = longest_deranged(&mut v); + match od { + None => println!("No deranged anagrams found!"), + Some((s1,s2)) => println!("{} {}",s1,s2), + } + }, + Err(e) => panic!("Could not read words: {}",e) + } +} diff --git a/Task/Anagrams-Deranged-anagrams/Simula/anagrams-deranged-anagrams.simula b/Task/Anagrams-Deranged-anagrams/Simula/anagrams-deranged-anagrams.simula new file mode 100644 index 0000000000..a7c0555893 --- /dev/null +++ b/Task/Anagrams-Deranged-anagrams/Simula/anagrams-deranged-anagrams.simula @@ -0,0 +1,132 @@ +! cim --memory-pool-size=512 deranged-anagrams.sim; +BEGIN + + CLASS TEXTVECTOR; + BEGIN + + CLASS TEXTARRAY(N); INTEGER N; + BEGIN TEXT ARRAY DATA(1:N); + END TEXTARRAY; + + PROCEDURE EXPAND(N); INTEGER N; + BEGIN + INTEGER I; + REF(TEXTARRAY) TEMP; + TEMP :- NEW TEXTARRAY(N); + FOR I := 1 STEP 1 UNTIL SIZE DO + TEMP.DATA(I) :- ITEMS.DATA(I); + ITEMS :- TEMP; + END EXPAND; + + PROCEDURE APPEND(T); TEXT T; + BEGIN + IF SIZE + 1 > CAPACITY THEN + BEGIN + CAPACITY := 2 * CAPACITY; + EXPAND(CAPACITY); + END; + SIZE := SIZE + 1; + ITEMS.DATA(SIZE) :- T; + END APPEND; + + TEXT PROCEDURE ELEMENT(I); INTEGER I; + BEGIN + IF I < 1 OR I > SIZE THEN ERROR("ELEMENT: INDEX OUT OF BOUNDS"); + ELEMENT :- ITEMS.DATA(I); + END ELEMENT; + + INTEGER PROCEDURE FIND_INDEX(STR,INDEX); TEXT STR; INTEGER INDEX; + BEGIN + INTEGER I, FOUND; + FOUND := -1; + FOR I := INDEX STEP 1 UNTIL SIZE DO + IF STR = ELEMENT(I) THEN + BEGIN + FOUND := I; + GOTO L; + END; + L: FIND_INDEX := FOUND; + END FIND_INDEX; + + INTEGER CAPACITY; + INTEGER SIZE; + REF(TEXTARRAY) ITEMS; + + CAPACITY := 20; + SIZE := 0; + EXPAND(CAPACITY); + END TEXTVECTOR; + + BOOLEAN PROCEDURE DERANGE(S1,S2); TEXT S1,S2; + BEGIN + INTEGER I; + BOOLEAN RESULT; + RESULT := TRUE; + I := 1; + WHILE RESULT AND I <= S1.LENGTH DO + BEGIN + CHARACTER C1, C2; + S1.SETPOS(I); C1 := S1.GETCHAR; + S2.SETPOS(I); C2 := S2.GETCHAR; + IF C1 = C2 THEN + RESULT := FALSE + ELSE + I := I+1; + END; + DERANGE := RESULT; + END DERANGE; + + PROCEDURE STRSORT(STR); NAME STR; TEXT STR; + BEGIN + INTEGER N, I; + FOR N := STR.LENGTH STEP -1 UNTIL 2 DO + FOR I := 1 STEP 1 UNTIL N-1 DO + BEGIN + CHARACTER CI1,CI2; + STR.SETPOS(I); CI1 := STR.GETCHAR; CI2 := STR.GETCHAR; + IF CI1 > CI2 THEN + BEGIN + STR.SETPOS(I); STR.PUTCHAR(CI2); STR.PUTCHAR(CI1); + END; + END; + END STRSORT; + + REF(INFILE) FILE; + INTEGER LEN, FOUNDLEN; + REF(TEXTVECTOR) VECT, SVECT; + INTEGER INDEX, P1, P2; + TEXT STR; + + VECT :- NEW TEXTVECTOR; + SVECT :- NEW TEXTVECTOR; + FOUNDLEN := 1; + FILE :- NEW INFILE("unixdict.txt"); + FILE.OPEN(BLANKS(132)); + WHILE NOT FILE.LASTITEM DO + BEGIN + STR :- FILE.INTEXT(132).STRIP; + LEN := STR.LENGTH; + IF LEN > FOUNDLEN THEN + BEGIN + VECT.APPEND(COPY(STR)); + STRSORT(STR); + INDEX := 0; + COMMENT Loop through anagrams by index in vector of sorted strings; + INDEX := SVECT.FIND_INDEX(STR, INDEX + 1); + WHILE INDEX > 0 DO + BEGIN + IF DERANGE(VECT.ELEMENT(VECT.SIZE), VECT.ELEMENT(INDEX)) THEN + BEGIN + P1 := VECT.SIZE; + P2 := INDEX; + FOUNDLEN := LEN; + END IF; + INDEX := SVECT.FIND_INDEX(STR, INDEX + 1); + END WHILE; + SVECT.APPEND(STR); + END IF; + END WHILE; + FILE.CLOSE; + OUTTEXT(VECT.ELEMENT(P1) & " " & VECT.ELEMENT(P2)); + OUTIMAGE; +END diff --git a/Task/Anagrams/00DESCRIPTION b/Task/Anagrams/00DESCRIPTION index 76cec38222..14f97172e7 100644 --- a/Task/Anagrams/00DESCRIPTION +++ b/Task/Anagrams/00DESCRIPTION @@ -2,7 +2,7 @@ When two or more words are composed of the same characters, but in a different o {{task heading}} -Using the word list at   http://www.puzzlers.org/pub/wordlists/unixdict.txt, +Using the word list at   http://wiki.puzzlers.org/pub/wordlists/unixdict.txt,
find the sets of words that share the same characters that contain the most words in them. {{task heading|Related tasks}} diff --git a/Task/Anagrams/Elena/anagrams.elena b/Task/Anagrams/Elena/anagrams.elena index d88d5b0b09..f5f459d359 100644 --- a/Task/Anagrams/Elena/anagrams.elena +++ b/Task/Anagrams/Elena/anagrams.elena @@ -1,36 +1,37 @@ -import system'routines. -import system'io. -import system'collections. -import extensions. -import extensions'routines. -import extensions'text. +import system'routines; +import system'io; +import system'collections; +import extensions; +import extensions'routines; +import extensions'text; extension op { - T normalized - = self toArray; ascendant; summarize(StringWriter new). + string normalized() + = self.toArray().ascendant().summarize(new StringWriter()); } -public program -[ - auto aDictionary := Map(). - File new("unixdict.txt"); forEachLine(:aWord) - [ - var s := aWord. - var aKey := aWord normalized. - var anItem := aDictionary[aKey]. - if (nil == anItem) - [ - anItem := ArrayList new. - aDictionary[aKey] := anItem. - ]. +public program() +{ + auto dictionary := new Map(); - anItem append:aWord. - ]. + File.assign("unixdict.txt").forEachLine:(word) + { + var key := word.normalized(); + var item := dictionary[key]; + if (nil == item) + { + item := new ArrayList(); + dictionary[key] := item + }; - aDictionary values; - sort(:aFormer:aLater)( aFormer item2; length > aLater item2; length ); - top:20; forEach(:aPair)[ console printLine(aPair item2) ]. + item.append:word + }; - console readChar -] + dictionary.Values + .sort:(former,later => former.Item2.Length > later.Item2.Length ) + .top:20 + .forEach:(pair){ console.printLine(pair.Item2) }; + + console.readChar() +} diff --git a/Task/Anagrams/Perl/anagrams-1.pl b/Task/Anagrams/Perl/anagrams-1.pl index 7dbf4662aa..cac4f853cd 100644 --- a/Task/Anagrams/Perl/anagrams-1.pl +++ b/Task/Anagrams/Perl/anagrams-1.pl @@ -1,15 +1,12 @@ -use LWP::Simple; -use List::Util qw(max); +use List::Util 'max'; -my @words = split(' ', get('http://www.puzzlers.org/pub/wordlists/unixdict.txt')); +my @words = split "\n", do { local( @ARGV, $/ ) = ( 'unixdict.txt' ); <> }; my %anagram; -foreach my $word (@words) { - push @{ $anagram{join('', sort(split(//, $word)))} }, $word; +for my $word (@words) { + push @{ $anagram{join '', sort split '', $word} }, $word; } my $count = max(map {scalar @$_} values %anagram); -foreach my $ana (values %anagram) { - if (@$ana >= $count) { - print "@$ana\n"; - } +for my $ana (values %anagram) { + print "@$ana\n" if @$ana == $count; } diff --git a/Task/Anagrams/Perl/anagrams-2.pl b/Task/Anagrams/Perl/anagrams-2.pl index b13e1a79eb..4ee447a858 100644 --- a/Task/Anagrams/Perl/anagrams-2.pl +++ b/Task/Anagrams/Perl/anagrams-2.pl @@ -1,7 +1,3 @@ -use LWP::Simple; - -for (split ' ' => get 'http://www.puzzlers.org/pub/wordlists/unixdict.txt') - {push @{$anagram{ join '' => sort split // }}, $_} - +push @{$anagram{ join '' => sort split '' }}, $_ for @words; $max > @$_ or $max = @$_ for values %anagram; -@$_ >= $max and print "@$_\n" for values %anagram; +@$_ == $max and print "@$_\n" for values %anagram; diff --git a/Task/Anagrams/PowerShell/anagrams.psh b/Task/Anagrams/PowerShell/anagrams-1.psh similarity index 80% rename from Task/Anagrams/PowerShell/anagrams.psh rename to Task/Anagrams/PowerShell/anagrams-1.psh index ecfca585de..7c34eca13d 100644 --- a/Task/Anagrams/PowerShell/anagrams.psh +++ b/Task/Anagrams/PowerShell/anagrams-1.psh @@ -1,5 +1,5 @@ $c = New-Object Net.WebClient -$words = -split ($c.DownloadString('http://www.puzzlers.org/pub/wordlists/unixdict.txt')) +$words = -split ($c.DownloadString('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt')) $top_anagrams = $words ` | ForEach-Object { $_ | Add-Member -PassThru NoteProperty Characters ` diff --git a/Task/Anagrams/PowerShell/anagrams-2.psh b/Task/Anagrams/PowerShell/anagrams-2.psh new file mode 100644 index 0000000000..b44dafcbba --- /dev/null +++ b/Task/Anagrams/PowerShell/anagrams-2.psh @@ -0,0 +1,43 @@ +$Timer = [System.Diagnostics.Stopwatch]::StartNew() + +$uri = 'http://wiki.puzzlers.org/pub/wordlists/unixdict.txt' +$words = -split [Net.WebClient]::new().DownloadString($uri) + +$anagrams = @{} +$maxAnagramCount = 0 + +foreach ($w in $words) +{ + # Sort the characters in the word into alphabetical order + $chars=[char[]]$w + [array]::sort($chars) + $orderedChars = [string]::Join('', $chars) + + + # If no anagrams list for these chars, make one + if (-not $anagrams.ContainsKey($orderedChars)) + { + $anagrams[$orderedChars] = [Collections.Generic.List[String]]::new() + } + + + # Add current word as an anagram of these chars, + # in a way which keeps the list available + ($list = $anagrams[$orderedChars]).Add($w) + + + # Keep running score of max number of anagrams seen + if ($list.Count -gt $maxAnagramCount) + { + $maxAnagramCount = $list.Count + } + +} + +foreach ($entry in $anagrams.GetEnumerator()) +{ + if ($entry.Value.Count -eq $maxAnagramCount) + { + [string]::join('', $entry.Value) + } +} diff --git a/Task/Anagrams/Processing/anagrams b/Task/Anagrams/Processing/anagrams new file mode 100644 index 0000000000..cca7c03988 --- /dev/null +++ b/Task/Anagrams/Processing/anagrams @@ -0,0 +1,26 @@ +import java.util.Map; + +void setup() { + String[] words = loadStrings("http://wiki.puzzlers.org/pub/wordlists/unixdict.txt"); + topAnagrams(words); +} + +void topAnagrams (String[] words){ + HashMap anagrams = new HashMap(); + int maxcount = 0; + for (String word : words) { + char[] chars = word.toCharArray(); + chars = sort(chars); + String key = new String(chars); + if (!anagrams.containsKey(key)) { + anagrams.put(key, new StringList()); + } + anagrams.get(key).append(word); + maxcount = max(maxcount, anagrams.get(key).size()); + } + for (StringList ana : anagrams.values()) { + if (ana.size() >= maxcount) { + println(ana); + } + } +} diff --git a/Task/Anagrams/Python/anagrams-4.py b/Task/Anagrams/Python/anagrams-4.py new file mode 100644 index 0000000000..e0581d58ee --- /dev/null +++ b/Task/Anagrams/Python/anagrams-4.py @@ -0,0 +1,111 @@ +'''Largest anagram groups found in list of words.''' + +from os.path import expanduser +from itertools import groupby +from operator import eq + + +# main :: IO () +def main(): + '''Largest anagram groups in local unixdict.txt''' + + print(unlines( + largestAnagramGroups( + lines(readFile('unixdict.txt')) + ) + )) + + +# largestAnagramGroups :: [String] -> [[String]] +def largestAnagramGroups(ws): + '''A list of the anagram groups of + of the largest size found in a + given list of words. + ''' + + # wordChars :: String -> (String, String) + def wordChars(w): + '''A word paired with its + AZ sorted characters + ''' + return (''.join(sorted(w)), w) + + groups = list(map( + compose(list)(snd), + groupby( + sorted( + map(wordChars, ws), + key=fst + ), + key=fst + ) + )) + + intMax = max(map(len, groups)) + return list(map( + compose(unwords)(curry(map)(snd)), + filter(compose(curry(eq)(intMax))(len), groups) + )) + + +# GENERIC ------------------------------------------------- + +# compose (<<<) :: (b -> c) -> (a -> b) -> a -> c +def compose(g): + '''Right to left function composition.''' + return lambda f: lambda x: g(f(x)) + + +# curry :: ((a, b) -> c) -> a -> b -> c +def curry(f): + '''A curried function derived + from an uncurried function.''' + return lambda a: lambda b: f(a, b) + + +# fst :: (a, b) -> a +def fst(tpl): + '''First member of a pair.''' + return tpl[0] + + +# lines :: String -> [String] +def lines(s): + '''A list of strings, + (containing no newline characters) + derived from a single new-line delimited string.''' + return s.splitlines() + + +# from os.path import expanduser +# readFile :: FilePath -> IO String +def readFile(fp): + '''The contents of any file at the path + derived by expanding any ~ in fp.''' + with open(expanduser(fp), 'r', encoding='utf-8') as f: + return f.read() + + +# snd :: (a, b) -> b +def snd(tpl): + '''Second member of a pair.''' + return tpl[1] + + +# unlines :: [String] -> String +def unlines(xs): + '''A single string derived by the intercalation + of a list of strings with the newline character.''' + return '\n'.join(xs) + + +# unwords :: [String] -> String +def unwords(xs): + '''A space-separated string derived from + a list of words.''' + return ' '.join(xs) + + +# MAIN --- +if __name__ == '__main__': + main() diff --git a/Task/Animate-a-pendulum/BASIC/animate-a-pendulum-4.basic b/Task/Animate-a-pendulum/BASIC/animate-a-pendulum-4.basic new file mode 100644 index 0000000000..32d2bae12f --- /dev/null +++ b/Task/Animate-a-pendulum/BASIC/animate-a-pendulum-4.basic @@ -0,0 +1,55 @@ +100 PROGRAM "Pendulum.bas" +110 LET THETA=RAD(50):LET G=9.81:LET L=.5 +120 CALL INIC +130 CALL DRAWING +140 CALL ANIMATE +150 CALL RESET +160 END +170 DEF INIC +180 CLOSE #102 +190 OPTION ANGLE RADIANS +200 SET STATUS OFF:SET INTERRUPT STOP OFF:SET BORDER 56 +210 SET VIDEO MODE 1:SET VIDEO COLOR 1:SET VIDEO X 14:SET VIDEO Y 8 +220 FOR I=1 TO 24 +230 OPEN #I:"video:" +240 SET #I:PALETTE 56,0,255,YELLOW +250 NEXT +260 END DEF +270 DEF DRAWING +280 LET SPD=0 +290 FOR I=1 TO 24 +300 DISPLAY #I:AT 3 FROM 1 TO 8 +310 SET #I:INK 2 +320 PLOT #I:224,280,ELLIPSE 10,10 +330 PLOT #I:0,280;214,280,234,280;446,280 +340 SET #I:INK 1 +350 CALL PENDULUM(THETA,L,I) +360 LET ACC=-G*SIN(THETA)/L/100 +370 LET SPD=SPD+ACC/10.5 +380 LET THETA=THETA+SPD +390 NEXT +400 END DEF +410 DEF PENDULUM(A,L,CH) +420 LET PX=224:LET PY=280 +430 LET BX=PX+L*460*SIN(A) +440 LET BY=PY-L*460*COS(A) +450 PLOT #CH:PX,PY;BX,BY +460 PLOT #CH:BX+24*SIN(A),BY-24*COS(A),ELLIPSE 20,20, +470 SET #CH:INK 3:PLOT #CH:PAINT +480 END DEF +490 DEF ANIMATE +500 DO +510 FOR I=1 TO 24 +520 DISPLAY #I:AT 3 FROM 1 TO 8 +530 NEXT +540 FOR I=23 TO 2 STEP-1 +550 DISPLAY #I:AT 3 FROM 1 TO 8 +560 NEXT +570 LOOP UNTIL INKEY$=CHR$(27) +580 END DEF +590 DEF RESET +600 TEXT 40:SET STATUS ON:SET INTERRUPT STOP ON:SET BORDER 0 +610 FOR I=24 TO 1 STEP-1 +620 CLOSE #I +630 NEXT +640 END DEF diff --git a/Task/Animate-a-pendulum/Julia/animate-a-pendulum.julia b/Task/Animate-a-pendulum/Julia/animate-a-pendulum.julia index dc58567eb3..4ab4c805d2 100644 --- a/Task/Animate-a-pendulum/Julia/animate-a-pendulum.julia +++ b/Task/Animate-a-pendulum/Julia/animate-a-pendulum.julia @@ -10,7 +10,7 @@ const framerate = 50.0 # intended frame rate/sec const t0 = 0.0 # start time (s) const tf = 2.3 # end simulation time (s) const dtframe = 1.0/framerate # time increment per frame -const tspan = linspace(t0, tf, Int(floor(tf*framerate))) # array of time points in animation +const tspan = LinRange(t0, tf, Int(floor(tf*framerate))) # array of time points in animation const bgcolor = "black" # gif background const leaderhue = (0.80, 0.70, 0.20) # gif swing arm hue light gold @@ -19,9 +19,9 @@ const hslcolors = [HSL(col) for col in (distinguishable_colors( const giffilename = "pendulum.gif" # output file # differential equations -simplependulum(t,u,du) = (θ=u[1]; dθ=u[2]; du[1]=dθ; du[2]=-(g/L)*sin(θ)) -bc2(residual, ua, ub) = (residual[1] = ua[1] + pi/2; residual[2] = ub[1] + pi/2) -bvp2 = TwoPointBVProblem(simplependulum, bc2, [pi/2,pi/2], (tspan[1],tspan[end])) +simplependulum(du, u, p, t) = (θ=u[1]; dθ=u[2]; du[1]=dθ; du[2]=-(g/L)*sin(θ)) +bc2(residual, u, p, t) = (residual[1] = u[end÷2][1] + pi/2; residual[2] = u[end][1] - pi/2) +bvp2 = BVProblem(simplependulum, bc2, [pi/2,pi/2], (tspan[1],tspan[end])) sol2 = solve(bvp2, MIRK4(), dt=dtframe) # use the MIRK4 solver for TwoPointBVProblem # movie making background diff --git a/Task/Animate-a-pendulum/Perl-6/animate-a-pendulum.pl6 b/Task/Animate-a-pendulum/Perl-6/animate-a-pendulum.pl6 new file mode 100644 index 0000000000..eb9673c843 --- /dev/null +++ b/Task/Animate-a-pendulum/Perl-6/animate-a-pendulum.pl6 @@ -0,0 +1,90 @@ +use SDL2::Raw; +use Cairo; + +my $width = 1000; +my $height = 400; + +SDL_Init(VIDEO); + +my $window = SDL_CreateWindow( + 'Pendulum - Perl 6', + SDL_WINDOWPOS_CENTERED_MASK, + SDL_WINDOWPOS_CENTERED_MASK, + $width, $height, RESIZABLE +); + +my $render = SDL_CreateRenderer($window, -1, ACCELERATED +| PRESENTVSYNC); + +my $bob = Cairo::Image.create( Cairo::FORMAT_ARGB32, 32, 32 ); +given Cairo::Context.new($bob) { + my Cairo::Pattern::Gradient::Radial $sphere .= + create(13.3, 12.8, 3.2, 12.8, 12.8, 32); + $sphere.add_color_stop_rgba(0, 1, 1, .698, 1); + $sphere.add_color_stop_rgba(1, .623, .669, .144, 1); + .pattern($sphere); + .arc(16, 16, 15, 0, 2 * pi); + .fill; + $sphere.destroy; +} + +my $bob_texture = SDL_CreateTexture( + $render, %PIXELFORMAT, + STATIC, 32, 32 +); + +SDL_UpdateTexture( + $bob_texture, + SDL_Rect.new(:x(0), :y(0), :w(32), :h(32)), + $bob.data, $bob.stride // 32 +); + +SDL_SetTextureBlendMode($bob_texture, 1); + +SDL_SetRenderDrawBlendMode($render, 1); + +my $event = SDL_Event.new; + +my $now = now; # time +my $Θ = -π/3; # start angle +my $ppi = 500; # scale +my $g = -9.81; # accelaration of gravity +my $ax = $width/2; # anchor x +my $ay = 25; # anchor y +my $len = $height - 75; # 'rope' length +my $vel; # velocity +my $dt; # delta time + +main: loop { + while SDL_PollEvent($event) { + my $casted_event = SDL_CastEvent($event); + given $casted_event { + when *.type == QUIT { last main } + when *.type == WINDOWEVENT { + if .event == 5 { + $width = .data1; + $height = .data2; + $ax = $width/2; + $len = $height - 75; + } + } + } + } + + $dt = now - $now; + $now = now; + $vel += $g / $len * sin($Θ) * $ppi * $dt; + $Θ += $vel * $dt; + my $bx = $ax + sin($Θ) * $len; + my $by = $ay + cos($Θ) * $len; + + SDL_SetRenderDrawColor($render, 255, 255, 255, 255); + SDL_RenderDrawLine($render, |($ax, $ay, $bx, $by)».round); + SDL_RenderCopy( $render, $bob_texture, Nil, + SDL_Rect.new($bx - 16, $by - 16, 32, 32) + ); + SDL_RenderPresent($render); + SDL_SetRenderDrawColor($render, 0, 0, 0, 0); + SDL_RenderClear($render); +} + +SDL_Quit(); diff --git a/Task/Animate-a-pendulum/Phix/animate-a-pendulum.phix b/Task/Animate-a-pendulum/Phix/animate-a-pendulum.phix index f51ffcb0dc..f2cc7e9b13 100644 --- a/Task/Animate-a-pendulum/Phix/animate-a-pendulum.phix +++ b/Task/Animate-a-pendulum/Phix/animate-a-pendulum.phix @@ -1,7 +1,4 @@ --- -- demo\rosetta\animate_pendulum2.exw --- ================================== --- include pGUI.e Ihandle dlg, canvas, timer diff --git a/Task/Animate-a-pendulum/Scala/animate-a-pendulum.scala b/Task/Animate-a-pendulum/Scala/animate-a-pendulum.scala index 1d4bd3ba7c..e5f1e38b84 100644 --- a/Task/Animate-a-pendulum/Scala/animate-a-pendulum.scala +++ b/Task/Animate-a-pendulum/Scala/animate-a-pendulum.scala @@ -1,34 +1,22 @@ import java.awt.Color -import scala.actors.Actor -import scala.swing.{ Graphics2D, MainFrame, Panel, SimpleSwingApplication } +import java.util.concurrent.{Executors, TimeUnit} + +import scala.swing.{Graphics2D, MainFrame, Panel, SimpleSwingApplication} import scala.swing.Swing.pair2Dimension object Pendulum extends SimpleSwingApplication { val length = 100 lazy val ui = new Panel { - import scala.math.{ cos, Pi, sin } + import scala.math.{cos, Pi, sin} + background = Color.white preferredSize = (2 * length + 50, length / 2 * 3) peer.setDoubleBuffered(true) var angle: Double = Pi / 2 - def pendular = new Actor { - var angleVelocity = 0.0 - val dt = 0.1 - - def act() { - while (true) { - angleVelocity += (-9.81 / length * sin(angle)) * dt - angle += angleVelocity * dt - repaint() - Thread.sleep(15) - } - } - } - - override def paintComponent(g: Graphics2D) = { + override def paintComponent(g: Graphics2D): Unit = { super.paintComponent(g) val (anchorX, anchorY) = (size.width / 2, size.height / 4) @@ -43,12 +31,25 @@ object Pendulum extends SimpleSwingApplication { g.setColor(Color.yellow) g.fillOval(ballX - 7, ballY - 7, 14, 14) } + + val animate: Runnable = new Runnable { + var angleVelocity = 0.0 + var dt = 0.1 + + override def run(): Unit = { + angleVelocity += -9.81 / length * Math.sin(angle) * dt + angle += angleVelocity * dt + repaint() + } + } } - def top = new MainFrame { + override def top = new MainFrame { title = "Rosetta Code >>> Task: Animate a pendulum | Language: Scala" contents = ui - centerOnScreen - ui.pendular.start + centerOnScreen() + Executors. + newSingleThreadScheduledExecutor(). + scheduleAtFixedRate(ui.animate, 0, 15, TimeUnit.MILLISECONDS) } } diff --git a/Task/Animation/Perl-6/animation.pl6 b/Task/Animation/Perl-6/animation.pl6 new file mode 100644 index 0000000000..ebcd6a8e37 --- /dev/null +++ b/Task/Animation/Perl-6/animation.pl6 @@ -0,0 +1,19 @@ +use v6; + +use GTK::Simple; +use GTK::Simple::App; + +my $app = GTK::Simple::App.new(:title); +my $button = GTK::Simple::Button.new(label => 'Hello World! '); +my $vbox = GTK::Simple::VBox.new($button); + +my $repeat = $app.g-timeout(100); # milliseconds + +my $dir = 1; +$button.clicked.tap({ $dir *= -1 }); + +$repeat.tap( &{$button.label = $button.label.comb.List.rotate($dir).join} ); + +$app.set-content($vbox); + +$app.run; diff --git a/Task/Animation/Perl/animation.pl b/Task/Animation/Perl/animation.pl index 533912f4d0..561e66b0e7 100644 --- a/Task/Animation/Perl/animation.pl +++ b/Task/Animation/Perl/animation.pl @@ -1,11 +1,27 @@ -use XUL::Gui; +use Tk; +use Time::HiRes qw(sleep); -my $dir = '(.+)(.)'; -interval { - ID(lbl)->value =~ s/$dir/$2$1/; -} 75; +my $msg = 'Hello World! '; +my $first = '.+'; +my $second = '.'; -display Label - id => 'lbl', - value => "Hello World! ", - onclick => sub {toggle $dir => '(.+)(.)', '(.)(.+)'}; +my $mw = Tk::MainWindow->new(-title => 'Animated side-scroller',-bg=>"white"); +$mw->geometry ("400x150+0+0"); + +$mw->optionAdd('*Label.font', 'Courier 24 bold' ); + +my $scroller = $mw->Label(-text => "$msg")->grid(-row=>0,-column=>0); +$mw->bind('all'=> '' => sub {exit;}); +$mw->bind("