l containers.
I implemented some of the intrusive containers back in D1 times.
See
http://dsource.org/projects/nova/browser/trunk/nova/ds/intrusive
KlausO
Am 13.11.2013 02:21, schrieb Andrei Alexandrescu:
On 11/12/13 5:10 PM, Vladimir Panteleev wrote:
* Pointers and class references: size_t.max - 65_535, i.e. 64K below
the upper memory limit. On all systems I know it can be safely assumed
that that area will cause GPF when accessed.
Make that va
Am 26.07.2012 19:15, schrieb Simon:
On 26/07/2012 09:16, Russel Winder wrote:
On Wed, 2012-07-25 at 23:17 +0200, Kagamin wrote:
On Wednesday, 25 July 2012 at 18:50:51 UTC, Simon wrote:
You have to be very, very careful with trying to do multi
threading w/ windoze windows. Try doing a google se
or" },
{ "ALLOCATION_ERROR" , "allocation error" },
{ "INTEGER_EXPECTED" , "integer expected" },
];
mixin(generate_enum("ErrorType", ErrorList));
void main()
{
writefln(ErrorType.ALLOCATION_ERROR, " : ",
ErrorTypeToStr
s, it's called Medibuntu
http://www.medibuntu.org/
KlausO
also an advanced version of sleepy called verysleepy :-)
(http://www.codersnotes.com/sleepy) and a commercial profiler called
LTProf (http://www.lw-tech.com) using the same technique.
KlausO
bearophile wrote:
KlausO, I like limited forms of pattern matching, I have asked for them in D in
the past; they also fit with the growing functional nature of D2.
But I've seen the pattern matching you can see for example in Scala adds lot of
complexity to the compiler (and some t
KlausO schrieb:
The Scala implementation has already influenced the F# team to create the
"Active Patterns" extension [6].
Sorry, this is not correct, they worked at the same time on this and
may have influenced each other, see
http://blogs.msdn.com/dsyme/archive/2006/08/16/ActivePat
t; extension [6].
Will we see this feature in D one day in the (hopefully near) future ?
Thank you for your comments
KlausO
[1] http://memphis.compilertools.net/
[2] http://www.cs.cornell.edu/Projects/jmatch/
[3] http://lamp.epfl.ch/%7Eemir/written/patmattrans.pdf
[4] http://library.epfl.ch/theses/?n
