From ff3d2d1784cce6ff6b87f8ea47887aa8eee78036 Mon Sep 17 00:00:00 2001
From: Samantha McVey <samantham@posteo.net>
Date: Sat, 31 Dec 2016 15:25:24 -0800
Subject: Set bf, chapel, d and dart to use the language's highlighting

Previously were using other languages with similar syntax, but now
we have Pygments.
---
 d.html.markdown | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

(limited to 'd.html.markdown')

diff --git a/d.html.markdown b/d.html.markdown
index edb3bff5..c682cfb5 100644
--- a/d.html.markdown
+++ b/d.html.markdown
@@ -6,7 +6,7 @@ contributors:
 lang: en
 ---
 
-```c
+```d
 // You know what's coming...
 module hello;
 
@@ -28,7 +28,7 @@ D is actively developed by a large group of super-smart people and is spearheade
 [Andrei Alexandrescu](https://en.wikipedia.org/wiki/Andrei_Alexandrescu).
 With all that out of the way, let's look at some examples!
 
-```c
+```d
 import std.stdio;
 
 void main() {
@@ -73,7 +73,7 @@ We can define new types with `struct`, `class`, `union`, and `enum`. Structs and
 are passed to functions by value (i.e. copied) and classes are passed by reference. Furthermore,
 we can use templates to parameterize all of these on both types and values!
 
-```c
+```d
 // Here, 'T' is a type parameter. Think '<T>' from C++/C#/Java.
 struct LinkedList(T) {
     T data = null;
@@ -136,7 +136,7 @@ is roughly a function that may act like an lvalue, so we can
 have the syntax of POD structures (`structure.x = 7`) with the semantics of
 getter and setter methods (`object.setX(7)`)!
 
-```c
+```d
 // Consider a class parameterized on types 'T' & 'U'.
 class MyClass(T, U) {
     T _data;
@@ -209,7 +209,7 @@ functions, and immutable data. In addition, all of your favorite
 functional algorithms (map, filter, reduce and friends) can be
 found in the wonderful `std.algorithm` module!
 
-```c
+```d
 import std.algorithm : map, filter, reduce;
 import std.range : iota; // builds an end-exclusive range
 
@@ -237,7 +237,7 @@ is of some type A on any expression of type A as a method.
 
 I like parallelism. Anyone else like parallelism? Sure you do. Let's do some!
 
-```c
+```d
 // Let's say we want to populate a large array with the square root of all
 // consecutive integers starting from 1 (up until the size of the array), and we
 // want to do this concurrently taking advantage of as many cores as we have
-- 
cgit v1.2.3


From 43bb6808b9698e617a8ecbb233a597f0e00b373d Mon Sep 17 00:00:00 2001
From: Pratik Karki <prertik@outlook.com>
Date: Fri, 25 Aug 2017 14:25:11 +0545
Subject: fix language code suffix(#2832)

---
 d.html.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'd.html.markdown')

diff --git a/d.html.markdown b/d.html.markdown
index c682cfb5..d2a57cae 100644
--- a/d.html.markdown
+++ b/d.html.markdown
@@ -3,7 +3,7 @@ language: D
 filename: learnd.d
 contributors:
     - ["Nick Papanastasiou", "www.nickpapanastasiou.github.io"]
-lang: en
+
 ---
 
 ```d
-- 
cgit v1.2.3


From 75320beb234e3321e76b04010b292e343cf26f6d Mon Sep 17 00:00:00 2001
From: Mark <mark@qtrac.eu>
Date: Wed, 22 Jan 2020 12:16:26 +0000
Subject: Added missing import std.stdio...

to make an example compilable.
---
 d.html.markdown | 1 +
 1 file changed, 1 insertion(+)

(limited to 'd.html.markdown')

diff --git a/d.html.markdown b/d.html.markdown
index d2a57cae..93c08da2 100644
--- a/d.html.markdown
+++ b/d.html.markdown
@@ -212,6 +212,7 @@ found in the wonderful `std.algorithm` module!
 ```d
 import std.algorithm : map, filter, reduce;
 import std.range : iota; // builds an end-exclusive range
+import std.stdio;
 
 void main() {
     // We want to print the sum of a list of squares of even ints
-- 
cgit v1.2.3