Yesterday the paperback edition of TDPL has reached an Amazon sales rank
of 19,426 (smaller is better). Last time the book has enjoyed a better
rank was on October 29, 2010 (18,755).
These numbers are estimates based on scripts scraping Amazon and should
not be considered official.
Andrei
Summary of previous discussion:
Q. Is there more information on the Astoria seminar?
A. Yes: http://astoriaseminar.com/index.html
So which is less helpful? The answer to a question asked in the
previous post which requires the reader to actually read down
ten lines, or a long digression
Elements of containers (and pseudo-containers) are accessed by the range
abstraction of D. D's InputRange, ForwardRange, BidirectionalRange,
RandomAccessRange, and OutputRange are sufficient to connect many types of
containers and many types of algorithms.
Most modules of Phobos, including
On 05/27/2012 01:12 PM, Walter Bright wrote:
Elements of containers (and pseudo-containers) are accessed by the range
abstraction of D. D's InputRange, ForwardRange, BidirectionalRange,
RandomAccessRange, and OutputRange are sufficient to connect many types
of containers and many types of
On 5/27/2012 1:38 PM, Ali Çehreli wrote:
Great! :) Walter, there is a typo in my last name and it's not the first
letter. ;)
OOPS! Fixed.
What's the Unicode number for the first letter, so I can fix that, too? Is there
an entity name for it?
Some of you might remember that I have been meaning to write a
comprehensive introduction to design and use of purity for quite
some while now – I finally got around to do so:
http://klickverbot.at/blog/2012/05/purity-in-d/
Feedback and criticism of all kinds very welcome!
David
On Sunday, May 27, 2012 13:53:24 Walter Bright wrote:
On 5/27/2012 1:38 PM, Ali Çehreli wrote:
Great! :) Walter, there is a typo in my last name and it's not the first
letter. ;)
OOPS! Fixed.
What's the Unicode number for the first letter, so I can fix that, too? Is
there an entity name
On Sunday, May 27, 2012 14:01:09 Jonathan M Davis wrote:
On Sunday, May 27, 2012 13:53:24 Walter Bright wrote:
On 5/27/2012 1:38 PM, Ali Çehreli wrote:
Great! :) Walter, there is a typo in my last name and it's not the first
letter. ;)
OOPS! Fixed.
What's the Unicode number for
On 5/27/2012 2:01 PM, Jonathan M Davis wrote:
On Sunday, May 27, 2012 13:53:24 Walter Bright wrote:
On 5/27/2012 1:38 PM, Ali Çehreli wrote:
Great! :) Walter, there is a typo in my last name and it's not the first
letter. ;)
OOPS! Fixed.
What's the Unicode number for the first letter, so I
On 5/27/2012 2:03 PM, Jonathan M Davis wrote:
Having .d files be able to be UTF-8 combined with unicode support built into
the language itself can be _very_ handy.
I also love D's support for entities: http://dlang.org/entity.html
I'm amazed this is not adopted by other languages. It is so
On 05/27/2012 01:53 PM, Walter Bright wrote:
On 5/27/2012 1:38 PM, Ali Çehreli wrote:
Great! :) Walter, there is a typo in my last name and it's not the
first letter. ;)
OOPS! Fixed.
What's the Unicode number for the first letter, so I can fix that, too?
Is there an entity name for it?
On Wednesday, 23 May 2012 at 23:26:35 UTC, Walter Bright wrote:
Congratulations, Robert!
http://astoriaseminar.com/sessions.html
»by a factor of at least 1:000 and 10:000 respectively« – the
colons doesn't really make sense, do they?
David
On 5/27/2012 2:15 PM, Ali Çehreli wrote:
Thanks but the misspelling has overpowered the correct one: Now both the
Speakers and the Sessions page has the wrong name! :D
Also, there is a rogue Ddoc at the end of the speaker bio.
Alas! Someday, I might get this right. Fixed.
About the letter,
On Sunday, 27 May 2012 at 20:56:22 UTC, David Nadlinger wrote:
Some of you might remember that I have been meaning to write a
comprehensive introduction to design and use of purity for
quite some while now – I finally got around to do so:
http://klickverbot.at/blog/2012/05/purity-in-d/
On 5/27/12 3:38 PM, Ali Çehreli wrote:
On 05/27/2012 01:12 PM, Walter Bright wrote:
Elements of containers (and pseudo-containers) are accessed by the range
abstraction of D. D's InputRange, ForwardRange, BidirectionalRange,
RandomAccessRange, and OutputRange are sufficient to connect many
On 5/27/2012 1:56 PM, David Nadlinger wrote:
Some of you might remember that I have been meaning to write a comprehensive
introduction to design and use of purity for quite some while now – I finally
got around to do so:
http://klickverbot.at/blog/2012/05/purity-in-d/
Feedback and criticism of
On Sunday, May 27, 2012 21:36:39 Andrei Alexandrescu wrote:
There's a post that made it on forum.dlang.org but not on the NNTP site.
Did that happen to anyone else?
http://forum.dlang.org/thread/jptjlb$qh1$1...@digitalmars.com
It arrived for the mailing list (at least, I got it that way - I
Andrei Alexandrescu seewebsiteforem...@erdani.org wrote in message
news:jpuobn$30v8$1...@digitalmars.com...
There's a post that made it on forum.dlang.org but not on the NNTP site.
Did that happen to anyone else?
http://forum.dlang.org/thread/jptjlb$qh1$1...@digitalmars.com
It showed up on
On 05/27/2012 09:30 PM, Nick Sabalausky wrote:
Andrei Alexandrescuseewebsiteforem...@erdani.org wrote in message
news:jpuobn$30v8$1...@digitalmars.com...
There's a post that made it on forum.dlang.org but not on the NNTP site.
Did that happen to anyone else?
On 5/28/12 12:12 AM, Ali Çehreli wrote:
On 05/27/2012 09:30 PM, Nick Sabalausky wrote:
Andrei Alexandrescuseewebsiteforem...@erdani.org wrote in message
news:jpuobn$30v8$1...@digitalmars.com...
There's a post that made it on forum.dlang.org but not on the NNTP site.
Did that happen to anyone
Below there are two routines with the same name.
Apparently both can be present at the same time.
Which one of the two is the recommended code?
import std.stdio;
interface ITest
{
int first();
int second();
}
class Test: ITest
{
int first()
{
On 27-05-2012 11:43, sclytrack wrote:
Below there are two routines with the same name.
Apparently both can be present at the same time.
Which one of the two is the recommended code?
import std.stdio;
interface ITest
{
int first();
int second();
}
class Test: ITest
{
int first()
{
On Sat, 26 May 2012 19:51:48 +0200, Walter Bright
newshou...@digitalmars.com wrote:
http://www.gamedev.net/blog/1140/entry-2254294-compiling-data-into-a-d-executable/
and on Reddit:
http://www.reddit.com/r/programming/comments/u5sgs/compiling_data_into_a_d_executable/
On 2012-05-26 19:40, bioinfornatics wrote:
pypy from python do both http://pypy.org/ get dependencies, build from
setup script
What does a python tool need to build, external libraries?
In comparison Rubygems and Rake are to separate tools.
--
/Jacob Carlborg
On 2012-05-27 03:22, Michaël Larouche michael.larou...@gmail.com
Yes they should be separate tools but that's doesn't mean they can't
work together.
Of course they should work together.
--
/Jacob Carlborg
Am 26.05.2012 19:42, schrieb bioinfornatics:
Fix link: http://pypi.python.org/pypi that is pypi and not pypy
Wrong it's PIP, http://pypi.python.org/pypi/pip/1.1
PyPi is just the index.
This would mean that all that data is in memory at runtime i
guess ? ...
And if so is there a way to avoid this...
I frequently use a audiovisual slideshow program called
mobjects. It can compile your slideshow to an executable (often
larger thn 1GiB) but it's memory footprint at runtime is
On Sun, 2012-05-27 at 12:18 +0200, Jacob Carlborg wrote:
On 2012-05-26 19:40, bioinfornatics wrote:
pypy from python do both http://pypy.org/ get dependencies, build from
setup script
What does a python tool need to build, external libraries?
In comparison Rubygems and Rake are to
On 05/27/12 02:45, Walter Bright wrote:
On 5/26/2012 3:59 AM, Don wrote:
Yes, that's what happens now. But that doesn't help the programmer.
If it is inside, no problem, the expression is true. But if it is not inside,
the expression is not false -- it's a compile-time error.
Ok, I
On Sun, 2012-05-27 at 13:33 +0100, Russel Winder wrote:
pip (and easy_install) are package downloaders and installers, invoke
bytecode generation of the installed, they are not build tools. The
offerings for build tools from the Python arena are SCons and Waf.
I guess I should have added
I have found two Scala annotations.
1) The first one is @switch:
http://www.scala-lang.org/api/current/scala/annotation/switch.html
Currently this D2 code compiles:
void main() {
int x = 2;
int y = 2;
switch(x) {
case 1: break;
case y: break;
default:
}
On 27-05-2012 15:13, bearophile wrote:
I have found two Scala annotations.
1) The first one is @switch:
http://www.scala-lang.org/api/current/scala/annotation/switch.html
Currently this D2 code compiles:
void main() {
int x = 2;
int y = 2;
switch(x) {
case 1: break;
case y: break;
default:
}
On 27.05.2012 17:13, bearophile wrote:
I have found two Scala annotations.
1) The first one is @switch:
http://www.scala-lang.org/api/current/scala/annotation/switch.html
Currently this D2 code compiles:
void main() {
int x = 2;
int y = 2;
switch(x) {
case 1: break;
case y: break;
default:
}
Alex Rønne Petersen:
1) Any half-decent compiler *will* optimize this thanks to a
wide array of standard dataflow analyses.
'y' was meant to be a value unknown at compile-time.
I don't know from where people got this crazy idea that a
switch statement MUST compile to a jump table *no
27.05.2012 15:40, Pieter De Bruyne написал:
This would mean that all that data is in memory at runtime i guess ? ...
And if so is there a way to avoid this...
I frequently use a audiovisual slideshow program called mobjects. It
can compile your slideshow to an executable (often larger thn
27.05.2012 15:40, Pieter De Bruyne написал:
This would mean that all that data is in memory at runtime i guess ? ...
And if so is there a way to avoid this...
It can compile your slideshow to an executable (often larger thn 1GiB)
By the way, dmd takes 14 s with full load of one CPU core to
Generally a parser generated by other tool and accepting tokens returns
the abstract syntax tree, but it return the evaluated value in the example.
In other words, it does lexical analysis, parsing and (type) converting at
a time.
If you want simply abstract syntax tree, it may be a little
I would like the parser to effect some side effects. For this purpose, I
tried including the parser mixin into a class, but I got a strange error
saying:
Error: need 'this' to access member parse
Ok. I see my folly. At compile time, there would not be any this since
the class has not been
On Saturday, 26 May 2012 at 22:04:34 UTC, Martin Nowak wrote:
On Sat, 26 May 2012 03:35:13 +0200, Walter Bright
newshou...@digitalmars.com wrote:
On 5/25/2012 1:32 AM, Martin Nowak wrote:
Anyone want to implement such? It ought to be fairly
straightforward, and will
be a nice timesaver for
In some code I have created a small bug that can be reduced to
something like this, that the D compiler has not caught at
compile-time:
enum E1 { A, B }
enum E2 { C, D }
void main() {
E1[2] a;
with (E2)
assert(a[0] == D);
}
Why isn't D able to statically tell when you
I'm not sure I follow all the details of what Andrei's suggesting
and what's being talked about here, this parser/lexer stuff is
still very new to me, so this may be a bit off-topic. However, I
thought I'd weigh in on something I was very impressed with about
the Nimrod language's direct AST
On 5/27/2012 9:56 AM, Denis Shelomovskij wrote:
By the way, dmd takes 14 s with full load of one CPU core to include 40 MiB file
as a string import on my PC so you will have to wait a lot if you wish to
include ~1 GiB.
This should be a bug report in Bugzilla.
On Thursday, 1 March 2012 at 15:10:36 UTC, Philippe Sigaud wrote:
mixin(Grammar!(Doc - Node*
Node - OpeningTag (Text / Node)* ClosingTag, NodeAction,
OpeningTag - '' Identifier '', OpeningAction,
ClosingTag - `/` Identifier '', ClosingAction,
Text - (!(OpeningTag / ClosingTag) _)+));
That
On Saturday, 26 May 2012 at 15:56:38 UTC, Chang Long wrote:
CTFE execute will be very useful on web develop, for example It
is very hard to create a CTFE version template engine with rich
feature. But we can use execute call to transe template file to
d code string, then mixed it to
On Monday, 28 May 2012 at 05:33:28 UTC, Mehrdad wrote:
The *real* question is, why don't you need the E2 qualifier
when you say D?
well never mind, I need sleep... I didn't see you were using
'with'.
The *real* question is, why don't you need the E2 qualifier
when you say D?
28.05.2012 0:19, Walter Bright написал:
On 5/27/2012 9:56 AM, Denis Shelomovskij wrote:
By the way, dmd takes 14 s with full load of one CPU core to include
40 MiB file
as a string import on my PC so you will have to wait a lot if you wish to
include ~1 GiB.
This should be a bug report in
Curiously I'm making a huffman compression algo for fun, however
I didn't see anything in std.array or anywhere that was to
support bools specifically (in a packed form anyways). So I'm
making one. So far I've got it saving the data as uint, 0 refers
to the most significant bit and 7 the
On 27-05-2012 08:50, Era Scarecrow wrote:
Curiously I'm making a huffman compression algo for fun, however I
didn't see anything in std.array or anywhere that was to support bools
specifically (in a packed form anyways). So I'm making one. So far I've
got it saving the data as uint, 0 refers to
On Sunday, 27 May 2012 at 06:58:21 UTC, Era Scarecrow wrote:
On Sunday, 27 May 2012 at 06:53:33 UTC, Alex Rønne Petersen
wrote:
std.bitmanip.BitArray.
And I was certain I checked std.bitmanip. Oh well, I'll throw
my current unittests at it and perhaps improve what's already
avaliable if it
On 27-05-2012 08:58, Era Scarecrow wrote:
On Sunday, 27 May 2012 at 06:53:33 UTC, Alex Rønne Petersen wrote:
std.bitmanip.BitArray.
And I was certain I checked std.bitmanip. Oh well, I'll throw my current
unittests at it and perhaps improve what's already avaliable if it needs
it.
It could
On Sunday, 27 May 2012 at 07:04:36 UTC, Alex Rønne Petersen
wrote:
It could definitely use some improvement. In particular:
* It still uses the deprecated operator overload methods,
rather than opBinary(Right) and opUnary.
* It's not quite const/immutable-friendly.
* It forces the GC on you.
Era Scarecrow:
I'll go over it and see what I can do.
Take also a look in Bugzilla, there are few small enhancement
requests about BitArray (like a fast population count method).
Bye,
bearophile
On Friday, 25 May 2012 at 20:55:12 UTC, Donald Duvall wrote:
On Friday, 25 May 2012 at 20:50:25 UTC, Donald Duvall wrote:
On Wednesday, 23 May 2012 at 19:24:53 UTC, Jarl André wrote:
On Wednesday, 23 May 2012 at 13:39:09 UTC, Jarl André wrote:
On Saturday, 19 May 2012 at 20:33:49 UTC, Nathan
That seems like a good approach, since then you're not marking things as const
in D that C would consider mutable and therefore be likely to be altered,
breaking D's guarantees. It does make me think that it could be valuable to
include a comment with the original declaration though (at least
Sorry for the typo: I do NOT understand it completely.
Thanks for the feedback! Well, for me I am a Java enterprise
developer working with Java on Unix, but, I have worked with
.NET in the past giving me a tiny portion of mercy to those
that enjoys Visual Studio :) Its actually a blazing
well, maybe, looking back at it, a range isn't the ideal way to go
about generating primes easily. I'm going to implement the sieve of
Atkin and make it return an array of primes up to a given number. This
might be a bit more useful and fast.
Is there somewhere I can catch up on ctfe? after
On 5/27/12, Ali Çehreli acehr...@yahoo.com wrote:
On 05/26/2012 05:13 PM, Ali Çehreli wrote:
once you define toHash(), you
must also define opCmp() and opEquals() that are all consistent with
each other.
Correction: opEquals() is only for potential optimizations. What is
needed
On 05/27/2012 01:18 PM, maarten van damme wrote:
well, maybe, looking back at it, a range isn't the ideal way to go
about generating primes easily. I'm going to implement the sieve of
Atkin and make it return an array of primes up to a given number. This
might be a bit more useful and fast.
Is
thank you :)
I wrote a sieve of aristotle because atkin's sieve needed waay to many
optimizations to beat aristotle's sieve by even a little bit so I
wanted to see if aristotle's was good enough.
I ran in two problems. It was extremely fast when sieving a byte array
of 1 million entries (without
I ran in two problems. It was extremely fast when sieving a
byte array
of 1 million entries (without optimizations at all) but when
trying
with 10_000_000 entries the program crashes before it even
starts to
execute (main isn't reached).
You say it does compile, but then crashes immediatly?
On Sunday, 27 May 2012 at 03:55:58 UTC, jerro wrote:
On Sunday, 27 May 2012 at 03:29:17 UTC, dnewbie wrote:
In C I can write
OPENFILENAME ofn;
ZeroMemory(ofn, sizeof(ofn));
In D, there is no ZeroMemory. Please help me.
You could use c memset:
import std.c.string;
memset(cast(void*)ofn, 0,
On 05/27/2012 04:22 AM, Andrej Mitrovic wrote:
On 5/27/12, Ali Çehreliacehr...@yahoo.com wrote:
On 05/26/2012 05:13 PM, Ali Çehreli wrote:
once you define toHash(), you
must also define opCmp() and opEquals() that are all consistent with
each other.
Correction: opEquals() is only
On 5/27/12, dnewbie r...@myopera.com wrote:
In C I can write
OPENFILENAME ofn;
ZeroMemory(ofn, sizeof(ofn));
In D, there is no ZeroMemory. Please help me.
I've never had to use this with WinAPI. The default .init value
usually works well, especially if the struct is well-defined, e.g.:
ok, can't seem to reproduce the crashing. now on to optimizing my
sieve a bit more ,9 miliseconds for 1_000_000 is still to slow.
--
Er is zon buiten. Zonnige zondag namiddag met priemgetallen in de
plaats van buiten zitten. Tss tss. :-)
hoe? wie? x)
On Sunday, 27 May 2012 at 06:53:33 UTC, Alex Rønne Petersen
wrote:
std.bitmanip.BitArray.
And also std.container.Array ... it has a specialization that
packs bools. It also appears to be more modern.
On Sunday, 27 May 2012 at 17:26:33 UTC, Chris Cain wrote:
And also std.container.Array ... it has a specialization that
packs bools. It also appears to be more modern.
Unfortunately I'm not following, either in the documentation or
glancing over the sources.
On Sunday, 27 May 2012 at 18:18:13 UTC, Era Scarecrow wrote:
On Sunday, 27 May 2012 at 17:26:33 UTC, Chris Cain wrote:
And also std.container.Array ... it has a specialization that
packs bools. It also appears to be more modern.
Unfortunately I'm not following, either in the documentation
On Sunday, May 27, 2012 20:21:23 Era Scarecrow wrote:
On Sunday, 27 May 2012 at 18:18:13 UTC, Era Scarecrow wrote:
On Sunday, 27 May 2012 at 17:26:33 UTC, Chris Cain wrote:
And also std.container.Array ... it has a specialization that
packs bools. It also appears to be more modern.
On 22/05/2012 18:36, cal wrote:
snip
my build command 21 | head -n number of lines you want to see
Where my build command is your dmd/rdmd/build script command. There's probably
something similar you could use on Windows, I don't really know though.
By something similar do you mean a way of
On Sunday, 27 May 2012 at 18:31:53 UTC, Stewart Gordon wrote:
What version of Windows are you using?
Modern versions support 2 to redirect stderr to a file. But
2| doesn't seem to work correspondingly (at least under Vista,
don't know about Win7) - by the looks of it it just passes 2 as
an
On Sunday, 27 May 2012 at 17:00:01 UTC, maarten van damme wrote:
ok, can't seem to reproduce the crashing. now on to optimizing
my
sieve a bit more ,9 miliseconds for 1_000_000 is still to slow.
--
Er is zon buiten. Zonnige zondag namiddag met priemgetallen in
de
plaats van buiten zitten. Tss
http://d.puremagic.com/issues/show_bug.cgi?id=1985
d...@dawgfoto.de changed:
What|Removed |Added
CC||d...@dawgfoto.de
http://d.puremagic.com/issues/show_bug.cgi?id=3536
--- Comment #10 from bearophile_h...@eml.cc 2012-05-27 05:44:10 PDT ---
Is it possible to close this bug now?
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
--- You are receiving this mail because: ---
http://d.puremagic.com/issues/show_bug.cgi?id=8154
Summary: Source fo error is hidden when using
default-parametrized tempalte-struct
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
http://d.puremagic.com/issues/show_bug.cgi?id=6921
bearophile_h...@eml.cc changed:
What|Removed |Added
CC||bearophile_h...@eml.cc
---
http://d.puremagic.com/issues/show_bug.cgi?id=8154
Dmitry Olshansky dmitry.o...@gmail.com changed:
What|Removed |Added
Keywords||diagnostic
http://d.puremagic.com/issues/show_bug.cgi?id=3536
Chad Joan chadj...@gmail.com changed:
What|Removed |Added
Status|NEW |RESOLVED
http://d.puremagic.com/issues/show_bug.cgi?id=4997
--- Comment #3 from bearophile_h...@eml.cc 2012-05-27 10:56:27 PDT ---
Two other useful properties are succ and pred, to be used similarly to:
enum MyEnum : ushort {
FOO = 10,
BAR = 20,
BAZ = 40,
SPAM = 30
}
static
http://d.puremagic.com/issues/show_bug.cgi?id=3536
Walter Bright bugzi...@digitalmars.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=8155
Summary: Deprecate std.range.lockstep
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
Severity: enhancement
Priority: P2
Component:
http://d.puremagic.com/issues/show_bug.cgi?id=6036
--- Comment #7 from bearophile_h...@eml.cc 2012-05-27 18:14:48 PDT ---
See also Issue 4678 and Issue 7210 and Issue 1840
This is a problem I hit often.
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
---
http://d.puremagic.com/issues/show_bug.cgi?id=7982
--- Comment #2 from github-bugzi...@puremagic.com 2012-05-27 19:50:06 PDT ---
Commits pushed to master at https://github.com/D-Programming-Language/phobos
http://d.puremagic.com/issues/show_bug.cgi?id=7824
--- Comment #2 from github-bugzi...@puremagic.com 2012-05-27 19:56:08 PDT ---
Commits pushed to master at https://github.com/D-Programming-Language/phobos
http://d.puremagic.com/issues/show_bug.cgi?id=8112
--- Comment #2 from github-bugzi...@puremagic.com 2012-05-27 20:35:14 PDT ---
Commits pushed to master at https://github.com/D-Programming-Language/phobos
http://d.puremagic.com/issues/show_bug.cgi?id=8156
Summary: Very slow compilation with string-imported file ~100
MiB
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
Keywords: performance
86 matches
Mail list logo
