On Tuesday, 15 April 2014 at 17:01:38 UTC, Walter Bright wrote:
http://wiki.dlang.org/DIP60
Start on implementation:
https://github.com/D-Programming-Language/dmd/pull/3455
Good start.
However, what is still an open issue is that @nogc can be stopped
by allocations in another thread. We
On Monday, 19 May 2014 at 08:20:54 UTC, Namespace wrote:
On Sunday, 18 May 2014 at 22:29:04 UTC, bearophile wrote:
Undefined Behavior in C++; what is it, and why should I
care:
https://github.com/boostcon/cppnow_presentations_2014/blob/master/files/Undefined-Behavior.pdf?raw=true
This reminds
On Wednesday, 17 September 2014 at 15:41:02 UTC, Peter Alexander
wrote:
On Wednesday, 17 September 2014 at 14:59:48 UTC, Andrei
Alexandrescu wrote:
Awesome. Suggestion in order to leverage crowdsourcing: first
focus on setting up the test bed such that adding benchmarks
is easy. Then you and
On Thursday, 30 October 2014 at 17:11:40 UTC, First Try wrote:
On Thursday, 30 October 2014 at 16:48:23 UTC, Gary Willoughby
wrote:
On Thursday, 30 October 2014 at 13:04:26 UTC, First Try wrote:
1.) ADD Windows import of the C headers.
2.) ADD libraries such as Database and Gui
3.) Get a
On Friday, 16 January 2015 at 15:55:53 UTC, Brian Schott wrote:
On Friday, 16 January 2015 at 15:06:42 UTC, Ary Borenszweig
wrote:
The way I did it in Descent (I copied the logic from JDT) is
to parse the code into an AST, and then walk the AST in sync
with a lexer.
My dfmt tool does
On Monday, 12 January 2015 at 05:43:33 UTC, Zach the Mystic wrote:
On Monday, 12 January 2015 at 00:38:20 UTC, Walter Bright wrote:
On 1/11/15 10:48 AM, Walter Bright wrote:
The main problem is what to do about comments, which don't
fit into the
grammar.
In the first version comments might
On Monday, 12 January 2015 at 05:43:33 UTC, Zach the Mystic wrote:
On Monday, 12 January 2015 at 00:38:20 UTC, Walter Bright wrote:
On 1/11/15 10:48 AM, Walter Bright wrote:
The main problem is what to do about comments, which don't
fit into the
grammar.
In the first version comments might
On Monday, 30 March 2015 at 22:50:21 UTC, Andrei Alexandrescu
wrote:
Violent agreement here. I was just saying unittests should be
part of the build process, not the run process. Running
unittests and then the app is a bad idea.
Sounds like a good idea to me.
Then -unittest should be enabled
Looks like I will give a talk about D to our local Functional
Programming User Group in August. Feel free to join, if you can
be in Karlsruhe, Germany:
http://www.meetup.com/de/The-Karlsruhe-Functional-Programmers-Meetup-Group/events/22343/
As far as I know, pretty much nobody there knows
On Thursday, 25 June 2015 at 12:39:11 UTC, qznc wrote:
Looks like I will give a talk about D to our local Functional
Programming User Group in August. Feel free to join, if you can
be in Karlsruhe, Germany:
On Wednesday, 19 August 2015 at 11:22:09 UTC, Dmitry Olshansky
wrote:
On 18-Aug-2015 15:37, Vladimir Panteleev wrote:
I think stability of the DMD backend is a goal of much higher
value than
the performance of the code it emits. DMD is never going to
match the
code generation quality of LLVM
On Wednesday, 19 August 2015 at 19:05:09 UTC, Lewis wrote:
I was wondering if there was a way to dump the contents of the
heap to a file.
If the heap is guaranteed to be in one contiguous chunk, then
all I would need is:
- The start address of the heap
- The current size of the heap
If it
Am 20.08.2015 um 15:06 schrieb yawniek:
On Wednesday, 19 August 2015 at 20:15:48 UTC, qznc wrote:
On Thursday, 25 June 2015 at 12:39:11 UTC, qznc wrote:
If you are interested in my slides:
http://beza1e1.tuxen.de/stuff/FunctionalD.odp
http://beza1e1.tuxen.de/stuff/FunctionalD.pdf
I spent
On Wednesday, 21 October 2015 at 20:50:29 UTC, Andrei
Alexandrescu wrote:
Better late than later.
http://wiki.dlang.org/Vision/2015H2_(draft)
Destroy. After we make this good I'll rename it and make it
official.
I'd again raise the issue of an official blog/news channel.
People would like
On Tuesday, 10 November 2015 at 00:46:39 UTC, Adam D. Ruppe wrote:
Not necessarily. At least a separate download gives you a
chance to verify the download was completed too. Piping direct
into shell could deliver an end-of-file in the middle of a file
(e.g. in the case of a network error)
On Monday, 19 October 2015 at 19:20:15 UTC, ParticlePeter wrote:
I am a master student of Computational Visualistics / Computer
Science shortly before starting my master thesis.
My personal interest is the combination of cs and art, in
particular I would like to write about and create a
On Wednesday, 7 October 2015 at 15:06:55 UTC, Mike Parker wrote:
I'm looking for ideas on how to label the ranges returned from
take and drop. Some examples of what I think are appropriate
categories for other types of ranges:
Generative - iota, recurrence, sequence
Compositional - chain,
On Tuesday, 17 November 2015 at 18:47:58 UTC, Andrei Alexandrescu
wrote:
I'm thinking of inviting a notable industry luminary to deliver
a conference keynote. Please reply to this with ideas! -- Andrei
John Carmack or Niklaus Wirth would be my favorites so far,
although I'd consider the
Since issue 13487 [0] seems to rot away, I started something on
my own.
Made a benchmark script and inserted C/C++/D programs for
comparison.
However, various programs are broken, as you see in the example
report [1].
The D code is at least 7 years old. I only fixed compile errors.
The C/C++
On Saturday, 29 August 2015 at 12:35:14 UTC, Dmitry Olshansky
wrote:
Well, here is the regex-dna one with 3 versions including C-T
regex:
https://github.com/DmitryOlshansky/FReD/blob/master/bench/regex-dna/d_dna.d
Thanks Dmitry!
Which version should be used?
On Sunday, 30 August 2015 at 14:56:34 UTC, Dmitry Olshansky wrote:
Was one of the first benchmarks where std.regex destroyed the
competition. It may still do so ;)
Rust has compile-time regex as well now.
http://doc.rust-lang.org/regex/regex/index.html#the-regex!-macro
On Saturday, 29 August 2015 at 12:05:18 UTC, qznc wrote:
Maybe somebody has already fixed or improved benchmark programs?
As of now, most things work.
Only meteor.d is broken. Crashes at runtime.
Ldc and gdc sometimes fail, because they are behind dmd.
regexdna.cpp fails, because re2 is not
On Saturday, 29 August 2015 at 19:17:47 UTC, Dmitry Olshansky
wrote:
On 29-Aug-2015 21:14, qznc wrote:
On Saturday, 29 August 2015 at 12:35:14 UTC, Dmitry Olshansky
wrote:
Well, here is the regex-dna one with 3 versions including C-T
regex:
On Monday, 31 August 2015 at 08:31:26 UTC, Joakim wrote:
I just stumbled across this recent Rust blog post where they
laid out their vision for the rest of the year, thought it was
very well done, strategic and specific:
http://blog.rust-lang.org/2015/08/14/Next-year.html
D really needs
On Monday, 31 August 2015 at 07:38:18 UTC, Enamex wrote:
Some posters on reddit remarked that D's sales pitch on the
website is unnecessarily long and unindicative.
I'm only making a suggestion; suggest others or comment on this
one:
D is a multiparadigm systems programming language with
On Monday, 31 August 2015 at 11:26:57 UTC, Nemanja Boric wrote:
On Monday, 31 August 2015 at 10:47:12 UTC, qznc wrote:
On Monday, 31 August 2015 at 08:31:26 UTC, Joakim wrote:
[...]
Some visions for 2016 I guess:
* D Foundation
* ddmd
* std.allocator (important since various other Phobos
On Thursday, 3 September 2015 at 17:48:23 UTC, Prudence wrote:
2. Write a translation process that essentially "updates" the
source code to work.
Lucky you: https://github.com/Hackerpilot/dfix
On Sunday, 30 August 2015 at 13:21:42 UTC, qznc wrote:
On Saturday, 29 August 2015 at 19:17:47 UTC, Dmitry Olshansky
wrote:
On 29-Aug-2015 21:14, qznc wrote:
On Saturday, 29 August 2015 at 12:35:14 UTC, Dmitry Olshansky
wrote:
Well, here is the regex-dna one with 3 versions including
C-T
On Tuesday, 8 September 2015 at 08:24:43 UTC, Robert burner
Schadek wrote:
Why not go really big. aka:
http://forum.dlang.org/post/vzcvwrbqpeamtnopm...@forum.dlang.org
You suggest to create a benchmark suite from all the unittests in
Phobos?
I don't think this is a good idea. Most programs
On Tuesday, 8 September 2015 at 09:27:13 UTC, qznc wrote:
On Tuesday, 8 September 2015 at 08:24:43 UTC, Robert burner
Schadek wrote:
Why not go really big. aka:
http://forum.dlang.org/post/vzcvwrbqpeamtnopm...@forum.dlang.org
You suggest to create a benchmark suite from all the unittests
in
On Tuesday, 8 September 2015 at 18:41:10 UTC, Isaac Gouy wrote:
On Saturday, 29 August 2015 at 12:05:18 UTC, qznc wrote:
I started something on my own.
Kudos to qznc!
The C/C++ programs were selected quite randomly.
Note: There are separate C and C++ programs shown on the
benchmarks
On Tuesday, 8 September 2015 at 18:53:02 UTC, Isaac Gouy wrote:
On Tuesday, 8 September 2015 at 09:27:13 UTC, qznc wrote:
For example, threadring measures context switching.
thread-ring has aged badly. It was added when the measurements
were only made on single-core hardware, and Erlang's
On Tuesday, 3 May 2011 at 20:51:37 UTC, bearophile wrote:
Sean Cavanaugh:
In many ways the biggest thing I use regularly in game
development that I would lose by moving to D would be good
built-in SIMD support.
Don has given a nice answer about how D2 plans to face this.
To focus more what
On Tuesday, 8 September 2015 at 23:20:05 UTC, Ola Fosheim Grøstad
wrote:
On Tuesday, 8 September 2015 at 21:11:15 UTC, qznc wrote:
Yes. I'm not sure how to structure this whole suite. The
general goal is "D claims that it can match C/C++ in
performance, let's have some actual numbers". So far
The Rust people have this Crater [0,1] tool, which essentially
builds all Rust libraries with two compiler versions and compares
for regressions.
Since D has a central library repository as well, it would make
sense to do this broad testing as well. We don't have nightly
builds (or do we?),
On Wednesday, 9 September 2015 at 09:56:10 UTC, Ola Fosheim
Grøstad wrote:
I think the better approach is to write up the same algorithms
in a high level fashion (using generic templates on both sides)
from the ground up using the same constructs and measure the
ability to optimize.
That is
On Wednesday, 9 September 2015 at 08:56:56 UTC, Rikki Cattermole
wrote:
Or use travis-ci.
They have that as well: http://rust-ci.org/
On Wednesday, 9 September 2015 at 12:02:55 UTC, Jacob Carlborg
wrote:
I think it's a great idea. This has been suggested before. The
objections were that:
* If you do find a problem who should be responsible for
figuring out if it's a regression or an intended change?
It does raise the bar
On Wednesday, 9 September 2015 at 14:09:36 UTC, Iain Buclaw wrote:
import gcc.builtins; // OK, cheating. :-)
Thanks, I did not know this. :)
I would not consider it cheating. Using builtins in C is not
portable C11 either. It also shows off how D does versions.
Is there an overview of D user groups somewhere?
There is one in Berlin and one in the Valley, apparently. Walter
participates in the Cpp group in Seattle or something, if I
remember correctly.
On Wednesday, 9 September 2015 at 16:58:41 UTC, Russel Winder
wrote:
On Tue, 2015-09-08 at 21:11 +, qznc via Digitalmars-d wrote:
[…]
Yes. I'm not sure how to structure this whole suite. The
general goal is "D claims that it can match C/C++ in
performance, let's have some actual nu
On Friday, 18 September 2015 at 11:46:13 UTC, ponce wrote:
Something written down about the Jai language.
https://sites.google.com/site/jailanguageprimer/
I don't see any runtime polymorphism. Isn't that desirable for
games?
On Friday, 21 August 2015 at 09:17:57 UTC, tired_eyes wrote:
The slides are very intresting! Please consider submitting them
to GitHub Speaker Desk (https://speakerdeck.com/), dlang really
lacks of presense there (as usual). http://www.slideshare.net/
is also a good target.
Added them to
On Wednesday, 16 December 2015 at 21:05:27 UTC, Andrei
Alexandrescu wrote:
I was looking at
https://github.com/D-Programming-Language/dlang.org/pull/1169
and that bold sans serif proportional text for the code is
just... well let's say it's time to replace it.
What would be a good code font
On Friday, 27 November 2015 at 20:19:40 UTC, tcak wrote:
if(1) doSomething();
if(1) { doSomething(); }
You are correct here about hash calculation, but unless someone
touches to codes, this never happens, and no hash changes would
be seen. If someone is touching it as you exampled, checking
On Monday, 30 November 2015 at 09:43:58 UTC, Idan Arye wrote:
It's pointless to emit most of the JSON5 relaxations - I see no
reason why the emitter should specifically add trailing commas,
and I don't see how it can emit comments...
You might want to implement a pretty-print with the
On Thursday, 26 November 2015 at 11:12:07 UTC, tcak wrote:
I brought this topic in "Learn" a while ago, but I want to talk
about it again.
You are in a big team or working with a big code base. APIs are
being defined/modified, configuration constants are
defined/modified, structures are
On Tuesday, 31 May 2016 at 22:50:37 UTC, David Nadlinger wrote:
Another thing that might be interesting to do (now that you
have a "clever" baseline) is to start counting cycles and make
some comparisons against manual asm/intrinsics implementations.
For short(-ish) needles, PCMPESTRI is
On Thursday, 2 June 2016 at 19:41:30 UTC, Basile B. wrote:
Yesterday I've took the decision not to propose anymore PR for
Phobos bugfixes, even if most of the time it's easy.
1)
It can take up to 2 or 3 weeks until a "phobos bugfix" get
merged. Even a straight one.
2)
Once a pr gets the
On Tuesday, 31 May 2016 at 21:29:34 UTC, Andrei Alexandrescu
wrote:
On 05/31/2016 04:18 PM, Chris wrote:
I actually thought that dmd didn't place
`computeSkip` inside of the loop. This begs the question if it
should be
moved to the loop, in case we use it in Phobos, to make sure
that it is
as
On Thursday, 2 June 2016 at 18:14:08 UTC, Jack Stouffer wrote:
On Thursday, 2 June 2016 at 15:40:28 UTC, Seb wrote:
I heard this a lot too.
"You don't have a web server in your standard libary?? It's
2016!"
Just to be clear, it's not a good idea to have a full blown
server in your stdlib.
On Thursday, 2 June 2016 at 20:59:52 UTC, Basile B. wrote:
Eventually I'll come back to bugfix if they take Jake, but not
you Seb.
For a reason or another I don't like you wilzbach.
You are frustrated. I get that.
Don't make this personal for others, please. Maybe you should
ignore this
On Thursday, 2 June 2016 at 13:59:13 UTC, Seb wrote:
If I left out an area or you miss an application/usage - please
let me know!
The Javascript JIT Compiler Higgs:
https://github.com/higgsjs/Higgs
Vibe.d needs some examples. Looks like their website does not
have any.
On Wednesday, 8 June 2016 at 22:19:47 UTC, Bauss wrote:
D definitely needs some optimizations, I mean look at its
benchmarks compared to other languages:
https://github.com/kostya/benchmarks
I believe the first step towards better performance would be
identifying the specific areas that are
On Monday, 6 June 2016 at 20:19:20 UTC, Observer wrote:
On Monday, 6 June 2016 at 19:55:53 UTC, DLearner wrote:
If we allow _int foo;_ to declare an integer variable foo,
then suggest we have
_dec bar(a,b);_ to declare a decimal variable bar with a units
in total length, b units of decimal
On Tuesday, 7 June 2016 at 17:19:16 UTC, Wyatt wrote:
On Tuesday, 7 June 2016 at 08:05:58 UTC, Russel Winder wrote:
So instead of debating this endlessly, I think this is about
the tenth time this has come up in the last two years, why
doesn't a group of people who know about GC algorithms get
On Monday, 6 June 2016 at 02:20:52 UTC, Walter Bright wrote:
* Hiring people who know D is a problem.
* Documentation and tutorials are weak.
* There's no web services framework (by this time many folks
know of D, but of those a shockingly small fraction has even
heard of vibe.d). I have
On Saturday, 11 June 2016 at 09:23:55 UTC, Chris wrote:
On Friday, 10 June 2016 at 22:01:53 UTC, Walter Bright wrote:
On 6/10/2016 3:55 AM, Chris wrote:
> Cool. I'd love to see `DScript` one day - and replace JS once
and for all ...
> well ... just day dreaming ...
Dreams are reality:
Today I learned [0] that opDollar must be explicitly implemented
and might not be available by some ranges. Likewise slicing. If
you think it further, there are lots of functions in Phobos (I'm
currently looking into std.algorithm.searching) which use more
features than they check capabilities
On Wednesday, 25 May 2016 at 16:21:07 UTC, H. S. Teoh wrote:
On Wed, May 25, 2016 at 03:05:33PM +, qznc via
Also, std.range.primitives should have a predicate for
opDollar similar to hasSlicing.
It's hard to imagine having much use for a range that has
slicing but not opDollar. For
On Saturday, 28 May 2016 at 01:30:11 UTC, Andrei Alexandrescu
wrote:
On 05/27/2016 06:19 PM, qznc wrote:
manual find: 118 ±24
qznc find: 109 ±13 <--- using the sentinel trick
Chris find: 142 ±27
It is normal that the numbers of the other tests change, since
those are
relative to the
On Saturday, 11 June 2016 at 14:26:20 UTC, Atila Neves wrote:
Why? Because I could, I don't plan on using this for anything
serious. I think "with" is my favourite D feature right now. I
also wrote the Writer and State monads (not that D needs them):
I also tried this. Instead of Write and
On Saturday, 11 June 2016 at 18:36:23 UTC, Ola Fosheim Grøstad
wrote:
On Saturday, 11 June 2016 at 10:14:25 UTC, qznc wrote:
I have given up hope for different browser languages than
Javascript. The problem is not finding a language. A lot of
people would love to have Lua, Python, or something
On Saturday, 28 May 2016 at 14:18:10 UTC, Chris wrote:
I used dmd, because I don't have ldc on my laptop. qznc's find
is clearly the winner.
DMD performance feels flaky to me.
If performance is important, you should use ldc or gdc.
Alternatively, you are Walter Bright and simply optimize
On Saturday, 28 May 2016 at 12:47:59 UTC, Andrei Alexandrescu
wrote:
On 5/28/16 6:56 AM, qznc wrote:
The sentinel value is `needleBack+1`, but range elements need
not
support addition. Finding a sentinel is hard and most
certainly requires
more assumptions about the ranges.
No need for a
On Sunday, 29 May 2016 at 21:07:21 UTC, qznc wrote:
When looking at the assembly I don't like the single-byte
loads. Since string (ubyte[] here) is of extraordinary
importance, it should be worthwhile to use word loads [0]
instead. Really fancy would be SSE.
So far, the results look
On Monday, 30 May 2016 at 20:08:46 UTC, Andrei Alexandrescu wrote:
On 05/30/2016 04:00 PM, Chris wrote:
./benchmark.dmd
std: 178 ±31+36 (4475) -29 (5344)
manual: 167 ±46+82 (2883) -32 (7054)
qznc: 114 ±7 +18 (1990) -5 (7288)
Chris: 228 ±49+82 (3050)
On Tuesday, 31 May 2016 at 17:31:29 UTC, Wyatt wrote:
qznc wins DMD (and is faster than the LDC's best?
Careful! These are not absolute numbers, but relative slowdowns.
You cannot compare the numbers between LDC and DMD.
On Tuesday, 31 May 2016 at 01:55:16 UTC, Andrei Alexandrescu
wrote:
I agree it's difficult to characterize the behavior of
substring search with one number. There are many dimensions of
variation. (But there's no reason for an emotional response.) A
few possible baselines come to mind:
*
On Tuesday, 31 May 2016 at 19:29:25 UTC, Chris wrote:
Would it speed things up even more, if we put the function
`computeSkip` into the loop or is this done automatically by
the compiler?
LDC inlines it. DMD does not.
More numbers:
./benchmark.ldc
Search in Alice in Wonderland
std:
On Friday, 27 May 2016 at 14:06:09 UTC, Chris wrote:
I think it's clear that `std find` is vry slow. If anyone
wants to test my function, please do so. I don't want to spread
wrong data, but this is what I get at the moment (ldc latest
version).
If you want to see find (current or my
On Friday, 27 May 2016 at 14:41:29 UTC, Chris wrote:
The improved `std find` comes very close to the manual function
above now, sometimes it's even faster or at least as fast.
I think it really depends on the use case. The manual algorithm
is really naive and std-find is slightly more
On Friday, 27 May 2016 at 14:41:29 UTC, Chris wrote:
The improved `std find` comes very close to the manual function
above now, sometimes it's even faster or at least as fast.
std findtook 12573666
manual find took 7418454
my std find took 6903854 <===
findStringS
Now added Chris' algo to the benchmark:
std find:155 ±33
manual find: 112 ±19
qznc find: 122 ±18 <--- improved find
Chris find: 133 ±20 <--- findStringS_
On Friday, 27 May 2016 at 20:50:52 UTC, Andrei Alexandrescu wrote:
On 05/27/2016 04:39 PM, qznc wrote:
Now added Chris' algo to the benchmark:
std find:155 ±33
manual find: 112 ±19
qznc find: 122 ±18 <--- improved find
Chris find: 133 ±20 <--- findStringS_
Does any of these feature
On Friday, 27 May 2016 at 18:21:06 UTC, Andrei Alexandrescu wrote:
What you want to do here for indexed access is to match the
last element first. If no match, continue etc. If there's a
match, enter an inner loop where you don't need to check for
the end of the haystack. -- Andrei
Another
On Thursday, 26 May 2016 at 17:07:54 UTC, Seb wrote:
I think we all agree that general is having to much traffic and
according to CyberShadow [1] this again is just an approval
issue, however I expect this a bit controversial, so please no
OT! Only other category proposals.
How about a "Show
On Thursday, 26 May 2016 at 06:07:36 UTC, Jonathan M Davis wrote:
At this point, generic code should just never use opDollar
unless it specifically tests for it, and usually, there's
really no reason to do that rather than just using length at
this point, much as it's far more aesthetically
On Tuesday, 31 May 2016 at 18:31:47 UTC, Andrei Alexandrescu
wrote:
On 5/31/16 1:54 PM, qznc wrote:
Using a one-letter needle string is more like a user mistake
than
something to optimize for.
How is splitting on ',' a user mistake? -- Andrei
The mistake is to split on "," instead of ','.
I played around with the benchmark. Some more numbers:
$ make ldc
ldmd2 -O -release -inline -noboundscheck *.d -ofbenchmark.ldc
./benchmark.ldc
E: wrong result with Chris find
E: wrong result with Chris find
E: wrong result with Chris find
std find: 153 ±25+66 (1934) -15 (7860)
manual
On Sunday, 29 May 2016 at 18:50:40 UTC, Jon Degenhardt wrote:
A minor thing - you might consider also calculating the median
and median version of MAD (median of absolute deviations from
the median). The reason is that benchmarks often have outliers
in the max time dimension, median will do a
On Wednesday, 22 June 2016 at 14:11:12 UTC, Jack Stouffer wrote:
On Wednesday, 22 June 2016 at 13:46:50 UTC, qznc wrote:
...
Including scripting languages in that example is unfair as they
only lex the file.
Sure. Especially bash, which is always in RAM anyways. It shows
the possible
On Wednesday, 22 June 2016 at 14:28:19 UTC, Adam D. Ruppe wrote:
On Wednesday, 22 June 2016 at 13:46:50 UTC, qznc wrote:
RDMD 0:00:00.275884
DMD 0:00:00.311102
Since rdmd is just a script wrapper around dmd, it shouldn't
actually be faster.
BTW this more measures linker
Walter and we as a community often claim that dmd is fast as in
"compiles quickly". Go also claims this. Rust does not. They even
state that compilation speed is one of the big tasks they are
working on.
From the general sentiment, I would expect that dmd performs on
the level of Go and Rust
On Monday, 20 June 2016 at 13:27:59 UTC, Jack Stouffer wrote:
On Monday, 20 June 2016 at 12:34:55 UTC, qznc wrote:
On Sunday, 19 June 2016 at 10:38:27 UTC, qznc wrote:
On Saturday, 18 June 2016 at 18:54:28 UTC, Andrei
Alexandrescu wrote:
Got this link from the reddit discussion around the blog
On Saturday, 18 June 2016 at 18:54:28 UTC, Andrei Alexandrescu
wrote:
Got this link from the reddit discussion around the blog
article: http://effbot.org/zone/stringlib.htm. The
Bloom-filter-style trick looks quite cool. Anyone interested in
running some more experiments? Thx! -- Andrei
On Sunday, 19 June 2016 at 06:28:45 UTC, deadalnix wrote:
On Sunday, 19 June 2016 at 05:37:01 UTC, Walter Bright wrote:
On 6/18/2016 10:22 PM, Suliman wrote:
8. create a greenthreads module that works like Goroutines
But we already have fibers, I thought that they are same with
Goroutines
On Wednesday, 22 June 2016 at 19:56:26 UTC, Adam D. Ruppe wrote:
D compile speed typically *scales* better than the competition.
Instead of chasing the 100ms in hello world, it tackles the
1ms of a real project.
Ok, but this is hard to test. It is not feasible to build the
same real
Survey results:
https://docs.google.com/document/d/1F6oELZcO_ejX2oVk20hmiBWd4lQugfFahn7yKsw/preview#
Maybe we should do a D survey?
For Rust, D is even mentioned. For the question "What programming
languages are you most comfortable with?" 68 of 3085 people
selected D.
An interesting
On Thursday, 23 June 2016 at 09:18:47 UTC, sdds wrote:
On Thursday, 23 June 2016 at 08:33:39 UTC, qznc wrote:
For Rust, D is even mentioned. For the question "What
programming languages are you most comfortable with?" 68 of
3085 people selected D.
1666 ppl selected Python. For the same Q in
On Sunday, 19 June 2016 at 10:38:27 UTC, qznc wrote:
On Saturday, 18 June 2016 at 18:54:28 UTC, Andrei Alexandrescu
wrote:
Got this link from the reddit discussion around the blog
article: http://effbot.org/zone/stringlib.htm. The
Bloom-filter-style trick looks quite cool. Anyone interested
On Saturday, 18 June 2016 at 20:04:50 UTC, Walter Bright wrote:
Starting a new thread with this, as requested. There are things
here for all skill levels and time commitments.
3. use -cov to improve code coverage of Phobos unittests
4. make sure every function in Phobos has an example
5.
On Thursday, 14 January 2016 at 07:44:16 UTC, Jacob Carlborg
wrote:
std.experimental.memory.rc
std.experimental.memory.gc
std.experimental.memory.manual // or something
This "rc" is "reference counting"? Reference counting is also a
form of garbage collection ("gc"). So I don't like this
On Tuesday, 28 June 2016 at 06:49:03 UTC, Timothee Cour wrote:
Is there any reason not to use git submodules to organize the
various common dlang repos?
see relevant discussion:
*
http://www.digitalmars.com/d/archives/digitalmars/D/The_annoying_D_build_system_181472.html [from 2012]
*
On Saturday, 25 June 2016 at 10:33:00 UTC, Ola Fosheim Grøstad
wrote:
Pony has a fiber local GC, which means collection can happen
when the fiber is inactive or even altogether skip collection
if the fiber is short-lived.
Go is currently exploring a Transaction Oriented GC addition to
the
On Thursday, 28 January 2016 at 22:30:51 UTC, nbro wrote:
Apart from [syntax], what are the real advantages of D over
Rust?
D is a broader language and is applicable in more situations.
In many cases you don't care and don't want to care about memory
management. Use D and its garbage
On Thursday, 17 March 2016 at 16:17:46 UTC, Karabuta wrote:
Are there any female programmers using D? :)
Moreover, the socia Media representation of D sucks. I think we
need a female, at least someone soft and mortal who actually
understand how to communicate and build a community. Coders
On Saturday, 19 March 2016 at 07:36:36 UTC, Joakim wrote:
"Crowling, Turner, and others originally built Magic Pocket
using a new programming language from Google called Go. Here
too, Dropbox is riding a much larger trend, languages designed
specifically for the new world of massively
On Thursday, 24 March 2016 at 09:16:51 UTC, Walter Bright wrote:
We're doing just fine with NNTP and Vladimir's forum software.
I agree. There is no need to change anything.
However, there is room for improvement, but it requires to change
the UI, which is not possible with Newsreaders.
On Wednesday, 20 April 2016 at 07:53:53 UTC, Benjamin Thaut wrote:
Is there a official presentation template for Dconf 2016? If
not it would be great if someone could create one. Many
programmers (me included) are not good with picking colors and
thus presentations usually don't look as good
1 - 100 of 297 matches
Mail list logo
