D言語をたまには真面目に紹介してみる
•Download as ZIP, PDF•
3 likes•2,214 views
This document summarizes recent developments in the D programming language. It discusses new features like templates, mixins, static if, enum final switch, and unittest blocks. It also outlines improvements to the Phobos standard library, including new modules for ranges, contracts, and regular expressions. Finally, it mentions people like Walter Bright and Andrei Alexandrescu who have contributed to D, and libraries like Tango that are being ported.
![•
•
• arr + 10
•
• Ruby arr[1..7]](https://image.slidesharecdn.com/dataizu-lt03-key-090922123549-phpapp01/85/D-9-320.jpg)
![range
• Recurrence
auto fib = recurrence!("a[n-1] + a[n-2]")(1, 1);
foreach (e; take(10, fib)) { writeln(e); }
• random
int[] a = [ 0, 1, 2, 3, 4, 5, 6, 7, 8 ];
auto rnd = Random(unpredictableSeed);
foreach (e; randomCover(a, rnd)) { writeln(e); }](https://image.slidesharecdn.com/dataizu-lt03-key-090922123549-phpapp01/85/D-32-320.jpg)
![std.regex
• std.regexp
• PCRE ECMA standard
auto r = regex("ab");
foreach(m; match("abcabcabab", r))
{
writefln("%s[%s]%s", m.pre, m.hit, m.post);
}](https://image.slidesharecdn.com/dataizu-lt03-key-090922123549-phpapp01/85/D-34-320.jpg)
D言語をたまには真面目に紹介してみる
- 1. D Thu, September 22, 2009
- 2. • tama : repeatedly • T • • ( ) • D ...
- 3. • •D
- 5. D • Digital Mars Walter • M$ • • ( •
- 6. • DMD • GDC • • GCC • D.NET • → LDC • • LDC • DLI • LLVM • … • GDC
- 7. DMD • • 1-2 • • 1 2 3
- 8. 1 2
- 9. • • • arr + 10 • • Ruby arr[1..7]
- 10. const / immutable • const • const • immutable • • ( )
- 11. • pure • nothrow • ref int foo() { ...; return *p; } ref foo = 3; • •
- 12. • op* • override • alias this ( ) class Foo { Foo foo; Bar bar; foo.func; // bar.func call alias bar this; }
- 13. Template • C++ • !() → Foo!(int)(args); • C++ +α • template • Mixin
- 14. Template • template Foo(T) { class Foo { } void foo() { } } • template Foo(T) { class Foo { } class Foo(T) { } }
- 15. Mixin • • Template • D • Ruby mixin • TMP mixin
- 16. TMP • • • static if • • is • • concept if • • • etc... • alias etc...
- 17. static if • if
- 18. is •
- 20. • TLS • shared • shared • __gshared • synchronized
- 21. • enum • • final switch • •
- 22. enum enum Foo : string { A = “a”, B = “b”, C = “c” } final switch (foo) { case Foo.A, Foo.B: ... break; case Foo.C: ... break; // break // default: }
- 23. • Eiffel • in/out invariant • • release
- 24. void func(int v) int func() class Foo in out(r) { { { int v; assert(v); assert(r); } } invariant() body body { { { assert(v); ... return 0; } } } }
- 25. • unittest {} • int foo() { return 0; } unittest { assert(foo == 0); }
- 26. GC • • GC • GC ML • GC
- 27. DIP • D improve proposal • • • •
- 28. • • • • • etc...
- 29. • 2 • Andrei ML • •3 • • Noop C# (ry
- 30. Phobos
- 31. std.range • Range • Phobos • R.I.P opApply • Iterators must go • Range • etc...
- 32. range • Recurrence auto fib = recurrence!("a[n-1] + a[n-2]")(1, 1); foreach (e; take(10, fib)) { writeln(e); } • random int[] a = [ 0, 1, 2, 3, 4, 5, 6, 7, 8 ]; auto rnd = Random(unpredictableSeed); foreach (e; randomCover(a, rnd)) { writeln(e); }
- 33. std.contract • enforce auto file = fopen(“hoge.d”) if (file is null) throw new Exception; auto file = enforce(fopen(“hoge.d”)) // null
- 34. std.regex • std.regexp • PCRE ECMA standard auto r = regex("ab"); foreach(m; match("abcabcabab", r)) { writefln("%s[%s]%s", m.pre, m.hit, m.post); }
- 35. • std.algorithm • STL • std.variant • Variant • std.traits • TMP template
- 36. • Andrei • Boost::Optional • net • replace • Tango …
- 37. Appendix • D official site • • The Case for D • • C/C++ D 2.0