Merge branch 'master' into AliasAssign

Author: mdparker

.htaccess

@@ -218,9 +218,9 @@ Redirect 301 /dips/1025 https://github.com/dlang/DIPs/tree/master/DIPs/other/DIP
 Redirect 301 /dips/1026 https://github.com/dlang/DIPs/tree/master/DIPs/other/DIP1026.md
 Redirect 301 /dips/1027 https://github.com/dlang/DIPs/tree/master/DIPs/rejected/DIP1027.md
 Redirect 301 /dips/1028 https://github.com/dlang/DIPs/tree/master/DIPs/rejected/DIP1028.md
-Redirect 301 /dips/1029 https://github.com/dlang/DIPs/tree/master/DIPs/DIP1029.md
-Redirect 301 /dips/1030 https://github.com/dlang/DIPs/tree/master/DIPs/DIP1030.md
+Redirect 301 /dips/1029 https://github.com/dlang/DIPs/tree/master/DIPs/accepted/DIP1029.md
+Redirect 301 /dips/1030 https://github.com/dlang/DIPs/tree/master/DIPs/accepted/DIP1030.md
 Redirect 301 /dips/1031 https://github.com/dlang/DIPs/tree/master/DIPs/other/DIP1031.md
-Redirect 301 /dips/1032 https://github.com/dlang/DIPs/tree/master/DIPs/DIP1032.md
-Redirect 301 /dips/1033 https://github.com/dlang/DIPs/tree/master/DIPs/DIP1033.md
-Redirect 301 /dips/1034 https://github.com/dlang/DIPs/tree/master/DIPs/DIP1034.md
+Redirect 301 /dips/1032 https://github.com/dlang/DIPs/tree/master/DIPs/other/DIP1032.md
+Redirect 301 /dips/1033 https://github.com/dlang/DIPs/tree/master/DIPs/other/DIP1033.md
+Redirect 301 /dips/1034 https://github.com/dlang/DIPs/tree/master/DIPs/accepted/DIP1034.md

VERSION

@@ -1 +1 @@
-2.093.0
+2.097.0

acknowledgements.dd

@@ -28,7 +28,7 @@ $(P
         Thomas Kuehne,
         Helmut Leitner,
         Lubomir Litchev,
-        $(LINK2 http://www.relisoft.com/, Bartosz Milewski),
+        $(LINK2 https://bartoszmilewski.com/, Bartosz Milewski),
         Christopher E. Miller,
         Pavel Minayev,
         Antonio Monteiro,

articles/code_coverage.dd

@@ -34,13 +34,15 @@ $(LI It can be used to track down why a particular section of code
 
 $(LI Since execution counts are given for each line, it is possible
      to use the coverage analysis to reorder the basic blocks in
-     a function to minimize jmps in the most used path, thus
-     optimizing it.)
-)
+     a function to minimize branches in the most used path, reducing stress
+     on the processor's pipeline (a run-of-the-mill X86 processor can usually handle 48 branches in its pipeline). This technique
+     is a special case of $(LINK2 https://en.wikipedia.org/wiki/Profile-guided_optimization, profile-guided optimization), which can
+     be performed automatically if either the `LLVM` or `GCC` backend is utilized.
+))
 
 $(P Experience with code coverage analyzers show that they dramatically
 reduce the number of bugs in shipping code.
-But it isn't a panacea, a code coverage analyzer won't help with:)
+But it isn't a panacea, a code coverage analyzer won't help (unlike Valgrind or the sanitizers available in GCC and LLVM) with:)
 
 $(OL
 $(LI Identifying race conditions.)
@@ -51,18 +53,18 @@ $(LI Verifying that the program got the correct result.)
 
 $(P Code coverage analysers are available for many popular languages,
 but they are often third party products that integrate
-poorly with the compiler, and are often very expensive.
+poorly with the compiler.
 A big problem with third party products is, in order to instrument
-the source code, they must include what is essentially a full blown
+the source code, they must include what is essentially a full-blown
 compiler front end for the same language. Not only is this an expensive
 proposition, it often winds up out of step with the various compiler
 vendors as their implementations change and as they evolve various extensions.
 ($(LINK2 http://gcc.gnu.org/onlinedocs/gcc-3.0/gcc_8.html, gcov),
-the Gnu coverage analyzer, is an exception as it is both free
+the Gnu coverage analyzer is an exception as it is both free
 and is integrated into gcc.)
 )
 
-$(P The D code coverage analyser is built in as part of the D compiler.
+$(P The D code coverage analyser is part of the D compiler.
 Therefore, it is always in perfect synchronization with the language
 implementation. It's implemented by establishing a counter for each
 line in each module compiled with the $(DDSUBLINK dmd,switch-cov, $(B -cov)) switch.
@@ -78,7 +80,7 @@ $(P For example, consider the Sieve program:)
 
 import std.stdio;
 
-bool flags[8191];
+bool[8191] flags;
 
 int main()
 {
@@ -124,7 +126,7 @@ $(CONSOLE
        |
        |import std.stdio;
        |
-       |bool flags[8191];
+       |bool[8191] flags;
        |
        |int main()
        |{
@@ -163,13 +165,13 @@ as the execution count.
 At the end of the .lst file, the percent coverage is given.
 )
 
-$(P There are 3 lines with an exection count
+$(P There are 3 lines with an execution count
 of 1, these were each executed once. The declaration line for $(D i, prime),
 etc., has 5 because there are 5 declarations, and the initialization of
 each declaration counts as one statement.)
 
 $(P The first $(D for) loop shows 22. This is the sum of the 3 parts
-of the for header. If the for header is broken up into 3 lines, the
+of the for-header. If the for-header is broken up into 3 lines, the
 data is similarly divided:)
 
 $(CONSOLE
@@ -263,7 +265,7 @@ sieve --DRT-covopt="merge:1 dstpath:reports"
 
 $(H3 References)
 
-$(LINK2 https://en.wikipedia.org/wiki/Code_coverage, Wikipedia)
+$(LINK2 https://en.wikipedia.org/wiki/Code_coverage, Wikipedia: "Code Coverage")
 
 )
 

articles/exception-safe.dd

@@ -177,7 +177,7 @@ Transaction transaction()
 }
 ---
 
-With the try-finally approach:
+With the try-catch approach:
 
 ---
 Transaction transaction()
@@ -188,7 +188,7 @@ Transaction transaction()
         Bar b = dobar();
         return Transaction(f, b);
     }
-    catch (Object o)
+    catch (Exception o)
     {
         dofoo_undo(f);
         throw o;

articles/lazy-evaluation.dd

@@ -254,7 +254,7 @@ need to do this need to be broken up into multiple statements,
 and extra variables are introduced.
 (For a thorough treatment of this issue, see Andrei Alexandrescu and
 Petru Marginean's paper
-$(LINK2 http://erdani.org/publications/cuj-06-2003.html, Enforcements)).
+$(LINK2 https://erdani.org/publications/cuj-06-2003.php.html, Enforcements)).
 With lazy evaluation, this can all be encapsulated into a single
 function:
 )

articles/variadic-function-templates.dd

@@ -124,33 +124,32 @@ $(H2 $(LNAME2 d-solutions, D Programming Language Solutions))
 
 $(H3 The D Look Ma No Templates Solution)
 
-        $(P It is not practical to solve this problem in C++ without
-        using templates. In D, one can because D supports typesafe
-        variadic function parameters.
+        $(P The current best practice, e.g. as espoused by the standard library, favours
+        the variadic template solution. However, if the template solution is not practical, D provides a runtime solution
+        utilizing the $(D TypeInfo) system (An example is shown below). There is a lexical similarity with the
+        non-template variadic functions provided by C and C++ ($(D va_list)), however the solution D provides is
+        typesafe whereas the aforementioned alternative is not.
         )
 
 ------
 import core.vararg;
 import core.stdc.stdio;
-import std.format;
-
+/*
+This function was part of D1.0, but does not exist anymore, it has been
+resurrected here to give a realistic example of how this feature could be used.
+*/
+void doFormat(void delegate(dchar) putc, TypeInfo[] arguments, va_list argptr);
 void print(...)
 {
     void putc(dchar c)
     {
         fputc(c, stdout);
     }
 
-    std.format.doFormat(&putc, _arguments, _argptr);
+    doFormat(&putc, _arguments, _argptr);
 }
 ------
 
-        $(P It isn't elegant or the most efficient,
-        but it does work. However it is not the recommended way to write variadic functions.
-        (It relies on the parameters `_argptr` and `_arguments` imported from `core.vararg`
-        which give a pointer to the values and their types, respectively.)
-        )
-
 $(H3 Translating the Variadic C++ Solution into D)
 
         $(P Variadic templates in D enable a straightforward translation
@@ -195,7 +194,7 @@ $(H3 The Static If Solution)
 
         $(P It would be nice to encapsulate all the logic into a
         single function. One way to do that is by using
-        $D(static if)s, which provide for conditional compilation:
+        $(D static if)s, which provide for conditional compilation:
         )
 
 ---

changelog/2.093.1.dd

@@ -0,0 +1,60 @@
+Ddoc
+
+$(CHANGELOG_NAV_INJECT)
+
+$(VERSION Aug 15, 2020, =================================================,
+
+$(CHANGELOG_HEADER_STATISTICS
+$(VER) comes with  10 fixed Bugzilla issues.
+        A huge thanks goes to the
+        $(LINK2 #contributors, 13 contributors)
+        who made $(VER) possible.)
+
+$(CHANGELOG_SEP_HEADER_TEXT_NONEMPTY)
+
+$(CHANGELOG_SEP_HEADER_TEXT)
+
+$(CHANGELOG_SEP_TEXT_BUGZILLA)
+
+$(BUGSTITLE_BUGZILLA DMD Compiler regressions,
+
+$(LI $(BUGZILLA 21063): getLinkage is wrong for forward reference extern$(LPAREN)C++$(RPAREN) class)
+$(LI $(BUGZILLA 21074): const lost in mixin)
+$(LI $(BUGZILLA 21095): [ICE] AssertError@dmd/expressionsem.d$(LPAREN)5015$(RPAREN): Assertion failure)
+)
+$(BUGSTITLE_BUGZILLA DMD Compiler bugs,
+
+$(LI $(BUGZILLA 16400): naked variadic C function emits broken prologue)
+$(LI $(BUGZILLA 17351): Static const array can't be evaluated at compile time when passed as ref argument)
+$(LI $(BUGZILLA 21085): [glue] Only 9999 "hidden identifiers" can be generated)
+$(LI $(BUGZILLA 21092): [ICE] Segmentation fault in ExpressionPrettyPrintVisitor::visit$(LPAREN)CommaExp*$(RPAREN) at dmd/hdrgen.d:2293)
+$(LI $(BUGZILLA 21096): [ICE] Segmentation fault in dmd.hdrgen.sizeToBuffer at dmd/hdrgen.d:3153)
+$(LI $(BUGZILLA 21122): __traits$(LPAREN)getAttributes$(RPAREN) wrong scope on enums)
+)
+$(BUGSTITLE_BUGZILLA dlang.org bugs,
+
+$(LI $(BUGZILLA 21059): install.sh: posix_terminal returns false on Linux Mint 20)
+)
+)
+$(D_CONTRIBUTORS_HEADER 13)
+$(D_CONTRIBUTORS
+    $(D_CONTRIBUTOR Andrej Mitrovic)
+    $(D_CONTRIBUTOR Bastiaan Veelo)
+    $(D_CONTRIBUTOR Boris Carvajal)
+    $(D_CONTRIBUTOR dkorpel)
+    $(D_CONTRIBUTOR Iain Buclaw)
+    $(D_CONTRIBUTOR Martin Kinkelin)
+    $(D_CONTRIBUTOR Martin Nowak)
+    $(D_CONTRIBUTOR Mathias Lang)
+    $(D_CONTRIBUTOR Nicholas Wilson)
+    $(D_CONTRIBUTOR Razvan Nitu)
+    $(D_CONTRIBUTOR Sebastian Wilzbach)
+    $(D_CONTRIBUTOR Stefan Koch)
+    $(D_CONTRIBUTOR Walter Bright)
+)
+$(D_CONTRIBUTORS_FOOTER)
+$(CHANGELOG_NAV_INJECT)
+
+Macros:
+    VER=2.093.1
+    TITLE=Change Log: $(VER)