D (programming language)

The D programming language is an object-oriented, imperative, multi-paradigm system programming language created by Walter Bright of Digital Mars. Though it originated as a re-engineering of C++, D is a distinct language, having redesigned some core C++ features while also taking inspiration from other languages, notably Java, Python, Ruby, C#, and Eiffel.

D's design goals attempt to combine the performance of compiled languages with the safety and expressive power of modern dynamic languages. Idiomatic D code is commonly as fast as equivalent C++ code, while being shorter and memory-safe.^{[citation needed]} Type inference, automatic memory management and syntactic sugar for common types allow faster development, while bounds checking, design by contract features and a concurrency-aware type system help reduce the occurrence of bugs.^[7]

Features

D is designed with lessons learned from practical C++ usage rather than from a theoretical perspective. Even though it uses many C/C++ concepts it also discards some, and as such is not compatible with C/C++ source code. It adds to the functionality of C++ by also implementing design by contract, unit testing, true modules, garbage collection, first class arrays, associative arrays, dynamic arrays, array slicing, nested functions, inner classes, closures, anonymous functions, compile time function execution, lazy evaluation and has a reengineered template syntax. D retains C++'s ability to do low-level coding, and adds to it with support for an integrated inline assembler. C++ multiple inheritance is replaced by Java style single inheritance with interfaces and mixins. D's declaration, statement and expression syntax closely matches that of C++.

The inline assembler typifies the differences between D and application languages like Java and C#. An inline assembler lets programmers enter machine-specific assembly code within standard D code, a method often used by system programmers to access the low-level features of the processor needed to run programs that interface directly with the underlying hardware, such as operating systems and device drivers.

D has built-in support for documentation comments, allowing automatic documentation generation.

Programming paradigms

D supports five main programming paradigms—imperative, object-oriented, metaprogramming, functional and concurrent (Actor model).

Imperative

Imperative programming in D is almost identical to C. Functions, data, statements, declarations and expressions work just as in C, and the C runtime library can be accessed directly. Some notable differences between D and C in the area of imperative programming include D's foreach loop construct, which allows looping over a collection, and nested functions, which are functions that are declared inside of another and may access the enclosing function's local variables.

Object-oriented

Object-oriented programming in D is based on a single inheritance hierarchy, with all classes derived from class Object. D does not support multiple inheritance; instead, it uses Java-style interfaces, which are comparable to C++ pure abstract classes, and mixins, which allow separating common functionality out of the inheritance hierarchy. D also allows declaring static and final (non-virtual) methods in interfaces.

Metaprogramming

Metaprogramming is supported by a combination of templates, compile time function execution, tuples, and string mixins. The following examples demonstrate some of D's compile-time features.

Templates in D can be written in a more imperative style compared to C++ functional style for templates. This is a regular function that calculates the factorial of a number:

ulong factorial(ulong n){ if(n < 2) return 1; else return n * factorial(n - 1);}

Here, the use of static if, D's compile-time conditional construct, is demonstrated to construct a template that performs the same calculation using code that is similar to that of the above function:

template Factorial(ulong n){ static if(n < 2) const Factorial = 1; else const Factorial = n * Factorial!(n - 1);}

In the following two examples, the template and function defined above are used to compute factorials. The types of constants need not be specified explicitly as the compiler infers their types from the right-hand sides of assignments:

const fact_7 = Factorial!(7);

This is an example of compile time function execution. Ordinary functions may be used in constant, compile-time expressions provided they meet certain criteria:

const fact_9 = factorial(9);

The std.metastrings.Format template performs printf-like data formatting, and the "msg" pragma displays the result at compile time:

import std.metastrings;pragma(msg, Format!("7! = %s", fact_7));pragma(msg, Format!("9! = %s", fact_9));

String mixins, combined with compile-time function execution, allow generating D code using string operations at compile time. This can be used to parse domain-specific languages to D code, which will be compiled as part of the program:

import FooToD; // hypothetical module which contains a function that parses Foo source code   // and returns equivalent D codevoid main(){ mixin(fooToD(import("example.foo")));}

Functional

D supports functional programming features such as function literals, closures, and the use of higher-order functions. There are two syntaxes for anonymous functions, including a multiple-statement form and a "shorthand" single-expression notation:^[8]

int function(int) g;g = (x) { return x * x; }; // longhandg = (x) => x * x;  // shorthand

There are two builtin types for function literals, function, which is simply a pointer to a stack-allocated function, and delegate, which also includes a pointer to the surrounding environment. Type inference can be used with an anonymous function, in which case the compiler creates a delegate unless it can prove that an environment pointer is not necessary. Likewise, to implement a closure, the compiler places enclosed local variables on the heap only if necessary (for example, if a closure is returned by another function, and exits that function's scope). When using type inference, the compiler will also add attributes such as pure and nothrow to a function's type, if it can prove that they apply.

Other functional features such as currying and common higher-order functions such as map, filter, and reduce are available through the standard library modules std.functional and std.algorithm.

import std.stdio, std.algorithm, std.range; void main(){ int[] a1 = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]; int[] a2 = [6, 7, 8, 9]; // must be immutable to allow access from inside a pure function immutable pivot = 5; int mySum(int a, int b) pure nothrow // pure function { if (b <= pivot) // ref to enclosing-scope return a + b; else return a; } // passing a delegate (closure) auto result = reduce!mySum(chain(a1, a2)); writeln("Result: ", result); // Result: 15 // passing a delegate literal (lambda) result = reduce!((a, b) => (b <= pivot) ? a + b : a)(chain(a1, a2)); writeln("Result: ", result); // Result: 15}

Parallel

import std.stdio : writeln;import std.range : iota;import std.parallelism : parallel; void main(){ foreach (i; iota(10).parallel) { // The body of the foreach loop is executed in parallel for each i writeln("processing ", i); }}

Concurrent

import std.stdio, std.concurrency; void foo(){ bool cont = true; while (cont) { receive( // delegates are used to match the message type (int msg) => writeln("int received: ", msg), (Tid sender) { cont = false; sender.send(-1); }, (Variant v) => writeln("huh?") // Variant matches any type ); }} void main(){ auto tid = spawn(&foo); // spawn a new thread running foo() foreach (i; 0 .. 10) tid.send(i);   // send some integers tid.send(1.0f); // send a float tid.send("hello"); // send a string tid.send(thisTid); // send a struct (Tid) receive((int x) => writeln("Main thread received message: ", x));}

Memory management

Memory is usually managed with garbage collection, but specific objects can be finalized immediately when they go out of scope. Explicit memory management is possible using the overloaded operators new and delete, and by simply calling C's malloc and free directly. Garbage collection can be controlled: programmers can add and exclude memory ranges from being observed by the collector, can disable and enable the collector and force a generational or a full collection cycle.^[9] The manual gives many examples of how to implement different highly optimized memory management schemes for when garbage collection is inadequate in a program.^[10]

Interaction with other systems

C's application binary interface (ABI) is supported as well as all of C's fundamental and derived types, enabling direct access to existing C code and libraries. D bindings are available for many popular C libraries. C's standard library is part of standard D.

Because C++ does not have a single standard ABI, D can only fully access C++ code that is written to the C ABI. The D parser understands an extern (C++) calling convention for limited linking to C++ objects.

On Microsoft Windows, D can access Component Object Model (COM) code.

History

Walter Bright decided to start working on a new language in 1999. D was first released in December 2001,^[1] and reached version 1.0 in January 2007.^[11] The first version of the language (D1) concentrated on the imperative, object oriented and metaprogramming paradigms,^[12] similar to C++.

Dissatisfied with Phobos, D's official runtime and standard library, members of the D community created an alternative runtime and standard library named Tango. The first public Tango announcement came within days of D 1.0's release.^[13] Tango adopted a different programming style, embracing OOP and high modularity. Being a community-led project, Tango was more open to contributions, which allowed it to progress faster than the official standard library. At that time, Tango and Phobos were incompatible due to different runtime support APIs (the garbage collector, threading support, etc.). This made it impossible to use both libraries in the same project. The existence of two libraries, both widely in use, has led to significant dispute due to some packages using Phobos and others using Tango.^[14]

In June 2007, the first version of D2 was released.^[2] The beginning of D2's development signalled the stabilization of D1; the first version of the language has since been in maintenance, only receiving corrections and implementation bugfixes. D2 was to introduce breaking changes to the language, beginning with its first experimental const system. D2 later added numerous other language features, such as closures, purity, and support for the functional and concurrent programming paradigms. D2 also solved standard library problems by separating the runtime from the standard library. The completion of a D2 Tango port was announced in February 2012.^[15]

The release of Andrei Alexandrescu's book The D Programming Language on June 12, 2010 marked the stabilization of D2, which today is commonly referred to as just "D".

In January 2011, D development moved from a bugtracker / patch-submission basis to GitHub. This has led to a significant increase in contributions to the compiler, runtime and standard library.^[16]

Implementations

Most current D implementations compile directly into machine code for efficient execution.

• DMD — The Digital Mars D compiler is the official D compiler by Walter Bright. The compiler front-end is licensed under both the Artistic License and the GNU GPL; the source code for the front-end is distributed with the compiler binaries. The compiler back-end source code is available but not under an open source license.^[5]
• GDC — A front-end for the GCC back-end, built using the open DMD compiler source code.^[17]
• LDC — A compiler based on the DMD front-end that uses Low Level Virtual Machine (LLVM) as its compiler back-end. The first release-quality version was published on January 9, 2009.^[18] It supports both versions: 1.0 and version 2.0.^[19]
• D Compiler for .NET — A back-end for the D programming language 2.0 compiler.^[20][21] It compiles the code to Common Intermediate Language (CIL) bytecode rather than to machine code. The CIL can then be run via a Common Language Infrastructure (CLR) virtual machine.

Development tools

Editors and integrated development environments (IDEs) supporting D include Eclipse, Microsoft Visual Studio, SlickEdit, Emacs, vim, SciTE, Smultron, TextMate, MonoDevelop, Zeus,^[22] and Geany among others.^[23]

• Eclipse plug-ins for D include: DDT,^[24] and Descent (dead project).^[25]
• Visual Studio integration is provided by VisualD.^[26]
• Vim supports both syntax highlighting and code completion (through patched Ctags).
• A bundle is available for TextMate, and the Code::Blocks IDE includes partial support for the language. However, standard IDE features such as code completion or refactoring are not yet available, though they do work partially in Code::Blocks (due to D's similarity to C).
• A plugin for Xcode 3 is available, D for Xcode, to enable D-based projects and development.^[27]
• An AddIn for MonoDevelop is available, named Mono-D.^[28]

Open source D IDEs for Windows exist, some written in D, such as Poseidon,^[29] D-IDE,^[30] and Entice Designer.^[31]

D applications can be debugged using any C/C++ debugger, like GDB or WinDbg, although support for various D-specific language features is extremely limited. On Windows, D programs can be debugged using Ddbg, or Microsoft debugging tools (WinDBG and Visual Studio), after having converted the debug information using cv2pdb. The ZeroBUGS debugger for Linux has experimental support for the D language. Ddbg can be used with various IDEs or from the command line; ZeroBUGS has its own graphical user interface (GUI).

Examples

Example 1

This example program prints its command line arguments. The main function is the entry point of a D program, and args is an array of strings representing the command line arguments. A string in D is an array of characters, represented by char[] in D1, or immutable(char)[] in D2.

import std.stdio: writefln; void main(string[] args){ foreach (i, arg; args) writefln("args[%d] = '%s'", i, arg);}

The foreach statement can iterate over any collection. In this case, it is producing a sequence of indexes (i) and values (arg) from the array args. The index i and the value arg have their types inferred from the type of the array args.

Example 2

The following shows several D capabilities and D design trade-offs in a very short program. It iterates the lines of a text file named words.txt that contains a different word on each line, and prints all the words that are anagrams of other words.

import std.stdio, std.algorithm, std.range, std.string; void main(){ dstring[][dstring] signs2words; foreach(dchar[] w; lines(File("words.txt"))) { w = w.chomp().toLower(); immutable key = w.dup.sort().release().idup; signs2words[key] ~= w.idup; } foreach(words; signs2words) if(words.length > 1) writefln(words.join(" "));}

1. signs2words is a built-in associative array that maps dstring (32-bit / char) keys to arrays of dstrings. It is similar to defaultdict(list) in Python.
2. lines(File()) yields lines lazily, with the newline. It has to then be copied with idup to obtain a string to be used for the associative array values (the idup property of arrays returns an immutable duplicate of the array, which is required since the dstring type is actually immutable(dchar)[]). Built-in associative arrays require immutable keys.
3. The ~= operator appends a new dstring to the values of the associate dynamic array.
4. toLower, join and chomp are string functions that D allows to use with a method syntax. The name of such functions is often very similar to Python string methods. The toLower converts a string to lower case, join(" ") joins an array of strings into a single string using a single space as separator, and chomp removes a newline from the end of the string if one is present.
5. The sort is an std.algorithm function that sorts the array in place, creating a unique signature for words that are anagrams of each other. The release() method on the return value of sort() is handy to keep the code as a single expression.
6. The second foreach iterates on the values of the associative array, it's able to infer the type of words.
7. key is assigned to an immutable variable, its type is inferred.
8. UTF-32 dchar[] is used instead of normal UTF-8 char[] otherwise sort() refuses to sort it. There are more efficient ways to write this program, that use just UTF-8.

See also

• Ddoc
• GtkD

References

Further reading

• Alexandrescu, Andrei (January 4, 2010). The D Programming Language (1 ed.). Addison-Wesley Professional. ISBN 978-0-321-63536-5.
• Alexandrescu, Andrei (June 15, 2009). "The Case for D". Dr. Dobb's Journal. http://www.ddj.com/hpc-high-performan ce-computing/217801225.
• Çehreli, Ali (February 1, 2012). "Programming in D". http://ddili.org/ders/d.en/index.html. (distributed under CC-BY-NC-SA license). This book provides a basic level introduction.

External links

• Official website
• Digital Mars
• D on GitHub