Re: EMSI has a Github page
On 6/26/2014 2:26 PM, Brian Schott wrote: https://github.com/economicmodeling Stuff that's been made available: * D implementation of the DDoc macro processor * Documentation generator that doesn't need the compiler - No more requirement to use all the -I options to just get docs. - Template constraints don't vanish. - size_t doesn't turn into ulong. - Javascript-based offline search. * Containers library backed by std.allocator - Less sitting around waiting for the GC Very nice. Thank you!
Re: EMSI has a Github page
On 06/27/2014 09:16 AM, Walter Bright via Digitalmars-d-announce wrote: On 6/26/2014 2:26 PM, Brian Schott wrote: https://github.com/economicmodeling Stuff that's been made available: * D implementation of the DDoc macro processor * Documentation generator that doesn't need the compiler - No more requirement to use all the -I options to just get docs. - Template constraints don't vanish. - size_t doesn't turn into ulong. - Javascript-based offline search. * Containers library backed by std.allocator - Less sitting around waiting for the GC Very nice. Thank you! Indeed, very nice! but where is the dub package?
Re: EMSI has a Github page
On 2014-06-26 23:26, Brian Schott wrote: * Documentation generator that doesn't need the compiler Do you have any example of documentation generated with this tool? -- /Jacob Carlborg
Re: EMSI has a Github page
On Thursday, 26 June 2014 at 21:26:55 UTC, Brian Schott wrote: * Documentation generator that doesn't need the compiler How does it relate to ddox?
DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
http://www.reddit.com/r/programming/comments/298vtt/dconf_2014_panel_with_walter_bright_and_andrei/ https://twitter.com/D_Programming/status/482546357690187776 https://news.ycombinator.com/newest https://www.facebook.com/dlang.org/posts/874091959271153 Andrei
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
http://youtu.be/TNvUIWFy02I
Re: EMSI has a Github page
https://github.com/economicmodeling/containers/blob/master/src/containers/dynamicarray.d#L72 Does this work? You try to remove new range instead of old one. Also you should remove old range only after you added new range, so that GC won't catch you in the middle.
Re: EMSI has a Github page
And then it will still be able to catch you between realloc and addRange.
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
On 6/27/2014 12:53 PM, Dicebot wrote: http://youtu.be/TNvUIWFy02I Ack, need to work on my posture :-(
Re: EMSI has a Github page
On Friday, 27 June 2014 at 20:33:22 UTC, Kagamin wrote: https://github.com/economicmodeling/containers/blob/master/src/containers/dynamicarray.d#L72 Does this work? You try to remove new range instead of old one. Also you should remove old range only after you added new range, so that GC won't catch you in the middle. The issue tracker is located here: https://github.com/economicmodeling/containers/issues
Re: EMSI has a Github page
On Friday, 27 June 2014 at 12:31:09 UTC, Dicebot wrote: On Thursday, 26 June 2014 at 21:26:55 UTC, Brian Schott wrote: * Documentation generator that doesn't need the compiler How does it relate to ddox? DDOX uses the compiler's JSON output. This new documentation generator only looks at the code.
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
I have two questions that I've come upon lately:
1) How was it decided that there should be implicit conversion
between signed and unsigned integers in arithmetic operations,
and why prefer unsigned numbers?
E.g. Signed / Unsigned = Unsigned
Is this simply compatibility with C or is there something greater
behind this decision.
2) With regard to reducing template instantiations:
I've been using a technique similar to the one mentioned in the
video: separating functions out of templates to reduce bloat.
My question is: does a template such as:
T foo(T)(T x)
if (isIntegral!T) { return x; }
Get instantiated multiple times for const, immutable, etc.
qualifiers on the input?
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
On Friday, 27 June 2014 at 23:30:39 UTC, safety0ff wrote:
2) With regard to reducing template instantiations:
I've been using a technique similar to the one mentioned in the
video: separating functions out of templates to reduce bloat.
My question is: does a template such as:
T foo(T)(T x)
if (isIntegral!T) { return x; }
Get instantiated multiple times for const, immutable, etc.
qualifiers on the input?
Yes, but bear in mind that those qualifiers are often stripped
with IFTI, e.g.:
int a;
const int b;
immutable int c;
foo(a);
foo(b);
foo(c);
These all call foo!int
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
On Saturday, 28 June 2014 at 02:02:28 UTC, Peter Alexander wrote:
On Friday, 27 June 2014 at 23:30:39 UTC, safety0ff wrote:
2) With regard to reducing template instantiations:
I've been using a technique similar to the one mentioned in
the video: separating functions out of templates to reduce
bloat.
My question is: does a template such as:
T foo(T)(T x)
if (isIntegral!T) { return x; }
Get instantiated multiple times for const, immutable, etc.
qualifiers on the input?
Yes, but bear in mind that those qualifiers are often stripped
with IFTI, e.g.:
int a;
const int b;
immutable int c;
foo(a);
foo(b);
foo(c);
These all call foo!int
Awesome, thanks!
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
On Saturday, 28 June 2014 at 02:46:25 UTC, safety0ff wrote: On Saturday, 28 June 2014 at 02:02:28 UTC, Peter Alexander int a; const int b; immutable int c; foo(a); foo(b); foo(c); These all call foo!int Awesome, thanks! ... I just tried this and I'm wrong. The qualifier isn't stripped. Gah! Three different versions! I could have sworn D did this for primitive types. This makes me sad :-(
Re: DConf Day 1 Panel with Walter Bright and Andrei Alexandrescu
On Saturday, 28 June 2014 at 03:33:37 UTC, Peter Alexander wrote: ... I just tried this and I'm wrong. The qualifier isn't stripped. Gah! Three different versions! I could have sworn D did this for primitive types. This makes me sad :-( I guess you can make all kinds of code that depends on the qualifier. I tried using ld.gold to play with icf (identical code folding,) but I did not manage to get a working binary out of gold (regardless of icf.)
