Family Day update

Lang/APL/Increment-a-numerical-string

@@ -0,0 +1 @@
+../../Task/Increment-a-numerical-string/APL

Lang/AWK/Carmichael-3-strong-pseudoprimes

@@ -0,0 +1 @@
+../../Task/Carmichael-3-strong-pseudoprimes/AWK

Lang/AWK/Circles-of-given-radius-through-two-points

@@ -0,0 +1 @@
+../../Task/Circles-of-given-radius-through-two-points/AWK

Lang/AWK/Colour-bars-Display

@@ -0,0 +1 @@
+../../Task/Colour-bars-Display/AWK

Lang/AWK/Dynamic-variable-names

@@ -0,0 +1 @@
+../../Task/Dynamic-variable-names/AWK

Lang/AWK/Gray-code

@@ -0,0 +1 @@
+../../Task/Gray-code/AWK

Lang/AWK/Greyscale-bars-Display

@@ -0,0 +1 @@
+../../Task/Greyscale-bars-Display/AWK

Lang/AWK/Keyboard-input-Flush-the-keyboard-buffer

@@ -0,0 +1 @@
+../../Task/Keyboard-input-Flush-the-keyboard-buffer/AWK

Lang/AWK/Keyboard-input-Keypress-check

@@ -0,0 +1 @@
+../../Task/Keyboard-input-Keypress-check/AWK

Lang/AWK/Left-factorials

@@ -0,0 +1 @@
+../../Task/Left-factorials/AWK

Lang/AWK/Maximum-triangle-path-sum

@@ -0,0 +1 @@
+../../Task/Maximum-triangle-path-sum/AWK

Lang/AWK/Permutation-test

@@ -0,0 +1 @@
+../../Task/Permutation-test/AWK

Lang/AWK/Permutations

@@ -0,0 +1 @@
+../../Task/Permutations/AWK

Lang/AWK/Pythagorean-triples

@@ -0,0 +1 @@
+../../Task/Pythagorean-triples/AWK

Lang/AWK/Sudoku

@@ -0,0 +1 @@
+../../Task/Sudoku/AWK

Lang/Ada/AKS-test-for-primes

@@ -0,0 +1 @@
+../../Task/AKS-test-for-primes/Ada

Lang/Ada/Brownian-tree

@@ -0,0 +1 @@
+../../Task/Brownian-tree/Ada

Lang/Ada/Colour-bars-Display

@@ -0,0 +1 @@
+../../Task/Colour-bars-Display/Ada

Lang/Ada/Colour-pinstripe-Display

@@ -0,0 +1 @@
+../../Task/Colour-pinstripe-Display/Ada

Lang/Ada/Death-Star

@@ -0,0 +1 @@
+../../Task/Death-Star/Ada

Lang/Ada/Draw-a-clock

@@ -0,0 +1 @@
+../../Task/Draw-a-clock/Ada

Lang/Ada/Fractal-tree

@@ -0,0 +1 @@
+../../Task/Fractal-tree/Ada

Lang/Ada/Gaussian-elimination

@@ -0,0 +1 @@
+../../Task/Gaussian-elimination/Ada

Lang/Ada/Hickerson-series-of-almost-integers

@@ -0,0 +1 @@
+../../Task/Hickerson-series-of-almost-integers/Ada

Lang/Ada/Honeycombs

@@ -0,0 +1 @@
+../../Task/Honeycombs/Ada

Lang/Ada/Iterated-digits-squaring

@@ -0,0 +1 @@
+../../Task/Iterated-digits-squaring/Ada

Lang/Ada/Ludic-numbers

@@ -0,0 +1 @@
+../../Task/Ludic-numbers/Ada

Lang/Ada/MD4

@@ -0,0 +1 @@
+../../Task/MD4/Ada

Lang/Ada/Pinstripe-Display

@@ -0,0 +1 @@
+../../Task/Pinstripe-Display/Ada

Lang/Ada/RIPEMD-160

@@ -0,0 +1 @@
+../../Task/RIPEMD-160/Ada

Lang/Ada/SHA-256

@@ -0,0 +1 @@
+../../Task/SHA-256/Ada

Lang/Batch-File/Sorting-algorithms-Pancake-sort

@@ -0,0 +1 @@
+../../Task/Sorting-algorithms-Pancake-sort/Batch-File

Lang/Binary-Lambda-Calculus/Quine

@@ -0,0 +1 @@
+../../Task/Quine/Binary-Lambda-Calculus

Lang/Bracmat/Function-composition

@@ -0,0 +1 @@
+../../Task/Function-composition/Bracmat

Lang/Bracmat/Quine

@@ -0,0 +1 @@
+../../Task/Quine/Bracmat

Lang/C++/00DESCRIPTION

@@ -24,8 +24,8 @@ If you can't find an implementation for your task in the C++ category below, ple
 * '''TR1''' (Technical Report 1) is a proposal for extensions to the C++ standard library. It was published in 2007. Many of its proposals made it into C++11. Many compilers support it, but put its headers in a different directory.
 * '''C++11''' (formerly called '''C++0x''' and sometimes '''C++1x''') is a significant improvement, adding many new language features and libraries. It was standardized by ISO in 2011. Most of its features are available in [[GCC]] [http://gcc.gnu.org/projects/cxx0x.html] and [[Clang]] [http://clang.llvm.org/cxx_status.html].
 * '''C++14''' (formerly called '''C++1y''') is a minor improvement to C++11, standardized by ISO in 2014. Most of its features are available in [[Clang]] [http://clang.llvm.org/cxx_status.html] and [[GCC]] [http://gcc.gnu.org/projects/cxx1y.html].
-* '''C++17''' (formerly called '''C++1z''') is a minor improvement to C++14, standardized by ISO in 2017. Most of its features are already available in [[Clang]] [http://clang.llvm.org/cxx_status.html] and [[GCC]] [https://gcc.gnu.org/projects/cxx-status.html#cxx17].
-* '''C++2a''' ('''C++20 ''' unofficially) is a major upcoming improvement to C++17 first drafted in July 2017. What proposed features it will have is currently partially implemented by [[Clang]] [http://clang.llvm.org/cxx_status.html] and [[GCC]] [https://gcc.gnu.org/projects/cxx-status.html#tses]
+* '''C++17''' (formerly called '''C++1z''') is a minor improvement to C++14, standardized by ISO in 2017. Most of its features are available in [[Clang]] [http://clang.llvm.org/cxx_status.html] and [[GCC]] [https://gcc.gnu.org/projects/cxx-status.html#cxx17].
+* '''C++20''' (formerly called '''C++2a''') is a major upcoming improvement to C++17 first drafted in July 2017. What proposed features it will have is currently partially implemented by [[Clang]] [http://clang.llvm.org/cxx_status.html] and [[GCC]] [https://gcc.gnu.org/projects/cxx-status.html#tses]
 
 {{language programming paradigm|Imperative}}
 {{language programming paradigm|Object-oriented}}

Lang/C++/K-d-tree

@@ -0,0 +1 @@
+../../Task/K-d-tree/C++

Lang/C++/Parse-an-IP-Address

@@ -0,0 +1 @@
+../../Task/Parse-an-IP-Address/C++

Lang/C++/Truncatable-primes

@@ -0,0 +1 @@
+../../Task/Truncatable-primes/C++

Lang/C-sharp/Define-a-primitive-data-type

@@ -0,0 +1 @@
+../../Task/Define-a-primitive-data-type/C-sharp

Lang/C-sharp/Enforced-immutability

@@ -0,0 +1 @@
+../../Task/Enforced-immutability/C-sharp

Lang/C-sharp/Set-puzzle

@@ -0,0 +1 @@
+../../Task/Set-puzzle/C-sharp

Lang/C-sharp/Universal-Turing-machine

@@ -0,0 +1 @@
+../../Task/Universal-Turing-machine/C-sharp

Lang/C-sharp/Y-combinator

@@ -0,0 +1 @@
+../../Task/Y-combinator/C-sharp

Lang/C/00DESCRIPTION

@@ -22,7 +22,9 @@ C has since spread to many other [[:Category:Platforms|platforms]], and is now o
 * '''C89''' (often called '''[[ANSI]] C''') is the version of C standardized by ANSI in 1989. It is the most commonly used and supported version of the language.
 * '''C90''' (often called '''[[ISO]] C''') is identical to C89, republished by ISO in 1990. 
 * '''C99''' is a significant improvement, adopting many features of [[C++]] and standardizing common compiler extensions. It was standardized by ISO in 1999, and by ANSI in 2000. It is primarily supported by commercial C compilers, but most of its features are available in [[Clang]] [[GCC]]. [http://gcc.gnu.org/c99status.html]
-* '''C11''' is the current standard, published in December 2011. It is the default for [[GCC]] as of version 5.1.
+* '''C11''' is the previous standard, published in December 2011. It is the default for [[GCC]] as of version 5.1.
+* '''C18''' is the current standard, published in June 2018. It is the default for [[GCC]] as of version 8.1.
+* '''C2x''' is the upcoming standard, planned for a 2021 publication. [[GCC]] 9 and [[Clang]] 9 have preliminary support for it.
 
 ==Citation==
 *[[wp:C_%28programming_language%29|Wikipedia:C (programming language)]]

Lang/C/Balanced-ternary

@@ -0,0 +1 @@
+../../Task/Balanced-ternary/C

Lang/C/Call-a-foreign-language-function

@@ -0,0 +1 @@
+../../Task/Call-a-foreign-language-function/C

Lang/C/Call-an-object-method

@@ -0,0 +1 @@
+../../Task/Call-an-object-method/C

Lang/C/Casting-out-nines

@@ -0,0 +1 @@
+../../Task/Casting-out-nines/C

Lang/C/Inheritance-Multiple

@@ -0,0 +1 @@
+../../Task/Inheritance-Multiple/C

Lang/C/RIPEMD-160

@@ -0,0 +1 @@
+../../Task/RIPEMD-160/C

Lang/C/Zeckendorf-arithmetic

@@ -0,0 +1 @@
+../../Task/Zeckendorf-arithmetic/C

Lang/COBOL/Count-the-coins

@@ -0,0 +1 @@
+../../Task/Count-the-coins/COBOL

Lang/COBOL/Holidays-related-to-Easter

@@ -0,0 +1 @@
+../../Task/Holidays-related-to-Easter/COBOL

Lang/COBOL/Levenshtein-distance

@@ -0,0 +1 @@
+../../Task/Levenshtein-distance/COBOL

Lang/COBOL/Parsing-RPN-calculator-algorithm

@@ -0,0 +1 @@
+../../Task/Parsing-RPN-calculator-algorithm/COBOL

Lang/COBOL/Read-a-configuration-file

@@ -0,0 +1 @@
+../../Task/Read-a-configuration-file/COBOL

Lang/COBOL/Strip-comments-from-a-string

@@ -0,0 +1 @@
+../../Task/Strip-comments-from-a-string/COBOL

Lang/Cache-ObjectScript/Empty-string

@@ -0,0 +1 @@
+../../Task/Empty-string/Cache-ObjectScript

Lang/Clojure/Rep-string

@@ -0,0 +1 @@
+../../Task/Rep-string/Clojure

Lang/Clojure/Variables

@@ -0,0 +1 @@
+../../Task/Variables/Clojure

Lang/Commodore-BASIC/00DESCRIPTION

@@ -10,6 +10,6 @@ Commodore BASIC is notable for its lack of integer arithmetic; all operations we
 
 Programs were tokenized into [[wp:bytecode|bytecode]], although many characters were left intact to facilitate printing the source code back out in original form; it's one of the few BASICs of the time that preserved whitespace (though not leading whitespace). Unlike some contemporary BASICs, it supported arrays of strings, and arrays could have thousands of elements as long as there was sufficient memory for them (but strings were limited to 255 bytes).
 
-The most well-known version is 2.0, which came with the [[wp:Commodore VIC-20|VIC-20]] and [[wp:Commodore 64|Commodore 64]]. Despite the impressive sound and graphics capabilities of the machines, the language had no support for them; machine code was required to take advantage of those features. Later BASIC versions added support, but the later machines that came with those versions never came close to the popularity of the 64. 
+The most well-known version is 2.0, which came with the [[wp:Commodore VIC-20|VIC-20]] and [[wp:Commodore 64|Commodore 64]]. Despite the impressive sound and graphics capabilities of the machines, the language had no unique commands for them. Instead, programmers had to directly manipulate or read the hardware registers with POKE and PEEK commands to take advantage of those features. Later BASIC versions added support, but the later machines that came with those versions never came close to the popularity of the 64. 
 
 In addition to the sound and graphic statements, the later versions also introduced structured programming constructs: <code>DO...LOOP</code>, which supported both pre- and post-evaluated conditions (<code>DO WHILE/UNTIL ... LOOP</code> and <code>DO ... LOOP WHILE/UNTIL</code>) as well as unconditional loop exit (<code>EXIT</code>) and <code>BEGIN...BEND</code> code blocks, which allowed multi-line conditional clauses. However, other limitations remained: variables were still all global and limited to 2-letter names, user-defined functions were restricted to a single expression with a single argument, etc.

Lang/Commodore-BASIC/Count-the-coins

@@ -0,0 +1 @@
+../../Task/Count-the-coins/Commodore-BASIC

Lang/Commodore-BASIC/Joystick-position

@@ -0,0 +1 @@
+../../Task/Joystick-position/Commodore-BASIC

Lang/Commodore-BASIC/Number-names

@@ -0,0 +1 @@
+../../Task/Number-names/Commodore-BASIC

Lang/Crystal/Averages-Simple-moving-average

@@ -0,0 +1 @@
+../../Task/Averages-Simple-moving-average/Crystal

Lang/Crystal/Exceptions-Catch-an-exception-thrown-in-a-nested-call

@@ -0,0 +1 @@
+../../Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Crystal

Lang/Crystal/Factorial

@@ -0,0 +1 @@
+../../Task/Factorial/Crystal

Lang/Crystal/Handle-a-signal

@@ -0,0 +1 @@
+../../Task/Handle-a-signal/Crystal

Lang/Crystal/Hash-from-two-arrays

@@ -0,0 +1 @@
+../../Task/Hash-from-two-arrays/Crystal

Lang/Crystal/Hostname

@@ -0,0 +1 @@
+../../Task/Hostname/Crystal

Lang/Crystal/Include-a-file

@@ -0,0 +1 @@
+../../Task/Include-a-file/Crystal

Lang/Crystal/Knuth-shuffle

@@ -0,0 +1 @@
+../../Task/Knuth-shuffle/Crystal

Lang/Crystal/Leap-year

@@ -0,0 +1 @@
+../../Task/Leap-year/Crystal

Lang/Crystal/Loops-For

@@ -0,0 +1 @@
+../../Task/Loops-For/Crystal

Lang/Crystal/Pangram-checker

@@ -0,0 +1 @@
+../../Task/Pangram-checker/Crystal

Lang/Crystal/Remove-duplicate-elements

@@ -0,0 +1 @@
+../../Task/Remove-duplicate-elements/Crystal

Lang/Crystal/Sorting-algorithms-Bogosort

@@ -0,0 +1 @@
+../../Task/Sorting-algorithms-Bogosort/Crystal

Lang/Crystal/Sorting-algorithms-Permutation-sort

@@ -0,0 +1 @@
+../../Task/Sorting-algorithms-Permutation-sort/Crystal

Lang/Crystal/Sorting-algorithms-Selection-sort

@@ -0,0 +1 @@
+../../Task/Sorting-algorithms-Selection-sort/Crystal

Lang/Crystal/Stack

@@ -0,0 +1 @@
+../../Task/Stack/Crystal

Lang/Crystal/Substring

@@ -0,0 +1 @@
+../../Task/Substring/Crystal

Lang/Crystal/Synchronous-concurrency

@@ -0,0 +1 @@
+../../Task/Synchronous-concurrency/Crystal

Lang/Crystal/Test-a-function

@@ -0,0 +1 @@
+../../Task/Test-a-function/Crystal

Lang/Crystal/User-input-Text

@@ -0,0 +1 @@
+../../Task/User-input-Text/Crystal

Lang/Crystal/Zero-to-the-zero-power

@@ -0,0 +1 @@
+../../Task/Zero-to-the-zero-power/Crystal

Lang/D/Determine-if-only-one-instance-is-running

@@ -0,0 +1 @@
+../../Task/Determine-if-only-one-instance-is-running/D

Lang/Dart/9-billion-names-of-God-the-integer

@@ -0,0 +1 @@
+../../Task/9-billion-names-of-God-the-integer/Dart

Lang/Dart/Comments

@@ -0,0 +1 @@
+../../Task/Comments/Dart

Lang/Delphi/Almost-prime

@@ -0,0 +1 @@
+../../Task/Almost-prime/Delphi

Lang/Delphi/CRC-32

@@ -0,0 +1 @@
+../../Task/CRC-32/Delphi

Lang/Delphi/Last-Friday-of-each-month

@@ -0,0 +1 @@
+../../Task/Last-Friday-of-each-month/Delphi

Lang/EDSAC-order-code/100-doors

@@ -0,0 +1 @@
+../../Task/100-doors/EDSAC-order-code

Lang/EDSAC-order-code/Caesar-cipher

@@ -0,0 +1 @@
+../../Task/Caesar-cipher/EDSAC-order-code

Lang/EDSAC-order-code/Catalan-numbers

@@ -0,0 +1 @@
+../../Task/Catalan-numbers/EDSAC-order-code

Lang/EDSAC-order-code/Continued-fraction-Arithmetic-Construct-from-rational-number

@@ -0,0 +1 @@
+../../Task/Continued-fraction-Arithmetic-Construct-from-rational-number/EDSAC-order-code

Lang/EDSAC-order-code/Factors-of-an-integer

@@ -0,0 +1 @@
+../../Task/Factors-of-an-integer/EDSAC-order-code

Lang/EDSAC-order-code/Greatest-common-divisor

@@ -0,0 +1 @@
+../../Task/Greatest-common-divisor/EDSAC-order-code

Lang/EDSAC-order-code/Hailstone-sequence

@@ -0,0 +1 @@
+../../Task/Hailstone-sequence/EDSAC-order-code

Lang/EDSAC-order-code/Pangram-checker

@@ -0,0 +1 @@
+../../Task/Pangram-checker/EDSAC-order-code