On Tuesday, 26 June 2012 at 18:12:03 UTC, Walter Bright wrote:
On 6/26/2012 8:41 AM, Jonathan M Davis wrote:
On Tuesday, June 26, 2012 16:24:24 Dejan Lekic wrote:
On 26/06/12 10:17, deadalnix wrote:
Le 23/06/2012 22:50, Walter Bright a écrit :
Due to there not being sufficient time left to
On 16/07/12 09:51, Adam Wilson wrote:
As a result of the D Versioning thread, we have decided to create a new
organization on Github called dlang-stable. This organization will be
responsible for maintaining stable releases of DMD, DRuntime, and Phobos.
So what is a stable release?
A stable
On 7/24/2012 1:04 AM, Michael Kerrisk wrote:
However, for anyone outside the continental US, this location makes the
statement that we're not terribly interested in having you attend: we'll make
you take at least two flights (not so many international connections to
Portland) or even three (if
On Monday, 16 July 2012 at 19:35:47 UTC, Andrei Alexandrescu
wrote:
I agree this would be more direct. But I fail to see how Walter
cherry-picking stuff is basically no additional work, whereas
Adam doing essentially the same is an unenviable amount of
labor.
The difference is Walter (and
jerro:
I haven't talked to Andrei or others about changing it, but I am
willing to write a patch that changes the API, if it would be
decided that would be the best thing to do.
Given your willingness to work, and the days since you wrote
that, maybe we have to write this little proposal
On 7/20/12 8:02 PM, jerro wrote:
On Friday, 20 July 2012 at 23:36:37 UTC, bearophile wrote:
Is it worth changing the Phobos API to something similar to this API?
Pfft already includes an API that is compatible with the
Phobos one (pfft.stdapi). But I don't think it makes any sense
to change
On Tue, 24 Jul 2012 02:12:05 -0700, Walter Bright
newshou...@digitalmars.com wrote:
On 7/24/2012 1:04 AM, Michael Kerrisk wrote:
However, for anyone outside the continental US, this location makes the
statement that we're not terribly interested in having you attend:
we'll make
you take
On Tue, 24 Jul 2012 01:50:02 -0700, Don Clugston d...@nospam.com wrote:
On 16/07/12 09:51, Adam Wilson wrote:
As a result of the D Versioning thread, we have decided to create a new
organization on Github called dlang-stable. This organization will be
responsible for maintaining stable
This all is very interesting. Even considering all potential
issues and incompatibilities, it might be great to look into
integrating Fft into Phobos. Do you think it would work to add
it as a high-speed alternative with different format and
alignment requirements? Offhand I'd think someone
Nice work.
Just did the usual advertising in HN and Reddit,
http://news.ycombinator.com/item?id=4286257
http://www.reddit.com/r/programming/comments/x2tt8/pfft_a_fast_fourier_transform_written_in_d/
--
Paulo
Thanks.
On Mon, Jul 23, 2012 at 4:08 PM, Simen Kjaeraas simen.kja...@gmail.com wrote:
This was filed as bug 3608[1], but that report was insufficiently specific,
and so T... matching both a TemplateParameterList and a variadic
TemplateParameter apparently did not make it into the patch.
I'm unsure
On 2012-07-23 22:28, monarch_dodra wrote:
My fear is that no matter how you look at it, the compiler just doesn't
know which overload you want to call. If the compiler could generate
messages about why each overload was not satisfactory, and it would have
then to generate messages about each
On Tuesday, 24 July 2012 at 02:51:44 UTC, H. S. Teoh wrote:
Reminds of a certain individual who shall remain unnamed, with
whom I
argued about why he should *not* implement IPv6 prefix checking
by
converting the address and prefixes to strings and then using
strncmp()... Truly boggles the
I can't help thinking it sounds rather like a job for... named
parameters. Just imagine it:
##
void foo ( bool closeButton = true, int width = 600 ) {
writeln( closeButton, , , width );
}
void main () {
foo( closeButton: false );
}
Stuart wrote in message news:nnyvtncaxpgnjtklv...@forum.dlang.org...
On Monday, 23 July 2012 at 15:56:37 UTC, Paulo Pinto wrote:
Am 23.07.2012 14:49, schrieb Stuart:
On Saturday, 21 July 2012 at 22:16:52 UTC, Nick Sabalausky wrote:
C++ is living in the 70's.
Precisely what I have been
Nick Sabalausky wrote in message news:20120723171909.0527@unknown...
On Mon, 23 Jul 2012 22:51:19 +0200
Stuart stu...@gmx.com wrote:
On Monday, 23 July 2012 at 15:56:37 UTC, Paulo Pinto wrote:
Am 23.07.2012 14:49, schrieb Stuart:
On Saturday, 21 July 2012 at 22:16:52 UTC, Nick
Il giorno lun, 23/07/2012 alle 18.30 +0200, bearophile ha scritto:
[...]
Then I suggest to call the next release dmd 2.1.0 :-)
[...]
+1
On Tue, 24 Jul 2012 08:40:13 +0200
Chris NS ibisbase...@gmail.com wrote:
On Tuesday, 24 July 2012 at 02:51:44 UTC, H. S. Teoh wrote:
Reminds of a certain individual who shall remain unnamed, with
whom I
argued about why he should *not* implement IPv6 prefix checking
by
converting
David Nadlinger wrote:
On Sunday, 22 July 2012 at 03:06:28 UTC, Jens Mueller wrote:
Where is argmin defined? I couldn't find it.
On the slide before that… ;)
:)
Jens
On 24-Jul-12 02:06, Walter Bright wrote:
On 7/23/2012 2:25 PM, bearophile wrote:
Walter Bright:
D already has it: http://dlang.org/statement.html#FinalSwitchStatement
Do you have a proof? (Show me asm code)
Since the final switch does not allow a 'default' case, the check can be
omitted,
On Monday, 23 July 2012 at 19:57:42 UTC, Jacob Carlborg wrote:
constraint BidirectionalRange (Range) : ForwardRange!(Range)
{
void popBack ();
@property E back ();
@property E front ();
}
[snip]
I know that others have had similar ideas.
I remember this was discussed recently
On Tue, 24 Jul 2012 08:08:19 +0200, Philippe Sigaud
philippe.sig...@gmail.com wrote:
class C(T,U) {}
// does not work on class C
template dissect1(T : Name!(Params), alias Name, Params...) {}
// works on class C
template dissect2(T : Name!(Param1, Param2), alias Name, Param1, Param2)
{}
On Tue, 24 Jul 2012 04:21:18 +0200, Andrei Alexandrescu
seewebsiteforem...@erdani.org wrote:
Tuple!(float, x, float, y) bar() {
return typeof(return)( 0.0, 0.0 );
}
[snip]
We could make
return tuple(0.0, 0.0);
to work. I can't imagine a scenario in which this relaxation would cause
a
On 7/24/2012 12:58 AM, Dmitry Olshansky wrote:
Now if I use final switches there is still:
A) jump table per switch, or maybe less but there is no guarantees
(= depend on another optimization that's not here)
B) it's an ugly and a roundabout way to do this
However I think that always
On Tuesday, July 24, 2012 11:03:16 Simen Kjaeraas wrote:
On Tue, 24 Jul 2012 04:21:18 +0200, Andrei Alexandrescu
seewebsiteforem...@erdani.org wrote:
Tuple!(float, x, float, y) bar() {
return typeof(return)( 0.0, 0.0 );
}
[snip]
We could make
return tuple(0.0, 0.0);
to
On Tue, 24 Jul 2012 13:00:44 +0200, Jonathan M Davis jmdavisp...@gmx.com
wrote:
On Tuesday, July 24, 2012 11:03:16 Simen Kjaeraas wrote:
On Tue, 24 Jul 2012 04:21:18 +0200, Andrei Alexandrescu
seewebsiteforem...@erdani.org wrote:
Tuple!(float, x, float, y) bar() {
return typeof(return)(
Le 23/07/2012 18:56, bearophile a écrit :
deadalnix:
The presented example is insanely unsafe. By giving invalid input, you
can basically branch randomly.
The check added by the switch is what is required to make it safe, so
it isn't faster at the end.
The case in the article isn't very
On 2012-07-24 10:37, xenon325 wrote:
I remember this was discussed recently and Don Clugston suggested
something like this:
if there is no match for:
void foo(T)(T t) if( !conditionA!T ){}
void foo(T)(T t) if( conditionA!T conditionB!T ){}
the error will be:
template foo does not
On 7/24/12 5:03 AM, Simen Kjaeraas wrote:
On Tue, 24 Jul 2012 04:21:18 +0200, Andrei Alexandrescu
seewebsiteforem...@erdani.org wrote:
Tuple!(float, x, float, y) bar() {
return typeof(return)( 0.0, 0.0 );
}
[snip]
We could make
return tuple(0.0, 0.0);
to work. I can't imagine a scenario in
On 24-Jul-12 14:04, Walter Bright wrote:
On 7/24/2012 12:58 AM, Dmitry Olshansky wrote:
Now if I use final switches there is still:
A) jump table per switch, or maybe less but there is no guarantees
(= depend on another optimization that's not here)
B) it's an ugly and a roundabout way to do
On Tue, Jul 24, 2012 at 11:08 AM, Simen Kjaeraas simen.kja...@gmail.com wrote:
Sigh... I'll go back to parsing a .stringof representation.
I went ahead and filed a new bug[1], and (90) minutes after, Kenji Hara
responded
this is already implemented for 2.060.
[1]:
On 23/07/12 17:04, Adam D. Ruppe wrote:
On Monday, 23 July 2012 at 14:46:30 UTC, FeepingCreature wrote:
The more general form would be to make variable declaration an
expression.
Right, and that would be pretty amazing, but it would probably
be too hard to do in D today...
The bizarre
Hello,
I was talking to Walter on how to define a good study of D's compilation
speed. We figured that we clearly need a good baseline, otherwise
numbers have little meaning.
One idea would be to take a real, non-trivial application, written in
both D and another compiled language. We then
On Monday, 23 July 2012 at 21:14:31 UTC, Simen Kjaeraas wrote:
On Mon, 23 Jul 2012 22:51:19 +0200, Stuart stu...@gmx.com
wrote:
Saves us having to create a struct for every goddamn little
function; or using tuples directly, which means we have to
refer to variables like .value1 and .value2
On Tue, 24 Jul 2012 15:42:19 +0100, Stuart stu...@gmx.com wrote:
On Monday, 23 July 2012 at 21:14:31 UTC, Simen Kjaeraas wrote:
On Mon, 23 Jul 2012 22:51:19 +0200, Stuart stu...@gmx.com wrote:
Saves us having to create a struct for every goddamn little function;
or using tuples directly,
On 24-Jul-12 18:34, Andrei Alexandrescu wrote:
Hello,
Although it sounds daunting to write the same nontrivial program twice,
it turns out such an application does exist: dmdscript, a Javascript
engine written by Walter in both C++ and D. It has over 40KLOC so it's
of a good size to play with.
On Tuesday, 24 July 2012 at 14:34:58 UTC, Andrei Alexandrescu
wrote:
the D source is in D1 and should be adjusted to compile with
D2),
That would provide performance (compilation and run-time) for D1
only (with D2 compiler). Performance of a typical D2 app would
likely be different.
On 7/24/12 10:53 AM, Dmitry Olshansky wrote:
On 24-Jul-12 18:34, Andrei Alexandrescu wrote:
Hello,
Although it sounds daunting to write the same nontrivial program twice,
it turns out such an application does exist: dmdscript, a Javascript
engine written by Walter in both C++ and D. It has over
On Tue, Jul 24, 2012 at 03:49:14PM +0100, Regan Heath wrote:
On Tue, 24 Jul 2012 15:42:19 +0100, Stuart stu...@gmx.com wrote:
[...]
You mean it's already supported? Nice! Although, It'd still be
awesome to be able to do things like:
auto a,b = bar();
auto c,_ = bar();
Sadly the
On Tue, 24 Jul 2012 16:42:19 +0200, Stuart stu...@gmx.com wrote:
You mean it's already supported? Nice!
That's what I mean. :p
Although, It'd still be awesome to be able to do things like:
auto a,b = bar();
auto c,_ = bar();
That would be nice, and has been on the table
Roman D. Boiko wrote in message
news:hpibxcqsmlpmgyngj...@forum.dlang.org...
On Tuesday, 24 July 2012 at 14:34:58 UTC, Andrei Alexandrescu wrote:
the D source is in D1 and should be adjusted to compile with D2),
That would provide performance (compilation and run-time) for D1 only (with
D2
On Tuesday, 24 July 2012 at 14:50:02 UTC, Regan Heath wrote:
On Tue, 24 Jul 2012 15:42:19 +0100, Stuart stu...@gmx.com
wrote:
You mean it's already supported? Nice! Although, It'd still be
awesome to be able to do things like:
auto a,b = bar();
auto c,_ = bar();
Sadly the comma
On 24-Jul-12 18:54, Andrei Alexandrescu wrote:
On 7/24/12 10:53 AM, Dmitry Olshansky wrote:
On 24-Jul-12 18:34, Andrei Alexandrescu wrote:
Hello,
Although it sounds daunting to write the same nontrivial program twice,
it turns out such an application does exist: dmdscript, a Javascript
engine
On 24-Jul-12 18:54, Roman D. Boiko wrote:
On Tuesday, 24 July 2012 at 14:34:58 UTC, Andrei Alexandrescu wrote:
the D source is in D1 and should be adjusted to compile with D2),
That would provide performance (compilation and run-time) for D1 only
(with D2 compiler). Performance of a typical
On 7/24/12 10:54 AM, Roman D. Boiko wrote:
On Tuesday, 24 July 2012 at 14:34:58 UTC, Andrei Alexandrescu wrote:
the D source is in D1 and should be adjusted to compile with D2),
That would provide performance (compilation and run-time) for D1 only
(with D2 compiler). Performance of a typical
On Tuesday, 24 July 2012 at 15:06:58 UTC, Andrei Alexandrescu
wrote:
Nevertheless, I think there is value in the study. We're
looking at a real nontrivial application that wasn't written
for a study, but for actual use, and that implements the same
design and same functionality in both
On 07/24/2012 07:42 AM, Stuart wrote:
You mean it's already supported? Nice! Although, It'd still be awesome
to be able to do things like:
auto a,b = bar();
auto c,_ = bar();
Works in foreach loops:
foreach (a, b; hasTupleElements)
The element type of the following range of map
On Saturday, 21 July 2012 at 16:32:56 UTC, Andrei Alexandrescu
wrote:
On 7/21/12 6:28 AM, monarch_dodra wrote:
On Friday, 20 July 2012 at 21:45:17 UTC, Andrei Alexandrescu
wrote:
On 7/20/12 8:51 AM, Andrea Fontana wrote:
CMWC is proven to be a valid method and it passes diehard
tests. It was
Hello!
Why does this code print output when I run it?
- It only happens when the HTTP response Code is == 405
- 173.194.69.94 is a Google Server for testing
- Are there any default callbacks which make this output?
CODE:
http://pastebin.com/CZP86Gwh
OUTPUT:
On 7/24/12, Andrei Alexandrescu seewebsiteforem...@erdani.org wrote:
snip
I've got a codebase where it takes DMD 15 seconds to output an error
message to stdout. The error message is 3000 lines long. (and people
thought C++ errors were bad!). It's all thanks to this bug:
On 7/24/12, H. S. Teoh hst...@quickfur.ath.cx wrote:
The comma operator must go.
The comma operator needs to die a fast but painful death. I've had
this sort of bug recently:
int getInt(string op)
{
if (op, a)
return 1;
else
if (op == b)
return 2;
else
On Tue, 2012-07-24 at 16:59 +0200, Simen Kjaeraas wrote:
[…]
...which inspired me to write this implementation of fibonacci:
T fib(T = int)(int n, T a = 0, T b = 1) {
while ( n-- ) {
TypeTuple!(a,b) = tuple(b, a +b);
}
return a;
}
Or possibly better:
long
On 7/24/2012 6:58 AM, Dmitry Olshansky wrote:
void op_1()
{
...//some code for instruction 1
opcode = cast(function void ())code[pc++];
goto opcode(); //opcode is pointer to function op_xx
}
//can do without goto fn() iff tail call is GUARANTEED
I believe you can do this with:
I am wondering if the examples at
http://dlang.org/phobos/std_range.html#take need some attention. As far
as I can see they only work because the input is a list. If you take
from the result of an algorithm such as recurrence then you have to
explicitly create an array from the result of the take
On 7/24/2012 10:10 AM, Russel Winder wrote:
I am wondering if the examples at
http://dlang.org/phobos/std_range.html#take need some attention. As far
as I can see they only work because the input is a list. If you take
from the result of an algorithm such as recurrence then you have to
On 7/24/12 1:10 PM, Russel Winder wrote:
I am wondering if the examples at
http://dlang.org/phobos/std_range.html#take need some attention. As far
as I can see they only work because the input is a list. If you take
from the result of an algorithm such as recurrence then you have to
explicitly
On 07/24/12 16:34, Andrei Alexandrescu wrote:
I was talking to Walter on how to define a good study of D's compilation
speed. We figured that we clearly need a good baseline, otherwise
numbers have little meaning.
I agree.
One idea would be to take a real, non-trivial application, written in
On Tue, 24 Jul 2012 19:02:07 +0200, Russel Winder rus...@winder.org.uk
wrote:
On Tue, 2012-07-24 at 16:59 +0200, Simen Kjaeraas wrote:
[…]
...which inspired me to write this implementation of fibonacci:
T fib(T = int)(int n, T a = 0, T b = 1) {
while ( n-- ) {
TypeTuple!(a,b)
On Tue, 2012-07-24 at 13:56 -0400, Andrei Alexandrescu wrote:
[…]
The example is:
int[] arr1 = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ];
auto s = take(arr1, 5);
assert(s.length == 5);
assert(s[4] == 5);
assert(equal(s, [ 1, 2, 3, 4, 5 ][]));
Were you referring to this? Example code does not
On 7/24/12 2:17 PM, Russel Winder wrote:
That's the one.
s[4] relies on the fact that arr1 is an array:
( takeExactly ( recurrence ! ( a[n-1] + a[n-2] ) ( 0L , 1L ) , cast
( size_t ) ( n + 1 ) ) ) [ n ]
fails with operator [] not defined, I find I have to:
array ( takeExactly ( recurrence
On Tue, 2012-07-24 at 14:21 -0400, Andrei Alexandrescu wrote:
[…]
I must have gotten a bit too used to it, but I think that's quite a
basic reality imposed by the types involved... yes, that's as clear as
xyz = 4.5 only works if xyz is of some certain types.
I think the point here is that
On Tue, Jul 24, 2012 at 11:47 AM, Russel Winder rus...@winder.org.uk wrote:
On Tue, 2012-07-24 at 14:21 -0400, Andrei Alexandrescu wrote:
[…]
Is the website documentation generated from the Phobos source or is it a
separate repository?
That particular example should be in the ddoc block for
On 7/24/12 2:47 PM, Russel Winder wrote:
On Tue, 2012-07-24 at 14:21 -0400, Andrei Alexandrescu wrote:
[…]
I must have gotten a bit too used to it, but I think that's quite a
basic reality imposed by the types involved... yes, that's as clear as
xyz = 4.5 only works if xyz is of some certain
On Tue, 24 Jul 2012 18:53:25 +0200
Andrej Mitrovic andrej.mitrov...@gmail.com wrote:
On 7/24/12, Andrei Alexandrescu seewebsiteforem...@erdani.org wrote:
snip
I've got a codebase where it takes DMD 15 seconds to output an error
message to stdout. The error message is 3000 lines long. (and
On 24-Jul-12 21:03, Walter Bright wrote:
On 7/24/2012 6:58 AM, Dmitry Olshansky wrote:
void op_1()
{
...//some code for instruction 1
opcode = cast(function void ())code[pc++];
goto opcode(); //opcode is pointer to function op_xx
}
//can do without goto fn() iff tail call is
On Tue, 24 Jul 2012 19:47:42 +0100
Russel Winder rus...@winder.org.uk wrote:
Is the website documentation generated from the Phobos source or is
it a separate repository? (He says giving away his green-ness at the
D community infrastructure!)
The Phobos documentation is generated from the
On 7/24/2012 12:50 PM, Dmitry Olshansky wrote:
are the same (same as in same number of indirections).
switch (code[pc++])
and
goto code[pc++]()
are the same, too.
It's not. Let's get to assembly then. It's an illustration as I'm no expert and
may have made some illegal shortcuts
On Tuesday, 24 July 2012 at 16:09:15 UTC, monarch_dodra wrote:
On Saturday, 21 July 2012 at 16:32:56 UTC, Andrei Alexandrescu
wrote:
On 7/21/12 6:28 AM, monarch_dodra wrote:
On Friday, 20 July 2012 at 21:45:17 UTC, Andrei Alexandrescu
wrote:
On 7/20/12 8:51 AM, Andrea Fontana wrote:
CMWC is
On Wednesday, July 25, 2012 00:01:03 Andrea Fontana wrote:
I see there's an implementation in tango for d1, with params too
Which does Phobos no good unless you can get permission from the author(s) of
that code to switch the license to Boost. Without that, you should probably
avoid even
On Tuesday, July 24, 2012 15:49:38 Nick Sabalausky wrote:
Yea. Programs using Goldie ( semitwist.com/goldie ) take a long time to
compile (by D standards, not by C++ standards). I tried to benchmark
it a while back, and was never really confident in the results I was
getting or my
On 25-Jul-12 01:40, Walter Bright wrote:
On 7/24/2012 12:50 PM, Dmitry Olshansky wrote:
are the same (same as in same number of indirections).
switch (code[pc++])
and
goto code[pc++]()
are the same, too.
It's not. Let's get to assembly then. It's an illustration as I'm no
expert
On Tuesday, 24 July 2012 at 22:19:07 UTC, Jonathan M Davis wrote:
On Tuesday, July 24, 2012 15:49:38 Nick Sabalausky wrote:
Yea. Programs using Goldie ( semitwist.com/goldie ) take a
long time to
compile (by D standards, not by C++ standards). I tried to
benchmark
it a while back, and was
On Tuesday, 24 July 2012 at 06:40:14 UTC, Chris NS wrote:
On Tuesday, 24 July 2012 at 02:51:44 UTC, H. S. Teoh wrote:
Reminds of a certain individual who shall remain unnamed, with
whom I argued about why he should *not* implement IPv6 prefix
checking by converting the address and prefixes
On Tuesday, 24 July 2012 at 22:38:07 UTC, Era Scarecrow wrote:
documented' because they couldn't understand what were for.
Sorry my filter stripped that out. They couldn't understand what
and were for.
On 7/24/12 6:48 PM, Era Scarecrow wrote:
On Tuesday, 24 July 2012 at 22:38:07 UTC, Era Scarecrow wrote:
documented' because they couldn't understand what were for.
Sorry my filter stripped that out. They couldn't understand what and
were for.
x = 2; // if x much greater than 2, assign 2
On Tuesday, 24 July 2012 at 07:03:05 UTC, Chris NS wrote:
I can't help thinking it sounds rather like a job for... named
parameters. Just imagine it:
Yeah, that could do it too, but named parameters have been
brought up a few times too and there's opposition to it.
I kinda prefer the struct
On 7/24/2012 3:33 PM, Dmitry Olshansky wrote:
On 25-Jul-12 01:40, Walter Bright wrote:
On 7/24/2012 12:50 PM, Dmitry Olshansky wrote:
are the same (same as in same number of indirections).
switch (code[pc++])
and
goto code[pc++]()
are the same, too.
It's not. Let's get to
On 24/07/12 15:34, Andrei Alexandrescu wrote:
One idea would be to take a real, non-trivial application, written in both D and
another compiled language. We then can measure build times for both
applications, and also measure the relative speeds of the generated executables.
Suggest that this
On 7/24/2012 3:18 PM, Jonathan M Davis wrote:
But we'd have to actually profile
the compiler on a variety of projects to be sure of that (which is at least
partially related to what Andrei is suggesting).
I wouldn't be a bit surprised to find that there are some O(n*n) or worse
algorithms
On 7/24/2012 8:06 AM, Andrei Alexandrescu wrote:
Nevertheless, I think there is value in the study. We're looking at a real
nontrivial application that wasn't written for a study, but for actual use, and
that implements the same design and same functionality in both languages.
The translation
On 7/24/2012 7:58 AM, Paulo Pinto wrote:
Roman D. Boiko wrote in message news:hpibxcqsmlpmgyngj...@forum.dlang.org...
On Tuesday, 24 July 2012 at 14:34:58 UTC, Andrei Alexandrescu wrote:
the D source is in D1 and should be adjusted to compile with D2),
That would provide performance
(Maybe this should be in D.learn but it's a somewhat advanced
topic)
I would really like to understand how D compiles a program or
library. I looked through TDPL and it doesn't seem to say
anything about how compilation works.
- Does it compile all source files in a project at once?
- Does
On 7/24/2012 11:02 AM, Guillaume Chatelet wrote:
By the way, it reminds me of the 'Computer Language Benchmarks Game'
(http://shootout.alioth.debian.org/). I know D is not welcome aboard but
couldn't we try do run the game for ourself so to have some more data ?
Small programs are completely
On 7/24/12 8:20 PM, Walter Bright wrote:
On 7/24/2012 11:02 AM, Guillaume Chatelet wrote:
By the way, it reminds me of the 'Computer Language Benchmarks Game'
(http://shootout.alioth.debian.org/). I know D is not welcome aboard but
couldn't we try do run the game for ourself so to have some
On 07/24/2012 04:54 PM, Joseph Rushton Wakeling wrote:
Language Compiler Compile time (s) Runtime (s)
D GDC 1.5 25.3
D DMD 0.4 52.1
C++ g++ 2.3 21.8
C++ Clang++ 1.8 27.6
Those C++ builds have very few C++ source files, right? In my experience
each source file takes a few seconds each,
On Tuesday, 24 July 2012 at 23:03:39 UTC, Adam D. Ruppe wrote:
On Tuesday, 24 July 2012 at 07:03:05 UTC, Chris NS wrote:
I can't help thinking it sounds rather like a job for... named
parameters. Just imagine it:
Yeah, that could do it too, but named parameters have been
brought up a few
On Tuesday, 24 July 2012 at 22:38:07 UTC, Era Scarecrow wrote:
[code]
//remember, java
String toGuid(byte input[16]) {
String ID = {;
if (Integer.toHexString(input[5]).length 2)
ID = ID + 0;
ID = ID + Integer.toHexString(input[5]);
if (Integer.toHexString(input[6]).length 2)
On Wed, 25 Jul 2012 02:16:04 +0200
David Piepgrass qwertie...@gmail.com wrote:
(Maybe this should be in D.learn but it's a somewhat advanced
topic)
I would really like to understand how D compiles a program or
library. I looked through TDPL and it doesn't seem to say
anything about how
On Wed, 25 Jul 2012 03:52:28 +0200
Chris NS ibisbase...@gmail.com wrote:
Erm, so that I'm not completely off-topic: I know where D has
truly gone wrong. There's just too many damn semi-colons!
Nah, I know exactly where it went wrong.
Albuquerque.
Shoulda gone left.
On Tue, 24 Jul 2012 21:35:24 -0500
Caligo iteronve...@gmail.com wrote:
Just found this:
http://hammerprinciple.com/therighttool/items/d/c-2
Jesus, that's one of the most poorly implemented sites I've ever seen.
I tried going through the questions (after switching to my
non-preferred
On Wednesday, 25 July 2012 at 02:35:47 UTC, Caligo wrote:
Just found this:
http://hammerprinciple.com/therighttool/items/d/c-2
One of the survey questions was:
I often write things in this language with the intent of
rewriting them in something else later
I think C++ got 76% of the vote on
Couple months ago I came across ClawsMail which, at first,
seemed to actually be good enough to finally pull me away from Outlook
Express. Which was nice because I was getting really tired of OE's
issues: lack of spellcheck, can't send unicode, proprietary storage
format, certin NG postings only
I've only recently discovered D, and I already think it's great.
I mean, where else am I going to find a language that [a]
compiles to native code, [b] has classes, [c] has no stupid
flat-file #include system, and [d] has a GC? Honestly, I can't
think of any others!
I really don't understand
Please build LDC2 for windowXP with visual studio 2010
I try compling on windows XP 32 bit .But I get Error
Please Help me !
C:/ldcenv/build-ldc2/ldc/vcbuild/ldfpu.asm(33): error A2034: must
be in segment
block [C:\ldcenv\build-ldc2\LDCShared.vcxproj]
On Tue, 24 Jul 2012 20:35:27 -0700
Jonathan M Davis jmdavisp...@gmx.com wrote:
On Tuesday, July 24, 2012 22:00:56 Nick Sabalausky wrote:
But with D, you get a HUGE boost in compilation speed by
not compiling one-at-a-time. So if you have a huge, slow-to-compile
codebase (for example, 15
On 25-Jul-12 03:31, Walter Bright wrote:
On 7/24/2012 3:33 PM, Dmitry Olshansky wrote:
There is no code just jump [ecx]. The offset is included already.
I'm not seeing where code is in the asm code you presented.
Sorry, I have no idea why it is not the same. jumptable is a static
array,
On Tuesday, 24 July 2012 at 12:50:08 UTC, Jacob Carlborg wrote:
That will be just a little better. The problem is it will leak
implementation details. For this to be useful you really need
to create a template for every condition:
template isFoo (T)
{
enum isFoo = is(T == Foo);
}
void
On Tuesday, 24 July 2012 at 03:25:55 UTC, ReneSac wrote:
Do I really have to duplicate the function, in order to achieve
this?
In a nutshell, yes. Or else resort to bizarre sorcery such as
may rot the very heart from one's chest (or template ninjitsu,
whatever). But is it really so
Am 24.07.2012 05:25, schrieb ReneSac:
I whish there was:
auto foo() {
return Tuple!(foo, bar, 1, new Custum());
}
void main() {
auto (s1, s2, i, c) = foo();
}
Thanks for the feedback guys. Casting away shared before usage
works.
On Monday, 23 July 2012 at 21:02:23 UTC, Jonathan M Davis wrote:
On Monday, July 23, 2012 10:37:03 Ali Çehreli wrote:
Appender does cast(Unqual!(T)) which removes the 'shared'
qualifier. I
think that should be considered a
1 - 100 of 162 matches
Mail list logo
