On Thursday, 21 April 2016 at 01:01:01 UTC, Matthias Klumpp wrote:
## How complete are the free compilers?
## Why is every D compiler shipping an own version of Phobos?
These two can be answered at once. LDC and GDC share the same
frontend code as DMD, but not the glue layer and backend
On Tuesday, 19 April 2016 at 13:05:35 UTC, tcak wrote:
On Thursday, 21 May 2015 at 10:39:46 UTC, ZombineDev wrote:
Basically you need clone your fork to your computer, add a
"upstream" remote to github.com/D-Programming-Language/[repo
name, eg. phobos], pull from upstream the new changes and
On Saturday, 16 April 2016 at 02:42:55 UTC, Andrei Alexandrescu
wrote:
So the constraint on chain() is:
Ranges.length > 0 &&
allSatisfy!(isInputRange, staticMap!(Unqual, Ranges)) &&
!is(CommonType!(staticMap!(ElementType, staticMap!(Unqual,
Ranges))) == void)
Noice. Now, an alternative is to
On Tuesday, 5 April 2016 at 22:43:05 UTC, Martin Nowak wrote:
Glad to announce D 2.071.0.
http://dlang.org/download.html
This release fixes many long-standing issues with imports and
the module
system.
See the changelog for more details.
http://dlang.org/changelog/2.071.0.html
-Martin
On Saturday, 9 April 2016 at 14:15:38 UTC, Nordlöw wrote:
Has anybody more than I thought about representing the sample
rate of a sampled signal collected from sources such as
microphones and digital radio receivers?
With it we could automatically relate DFT/FFT bins to real
frequencies and
On Thursday, 7 April 2016 at 09:25:46 UTC, John Colvin wrote:
On Thursday, 7 April 2016 at 08:53:32 UTC, Andrea Fontana wrote:
On Thursday, 7 April 2016 at 08:41:51 UTC, John Colvin wrote:
*hench my example of compiling one module to an object file
and then compiling the other and linking them
On Thursday, 7 April 2016 at 08:53:32 UTC, Andrea Fontana wrote:
On Thursday, 7 April 2016 at 08:41:51 UTC, John Colvin wrote:
*hench my example of compiling one module to an object file
and then compiling the other and linking them, without ever
importing one from the other.
If i move
On Thursday, 7 April 2016 at 09:01:14 UTC, tsbockman wrote:
On Thursday, 7 April 2016 at 08:23:09 UTC, John Colvin wrote:
But it definitely can eliminate an unused result. My
prediction: you took an array and sorted it, then did nothing
with the result, so it rightly concluded
On Thursday, 7 April 2016 at 08:33:40 UTC, Andrea Fontana wrote:
On Thursday, 7 April 2016 at 08:23:09 UTC, John Colvin wrote:
But it definitely can eliminate an unused result. My
prediction: you took an array and sorted it, then did nothing
with the result, so it rightly concluded
On Thursday, 7 April 2016 at 07:57:11 UTC, Andrea Fontana wrote:
On Wednesday, 6 April 2016 at 18:54:08 UTC, tsbockman wrote:
On Wednesday, 6 April 2016 at 08:15:39 UTC, Andrea Fontana
wrote:
Using ldmd2 -O -release -noboundscheck -inline sort.d &&
./sort
instead:
2 inputs:
Faster: 0 hnsecs
On Tuesday, 5 April 2016 at 08:34:32 UTC, Walter Bright wrote:
On 4/4/2016 11:10 PM, 9il wrote:
It is impossible to deduct from that combination that Xeon Phi
has 32 FP registers.
Since dmd doesn't generate specific code for a Xeon Phi, having
a compile time switch for it is meaningless.
On Monday, 4 April 2016 at 02:32:56 UTC, Yuxuan Shui wrote:
On Monday, 4 April 2016 at 00:50:27 UTC, Jonathan M Davis wrote:
On Sunday, April 03, 2016 23:46:10 John Colvin via
Digitalmars-d-learn wrote:
On Saturday, 2 April 2016 at 16:00:51 UTC, Jonathan M Davis
wrote:
> [...]
Ma
On Saturday, 2 April 2016 at 16:00:51 UTC, Jonathan M Davis wrote:
On Saturday, April 02, 2016 15:38:30 Ozan via
Digitalmars-d-learn wrote:
On Friday, 1 April 2016 at 20:50:32 UTC, Yuxuan Shui wrote:
> Why?
>
> This is annoying when I need to feed it into a function that
> requires hasLength.
On Thursday, 31 March 2016 at 08:23:45 UTC, Martin Nowak wrote:
I'm currently working on a templated arrayop implementation
(using RPN
to encode ASTs).
So far things worked out great, but now I got stuck b/c
apparently none
of the D compilers has a working SIMD implementation (maybe GDC
has
On Wednesday, 30 March 2016 at 22:14:11 UTC, BLM768 wrote:
On Wednesday, 30 March 2016 at 20:53:02 UTC, Shammah Chancellor
wrote:
I just stumbled on this wikipedia article:
https://en.wikipedia.org/wiki/Concatenative_programming_language
Seems like D falls under that category?
-S.
Not
On Wednesday, 30 March 2016 at 16:00:34 UTC, Luís Marques wrote:
On Wednesday, 30 March 2016 at 15:48:28 UTC, John Colvin wrote:
That would be me. Waiting for merge:
https://github.com/Homebrew/homebrew/pull/50539
Thanks!
Would it be against the homebrew spirit for the DMD recipe to
link
On Wednesday, 30 March 2016 at 13:04:08 UTC, Luís Marques wrote:
On Wednesday, 30 March 2016 at 11:03:51 UTC, Martin Nowak wrote:
Second beta for the 2.071.0 release.
http://dlang.org/download.html#dmd_beta
http://dlang.org/changelog/2.071.0.html
Please report any bugs at
On Thursday, 24 March 2016 at 01:49:25 UTC, Martin Nowak wrote:
First beta for the 2.071.0 release.
This release comes with many import and lookup related changes
and fixes. You might see a lot of deprecation warnings b/c of
these changes. We've added the -transition=import switch and
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 Sunday, 13 March 2016 at 13:02:16 UTC, Bastien wrote:
Hi, apologies for what may be a fairly obvious question to some.
## The background:
I have been tasked with building software to process data
output by scientific instruments for non-experts - basically
with GUI, menus, easy config
On Tuesday, 15 March 2016 at 11:48:48 UTC, Temtaime wrote:
Hi!
http://dpaste.dzfl.pl/93d518c713b5
On dpaste it's ["a\n\nb"]
But should be ["a\r\n\rb"]
I've tested with dmd on win, linux and mac : all is ok, and
only dpaste returns incorrect result.
Why so?
I'd wrote them using contact form
On Tuesday, 15 March 2016 at 10:58:16 UTC, Suliman wrote:
I have got:
string [] total_content;
I am appending to it data on every iteration.
total_content ~= somedata
File file = File(`D:\code\2vlad\result.txt`, "a+");
file.write(total_content);
I need to write it's to file by lines. Like:
On Wednesday, 9 March 2016 at 20:14:13 UTC, Adam D. Ruppe wrote:
---
import std.stdio;
@nogc int delegate(int) dg;
int helper() @nogc {
int a = 50;
struct MyFunctor {
int a;
@nogc this(int a) { this.a = a; }
// the function
On Wednesday, 9 March 2016 at 07:30:31 UTC, Edwin van Leeuwen
wrote:
On Sunday, 6 March 2016 at 17:35:38 UTC, Seb wrote:
[...]
In ggplotd I often use named tuples as and "anonymoous" struct:
Tuple!(double,"x")( 0.0 )
I also added a merge function that will return a tuple
containing merged
On Wednesday, 9 March 2016 at 21:01:13 UTC, H. S. Teoh wrote:
On Wed, Mar 09, 2016 at 08:30:10PM +, Jon D via
Digitalmars-d wrote:
On Tuesday, 8 March 2016 at 14:14:25 UTC, ixid wrote:
>[...]
In the case of std.algorithm.sum, the focus is on accuracy
rather than performance. It does
On Wednesday, 9 March 2016 at 14:04:40 UTC, Andrei Alexandrescu
wrote:
On 3/9/16 9:03 AM, John Colvin wrote:
On Wednesday, 9 March 2016 at 13:26:45 UTC, Andrei
Alexandrescu wrote:
On 03/08/2016 09:14 AM, ixid wrote:
[...]
Whoa. What's happening there? Do we have anyone on it? --
Andrei
On Wednesday, 9 March 2016 at 13:26:45 UTC, Andrei Alexandrescu
wrote:
On 03/08/2016 09:14 AM, ixid wrote:
Since I posted this thread I've learned std.algorithm.sum is 4
times
slower than a naive loop sum. Even if this is for reasons of
accuracy
this is exactly what I am talking about- this is
On Wednesday, 9 March 2016 at 10:48:30 UTC, cym13 wrote:
On Wednesday, 9 March 2016 at 10:28:06 UTC, John Colvin wrote:
Potential for leaking references from alias this aside, is
there some reason that I shouldn't do this for all my C++-like
RAII needs:
class A
{
~this(){ import
Potential for leaking references from alias this aside, is there
some reason that I shouldn't do this for all my C++-like RAII
needs:
class A
{
~this(){ import std.stdio; writeln("hello"); }
}
auto RAII(T)()
if (is(T == class))
{
struct Inner
{
private
On Saturday, 5 March 2016 at 11:05:09 UTC, Dmitry Olshansky wrote:
I'm having an opportunity to do a small tech-talk on things D
in a eCommerce shop that is currently sold on Go (migrating to
SOA from PHP monolith). I do not intend that to become Go vs D
battle but it gives the context.
On Friday, 4 March 2016 at 23:33:40 UTC, Andrei Alexandrescu
wrote:
On 03/04/2016 04:19 PM, H. S. Teoh via Digitalmars-d wrote:
Why not rather improve dmd optimization, so that such manual
optimizations are no longer necessary?
As I mentioned, optimizing the use of stride in large
On Friday, 4 March 2016 at 16:45:42 UTC, Andrei Alexandrescu
wrote:
Currently we have a very useful stride() function that allows
spanning a random access range with a specified step, e.g. 0,
3, 6, 9, ... for step 3.
I've run some measurements recently and it turns out a
compile-time-known
On Thursday, 3 March 2016 at 11:16:03 UTC, Dejan Lekic wrote:
On Tuesday, 1 March 2016 at 21:00:30 UTC, Erik Smith wrote:
I'm back to actively working on a std.database specification &
implementation. It's still unstable, minimally tested, and
there is plenty of work to do, but I wanted to
On Thursday, 3 March 2016 at 02:03:01 UTC, maik klein wrote:
Consider the following code
void main()
{
import std.stdio;
import std.range: iota, join;
import std.algorithm.iteration: map;
import std.conv: to;
import std.meta: aliasSeqOf, staticMap, AliasSeq;
enum types =
On Sunday, 28 February 2016 at 12:59:53 UTC, Atila Neves wrote:
On Saturday, 27 February 2016 at 11:31:53 UTC, Joakim wrote:
On Saturday, 27 February 2016 at 11:27:39 UTC, Walter Bright
wrote:
On 2/27/2016 1:12 AM, Atila Neves wrote:
I've had similar problems in the past with template mixins.
On Saturday, 27 February 2016 at 23:19:51 UTC, w0rp wrote:
On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill
wrote:
Clojure supports immutable lists that allow adding and
removing elements, and yet still have excellent performance.
For D language, what are the recommended techniques
On Friday, 26 February 2016 at 19:35:38 UTC, Joseph Rushton
Wakeling wrote:
On Thursday, 25 February 2016 at 17:27:25 UTC, Andrei
Alexandrescu wrote:
This could be fixed by devising a PRNG that takes a given
period n and generates all numbers in [0, n) in exactly n
steps.
On reflection, I
On Friday, 26 February 2016 at 18:23:41 UTC, Andrei Alexandrescu
wrote:
On 02/20/2016 09:06 AM, Edwin van Leeuwen wrote:
On Saturday, 20 February 2016 at 14:01:22 UTC, Andrei
Alexandrescu wrote:
Do we have a good quality converter of uniform numbers to
Gaussian-distributed numbers around? --
On Friday, 26 February 2016 at 17:15:02 UTC, Wyatt wrote:
On Thursday, 25 February 2016 at 22:28:52 UTC, jmh530 wrote:
I think PyD is really your best option.
That's what I figured, but I wanted to be sure because, well...
http://pyd.readthedocs.org/en/latest/embed.html
...these are some
On Thursday, 25 February 2016 at 17:27:25 UTC, Andrei
Alexandrescu wrote:
So we have
https://dlang.org/phobos/std_random.html#.randomCover which
needs to awkwardly allocate memory to keep track of the
portions of the array already covered.
This could be fixed by devising a PRNG that takes a
On Tuesday, 23 February 2016 at 13:46:33 UTC, Charles wrote:
On Tuesday, 23 February 2016 at 08:49:50 UTC, John Colvin wrote:
I saw you looking for heavy math users. I work with quite a
few actuaries, but I probably wouldn't be able to convince
them to use anything if there wasn't a way to use
On Tuesday, 23 February 2016 at 01:08:38 UTC, Charles wrote:
On Monday, 22 February 2016 at 21:27:31 UTC, Nick B wrote:
On Monday, 22 February 2016 at 17:15:54 UTC, Charles wrote:
[...]
Slide 12, 0101 is repeated. The top
[...]
I will check with John re this error.
[...]
Its likely
On Saturday, 20 February 2016 at 14:01:22 UTC, Andrei
Alexandrescu wrote:
Do we have a good quality converter of uniform numbers to
Gaussian-distributed numbers around? -- Andrei
There is this, from years ago:
https://github.com/DlangScience/dstats/blob/master/source/dstats/random.d#L266
and
On Thursday, 18 February 2016 at 23:28:43 UTC, Joel wrote:
On Thursday, 18 February 2016 at 16:33:51 UTC, John Colvin
wrote:
[...]
I don't think I put 'sudo brew' at any point (I can't
remember). I hope I haven't broken my OSX!
[...]
Did you recently upgrade OS X? Anyway, you should
On Thursday, 18 February 2016 at 16:14:09 UTC, Chris wrote:
Just to say that the copyright notice on the vibe.d website
should be updated. In the API it still says
"Copyright © 2012-2015 RejectedSoftware e.K."
In the license it still says "Copyright (c) 2012-2014,
rejectedsoftware e.K." and
On Thursday, 18 February 2016 at 07:52:11 UTC, Joel wrote:
On Thursday, 18 February 2016 at 07:11:23 UTC, Joel wrote:
I had dub installed in a folder that meant I had to put 'sudo
dub' to run it. I've tried to fix the problem, but where do
you put it (also I tried one place, but couldn't put
On Wednesday, 17 February 2016 at 07:15:01 UTC, Steven
Schveighoffer wrote:
On 2/17/16 1:58 AM, Rikki Cattermole wrote:
A few things:
https://github.com/schveiguy/iopipe/blob/master/source/iopipe/traits.d#L126
why isn't that used more especially with e.g. window?
After all, window seems like a
On Tuesday, 16 February 2016 at 03:13:48 UTC, maik klein wrote:
On Tuesday, 16 February 2016 at 02:47:38 UTC, WebFreak001 wrote:
On Tuesday, 16 February 2016 at 02:42:06 UTC, maik klein wrote:
I just seems very annoying to add @nogc to every function.
you can mark everything as nogc with
//
On Saturday, 13 February 2016 at 00:30:58 UTC, Andrei
Alexandrescu wrote:
On 02/12/2016 06:52 PM, deadalnix wrote:
[...]
I think we're good there. -- Andrei
Is there somewhere where I / others can see an explanation of how
"we're good"? Those sound like genuine problems.
On Thursday, 11 February 2016 at 13:05:41 UTC, Claude wrote:
Hello,
I come from the C world and try to do some procedural terrain
generation, and I thought ndslice would help me to make things
look clean, but I'm very new to those semantics and I need help.
Here's my problem: I have a
On Thursday, 11 February 2016 at 21:38:42 UTC, H. S. Teoh wrote:
On Thu, Feb 11, 2016 at 03:38:42PM -0500, Nick Sabalausky via
Digitalmars-d wrote:
On 02/11/2016 11:22 AM, H. S. Teoh via Digitalmars-d wrote:
>[...]
My understanding is that's the whole point of the "dump"
function being
On Monday, 8 February 2016 at 13:37:19 UTC, Andrei Alexandrescu
wrote:
On 2/7/16 7:11 PM, John Colvin wrote:
alias dump = dumpTo!stdout;
alias errDump = dumpTo!stderr;
I'm hoping for something with a simpler syntax, a la
dump!(stdout, "x") where stdout is optional. -- Andrei
On Monday, 8 February 2016 at 07:25:49 UTC, Dominikus Dittes
Scherkl wrote:
On Monday, 8 February 2016 at 07:05:15 UTC, Suliman wrote:
Cool! Thanks! But do you have any plans to reimplement it from
Pascal to В to get it's more native...
B?
What is B?
On Monday, 8 February 2016 at 19:46:19 UTC, Joseph Rushton
Wakeling wrote:
[snip]
This might be a stupid idea, but perhaps there's something useful
in it:
Determinism isn't the same thing as "one long chain of numbers
that everybody reads from".
It can be acceptable to seed a set of
On Sunday, 7 February 2016 at 23:26:05 UTC, Andrei Alexandrescu
wrote:
On 02/04/2016 09:46 PM, Tofu Ninja wrote:
On Thursday, 4 February 2016 at 15:33:41 UTC, Andrei
Alexandrescu wrote:
https://github.com/D-Programming-Language/phobos/pull/3971 --
Andrei
People one github were asking for a
On Friday, 29 January 2016 at 20:40:18 UTC, Andrei Alexandrescu
wrote:
On 01/29/2016 08:56 AM, Dragos Carp wrote:
On Friday, 29 January 2016 at 13:11:34 UTC, Luís Marques wrote:
[...]
But not in python, where "accumulate"[1] is the generic
equivalent of
C++ "partial_sum"[2]. I like "fold"
On Wednesday, 3 February 2016 at 21:45:04 UTC, Timon Gehr wrote:
On 02/03/2016 09:12 PM, Atila Neves wrote:
https://github.com/D-Programming-Language/phobos/pull/3968
I think fold should be nothrow, but maybe that's just me. It's
also a
massive pain to make it that way, so I didn't for now.
On Friday, 29 January 2016 at 08:23:38 UTC, Ola Fosheim Grøstad
wrote:
On Friday, 29 January 2016 at 07:01:07 UTC, Sönke Ludwig wrote:
Am 29.01.2016 um 00:18 schrieb Ola Foaheim Grøstad:
D is closer to C++ style templating and OO, and currently
focus
on enabling binding to non-template C++
On Sunday, 17 January 2016 at 20:52:20 UTC, Martin Nowak wrote:
Second and last beta for the 2.070.0 release.
http://dlang.org/download.html#dmd_beta
http://dlang.org/changelog/2.070.0.html
Please report any bugs at https://issues.dlang.org
-Martin
% dmd --version
DMD64 D Compiler v2.069
On Wednesday, 13 January 2016 at 06:01:41 UTC, Vladimir Panteleev
wrote:
http://beta.forum.dlang.org/
https://github.com/CyberShadow/DFeed/pull/51
I tried using this a bit and it's ... frustrating. I'll try and
describe the thought process of a visit:
I load beta.forum.dlang.org,
On Friday, 15 January 2016 at 08:15:50 UTC, Iain Buclaw wrote:
On 15 Jan 2016 9:12 am, "Russel Winder via Digitalmars-d" <
digitalmars-d@puremagic.com> wrote:
In this mindset D is certainly stable enough for production,
it is not beta software. DMD is the playground compiler, GDC
the
On Wednesday, 13 January 2016 at 21:35:15 UTC, tsbockman wrote:
On Wednesday, 13 January 2016 at 20:11:07 UTC, Jacob Carlborg
wrote:
On 2016-01-13 14:55, Vladimir Panteleev wrote:
As soon as anyone comes up with a way to fit it into the
design that
doesn't look awful.
I don't think this
On Wednesday, 13 January 2016 at 01:43:21 UTC, John Colvin wrote:
On Wednesday, 13 January 2016 at 01:39:26 UTC, John Colvin
wrote:
On Wednesday, 13 January 2016 at 00:31:48 UTC, Andrei
Alexandrescu wrote:
[...]
I would completely agree, except that we have builtin types
that don't obey
On Tuesday, 12 January 2016 at 21:27:38 UTC, Timon Gehr wrote:
On 01/12/2016 10:02 PM, John Colvin wrote:
On Tuesday, 12 January 2016 at 20:52:51 UTC, Timon Gehr wrote:
On 01/12/2016 07:27 PM, John Colvin wrote:
...
struct S{
auto opCmp(S rhs){ return float.nan; }
bool opEquals(S
On Wednesday, 13 January 2016 at 06:01:41 UTC, Vladimir Panteleev
wrote:
http://beta.forum.dlang.org/
https://github.com/CyberShadow/DFeed/pull/51
Look pretty, but not using the full width makes it a big
thumbs-down from me. I love the horizontal split mode and it
doesn't work well in such
On Tuesday, 12 January 2016 at 10:43:40 UTC, Russel Winder wrote:
On Tue, 2016-01-12 at 08:12 +, Atila Neves via
Digitalmars-d wrote:
On Monday, 11 January 2016 at 17:25:26 UTC, Russel Winder
wrote:
> I am guessing that people have an answer to this:
>
> D making use of a C API needs a D
On Tuesday, 12 January 2016 at 13:24:48 UTC, Russel Winder wrote:
On Tue, 2016-01-12 at 11:05 +, John Colvin via
Digitalmars-d wrote:
[…]
What's so hard about writing a few function prototypes,
aliases and enums? It's annoying that we have to do it, but
compared to writing the rest
On Tuesday, 12 January 2016 at 19:44:18 UTC, Fool wrote:
On Tuesday, 12 January 2016 at 19:21:47 UTC, John Colvin wrote:
Note that a non-reflexive <= doesn't imply anything about ==.
Non-reflexive '<=' does not make any sense at all.
It might be a bit of a mess, agreed, but nonet
Background:
Some important properties for binary relations on sets that are
somewhat similar to the normal ≤/≥ on the real numbers or
integers are:
a ≤ a (reflexivity);
if a ≤ b and b ≤ a, then a = b (antisymmetry);
if a ≤ b and b ≤ c, then a ≤ c (transitivity);
a ≤ b or b ≤ a (totality,
On Tuesday, 12 January 2016 at 18:36:32 UTC, Ilya Yaroshenko
wrote:
On Tuesday, 12 January 2016 at 18:27:15 UTC, John Colvin wrote:
Background:
Some important properties for binary relations on sets that
are somewhat similar to the normal ≤/≥ on the real numbers or
integers
On Tuesday, 12 January 2016 at 19:13:29 UTC, John Colvin wrote:
On Tuesday, 12 January 2016 at 19:00:11 UTC, Andrei
Alexandrescu wrote:
On 01/12/2016 01:27 PM, John Colvin wrote:
Preorder or partial order: not possible in D, opCmp insists
on totality.
The way I look at it, a partial order
On Tuesday, 12 January 2016 at 20:32:57 UTC, jmh530 wrote:
I'm not sure when you would want to use dynamic bindings.
When you want to have control over the process of loading a
library e.g. if you want it to be an optional dependency at
runtime.
On Tuesday, 12 January 2016 at 21:12:08 UTC, tsbockman wrote:
On Tuesday, 12 January 2016 at 20:56:41 UTC, John Colvin wrote:
Please consider the second design I proposed? It's small,
simple, has no impact on existing code and works in the right
direction (library types can emulate / act
On Tuesday, 12 January 2016 at 22:00:32 UTC, jmh530 wrote:
On Tuesday, 12 January 2016 at 21:10:28 UTC, John Colvin wrote:
When you want to have control over the process of loading a
library e.g. if you want it to be an optional dependency at
runtime.
I've seen the example in the book. I'm
On Tuesday, 12 January 2016 at 20:04:26 UTC, Andrei Alexandrescu
wrote:
On 01/12/2016 03:01 PM, John Colvin wrote:
On Tuesday, 12 January 2016 at 19:28:36 UTC, Andrei
Alexandrescu wrote:
On 01/12/2016 02:13 PM, John Colvin wrote:
a<=b and b<=a must also be false.
Would the advice &qu
On Tuesday, 12 January 2016 at 20:52:51 UTC, Timon Gehr wrote:
On 01/12/2016 07:27 PM, John Colvin wrote:
...
struct S{
auto opCmp(S rhs){ return float.nan; }
bool opEquals(S rhs){ return false; }
}
unittest{
S a,b;
assert(!(a==b));
assert(!(a<b));
assert(!(a
On Tuesday, 12 January 2016 at 20:52:51 UTC, Timon Gehr wrote:
On 01/12/2016 07:27 PM, John Colvin wrote:
...
struct S{
auto opCmp(S rhs){ return float.nan; }
bool opEquals(S rhs){ return false; }
}
unittest{
S a,b;
assert(!(a==b));
assert(!(a<b));
assert(!(a
On Tuesday, 12 January 2016 at 19:50:57 UTC, Fool wrote:
On Tuesday, 12 January 2016 at 19:48:35 UTC, Fool wrote:
On Tuesday, 12 January 2016 at 19:46:47 UTC, John Colvin wrote:
On Tuesday, 12 January 2016 at 19:44:18 UTC, Fool wrote:
Non-reflexive '<=' does not make any sense at
On Tuesday, 12 January 2016 at 19:28:36 UTC, Andrei Alexandrescu
wrote:
On 01/12/2016 02:13 PM, John Colvin wrote:
a<=b and b<=a must also be false.
Would the advice "Only use < and == for partially-ordered data"
work? -- Andrei
If by that you mean "Only use <=
On Tuesday, 12 January 2016 at 17:22:16 UTC, Walter Bright wrote:
On 1/12/2016 6:53 AM, Adam D. Ruppe wrote:
I'm pretty sure dfmt is up to the task in 99% of cases already.
The last 1% always takes 99% of the dev time :-(
But in this case, the 1% doesn't actually have to be fixed
(although
On Tuesday, 12 January 2016 at 19:00:11 UTC, Andrei Alexandrescu
wrote:
On 01/12/2016 01:27 PM, John Colvin wrote:
Preorder or partial order: not possible in D, opCmp insists on
totality.
The way I look at it, a partial order would implement opCmp and
opEqual such that a < b
On Tuesday, 12 January 2016 at 22:28:13 UTC, Andrei Alexandrescu
wrote:
On 01/12/2016 03:56 PM, John Colvin wrote:
Please consider the second design I proposed?
I don't think it solves a large problem. -- Andrei
Ok. Would you consider any solution, or is that a "leave it
broken"?
On Wednesday, 13 January 2016 at 00:31:48 UTC, Andrei
Alexandrescu wrote:
On 01/12/2016 06:52 PM, John Colvin wrote:
On Tuesday, 12 January 2016 at 22:28:13 UTC, Andrei
Alexandrescu wrote:
On 01/12/2016 03:56 PM, John Colvin wrote:
Please consider the second design I proposed?
I don't think
On Wednesday, 13 January 2016 at 01:39:26 UTC, John Colvin wrote:
On Wednesday, 13 January 2016 at 00:31:48 UTC, Andrei
Alexandrescu wrote:
[...]
I would completely agree, except that we have builtin types
that don't obey this rule. I'd be all in favour of sticking
with total orders
On Sunday, 3 January 2016 at 19:24:57 UTC, Martin Nowak wrote:
First beta for the 2.070.0 release.
Still a few things missing from the changelog, there is a new
package std.experimental.ndslice, and native (DWARF based)
exception handling on linux.
http://dlang.org/download.html#dmd_beta
On Sunday, 10 January 2016 at 16:23:24 UTC, Russel Winder wrote:
Iain,
Playing with the SCons tests, I am heading to the hypothesis
that, at least on Debian Sid, if both gdc and ldc packages are
installed, then gdc picks up the D source files from the ldc
package in preference to the ones
On Sunday, 10 January 2016 at 17:12:40 UTC, Jacob Carlborg wrote:
I've implemented native TLS in DMD on OS X for 64bit. Now the
question is, does it need to work for 32bit as well?
The easiest would be to drop the 32bit support all together.
Other options would be to continue to use emulate
On Saturday, 9 January 2016 at 11:38:06 UTC, Rikki Cattermole
wrote:
Enums are free and global variables may have cache misses issue
An enum isn't guaranteed to be embedded in the instruction
stream, there's still plenty of opportunities for cache misses.
On Saturday, 9 January 2016 at 14:55:27 UTC, Rikki Cattermole
wrote:
On 10/01/16 3:50 AM, John Colvin wrote:
On Saturday, 9 January 2016 at 11:38:06 UTC, Rikki Cattermole
wrote:
Enums are free and global variables may have cache misses
issue
An enum isn't guaranteed to be embedded
On Wednesday, 6 January 2016 at 13:36:03 UTC, data pulverizer
wrote:
I have been converting C numeric libraries and depositing them
here: https://github.com/dataPulverizer. So far I have glpk and
nlopt converted on a like for like c function basics. I am now
stuck on the gsl library, primarily
On Tuesday, 5 January 2016 at 18:34:20 UTC, JohnCK wrote:
On Tuesday, 5 January 2016 at 18:09:57 UTC, Andrei Alexandrescu
wrote:
Is the recent http://wiki.dlang.org/Contributing_to_dlang.org
along the lines of what you need? What other sort of
documentation would you find useful?
I took a
On Monday, 4 January 2016 at 12:28:47 UTC, Russel Winder wrote:
I must now try creating a D version of the
pytest.mark.parametrize decorator – unless someone already has
and I have just missed it.
I quick look at pytest.mark.parametrize suggests it could be
implemented with UDAs and a
On Sunday, 3 January 2016 at 14:50:51 UTC, Jacob Carlborg wrote:
On 2016-01-03 08:17, Manu via Digitalmars-d wrote:
I'll try and reduce this one again...
Have you tried using dustmite [1] to reduce the code? It will
automatically modify/reduce the source code as long as the
issue persists.
On Saturday, 2 January 2016 at 10:04:47 UTC, Shriramana Sharma
wrote:
import std.stdio;
union EarthLocation
{
struct { immutable double lon, lat, alt; }
double[3] data;
}
void main()
{
EarthLocation d = {data: [4, 5, 6]};
writeln(d.data);
d.data = [1, 2, 3];
On Saturday, 2 January 2016 at 12:08:48 UTC, Meta wrote:
On Saturday, 2 January 2016 at 12:07:31 UTC, John Colvin wrote:
You are manually breaking immutable by making a union of
immutable and mutable data and then writing to the mutable
reference. This is roughly equivalent to casting away
On Saturday, 2 January 2016 at 02:12:19 UTC, Shriramana Sharma
wrote:
If I have:
struct TimeSpan { double start, end; }
Then both the following automatically work:
auto s = TimeSpan();
auto t = TimeSpan(1, 2);
But if I make it a class (I need to) then I have to explicitly
define a
On Saturday, 2 January 2016 at 14:57:58 UTC, Shriramana Sharma
wrote:
John Colvin wrote:
Strictly speaking you aren't calling a constructor there,
you're writing a struct literal.
Why do you say I'm not calling a constructor?
https://dlang.org/spec/struct.html#struct-literal
On Wednesday, 30 December 2015 at 21:39:54 UTC, Ilya Yaroshenko
wrote:
On Tuesday, 29 December 2015 at 18:08:52 UTC, Andrei
Alexandrescu wrote:
On 12/29/2015 11:28 AM, Robert burner Schadek wrote:
On Tuesday, 29 December 2015 at 16:11:00 UTC, Ilya Yaroshenko
wrote:
OK, lets discuss every
On Thursday, 24 December 2015 at 17:20:02 UTC, JerryR wrote:
On Thursday, 24 December 2015 at 14:48:46 UTC, John Colvin
wrote:
Often when you see breakage it's the compiler actually
enforcing a pre-existing rule that the code in question broke.
So that made me think, there is any flag that I
On Thursday, 24 December 2015 at 17:17:39 UTC, JerryR wrote:
On Thursday, 24 December 2015 at 16:05:18 UTC, bachmeier wrote:
But 2.060 was released in 2012...
Yes I know it's old but and the reason was to avoid breakage
that already had happened before.
I know that sometimes this
301 - 400 of 2625 matches
Mail list logo