summaryrefslogtreecommitdiffhomepage
path: root/d.html.markdown
diff options
context:
space:
mode:
authorGabriel Halley <gabhalley@gmail.com>2015-10-07 23:11:24 -0400
committerGabriel Halley <gabhalley@gmail.com>2015-10-07 23:11:24 -0400
commit960ee4a1856db8eadb96277bb2422edfa8f2a81c (patch)
tree1afa96957269a218ef2a84d9c9a2d4ab462e8fef /d.html.markdown
parenta793d16e3725bdaaf7ca40ff35a7cf0e1aba8488 (diff)
removing whitespace all over
Diffstat (limited to 'd.html.markdown')
-rw-r--r--d.html.markdown38
1 files changed, 19 insertions, 19 deletions
diff --git a/d.html.markdown b/d.html.markdown
index daba8020..ba24b60f 100644
--- a/d.html.markdown
+++ b/d.html.markdown
@@ -1,6 +1,6 @@
---
-language: D
-filename: learnd.d
+language: D
+filename: learnd.d
contributors:
- ["Nick Papanastasiou", "www.nickpapanastasiou.github.io"]
lang: en
@@ -18,9 +18,9 @@ void main(string[] args) {
}
```
-If you're like me and spend way too much time on the internet, odds are you've heard
+If you're like me and spend way too much time on the internet, odds are you've heard
about [D](http://dlang.org/). The D programming language is a modern, general-purpose,
-multi-paradigm language with support for everything from low-level features to
+multi-paradigm language with support for everything from low-level features to
expressive high-level abstractions.
D is actively developed by Walter Bright and Andrei Alexandrescu, two super smart, really cool
@@ -37,7 +37,7 @@ void main() {
}
auto n = 1; // use auto for type inferred variables
-
+
// Numeric literals can use _ as a digit seperator for clarity
while(n < 10_000) {
n += n;
@@ -49,7 +49,7 @@ void main() {
// For and while are nice, but in D-land we prefer foreach
// The .. creates a continuous range, excluding the end
- foreach(i; 1..1_000_000) {
+ foreach(i; 1..1_000_000) {
if(n % 2 == 0)
writeln(i);
}
@@ -72,12 +72,12 @@ we can use templates to parameterize all of these on both types and values!
// Here, T is a type parameter. Think <T> from C++/C#/Java
struct LinkedList(T) {
T data = null;
- LinkedList!(T)* next; // The ! is used to instaniate a parameterized type. Again, think <T>
+ LinkedList!(T)* next; // The ! is used to instaniate a parameterized type. Again, think <T>
}
class BinTree(T) {
T data = null;
-
+
// If there is only one template parameter, we can omit parens
BinTree!T left;
BinTree!T right;
@@ -101,7 +101,7 @@ alias NumTree = BinTree!double;
// We can create function templates as well!
T max(T)(T a, T b) {
- if(a < b)
+ if(a < b)
return b;
return a;
@@ -114,7 +114,7 @@ void swap(T)(ref T a, ref T b) {
auto temp = a;
a = b;
- b = temp;
+ b = temp;
}
// With templates, we can also parameterize on values, not just types
@@ -145,13 +145,13 @@ class MyClass(T, U) {
class MyClass(T, U) {
T _data;
U _other;
-
+
// Constructors are always named `this`
this(T t, U u) {
data = t;
other = u;
}
-
+
// getters
@property T data() {
return _data;
@@ -161,7 +161,7 @@ class MyClass(T, U) {
return _other;
}
- // setters
+ // setters
@property void data(T t) {
_data = t;
}
@@ -177,7 +177,7 @@ void main() {
mc.data = 7;
mc.other = "seven";
-
+
writeln(mc.data);
writeln(mc.other);
}
@@ -193,7 +193,7 @@ and `override`ing methods. D does inheritance just like Java:
Extend one class, implement as many interfaces as you please.
We've seen D's OOP facilities, but let's switch gears. D offers
-functional programming with first-class functions, `pure`
+functional programming with first-class functions, `pure`
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!
@@ -205,7 +205,7 @@ import std.range : iota; // builds an end-exclusive range
void main() {
// We want to print the sum of a list of squares of even ints
// from 1 to 100. Easy!
-
+
// Just pass lambda expressions as template parameters!
// You can pass any old function you like, but lambdas are convenient here.
auto num = iota(1, 101).filter!(x => x % 2 == 0)
@@ -216,12 +216,12 @@ void main() {
}
```
-Notice how we got to build a nice Haskellian pipeline to compute num?
+Notice how we got to build a nice Haskellian pipeline to compute num?
That's thanks to a D innovation know as Uniform Function Call Syntax.
With UFCS, we can choose whether to write a function call as a method
or free function call! Walter wrote a nice article on this
-[here.](http://www.drdobbs.com/cpp/uniform-function-call-syntax/232700394)
-In short, you can call functions whose first parameter
+[here.](http://www.drdobbs.com/cpp/uniform-function-call-syntax/232700394)
+In short, you can call functions whose first parameter
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!