On 9/9/2015 6:52 PM, Manu via Digitalmars-d wrote:
We've resolved this issue since 6/10/2013 no? ;)
:-)
On 10 September 2015 at 04:55, Walter Bright via Digitalmars-d
wrote:
> On 6/10/2013 7:33 AM, Manu wrote:
>>
>> [...]
>
>
> Sorry to say, your n.g. poster is back to its old tricks :-)
We've resolved this issue since 6/10/2013 no? ;)
On Wednesday, 9 September 2015 at 22:59:42 UTC, nazriel wrote:
I really have no idea,
I tried to copy and paste those links and indeed they trigger
recaptcha...
Not sure if recaptcha is so weak or indeed it is a human
posting those links %)
It costs 0.1 cent ($0.001) to have a human solve a r
On Wednesday, 9 September 2015 at 06:42:15 UTC, Jacob Carlborg
wrote:
On 2015-08-03 02:24, bitwise wrote:
Just stumbled upon this:
https://code.visualstudio.com/
I see support for Rust and Go, but no D.
If you download it, there is a little smiley/frowny in the
bottom right
corner for feedb
On Wednesday, 9 September 2015 at 18:33:41 UTC, Prudence wrote:
On Tuesday, 27 May 2014 at 12:21:40 UTC, d coder wrote:
[...]
What's the current state of this? I'm in need of such behavior
for win32 interop.
I'm thinking that one can make the above code more general by
using it in a mixin
On Wednesday, 9 September 2015 at 12:50:17 UTC, BBasile wrote:
On Wednesday, 9 September 2015 at 04:17:13 UTC, nazriel wrote:
On Sunday, 30 August 2015 at 15:05:41 UTC, BBasile wrote:
On Wednesday, 26 August 2015 at 05:54:44 UTC, nazriel wrote:
[...]
since mothes 90% of the new content is sp
On Saturday, 5 September 2015 at 09:44:13 UTC, Jacob Carlborg
wrote:
On 2015-09-05 08:18, Jonathan M Davis wrote:
There is nothing in the spec about supporting operator
overloading with
free functions, so I don't know where you get the idea that
it's even
intended to be a feature. UFCS applies
On Wednesday, 9 September 2015 at 18:21:32 UTC, NX wrote:
If I had the time and knowledge I would spend them to make D
better, but you can't expect a teenager (tip: me) to help
making DMD front-end better or to implement a precise GC... I
guess?
You can make a difference. Yes you probably don
On 9/9/2015 1:17 PM, Freddy wrote:
On Wednesday, 9 September 2015 at 18:55:18 UTC, Walter Bright wrote:
On 6/10/2013 7:33 AM, Manu wrote:
[...]
Sorry to say, your n.g. poster is back to its old tricks :-)
On 6/10/2013
That was 2 years ago.
Woops! I didn't notice. My reader sorts things ba
On Wednesday, 9 September 2015 at 14:00:52 UTC, Brandon Ragland
wrote:
D has zero use in anything time sensitive.
You mean, for example, like dealing with data for a billion
customers and responding in a few hundred microseconds? ;)
https://www.sociomantic.com/technology/
Case closed. SOM
All is in the title.
ARM/Mips/pNaCl/WebAssembly require 32bits to work. These are
valuable targets IMO.
I can provide support, but I just don't have the bandwidth to
pull it by myself. If someone could step up, that'd be great.
On Wednesday, 9 September 2015 at 20:18:06 UTC, Freddy wrote:
enum MemberFunc(alias Type, string member) = (ref Type self,
Parameters!(__traits(getMember, Type, member)) args) =>
mixin(q{self.} ~ member ~ q{(args)});
Whoops the alias wasn't needed
enum MemberFunc(Type, string member) = (ref T
On Wednesday, 9 September 2015 at 18:50:45 UTC, Walter Bright
wrote:
On 6/7/2013 4:21 PM, Manu wrote:
So from my dconf talk, I detailed a nasty hack to handle
member function
pointers in D.
https://www.digitalmars.com/articles/b68.html
Here's on automatic version
import std.traits : Parame
On Wednesday, 9 September 2015 at 18:55:18 UTC, Walter Bright
wrote:
On 6/10/2013 7:33 AM, Manu wrote:
[...]
Sorry to say, your n.g. poster is back to its old tricks :-)
On 6/10/2013
That was 2 years ago.
On Wednesday, 9 September 2015 at 18:21:32 UTC, NX wrote:
If I had the time and knowledge I would spend them to make D
better, but you can't expect a teenager (tip: me) to help
making DMD front-end better or to implement a precise GC... I
guess?
You wouldn't know what people have done with D
On 09/09/2015 01:32 AM, Jonathan M Davis wrote:
On Tuesday, 8 September 2015 at 20:55:35 UTC, Timon Gehr wrote:
On 09/08/2015 06:49 PM, Jonathan M Davis wrote:
Sure, it _could_ be implemented that way, but the only reason I
see to do that is if we're specifically looking to support defining
ove
On 6/10/2013 7:33 AM, Manu wrote:
[...]
Sorry to say, your n.g. poster is back to its old tricks :-)
On Tuesday, 8 September 2015 at 18:28:40 UTC, Matt Kline wrote:
A bit verbose, but I suppose that will do.
You could use map
---
import std.algorithm : map;
import std.utf : byCodeUnit;
import std.array : array;
auto arr = ["foo", "bar", "baz"].map!(a => a.byCodeUnit).array;
---
On Wednesday, 9 September 2015 at 15:20:41 UTC, Robert burner
Schadek wrote:
This post marks the start of the two week review process of
std.experimental.testing.
PR: https://github.com/D-Programming-Language/phobos/pull/3207
Dub: http://code.dlang.org/packages/unit-threaded
Doc: See CyberShado
On Wednesday, 9 September 2015 at 18:21:32 UTC, NX wrote:
The more you don't collect, the more time it takes time to
collect; thus, you may want to configure GC to do it's job more
often so it doesn't stop significantly, and also manually
trigger collection where appropriate...
Maybe that is
On 6/7/2013 4:21 PM, Manu wrote:
So from my dconf talk, I detailed a nasty hack to handle member function
pointers in D.
https://www.digitalmars.com/articles/b68.html
On Tuesday, 27 May 2014 at 12:21:40 UTC, d coder wrote:
https://github.com/D-Programming-Language/dmd/pull/3181
Daniel asked me to use this. And it works.
Use something like:
union U
{
void delegate(int) dg;
struct
{
void* ptr;
void function(int) funcptr;
}
}
U u;
u.dg = dg;
u.
On Wednesday, 9 September 2015 at 14:00:52 UTC, Brandon Ragland
wrote:
It's slow, really slow, and stopping the entire world is
painful, even in trivial user applications. A pause for even
half a second or less on the UI makes the application looks
"chunky" and broken.
If you're having that m
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 numbers"
On Wednesday, 9 September 2015 at 13:48:16 UTC, qznc wrote:
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
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 numbers". So far D mostly disappoints in terms
> of performance.
>
> […
On Tuesday, 8 September 2015 at 21:06:26 UTC, qznc wrote:
Afaik the Erlang runtime does not interrupt processes.
Depends what you mean by "processes" :-)
In this comparison it is actually interesting, because D has
its own bignum implementation in the standard library.
There you go!
On
On Tuesday, 12 April 2011 at 16:44:10 UTC, David Nadlinger wrote:
Recently, I have been playing around with a little units of
measurement system in D. As this topic has already been brought
up quite a number of times here, I thought I would put my
implementation up for discussion here.
...
A
This post marks the start of the two week review process of
std.experimental.testing.
PR: https://github.com/D-Programming-Language/phobos/pull/3207
Dub: http://code.dlang.org/packages/unit-threaded
Doc: See CyberShadow/DAutoTest for up-to-date documentation build
Previous Thread:
http://forum
On Wednesday, 9 September 2015 at 07:04:05 UTC, Per Nordlöw wrote:
Which direction should we choose?
quantities
On Wednesday, 9 September 2015 at 14:00:52 UTC, Brandon Ragland
wrote:
Seriously, the fact that the GC has gone un-noticied for so
long is a HUGE turn off for just about ANY would be C like
It has not gone un-noticed, that's how @nogc came about. So
people are aware that it is not suitable for
I would like to compile dman with any available D compiler.
Ideally with no network traffic on any system where a D
compiler is available.
Is there a way to do this with the downloadable zip archives
of dlang.org, druntime and Phobos? The background is shipping
the dlang tools as a "build from sour
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.
On Wednesday, 9 September 2015 at 14:00:07 UTC, qznc wrote:
That is a good idea, if you want to measure compiler
optimizations. Ideally g++ and gdc should always yield the same
performance then?
Hopefully, as I understand GCC uses a highlevel IR, but if
performance is equal that is a pretty s
Am Sat, 20 Jun 2015 15:15:47 + (UTC)
schrieb ketmar :
> On Sat, 20 Jun 2015 14:06:50 +0200, Marco Leise wrote:
>
> > If you have a perfectly working old notebook with Windows XP on it, I
> > can recommend QtWeb for its low resource usage and modern-ish feature
> > set. It is a little unstable
On 9 September 2015 at 16:00, qznc via Digitalmars-d <
digitalmars-d@puremagic.com> wrote:
> 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 si
On Monday, 7 September 2015 at 14:44:05 UTC, nx wrote:
https://github.com/NightmareX1337/DX
Don't kill me, I'm just trying to help...
You can report issues and create pull requests :)
Destroy!
Most of these things I agree with.
CamelCase this_case or that-case doesn't matter to me. It's a
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 a
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 f
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?
* Not all packages are
On Wednesday, 9 September 2015 at 04:17:13 UTC, nazriel wrote:
On Sunday, 30 August 2015 at 15:05:41 UTC, BBasile wrote:
On Wednesday, 26 August 2015 at 05:54:44 UTC, nazriel wrote:
On Thursday, 20 August 2015 at 20:28:48 UTC, Steven
Schveighoffer wrote:
[...]
I will work on it.
Should be f
On 2015-09-09 10:26, qznc wrote:
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
On Wednesday, 9 September 2015 at 08:26:59 UTC, qznc wrote:
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
On Wednesday, 9 September 2015 at 06:13:59 UTC, Dominikus Dittes
Scherkl wrote:
IMHO "friend" is a misconception, that is only there to
compensate for the lack of modules in C++.
It can be useful. Say you have a database engine module and an
ORM module, you might want to give the ORM special p
On Wednesday, 9 September 2015 at 07:59:48 UTC, qznc wrote:
I'm not sure if I understand you correctly. What is "high
level" and "low level" optimization?
Low level are local optimizations, which basically will be the
same if you use the same backend (like LLVM). It would just
measure the pro
On 09/09/15 9:21 PM, Edwin van Leeuwen wrote:
On Wednesday, 9 September 2015 at 08:56:56 UTC, Rikki Cattermole wrote:
On 09/09/15 8:26 PM, qznc wrote:
The Rust people have this Crater [0,1] tool, which essentially builds
all Rust libraries with two compiler versions and compares for
regressions
On Wednesday, 9 September 2015 at 08:56:56 UTC, Rikki Cattermole
wrote:
On 09/09/15 8:26 PM, qznc wrote:
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 a
On 09/09/15 8:26 PM, qznc wrote:
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
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?), b
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 D
On Wednesday, 9 September 2015 at 06:48:45 UTC, NX wrote:
Woah! I didn't know about private members are visible in it's
module, but to me it feels much cleaner if it was achieved by
something similar to what I suggested... Isn't it?
never mind...
Everything in the same module is friend to e
On Tuesday, 12 April 2011 at 16:44:10 UTC, David Nadlinger wrote:
Recently, I have been playing around with a little units of
measurement system in D. As this topic has already been brought
up quite a number of times here, I thought I would put my
implementation up for discussion here.
I woul
53 matches
Mail list logo
