iskm/learnxinyminutes-docs
1
0
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-12-23 09:41:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Improve code comments

Browse Source
This commit is contained in:
Gautam Kotian 2015-10-13 18:17:11 +02:00
parent 064b82eab4
commit 4be1044a64
1 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
d.html.markdown
View File

@ -38,9 +38,10 @@ void main() {
writeln(i);
}
auto n = 1; // use auto for type inferred variables
// 'auto' can be used for inferring types.
auto n = 1;
// Numeric literals can use _ as a digit seperator for clarity
// Numeric literals can use '_' as a digit separator for clarity.
while(n < 10_000) {
n += n;
}
@ -49,13 +50,15 @@ void main() {
n -= (n / 2);
} while(n > 0);
// For and while are nice, but in D-land we prefer foreach
// The .. creates a continuous range, excluding the end
// For and while are nice, but in D-land we prefer 'foreach' loops.
// The '..' creates a continuous range, including the first value
// but excluding the last.
foreach(i; 1..1_000_000) {
if(n % 2 == 0)
writeln(i);
}
// There's also 'foreach_reverse' when you want to loop backwards.
foreach_reverse(i; 1..int.max) {
if(n % 2 == 1) {
writeln(i);
@ -80,7 +83,7 @@ struct LinkedList(T) {
class BinTree(T) {
T data = null;
// If there is only one template parameter, we can omit parens
// If there is only one template parameter, we can omit the parentheses
BinTree!T left;
BinTree!T right;
}