On Monday, 14 September 2015 at 11:45:13 UTC, Sönke Ludwig wrote:
If no regressions show up in this RC, the final release will be
made on the upcoming Sunday. The main additions are support for
SDLang [1] package recipes [2] and a vastly improved "dub
describe".
Download:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Example output might be useful for you to see as well:
10009.1.1:5.2e-02_13: 16
10014.1.1:2.9e-03_11: 44
10017.1.1:4.1e-02_13: 16
10026.1.1:5.8e-03_12: 27
10027.1.1:6.6e-04_13: 16
10060.1.1:2.7e-03_14: 2
If no regressions show up in this RC, the final release will be made on
the upcoming Sunday. The main additions are support for SDLang [1]
package recipes [2] and a vastly improved "dub describe".
Download:
http://code.dlang.org/download
Change log:
BTW, it's rc.4, not rc.3.
Am 14.09.2015 um 13:59 schrieb ponce:
It would be great if
https://github.com/D-Programming-Language/dub/pull/638 would be merged,
it contains multiple fixes for being able to use LDC.
One of the commit here is controversial, but it wouldn't happen if DUB
wouldn't pass multiple -march flags to
On Monday, 14 September 2015 at 12:44:22 UTC, Edwin van Leeuwen
wrote:
Sounds like this program is actually IO bound. In that case I
would not expect a really expect an improvement by using D.
What is the CPU usage like when you run this program?
Also which dmd version are you using. I think
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if problem probabily is i/o related, have you tried with:
-O -inline -release -noboundscheck
?
Anyway I think it's a good idea to test it
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if problem probabily is i/o related, have you tried with:
-O -inline -release -noboundscheck
?
Anyway I think it's a good idea to test it against gdc and ldc
that are known to generate faster executables.
On Sunday, 13 September 2015 at 17:16:40 UTC, Daniel N wrote:
int opCmp(Foo rhs)
{
return (id > rhs.id) - (id < rhs.id);
}
IMO, subtracting boolean values is bad code style, it's better to
be explicit about your intention:
(id > rhs.id ? 1 : 0) - (id < rhs.id ? 1 : 0)
Hi,
This is my first post on Dlang forums and I don't have a lot of
experience with D (yet). I mainly code bioinformatics-stuff in
Python on my day-to-day job, but I've been toying with D for a
couple of years now. I had this idea that it'd be fun to write a
parser for a text-based tabular
On Monday, 14 September 2015 at 12:50:03 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 12:44:22 UTC, Edwin van Leeuwen
wrote:
Sounds like this program is actually IO bound. In that case I
would not expect a really expect an improvement by using D.
What is the CPU usage like when
Thanks for the clarification.
https://issues.dlang.org/show_bug.cgi?id=15044
--- Comment #3 from Kenji Hara ---
(In reply to Martin Nowak from comment #2)
> Any idea how to solve this @Kenji?
> We could try to do semantic3 for buildOpAssign later, but then we'd have to
> add a special case to op_overload
On Monday, 14 September 2015 at 05:37:05 UTC, Sebastiaan Koppe
wrote:
What about using zip and a slice?
Slicing requires a RandomAccessRange (Array). This is too
restrictive. We want to change operations such as adjacentTuples
with for example map and reduce without the need for temporary
On Monday, 14 September 2015 at 10:45:52 UTC, Per Nordlöw wrote:
restrictive. We want to change operations such as
Correction:
We want to *chain* operations such as...
On 14/09/2015 7:24 PM, Temtaime wrote:
Hi !
I wonder if there's a repo with magicport that was used to convert dmd.
I have a big library written in C++ and wanna try convert it to D.
Or is magicport closed and there's no chance to get it ?
Thanks for a reply.
The latest version of magicport
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
Hi,
Using a small test file (~550 MB) on my machine (2x Xeon(R) CPU
E5-2670 with RAID6 SAS disks and 192GB of RAM), the D version
runs in about 20 seconds and the Python version less than 16
seconds. I've repeated runs at
On Monday, 14 September 2015 at 14:17:51 UTC, Laeeth Isharc wrote:
chain doesn't seem to compile if I try and chain a chain of two
strings and another string.
what should I use instead?
Laeeth.
Works for me: http://dpaste.dzfl.pl/a692281f7a80
On Monday, 14 September 2015 at 14:14:18 UTC, John Colvin wrote:
what system are you on? What are the error messages you are
getting?
I really appreciate your will to try to help me out. This is what
ldd shows on the latest binary release of LDC on my machine. I'm
on a Red Hat Enterprise
On Monday, 14 September 2015 at 14:15:25 UTC, Laeeth Isharc wrote:
I picked up D to start learning maybe a couple of years ago. I
found Ali's book, Andrei's book, github source code (including
for Phobos), and asking here to be the best resources. The
docs make perfect sense when you have
On Monday, 14 September 2015 at 13:58:33 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 13:37:18 UTC, John Colvin wrote:
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if
On Monday, 14 September 2015 at 13:55:50 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 13:10:50 UTC, Edwin van Leeuwen
wrote:
Two things that you could try:
First hitlists.byKey can be expensive (especially if hitlists
is big). Instead use:
foreach( key, value ; hitlists )
On Monday, 14 September 2015 at 13:56:16 UTC, Laeeth Isharc wrote:
Personally, when I make a strong claim about something and find
that I am wrong (the claim that D needs to scan every pointer),
I take a step back and consider my view rather than pressing
harder. It's beautiful to be wrong
chain doesn't seem to compile if I try and chain a chain of two
strings and another string.
what should I use instead?
Laeeth.
On Monday, 14 September 2015 at 14:17:51 UTC, Laeeth Isharc wrote:
chain doesn't seem to compile if I try and chain a chain of two
strings and another string.
what should I use instead?
Laeeth.
std.algorithm.iteration.joiner?
On Monday, 14 September 2015 at 14:28:41 UTC, John Colvin wrote:
Yup, glibc is too old for those binaries.
What does "ldd --version" say?
It says "ldd (GNU libc) 2.12". Hmm... The most recent version in
RHEL's repo is "2.12-1.166.el6_7.1", which is what is installed.
Can this be side-loaded
On Mon, Sep 14, 2015 at 02:34:41PM +, Fredrik Boulund via
Digitalmars-d-learn wrote:
> On Monday, 14 September 2015 at 14:18:58 UTC, John Colvin wrote:
> >Range-based code like you are using leads to *huge* numbers of
> >function calls to get anything done. The advantage of inlining is
>
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if problem probabily is i/o related, have you tried with:
-O -inline -release -noboundscheck
?
Anyway I think it's a good idea to test it
On Monday, 14 September 2015 at 13:37:18 UTC, John Colvin wrote:
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if problem probabily is i/o related, have you tried with:
-O -inline -release
On Monday, 14 September 2015 at 00:53:58 UTC, Jonathan M Davis
wrote:
Only the stack and the GC heap get scanned unless you tell the
GC about memory that was allocated by malloc or some other
mechanism. malloced memory won't be scanned by default. So, if
you're using the GC minimally and
On Sunday, 13 September 2015 at 17:34:11 UTC, BBasile wrote:
On Sunday, 13 September 2015 at 17:24:20 UTC, Laeeth Isharc
wrote:
On Sunday, 13 September 2015 at 17:09:57 UTC, wobbles wrote:
Use __traits(compiles, date.second)?
Thanks.
This works:
static if (__traits(compiles, { T bar;
On Monday, 14 September 2015 at 13:50:22 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
[...]
Thanks for the suggestions! I'm not too familiar with compiled
languages like this, I've mainly written small programs in D
and run them via `rdmd`
On Saturday, 12 September 2015 at 06:45:16 UTC, bitwise wrote:
[...]
Alternatively, GC.addRange() could return a value indicating
whether or not the range had actually been added(for the first
time) and should be removed.
Bit
Maybe the solution is as simple as specifying the state of
On Monday, 14 September 2015 at 14:05:01 UTC, Laeeth Isharc wrote:
On Sunday, 13 September 2015 at 17:34:11 UTC, BBasile wrote:
On Sunday, 13 September 2015 at 17:24:20 UTC, Laeeth Isharc
wrote:
[...]
can't you use 'hasMember' (either with __traits() or
std.traits.hasMember)? It's more
On Monday, 14 September 2015 at 14:25:04 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 14:14:18 UTC, John Colvin wrote:
what system are you on? What are the error messages you are
getting?
I really appreciate your will to try to help me out. This is
what ldd shows on the latest
On 09/14/2015 07:45 AM, Sönke Ludwig wrote:
If no regressions show up in this RC, the final release will be made on
the upcoming Sunday. The main additions are support for SDLang [1]
package recipes [2] and a vastly improved "dub describe".
This one really should be included so it doesn't end
On Monday 14 September 2015 16:17, Laeeth Isharc wrote:
> chain doesn't seem to compile if I try and chain a chain of two
> strings and another string.
>
> what should I use instead?
Please show code, always.
A simple test works for me:
import std.algorithm: equal;
import std.range:
On Monday, 14 September 2015 at 14:40:29 UTC, H. S. Teoh wrote:
If performance is a problem, the first thing I'd recommend is
to use a profiler to find out where the hotspots are. (More
often than not, I have found that the hotspots are not where I
expected them to be; sometimes a 1-line
Nice one, thanks for the info.
I just used Pegged to generate an API for a JSON REST service at compile
time so I'm still geeking out about the power of D at compile time, but I'm
always interested in parsers.
On Mon, Sep 14, 2015 at 10:50 AM, Bastiaan Veelo via Digitalmars-d-announce
On Friday, 11 September 2015 at 19:41:41 UTC, Martin Nowak wrote:
Does anyone have a different idea how to make a nice query
language? db.get!Person.where!(p => p.age > 21 && p.name ==
"Peter")
In our last project we took the following approach:
`auto q =
On Monday, 14 September 2015 at 08:57:07 UTC, Ola Fosheim Grøstad
wrote:
On Monday, 14 September 2015 at 00:53:58 UTC, Jonathan M Davis
wrote:
So, while the fact that D's GC is less than stellar is
certainly a problem, and we would definitely like to improve
that, the idioms that D code
On Monday, 14 September 2015 at 13:56:16 UTC, Laeeth Isharc wrote:
An associate who sold a decent sized marketing group
Should read marketmaking. Making prices in listed equity options.
On Monday, 14 September 2015 at 13:10:50 UTC, Edwin van Leeuwen
wrote:
Two things that you could try:
First hitlists.byKey can be expensive (especially if hitlists
is big). Instead use:
foreach( key, value ; hitlists )
Also the filter.array.length is quite expensive. You could use
count
On Monday, 14 September 2015 at 14:18:58 UTC, John Colvin wrote:
Range-based code like you are using leads to *huge* numbers of
function calls to get anything done. The advantage of inlining
is twofold: 1) you don't have to pay the cost of the function
call itself and 2) often more
On Monday, 14 September 2015 at 09:09:27 UTC, Per Nordlöw wrote:
Is there a reason why such a common thing isn't already in
Phobos? If not what about adding it to std.typecons : asTuple
I guess nobody's really needed that functionality before. It
might be an interesting addition to std.array.
On Monday, 14 September 2015 at 08:56:43 UTC, Per Nordlöw wrote:
BTW: What about .tupleof? Isn't that what should be used here?
I don't believe .tupleof works for arrays.
On Monday, 14 September 2015 at 13:05:32 UTC, Andrea Fontana
wrote:
On Monday, 14 September 2015 at 12:30:21 UTC, Fredrik Boulund
wrote:
[...]
Also if problem probabily is i/o related, have you tried with:
-O -inline -release -noboundscheck
?
-inline in particular is likely to have a strong
On Friday, 11 September 2015 at 19:41:41 UTC, Martin Nowak wrote:
AFAIK expression templates are the primary choice tom implement
SIMD and
matrix libraries.
And I still have [this
idea](http://dpaste.dzfl.pl/cd375ac594cf) of
implementing a nice query language for ORMs.
While expression
On Monday, 14 September 2015 at 15:20:50 UTC, Adam D. Ruppe wrote:
On Monday, 14 September 2015 at 15:14:05 UTC, Taylor Hillegeist
wrote:
Gives a short example but the code doesn't compile for me.
core\stdc\windows\com.d seems to be missing?
I think the doc copy/pasted a typo there. It should
On Monday, 14 September 2015 at 14:31:33 UTC, anonymous wrote:
On Monday 14 September 2015 16:17, Laeeth Isharc wrote:
chain doesn't seem to compile if I try and chain a chain of
two strings and another string.
what should I use instead?
Please show code, always.
A simple test works for
On Monday 14 September 2015 17:01, Laeeth Isharc wrote:
>auto chain1 = chain("foo", "bar");
>chain1 = chain(chain1, "baz");
>
> Realized that in this case it was much simpler just to use the
> delegate version of toString and sink (which I had forgotten
> about). But I
On Monday, 14 September 2015 at 15:14:05 UTC, Taylor Hillegeist
wrote:
Gives a short example but the code doesn't compile for me.
core\stdc\windows\com.d seems to be missing?
I think the doc copy/pasted a typo there. It should be
`core.sys.windows.com`.
I've done some COM stuff with D
On Monday, 14 September 2015 at 15:30:14 UTC, Ali Çehreli wrote:
On 09/14/2015 08:01 AM, Laeeth Isharc wrote:
> I was trying to use the same variable eg
>
>auto chain1 = chain("foo", "bar");
>chain1 = chain(chain1, "baz");
[...]
> It may be that the type of chain1
> and chain2
On 09/14/2015 08:01 AM, Laeeth Isharc wrote:
> I was trying to use the same variable eg
>
>auto chain1 = chain("foo", "bar");
>chain1 = chain(chain1, "baz");
[...]
> It may be that the type of chain1
> and chain2 don't mix.
Exactly.
I was going to recommend using pragma(msg,
On Monday, 14 September 2015 at 14:21:12 UTC, John Colvin wrote:
On Monday, 14 September 2015 at 14:05:01 UTC, Laeeth Isharc
wrote:
On Sunday, 13 September 2015 at 17:34:11 UTC, BBasile wrote:
On Sunday, 13 September 2015 at 17:24:20 UTC, Laeeth Isharc
wrote:
[...]
can't you use 'hasMember'
On Monday, 14 September 2015 at 14:35:26 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 14:28:41 UTC, John Colvin wrote:
Yup, glibc is too old for those binaries.
What does "ldd --version" say?
It says "ldd (GNU libc) 2.12". Hmm... The most recent version
in RHEL's repo is
On 09/14/2015 03:47 PM, Sebastiaan Koppe wrote:
>
> In our last project we took the following approach:
>
> `auto q = query.builder!Person.age!">"(20).name("Peter");`
Interesting idea.
So, I've looked at this topic of COM OLE and activeX, and found
myself confused.
http://dlang.org/interface.html
Gives a short example but the code doesn't compile for me.
core\stdc\windows\com.d seems to be missing? And i cant find any
documentation on core\stdc on the standard library page.
On Monday, 14 September 2015 at 15:04:00 UTC, Laeeth Isharc wrote:
On Monday, 14 September 2015 at 14:21:12 UTC, John Colvin wrote:
On Monday, 14 September 2015 at 14:05:01 UTC, Laeeth Isharc
wrote:
On Sunday, 13 September 2015 at 17:34:11 UTC, BBasile wrote:
On Sunday, 13 September 2015 at
On Monday, 14 September 2015 at 14:54:34 UTC, Fredrik Boulund
wrote:
On Monday, 14 September 2015 at 14:40:29 UTC, H. S. Teoh wrote:
I agree with you on that. I used Python's cProfile module to
find the performance bottleneck in the Python version I posted,
and shaved off 8-10 seconds of
Is there a way to do a canvas in GTK3 so that I can use chart.js,
and connect this to D? See, in something similar, a guy named
Julien Wintz figured out that Qt's QQuickWidget acts much like
the webkit Canvas object, and thus was able to port chart.js to
that widget. This allows one to use Qt
On Monday, 14 September 2015 at 16:33:23 UTC, Rikki Cattermole
wrote:
On 15/09/15 12:30 AM, Fredrik Boulund wrote:
[...]
A lot of this hasn't been covered I believe.
http://dpaste.dzfl.pl/f7ab2915c3e1
1) You don't need to convert char[] to string via to. No. Too
much. Cast it.
Not a good
On Monday, 14 September 2015 at 15:44:36 UTC, Taylor Hillegeist
wrote:
So, Actually I am using NI LabVIEW to interact with my DLL. I
imagine even getting hold of of that would troublesome or
expensive.
Ah, all right. Here's a SO thing (followed up by email then
copy/pasted there) I did for
https://issues.dlang.org/show_bug.cgi?id=15044
Kenji Hara changed:
What|Removed |Added
Keywords||pull, rejects-valid
On Mon, Sep 14, 2015 at 04:13:12PM +, Edwin van Leeuwen via
Digitalmars-d-learn wrote:
> On Monday, 14 September 2015 at 14:54:34 UTC, Fredrik Boulund wrote:
> >[...] I tried using the built-in profiler in DMD on the D program but
> >to no avail. I couldn't really make any sense of the output
On 15/09/15 12:30 AM, Fredrik Boulund wrote:
Hi,
This is my first post on Dlang forums and I don't have a lot of
experience with D (yet). I mainly code bioinformatics-stuff in Python on
my day-to-day job, but I've been toying with D for a couple of years
now. I had this idea that it'd be fun to
https://issues.dlang.org/show_bug.cgi?id=15044
--- Comment #5 from github-bugzi...@puremagic.com ---
Commits pushed to stable at https://github.com/D-Programming-Language/dmd
https://github.com/D-Programming-Language/dmd/commit/8e4676303a688ce3a034b38508b5e5b8c7bfa7e0
fix Issue 15044 - destroy
On Monday, 14 September 2015 at 16:33:23 UTC, Rikki Cattermole
wrote:
A lot of this hasn't been covered I believe.
http://dpaste.dzfl.pl/f7ab2915c3e1
I believe that should be:
foreach (query, ref value; hitlists)
Since an assignment happenin there..?
The second beta for the 2.068.2 point release fixes an regression with
destroy that could result in a memory leak [¹].
http://downloads.dlang.org/pre-releases/2.x/2.068.2/
-Martin
[¹]: https://issues.dlang.org/show_bug.cgi?id=15044
https://issues.dlang.org/show_bug.cgi?id=15060
Issue ID: 15060
Summary: Can't load a D shared library first, then load a C
shared library
Product: D
Version: D2
Hardware: All
OS: Mac OS X
Status:
On Monday, 14 September 2015 at 17:51:59 UTC, Martin Nowak wrote:
What platform are you on?
I'm on OS X, using the homebrew version of DMD. And homebrew is
telling me that I have 2.068.1 installed
$ brew install dmd
Warning: dmd-2.068.1 already installed
$ dmd --version
DMD64 D Compiler
On Monday, September 14, 2015 01:12:02 Ola Fosheim Grostad via
Digitalmars-d-learn wrote:
> On Monday, 14 September 2015 at 00:41:28 UTC, Jonathan M Davis
> wrote:
> > Regardless, idiomatic D involves a lot more stack allocations
> > than you often get even in C++, so GC usage tends to be low in
On Monday, 14 September 2015 at 18:36:54 UTC, Meta wrote:
As an aside, you should use `sort()` instead of the
parentheses-less `sort`. The reason for this is that doing
`arr.sort` invokes the old builtin array sorting which is
terribly slow, whereas `import std.algorithm; arr.sort()` uses
the
On Monday 14 September 2015 21:59, jmh530 wrote:
> This approach gives the correct result, but dmd won't deduce the
> type of the template. So for instance, the second to the last
> line of the unit test requires explicitly stating the types. I
> may as well use the alternate version that
On Monday, 14 September 2015 at 19:59:18 UTC, jmh530 wrote:
In R, it is easy to have some optional inputs labeled as ...
and then pass all those optional inputs in to another function.
I was trying to get something similar to work in a templated D
function, but I couldn't quite get the same
Thanks to you both. This works perfect.
On Mon, Sep 14, 2015 at 08:07:45PM +, Kapps via Digitalmars-d-learn wrote:
> On Monday, 14 September 2015 at 18:31:38 UTC, H. S. Teoh wrote:
> >I decided to give the code a spin with `gdc -O3 -pg`. Turns out that
> >the hotspot is in std.array.split, contrary to expectations. :-)
> >Here are
https://issues.dlang.org/show_bug.cgi?id=15059
Issue ID: 15059
Summary: D Bug Tracker graph disappeared
Product: D
Version: D2
Hardware: x86
OS: Mac OS X
Status: NEW
Severity: enhancement
On Monday, 14 September 2015 at 19:56:57 UTC, Justin Whear wrote:
Mike, as this is really a GTK3 question and not specific to D
(if GTK will let you do it in C, you can do it in D), you might
have better success asking the GTK forum (gtkforums.com).
Another avenue of research would be to look
On Monday, 14 September 2015 at 20:54:55 UTC, Jonathan M Davis
wrote:
On Monday, September 14, 2015 01:12:02 Ola Fosheim Grostad via
Digitalmars-d-learn wrote:
On Monday, 14 September 2015 at 00:41:28 UTC, Jonathan M Davis
wrote:
> Regardless, idiomatic D involves a lot more stack
>
On Monday, 14 September 2015 at 20:14:45 UTC, Jack Stouffer wrote:
On Monday, 14 September 2015 at 17:51:59 UTC, Martin Nowak
wrote:
What platform are you on?
I'm on OS X, using the homebrew version of DMD. And homebrew is
telling me that I have 2.068.1 installed
$ brew install dmd
On Monday, 14 September 2015 at 20:14:45 UTC, Jack Stouffer wrote:
On Monday, 14 September 2015 at 17:51:59 UTC, Martin Nowak
wrote:
What platform are you on?
I'm on OS X, using the homebrew version of DMD. And homebrew is
telling me that I have 2.068.1 installed
Well I guess it's a bug in
On Monday, September 14, 2015 14:19:30 Ola Fosheim Grøstad via
Digitalmars-d-learn wrote:
> On Monday, 14 September 2015 at 13:56:16 UTC, Laeeth Isharc wrote:
> The claim is correct: you need to follow every pointer that
> through some indirection may lead to a pointer that may point
> into the
I created the following code that some of you have already seen.
It's sort of a multiple value AA array with self tracking.
The problem is, that for some type values, such as delegates, the
comparison is is identical. (basically when the delegate is the
same)
To solve that problem, I'd like
On Monday, 14 September 2015 at 20:34:03 UTC, Jonathan M Davis
wrote:
I'm not sure why it wouldn't be suitable for the typical use
case. It's quite performant. It would still not be suitable for
many games and environments that can't afford to stop the world
for more than a few milliseconds,
On Monday, 14 September 2015 at 20:54:55 UTC, Jonathan M Davis
wrote:
So, you _can_ have low heap allocation in a C++ program, and
many people do, but from what I've seen, that really isn't the
norm across the C++ community in general.
- Jonathan M Davis
Fully agreed, C++ in the wild
http://dlang.org/changelog/2.067.0.html#gc-options
On Mon, 14 Sep 2015 12:25:06 -0700
"H. S. Teoh via Digitalmars-d" wrote:
> On Mon, Sep 14, 2015 at 07:19:53PM +, Jonathan M Davis via
> Digitalmars-d wrote: [...]
> > Isn't there some amount of configuration
https://issues.dlang.org/show_bug.cgi?id=15056
--- Comment #5 from Kenji Hara ---
It's intentionally introduced in:
https://github.com/D-Programming-Language/dmd/pull/5003
To fix wrong-code issue 14708.
Today, in Win64 and all Posix platforms, dmd uses exception handling
On Monday, 14 September 2015 at 18:17:05 UTC, Adam D. Ruppe wrote:
On Monday, 14 September 2015 at 13:47:10 UTC, Sebastiaan Koppe
wrote:
`auto q = query.builder!Person.age!">"(20).name("Peter");`
I confess that I'm not really paying attention to this thread,
but I can't help but think plain
On 09/14/2015 04:23 PM, Prudence wrote:
> To solve that problem, I'd like to try and turn the Value into Tuples of
> the Value and the address of the SingleStore wrapper(which should be
> unique).
>
> e.g.,
> public Tuple!(TValue, void*)[][TKey] Store;
After changing that, I methodically dealt
On Wednesday, 22 July 2015 at 20:41:42 UTC, jmh530 wrote:
On Wednesday, 22 July 2015 at 19:28:41 UTC, Andrei Alexandrescu
wrote:
On 7/13/15 1:20 AM, Nick B wrote:
All we can do now, with our limited resources, is to keep an
eye on developments and express cautious interest. If someone
able
On Monday, 14 September 2015 at 21:57:23 UTC, Mike McKee wrote:
I'll ask in the GTK Forums what they recommend as the most
recently recommended approach for doing static charts in GTK3.
BTW, the gtkforums.com site doesn't just let anyone in. I'm still
waiting on an admin to approve me. :(
On Saturday, 11 July 2015 at 03:02:24 UTC, Nick B wrote:
On Thursday, 20 February 2014 at 10:10:13 UTC, Nick B wrote:
Hi everyone.
John Gustafson Will be presenting a Keynote on Thursday 27th
February at 11:00 am
The abstract is here:
https://issues.dlang.org/show_bug.cgi?id=15058
--- Comment #2 from ponce ---
Well, that would be very confusing, it's quite common to save projects files
even generated.
Better abandon the idea of hiding .visualdproj instead to have that. It's not a
huge must-have anyway.
--
https://issues.dlang.org/show_bug.cgi?id=15045
Kenji Hara changed:
What|Removed |Added
Keywords||pull
--- Comment #4 from
On 15/09/15 5:41 AM, NX wrote:
On Monday, 14 September 2015 at 16:33:23 UTC, Rikki Cattermole wrote:
A lot of this hasn't been covered I believe.
http://dpaste.dzfl.pl/f7ab2915c3e1
I believe that should be:
foreach (query, ref value; hitlists)
Since an assignment happenin there..?
https://issues.dlang.org/show_bug.cgi?id=15058
Issue ID: 15058
Summary: [VisualD] A way to specify Debugging Current Directory
from within the .visualdproj
Product: D
Version: D2
Hardware: x86_64
OS: Windows
https://issues.dlang.org/show_bug.cgi?id=15058
Rainer Schuetze changed:
What|Removed |Added
CC||r.sagita...@gmx.de
On Sunday, 13 September 2015 at 10:00:13 UTC, SuperLuigi wrote:
Just wondering if anyone here might know how I can accomplish
this... basically I'm editing my D code in Sublime using the
Dkit plugin to access DCD which so far is more reliable than
monodevelop's autocomplete but I do need to
On Monday, 14 September 2015 at 00:11:07 UTC, Ali Çehreli wrote:
On 09/13/2015 09:09 AM, Alex wrote:
> I'm new to this forum so, please excuse me in advance for
> asking silly questions.
Before somebody else says it: There are no silly questions. :)
> struct std.typecons.Unique!(S).Unique is
1 - 100 of 140 matches
Mail list logo