For having here as offline:
git clone https://github.com/k-five/D-By-Example.git
Since I have just learned D so these examples are not in advanced topic. but if you are looking for some examples to start to learn D, it may help you and I hope so.
The tp directory is the collection of examples that I read and put in code with the pdf of tutorialspoint.com note that most of the examples were taken from that pdf but not all, and also some of them even did not compile, such as examples in thread part. ( under the license of main site ).
The tour directory is the collection of examples that I read the tour page in the main website So I tried to introduce some feature of D on tour directory. ( under the license of main site ).
NOTE that may you see some bugs on these, because I did it in two weeks for getting familiar with D and then port my program renrem from C to D.
The D version of renrem, after getting ready will be put here so you can see a full program in D that is really useful.
And like me, may you can not install mono-D IDE on your 32 OS, so for using an IDE you can use geany or codeblock.
But if you like using emacs like I am, you can install d-mode for your emacs. Here is the screenshot of mine:
- create
.emacsin your home directory ( Linux OS ) - then put this code:
(add-to-list 'package-archives
'("melpa-stable" . "https://stable.melpa.org/packages/") t)
(package-initialize)
- then open emacs with
emacs -nw some.txt( any file ) - then: M-x package-list-packages to get to the package listing
- then: then package-install
- then type: d-mode
NOTE: You need the Internet to download d-mode
NOTE: If you see some other codes, put it before them
For more details see Emacs-D-Mode
// Hey come on, just get the whole army!
import std.algorithm : canFind, map,
filter, sort, uniq, joiner, chunkBy, splitter;
import std.array : array, empty;
import std.range : zip;
import std.stdio : writeln;
import std.string : format;
void main()
{
string text = q{This tour will give you an
overview of this powerful and expressive systems
programming language which compiles directly
to efficient, *native* machine code.};
// splitting predicate
alias pred = c => canFind(" ,.\n", c);
// as a good algorithm it just works
// lazily without allocating memory!
auto words = text.splitter!pred
.filter!(a => !a.empty);
auto wordCharCounts = words
.map!"a.count";
// Output the character count
// per word in a nice way
// beginning with least chars!
zip(wordCharCounts, words)
// convert to array for sorting
.array()
.sort()
// we don't need duplication, right?
.uniq()
// put all in one row that have the
// same char count. chunkBy helps
// us here by generating ranges
// of range that are chunked by the length
.chunkBy!(a => a[0])
// those elments will be joined
// on one line
.map!(chunk => format("%d -> %s",
chunk[0],
// just the words
chunk[1]
.map!(a => a[1])
.joiner(", ")))
// joiner joins, but lazily!
// and now the lines with the line
// feed
.joiner("\n")
// pipe to stdout
.writeln();
}