On Monday, 29 October 2018 at 16:01:38 UTC, Mike Parker wrote:
One of the easiest ways to support the D Language Foundation is
using smile.amazon.com when you make a purchase. Until Nov 2,
they're running a special where they're donating 5% (10 times
the usual amount) you buy through
On Sunday, 16 September 2018 at 20:19:32 UTC, Murilo wrote:
Hello everyone, I was so amazed with the D language that I
created a facebook group for us all to be connected and share
information. It is called "Programming in D", it has already 55
members. Please join the group and invite
On Sunday, 19 August 2018 at 23:49:21 UTC, Nicholas Wilson wrote:
On Sunday, 19 August 2018 at 20:33:45 UTC, Laeeth Isharc wrote:
[...]
Note that the D repl will only work on platforms where drepl
works i.e. platform with shared library support. It will
_build_ on OSX due to
On Saturday, 28 March 2015 at 20:35:07 UTC, Walter Bright wrote:
On 3/27/2015 12:34 PM, w0rp wrote:
Sean Parent's advice for no raw loops comes to mind.
https://channel9.msdn.com/Events/GoingNative/2013/Cpp-Seasoning
With that rule,
basically a one-line body for foreach becomes acceptable.
On Wednesday, 3 September 2014 at 09:20:44 UTC, Andrei
Alexandrescu wrote:
I recently got the access logs for dmd downloads through August
(and Sep 1st). [snip]
Nice! Will be interesting to see how much the recent increase
contributes to sustained activity/growth.
Any idea what caused the
Ha, that opDollar thing in the HTML generator is the nastiest D
hack I've seen :-P
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
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
On Tuesday, 10 June 2014 at 16:30:31 UTC, Andrei Alexandrescu
wrote:
Leverage - my talk at Lang.NEXT.
I think this is one of your better D talks. It's refreshing to
see honest admittance of the shortcomings of D's features,
although I think a little too much time was spent talking about
Well, I didn't considering this D.announce worthy, but Andrei
suggested I post the news.
As the title suggests, after over 5 years in the games industry
I've decided to shake things up a bit and join Facebook at their
London office.
Unfortunately, that's about all there is to say at the
On Sunday, 30 March 2014 at 20:43:52 UTC, Andrej Mitrovic wrote:
On 3/30/14, ixid nuacco...@gmail.com wrote:
Perhaps we should unleash a community effort to match clang?
Sounds like wasted effort, why improve tools for parsing C++
instead
of improving tools for parsing D?
It's good
On Saturday, 11 January 2014 at 03:53:28 UTC, Timon Gehr wrote:
One issue with the API is that it does not deal with graphs
with more than one edge between two given vertices very well. I
think it'd need a separate edge abstraction. (Formally, a graph
is just a pair of sets (V,E) with two
On Saturday, 11 January 2014 at 09:11:45 UTC, Philippe Sigaud
wrote:
* I sometimes have to use graphs with more than just `weight`
on edges
(names as strings, chars, for example for a state machine,
etc). Do
you think you could extend your design to allow
parameterization on
edges? Of course,
On Thursday, 9 January 2014 at 22:53:02 UTC, qznc wrote:
For the visitation API design: Your map approach (bool[Vertex]
m_visited) is probably the most generic one.
A variant, where the nodes store the flag internally is more
efficient, though.
Unless the graph is infinite ;-)
But yes, for
On Friday, 10 January 2014 at 18:26:15 UTC, Joseph Rushton
Wakeling wrote:
On Friday, 10 January 2014 at 11:07:13 UTC, John Colvin wrote:
Nice :)
I presume you are aware of https://github.com/WebDrake/Dgraph
Good inspiration for me to get back to work on that :-)
@Peter -- this is really
Trying to write a bit more about D on my blog now. To start, I've
written about a proof-of-concept range-based API for graph search.
http://poita.org/2014/01/09/range-based-graph-search-in-d.html
I'd greatly appreciate any feedback on the design. As we don't
yet have a graph library for D, it
On Thursday, 9 January 2014 at 22:54:11 UTC, bearophile wrote:
Peter Alexander:
http://poita.org/2014/01/09/range-based-graph-search-in-d.html
I'd like to see the usage of a not implicit graph.
There is a crude example in the unit test in the file.
You could actually create an non
On Friday, 2 August 2013 at 17:16:30 UTC, Andrei Alexandrescu
wrote:
On 2013-08-02 15:44:13 +, Leandro Lucarella said:
I'm not say is right or wrong for people to have this reflex
of thinking
about multipliers, I'm just saying if you care about
transmitting the
message as clear as you can,
Content looks great, but I was continually distracted by the
consistent use of lowercase i as a pronoun. Please fix this. It
would be a real shame for such a long and otherwise excellent
article to be rendered amateurish by such a trivial error.
Just in case English isn't your first language:
On Friday, 12 July 2013 at 13:26:21 UTC, Ary Borenszweig wrote:
This sentence worries me a bit:
The code shown above has been tested with dmd 2.063.2
It seems like every minor release of D works different than
previous ones. Is that true? Isn't it enough to say D2? Can
something be done to
On Sunday, 7 July 2013 at 03:03:03 UTC, Andrei Alexandrescu wrote:
Terrible. If you have conditionals, iteration, functions, and
objects
in D's straight programming support, you should have
conditionals,
iteration, functions, and objects in D's metalanguage.
:-(
template allSatisfy(alias F,
On Sunday, 7 July 2013 at 13:20:14 UTC, Timon Gehr wrote:
On 07/07/2013 02:27 PM, Peter Alexander wrote:
...
We're almost there with CTFE, but CTFE can only run functions
that could
run at runtime. In a crazy world where types were first class
objects,
stuff like this would be feasible
On Friday, 14 June 2013 at 05:48:17 UTC, Johannes Pfau wrote:
Am Fri, 14 Jun 2013 00:30:24 +0200
schrieb Peter Alexander peter.alexander...@gmail.com:
What can gdb do in particular that Visual Studio can't?
Can the visual studio debugger show the contents of registers?
Yes, Debug-Windows
On Friday, 14 June 2013 at 07:40:55 UTC, Dicebot wrote:
Does Visual Studio debugger have some sort of scripts/macros?
When I was in a small kernel dev related team, we had a lot of
own utility macros for gdb to help debug kernel core dumps,
especially for messy cases like stack corruption.
On Friday, 14 June 2013 at 07:40:42 UTC, Don wrote:
On Friday, 14 June 2013 at 06:49:08 UTC, Jacob Carlborg wrote:
I agree. But he said at the end of the talk that he didn't
want codecompletion refactoring or anything like that. Now he
said he just wants something better than Notepad that is
On Thursday, 13 June 2013 at 07:31:04 UTC, Don wrote:
Actually not. I'm just opposed to any work on them right now.
The point is that all of those things are COMPLETELY WORTHLESS
if the IDE crashes. It's not just a bug. It's an absolute
showstopper, and I'm begging the community to do
On Thursday, 13 June 2013 at 09:06:00 UTC, Don wrote:
Mono-D and Eclipse DDT both have major problems with long
pauses while typing (eg 15 seconds unresponsive) and crashes.
Both of them even have modules of death where just viewing
the file will cause a crash. If you're unlucky enough to get
On Thursday, 13 June 2013 at 08:25:19 UTC, Dicebot wrote:
And I just can't imagine D syntax highlighting crashing vim or
emacs :)
The syntax highlighting has actually bogged down vim for me in
the past. I had a file with a large array in it (hundreds of
lines), and scrolling over those lines
On Thursday, 13 June 2013 at 16:53:38 UTC, Walter Bright wrote:
Back in the bad old DOS days, there were many code editors that
worked instantly. No perceptible delays at all. I find it
ironic that today, with machines 1000 times faster, some
vendors consider it acceptable to have 15 second
On Thursday, 13 June 2013 at 18:49:14 UTC, Walter Bright wrote:
On 6/13/2013 3:48 AM, Regan Heath wrote:
What are the basic features you would require of a development
environment,
People tell me that intellisense is the #1 feature.
The debugger is the #1 feature I'd miss from my day job if
On Thursday, 23 May 2013 at 09:05:02 UTC, Don wrote:
This means that the const variable x has been initialized TWICE!
That's no different from non-const members.
struct Foo { int x = 1; }
Foo f = Foo(2); // f.x is 2
The initialiser is a default value if you don't provide one in
the
On Sunday, 3 February 2013 at 18:24:05 UTC, Dejan Lekic wrote:
Welcome to reality Bearophile!!!
In real projects people do the job as best as they can at the
moment, and they probably, and with right, do not care what
people who only theorise, criticise, and philosophise think!
You write
On Sunday, 3 February 2013 at 20:54:29 UTC, Nick Sabalausky wrote:
Also, AIUI, foreach(i; 0..10) involves a range and function
calls, so
perhaps they want to be certain there isn't any overhead that
accidentally fails to get optimized out?
There is no range or function calls! That syntax
On Sunday, 3 February 2013 at 22:00:05 UTC, bearophile wrote:
Nick Sabalausky:
Why is it silly? (Genuine question)
Silly wasn't the right word, sorry.
But generally if a language offers you a clean feature (D
contract programming is designed clean enough) it's better to
use it, when you
On Thursday, 20 December 2012 at 05:29:46 UTC, Andrei
Alexandrescu wrote:
Vote up!
http://www.reddit.com/r/programming/comments/155ivw/three_optimization_tips_for_c_video/
Andrei
I think the most interesting thing from that talk is when you
said that Facebook's back end code is spending
On Wednesday, 12 December 2012 at 01:07:56 UTC, David Nadlinger
wrote:
After a long wait and many unexpected delays, there is finally
going to be a released version of LDC, the LLVM D compiler,
again! I'll keep this post short and (hopefully) sweet, a more
detailed announcement will follow
On Saturday, 17 November 2012 at 11:03:18 UTC, Jacob Carlborg
wrote:
I just read the slides of a talk from that latest LLVM
Developers' Meeting. It's a talk about modules by Doug Gregor
from Apple. It seems that they already have started to
implement this new feature in Clang.
It's about
On Sunday, 18 November 2012 at 21:21:12 UTC, Jonathan M Davis
wrote:
Also, I think that so many C/C++ devs are so used to the
compile times that
they get with them that it's nowhere near the top of the list
of features that
they want. It probably didn't even occur to many of them. Not
to
On Friday, 28 September 2012 at 09:43:34 UTC, Timur Gafarov wrote:
dlib is a growing collection of native D language libraries
serving as a framework for various higher-level projects - such
as game engines, rendering pipelines and multimedia
applications. It is written in D2 and has no
On Thursday, 20 September 2012 at 14:15:22 UTC, deadalnix wrote:
What is Sininimp-Mulinint object-oriented style ?
I believe it's some weird way of saying:
SINgle INheritance of IMPlementation
MULtiple INheritance of INTerfaces
As opposed to C++ where you can multiply inherit
On Thursday, 6 September 2012 at 00:00:31 UTC, bearophile wrote:
Walter Bright:
I'd like it if you could add some instrumentation to see what
accounts for the time difference. I presume they both use the
same D source code.
Maybe that performance difference comes from the sum of some
On Wednesday, 5 September 2012 at 12:27:05 UTC, Benjamin Thaut
wrote:
Then because they are const, TypeInfo_Const.toString() will be
called:
override string toString()
{
return cast(string) (const( ~ base.toString() ~ ));
}
which allocates, due to array concardination.
On Friday, 24 August 2012 at 02:23:04 UTC, F i L wrote:
Jonathan M Davis wrote:
Well, since it'll be years before we even consider creating
D3, we're in
trouble if we need D3 for D to be successful. D2 isn't
perfect, but it's still
a very solid language and outshines more entrenched languages
On Sunday, 19 August 2012 at 22:22:28 UTC, Walter Bright wrote:
I find it more likely that the NaN will go unnoticed and
cause rare bugs.
NaNs in your output are pretty obvious. For example, if your
accounting program prints NAN for the amount on the payroll
cheques, someone is guaranteed
On Monday, 20 August 2012 at 20:21:12 UTC, cal wrote:
I just tried this:
float a, b = 10;
writeln(min(a, b), , , fmin(a, b));
Result:
nan, 10
I think that is incorrect - both should give NaN. The
scientific viz software I use at work returns NaN for any
numerical operation on NaN values,
On Sunday, 19 August 2012 at 05:13:09 UTC, dennis luehring wrote:
Am 19.08.2012 06:12, schrieb Jonathan M Davis:
On Friday, August 17, 2012 17:03:13 Walter Bright wrote:
Our discussion on this in the last few days inspired me to
write a blog post
about it:
On Sunday, 19 August 2012 at 14:14:00 UTC, Michel Fortin wrote:
On 2012-08-19 05:54:49 +, Walter Bright
newshou...@digitalmars.com said:
On 8/18/2012 9:21 PM, Nick Sabalausky wrote:
After actually *using* both D (default-initialization) and C#
(statically/conservatively ensure things
Ok, got another regression. Quite a scary bug.
http://d.puremagic.com/issues/show_bug.cgi?id=8497
On Thursday, 2 August 2012 at 20:38:11 UTC, Andrej Mitrovic wrote:
On 8/2/12, Philippe Sigaud philippe.sig...@gmail.com wrote:
On Thu, Aug 2, 2012 at 10:18 PM, dnewbie r...@myopera.com
wrote:
Memory usage of my program when compiled by dmd2.057, 2.058,
2.059
2.060:
On Friday, 3 February 2012 at 13:18:14 UTC, deadalnix wrote:
Le 02/02/2012 03:07, Andrei Alexandrescu a écrit :
I'm announcing this here because inevitably D will be
mentioned during
the panel with Bjarne Stroustrup, Herb Sutter, Hans Boehm, and
myself.
See you online!
On 23/12/11 4:01 AM, Walter Bright wrote:
For those where the download speed from the Digital Mars server is too
slow:
https://github.com/downloads/D-Programming-Language/dmd/dmd.2.057.zip
Got 1 MB/s here (that's megaBYTES not bits).
Nice :-)
On 14/12/11 7:05 AM, Walter Bright wrote:
Highlights are use of XMM floating point registers in 64 bit targets,
and now supporting OS X 64 as a target.
http://www.digitalmars.com/d/2.0/changelog.html
http://ftp.digitalmars.com/dmd.2.057.zip
A lot of people put a ton of effort into making this
On 4/12/11 12:56 AM, David wrote:
Am 04.12.2011 01:38, schrieb dsimcha:
I don't know much about computer graphics but I take it that a sane
design for a matrix/vector library geared towards graphics is completely
different from one geared towards general numerics/scientific computing?
I'm
On 30/10/11 10:36 AM, Timon Gehr wrote:
On 10/30/2011 09:52 AM, Max Wolter wrote:
Hey there.
Thanks for your good work.
I decided to test your xinok sort in my implementation of the A*
algorithm; since the list of open nodes will always be partially sorted,
it should give better performance
On 30/10/11 4:30 PM, Andrei Alexandrescu wrote:
On 10/30/11 3:43 AM, Max Wolter wrote:
Ola.
Well, my A* algorithm is already working very nicely - and imo there
isn't any problem-specific optimization left to implement other than the
data structures holding the nodes themselves.
A* is fairly
On 18/03/11 8:23 PM, Thomas Mader wrote:
Am 2011-03-18 21:01, schrieb Andrei Alexandrescu:
We have just got word from Google - Digital Mars has been accepted as
a mentoring organization for Google Summer of Code 2011.
Thanks to Trass3r for bringing up this idea, to Jens Mueller for
reiterating
On 2/01/11 2:43 PM, Andrei Alexandrescu wrote:
On 1/2/11 8:10 AM, Peter Alexander wrote:
On 13/12/10 2:31 PM, Andrej Mitrovic wrote:
Must be a very simple language.. and Google probably pulled some
strings, or they have someone that worked/collaborated with GCC devs?
dunno..
On 12/13/10
57 matches
Mail list logo
