Recently I've been asked if I could give a speech about D in my university. It
will be of one hour of long.
I not respond yet, but I think that I will do it. Actually I have the problem
that I don't know well how explain well too many features and things of D that
I like. I think that only talking
I understand from the documentation that the -release compiler switch turns
off array bounds checking for system and trusted functions.
Is it correct that the following code should seg fault when compiled with
-release ?
string[string] h;
h[abc] = def;
string s = h[aaa];
I.e. retrieving from
On 09/10/2011 11:00, Zardoz wrote:
Recently I've been asked if I could give a speech about D in my university. It
will be of one hour of long.
I not respond yet, but I think that I will do it. Actually I have the problem
that I don't know well how explain well too many features and things of D
On 09-10-2011 13:24, Graham Cole wrote:
I understand from the documentation that the -release compiler switch turns off
array bounds checking for system and trusted functions.
Is it correct that the following code should seg fault when compiled with
-release ?
string[string] h;
h[abc] = def;
On 09.10.2011 14:00, Zardoz wrote:
Recently I've been asked if I could give a speech about D in my university. It
will be of one hour of long.
I not respond yet, but I think that I will do it. Actually I have the problem
that I don't know well how explain well too many features and things of D
(I show this here because it's probably a silly idea, but it may a chance to
learn something.)
Do you like the idea of a POD that is always managed by reference, as class
instances?
ref struct Foo {}
static assert(Foo.sizeof == 1);
void main() {
Foo f1; // void reference
Foo f2 = new
Talk about stuff that's hard to do or impossible in C++ (or just a PITA
like the whole language) and compare it to some nifty D code.
For example template metaprogramming. No easy way to do template
constraints, no is expressions nor a proper typeof so you have to use
specialization a lot.
I think this is what refcounted structs are for.
Things that really convince me are comparisons with already existing stuff.
Show what the problems are with an example program like c++ or java and show
how d resolves the issue. Be careful though, one of the first things that
put me off is when I feel it's too biased and they only show possitive
On Sunday, October 09, 2011 22:42:35 Andrej Mitrovic wrote:
I think this is what refcounted structs are for.
That or make it a class and make it final.
- Jonathan M Davis
Le 09/10/2011 12:00, Zardoz a écrit :
Recently I've been asked if I could give a speech about D in my university. It
will be of one hour of long.
I not respond yet, but I think that I will do it. Actually I have the problem
that I don't know well how explain well too many features and things of
On 10/9/2011 5:18 PM, deadalnix wrote:
Le 09/10/2011 12:00, Zardoz a écrit :
Recently I've been asked if I could give a speech about D in my
university. It
will be of one hour of long.
I not respond yet, but I think that I will do it. Actually I have the
problem
that I don't know well how
12 matches
Mail list logo
