Vladimir Panteleev vladi...@thecybershadow.net wrote in message
news:op.vfvnf1bvtuz...@89-28-59-99.starnet.md...
On Thu, 15 Jul 2010 11:03:57 +0300, JimBob j...@bob.com wrote:
VirtualAlloc returns chunks that have 'dwAllocationGranularity'
granularity,
which is 64K on every Windows OS I've
Vladimir Panteleev wrote:
On Thu, 15 Jul 2010 11:03:57 +0300, JimBob j...@bob.com wrote:
VirtualAlloc returns chunks that have 'dwAllocationGranularity'
granularity,
which is 64K on every Windows OS I've used. So allocating a page, 4K,
will
actualy get you 64K.
So using VirtualAlloc as a
== Quote from Rainer Schuetze (r.sagita...@gmx.de)'s article
Vladimir Panteleev wrote:
On Thu, 15 Jul 2010 11:03:57 +0300, JimBob j...@bob.com wrote:
VirtualAlloc returns chunks that have 'dwAllocationGranularity'
granularity,
which is 64K on every Windows OS I've used. So allocating a
On Fri, 16 Jul 2010 01:58:27 +0300, dsimcha dsim...@yahoo.com wrote:
On the hardware end, 64-bit is now 6-7 years old, which has to be a
standard deviation or two older than the average age at which computers
get replaced.
FWIW, AFAIK data.d is 64-bit ready :D
--
Best regards,
Vladimir
On Fri, 16 Jul 2010 02:20:16 +0300, Vladimir Panteleev
vladi...@thecybershadow.net wrote:
Does this 2 or 3GB limitation only affect 32-bit operating systems? On
my 64-bit Windows, with /LARGEADDRESSAWARE, a simple program can do
close to 64K (65062 for me) 1-byte VirtualAllocs.
Said
On Fri, 16 Jul 2010 01:20:07 +0300, Rainer Schuetze r.sagita...@gmx.de
wrote:
There is only 2GB virtual memory available (3GB with some tweaks)
The allocation granularity doesn't affect virtual memory either (at least
according to all Process Explorer indications).
Does this 2 or 3GB
dsimcha dsim...@yahoo.com wrote in message
news:i1o3qj$13b...@digitalmars.com...
Yea, but I wonder how much longer it is going to be before 32-bit is dead
as a
dodo except on things like netbooks. Frankly, it's about time for it to
die,
because dealing w/ address space limitations when
On Fri, 16 Jul 2010 02:41:17 +0300, Nick Sabalausky a...@a.a wrote:
I have 1GB. (And I get by just fine.)
The discussion wasn't about physical memory, but address space. Due to the
discussed limitation, you won't be able to fill all of that 1 GB with
small VirtualAlloc'd objects because
Yea, but I wonder how much longer it is going to be before 32-bit is dead as a
dodo except on things like netbooks.
it consumes (leaves holes useable by others) to much memory because of
the allocation strategie - that is also a problem under 64bit
Andrei Alexandrescu Wrote:
And how would you use such a feature effectively? I've seen such
optional implementation policies in standards such as SQL
(compatibility levels) and C++ (export). They _always_ fare disastrously.
Just like we do it now: write code for the garbage collected
On Thu, 15 Jul 2010 04:00:49 +0300, Jonathan M Davis
jmdavisp...@gmail.com wrote:
Ideally, you'd want things to blow up when such an object was used, with
it clearly indicating that it was because you used an object which isn't
supposed to exist anymore.
I suggested this as well, by
Okay. I really don't know much about garbage collectors, how they work, or what
makes one particularly good or bad (other than the fact that it needs to be
efficient execution-wise and manage memory wisely so that you don't use too
much
of it or do anything else that would be an overall
On Thu, 15 Jul 2010 09:08:24 +0200, Vladimir Panteleev
vladi...@thecybershadow.net wrote:
On Thu, 15 Jul 2010 04:00:49 +0300, Jonathan M Davis
jmdavisp...@gmail.com wrote:
Ideally, you'd want things to blow up when such an object was used, with
it clearly indicating that it was because
On Thu, 15 Jul 2010 11:03:07 +0300, Rory McGuire rmcgu...@neonova.co.za
wrote:
On Thu, 15 Jul 2010 09:08:24 +0200, Vladimir Panteleev
vladi...@thecybershadow.net wrote:
On Thu, 15 Jul 2010 04:00:49 +0300, Jonathan M Davis
jmdavisp...@gmail.com wrote:
Ideally, you'd want things to blow
On Thu, 15 Jul 2010 10:18:38 +0300, Jonathan M Davis
jmdavisp...@gmail.com wrote:
Okay. I really don't know much about garbage collectors, how they work,
or what makes one particularly good or bad (other than the fact that it
needs to be efficient execution-wise and manage memory wisely so
dsimcha wrote:
== Quote from Don (nos...@nospam.com)'s article
[snip]
Thanks, that's definitely a bug. The code in core.cpuid has not been
tested on the most recent CPUs (Intel added a totally new method) and
their documentation is quite convoluted. It's hard to get it right
without an actual
On 14 July 2010 14:28, bearophile bearophileh...@lycos.com wrote:
(...)
P 10:
In this line of code:
while (!input.empty) {
There is not so much need of using an external function plus a negation:
while (input.length) {
(...)
I like writing:
while (!input.empty) {
To me, it better shows
I hope Andrei appreciated my efforts :-)
- The non-alphabetical index page 439 is a good idea.
- The page thickness is OK for me.
More comments on Chapter 1:
Page 17: using null to represent empty arrays is not good. In D there is []
that's better for this.
P 18: foo in
Once property syntax is fully enforced (not necessarily recommended) will it
be possible to overload properties against non-properties? My use case is
that I'm thinking about API improvements for my dflplot lib and one thing that
I would really like is to give a fluent interface to everything to
On Thu, 15 Jul 2010 12:13:27 +0200, Tim Verweij wrote:
On 14 July 2010 14:28, bearophile bearophileh...@lycos.com wrote:
(...)
P 10:
In this line of code:
while (!input.empty) {
There is not so much need of using an external function plus a
negation: while (input.length) {
(...)
I
On Thu, 15 Jul 2010 09:16:47 -0400, dsimcha dsim...@yahoo.com wrote:
Once property syntax is fully enforced (not necessarily recommended)
will it
be possible to overload properties against non-properties? My use case
is
that I'm thinking about API improvements for my dflplot lib and one
Jonathan M Davis, el 15 de julio a las 00:18 me escribiste:
Okay. I really don't know much about garbage collectors, how they work, or
what
makes one particularly good or bad (other than the fact that it needs to be
efficient execution-wise and manage memory wisely so that you don't use too
Thu, 15 Jul 2010 07:51:55 -0400, bearophile wrote:
P 61: this is so hard to read that I don't want to see anything similar
even in small script-like programs. The D compiler can even disallow
such long chains: int c = (a = b, b = 7, 8);
I suppose this mostly explains why the real tuples
== Quote from Don (nos...@nospam.com)'s article
dsimcha wrote:
== Quote from Don (nos...@nospam.com)'s article
[snip]
Thanks, that's definitely a bug. The code in core.cpuid has not been
tested on the most recent CPUs (Intel added a totally new method) and
their documentation is quite
== Quote from Max Samukha (spam...@d-coding.com)'s article
Not that I fiercely disagree but ideally I'd want it to be obliterated
to an invalid but easily recognizable state. It might help to discover
dangling pointer errors early. Otherwise, leaving a destroyed object in
a perfectly valid
On 15.07.2010 15:16, dsimcha wrote:
Once property syntax is fully enforced (not necessarily recommended) will it
be possible to overload properties against non-properties? My use case is
that I'm thinking about API improvements for my dflplot lib and one thing that
I would really like is to
On Thu, 15 Jul 2010 04:28:43 -0400, Vladimir Panteleev
vladi...@thecybershadow.net wrote:
On Thu, 15 Jul 2010 10:18:38 +0300, Jonathan M Davis
jmdavisp...@gmail.com wrote:
Okay. I really don't know much about garbage collectors, how they work,
or what makes one particularly good or bad
== Quote from torhu (n...@spam.invalid)'s article
In case the answer is no, that example of yours is the perfect
opportunity to dust off the almost-forgotten with statement :)
with (Histogram(someData, 10)) {
barColor = getColor(255, 0, 0);
histType = HistType.Probability;
== Quote from Don (nos...@nospam.com)'s article
dsimcha wrote:
== Quote from Don (nos...@nospam.com)'s article
dsimcha wrote:
== Quote from Don (nos...@nospam.com)'s article
[snip]
Thanks, that's definitely a bug. The code in core.cpuid has not been
tested on the most recent CPUs
On 12 July 2010 21:28, bearophile bearophileh...@lycos.com wrote:
Andrei Alexandrescu:
sort is all but deprecated, since std.algorithm.sort exists.
reverse could even more easily be implemented as a library function
than
sort, it should be removed as well.
On 07/15/2010 09:10 AM, retard wrote:
Thu, 15 Jul 2010 07:51:55 -0400, bearophile wrote:
P 61: this is so hard to read that I don't want to see anything similar
even in small script-like programs. The D compiler can even disallow
such long chains: int c = (a = b, b = 7, 8);
I suppose this
Hi folks,
When porting some D1 code to D2, i had the idea to add an alternative
syntax of deprecated:
deprecated ( string )
where string is any valid string or char.
The sense of this would be 'deprecated by', so the compiler should then
output xy is deprecated by ... instead of xy is
On 07/14/2010 07:28 AM, bearophile wrote:
I have finally received my copy of The D Programming Language :-)
This is a first post of notes that I am writing while I read this
text for the first time.
Thanks. Though the effort is definitely to be appreciated, there is a
high risk that such long
On Jul 16, 10 01:18, Mafi wrote:
Hi folks,
When porting some D1 code to D2, i had the idea to add an alternative
syntax of deprecated:
deprecated ( string )
where string is any valid string or char.
The sense of this would be 'deprecated by', so the compiler should then
output xy is deprecated
As a side note, why is there both a std.cpuid and a core.cpuid?
Does std use core? In that case, why not import std.cpuid?
Philippe Sigaud wrote:
As a side note, why is there both a std.cpuid and a core.cpuid?
Does std use core?
No.
In that case, why not import std.cpuid?
std.cpuid is deprecated.
If I had to chose one topic with most bitchin' on this newsgroup I have
impression it would be the one about GC. They usually goes from 'GC managed
programs are slow, D ain't good enough', to 'language X has better GC than D',
to ' GC that D has is bad at Z'.
Why not make D summer of code -
dsimcha wrote:
Here's the error message I'm getting. I know basically nothing about make
except
that it's a build system and that it almost never works, so I can't even begin
to
debug this. Here's the error message I've been getting, on a freshly unpacked
2.047 directory on some ancient
Anyway, I'm here bitching myself :) Just want to say that idea to have more
than one GC type to chose when compiling would be very interesting thing, if
single implementation can't be good for all cases.
If I had to chose one topic with most bitchin' on this newsgroup I have
impression it
== Quote from Walter Bright (newshou...@digitalmars.com)'s article
And here's the error I get when I try on a different machine w/ a more
modern
distro (this one is probably due to lack of 64 bit libs):
$ make -flinux.mak
make --no-print-directory -f linux.mak OS=posix BUILD=release
== Quote from Bane (branimir.milosavlje...@gmail.com)'s article
Anyway, I'm here bitching myself :) Just want to say that idea to have more
than
one GC type to chose when compiling would be very interesting thing, if single
implementation can't be good for all cases.
If I had to chose one
As a practical habit, once I stumble upon a very tricky error, I usually
share the valuable knowledge of when you do this ... and get that ...
it's probably because ...
Damn, sometimes they can even become cool quizzes...
So to warn those oblivious to the dangers of opDispatch, here is my the
On Thu, 15 Jul 2010 15:34:23 -0400, Dmitry Olshansky
dmitry.o...@gmail.com wrote:
As a practical habit, once I stumble upon a very tricky error, I usually
share the valuable knowledge of when you do this ... and get that ...
it's probably because ...
Damn, sometimes they can even become
Walter Bright, el 15 de julio a las 11:40 me escribiste:
dsimcha wrote:
Here's the error message I'm getting. I know basically nothing about make
except
that it's a build system and that it almost never works, so I can't even
begin to
debug this. Here's the error message I've been
Bane, el 15 de julio a las 14:34 me escribiste:
If I had to chose one topic with most bitchin' on this newsgroup
I have impression it would be the one about GC. They usually goes from
'GC managed programs are slow, D ain't good enough', to 'language
X has better GC than D', to ' GC that D has
Weren't you leaving for good this list?
On Thu, 15 Jul 2010 09:10:03 -0500, retard r...@tard.com.invalid wrote:
Thu, 15 Jul 2010 07:51:55 -0400, bearophile wrote:
P 61: this is so hard to read that I don't want to see anything similar
even in small script-like programs. The D compiler can
On 15.07.2010 17:42, dsimcha wrote:
== Quote from torhu (n...@spam.invalid)'s article
In case the answer is no, that example of yours is the perfect
opportunity to dust off the almost-forgotten with statement :)
with (Histogram(someData, 10)) {
barColor = getColor(255, 0, 0);
dsimcha, el 15 de julio a las 19:23 me escribiste:
== Quote from Bane (branimir.milosavlje...@gmail.com)'s article
Anyway, I'm here bitching myself :) Just want to say that idea to have more
than
one GC type to chose when compiling would be very interesting thing, if single
implementation
== Quote from Leandro Lucarella (l...@llucax.com.ar)'s article
dsimcha, el 15 de julio a las 19:23 me escribiste:
== Quote from Bane (branimir.milosavlje...@gmail.com)'s article
Anyway, I'm here bitching myself :) Just want to say that idea to have
more than
one GC type to chose when
Walter Bright Wrote:
$ make -flinux.mak
make --no-print-directory -f OS=posix BUILD=release
make[1]: OS=posix: No such file or directory
make[1]: *** No rule to make target `OS=posix'. Stop.
make: *** [release] Error 2
The OS=posix sets the macro OS to the value posix, it does
Hello dsimcha,
Histogram(someData, 10)
.barColor(getColor(255, 0, 0))
.histType(HistType.Probability)
.toFigure.title(A Histogram)
.xLabel(Stuff).showAsMain();
With a little meta programming you might be able to make a type that generate
a fluent interface for any type. Using opDispatch you
Dmitry Olshansky dmitry.o...@gmail.com wrote in message
news:i1nns8$d4...@digitalmars.com...
The tricky part is that *any* class with unconstrained (or loosely
constrained) opDispatch is also a Range, and at least a bidirectional one,
since it provides all the primitives: front, popFront
On 07/14/2010 08:55 PM, dsimcha wrote:
== Quote from eris (jvbur...@gmail.com)'s article
This is a relatively difficult problem in general to do portably due to hardware
differences, topology differences, changes to hardware, OS variations. Even the
pthreads library doesn't reliably implement
On 16.07.2010 01:46, BCS wrote:
Hello dsimcha,
Histogram(someData, 10)
.barColor(getColor(255, 0, 0))
.histType(HistType.Probability)
.toFigure.title(A Histogram)
.xLabel(Stuff).showAsMain();
With a little meta programming you might be able to make a type that generate
a fluent
Georg Wrede wrote:
On 07/14/2010 08:55 PM, dsimcha wrote:
== Quote from eris (jvbur...@gmail.com)'s article
This is a relatively difficult problem in general to do portably due
to hardware
differences, topology differences, changes to hardware, OS
variations. Even the
pthreads library
I've refactored my dflplot lib to the point where the GUI-specific stuff is
well abstracted from the GUI-agnostic stuff in preparation for a port to a GUI
lib that supports rotated fonts, saving bitmaps, and/or *nix. The plan is to
support multiple GUI libs, including DFL (already working except
OK, only 98%
http://www.hulu.com/initial-d
--
... IXOYE
Hi,
does any know where to get style sheets for a2ps for D.
Many thanks,
Helmut.
On Wed, 14 Jul 2010 23:22:20 -0400, Heywood Floyd soul...@gmail.com
wrote:
Hi!
Breakfast toast: Is there any chance a) and b) below are identical in
what they do?
auto mutex = new Mutex();
auto cond = new Condition(mutex);
// a)
synchronized(mutex){
cond.wait();
}
// b)
On Wed, 14 Jul 2010 16:57:13 -0400, Heywood Floyd wrote:
Lars T. Kyllingstad Wrote:
But then arrays would be different from all other types! If you have
an array of 3 Ts, that is written T[3], regardless of what T is. Now
consider these two cases:
A. T is an int. Then T[3]
Jonathan M Davis:
[5](int) const a;
Go language uses something similar, and I find it a bit better than D syntax.
Bye,
bearophile
On Thu, 15 Jul 2010 00:22:34 +0200, Jonathan M Davis
jmdavisp...@gmail.com wrote:
I was wondering what the general consesus was (if there is one) on
whether it's
valuable to always put module declarations in each module.
Obviously, if you need the module to have a name other than the file
On 15.07.2010 21:59, Rory McGuire wrote:
From what I remember in TDPL:
Can be used to rename a module if you have it in a different directory
structure than how you use it. E.g. implementation and headers in
separate folders.
If you use *.di files (headers), you would normally just keep the
On Thu, 15 Jul 2010 23:08:07 +0200, torhu n...@spam.invalid wrote:
On 15.07.2010 21:59, Rory McGuire wrote:
From what I remember in TDPL:
Can be used to rename a module if you have it in a different directory
structure than how you use it. E.g. implementation and headers in
separate folders.
So having got a collectors' edition TDPL, I though I'd have a try at
writing some concurrent code. The idea was a worker thread(s) would do
some work and write the results to some immutable objects. These would
get passed to an indexer thread that would do neat stuff like indexing
the
On 02/07/10 15:18, Heywood Floyd wrote:
On Jul 2, 2010, at 15:34 , Steven Schveighoffer wrote:
On Fri, 02 Jul 2010 09:32:39 -0400, Steven Schveighofferschvei...@yahoo.com
wrote:
On Fri, 02 Jul 2010 09:24:20 -0400, Heywood Floydsoul...@gmail.com wrote:
Good day!
Consider
// - - - -
On Thursday, July 15, 2010 17:40:26 Gareth Charnock wrote:
So having got a collectors' edition TDPL, I though I'd have a try at
writing some concurrent code. The idea was a worker thread(s) would do
some work and write the results to some immutable objects. These would
get passed to an indexer
On 16/07/10 02:08, Jonathan M Davis wrote:
On Thursday, July 15, 2010 17:40:26 Gareth Charnock wrote:
So having got a collectors' edition TDPL, I though I'd have a try at
writing some concurrent code. The idea was a worker thread(s) would do
some work and write the results to some immutable
Jonathan M Davis:
It's not terribly pretty, but apparently no one could come up with a
satistfactory way of doing it in the language itself given the syntax for
references. So, Rebindable!(T) is the solution.
A helper function can help:
import std.stdio, std.typecons, std.traits;
template
== Quote from strtr (st...@sp.am)'s article
== Quote from bearophile (bearophileh...@lycos.com)'s article
strtr:
Not that the memory is really significant compared to the rest of my
program,
but I have a few fairly large arrays I use only in compile time and I was
wondering why dmd
Jonathan M Davis:
Personally, I'd advise you to just use dynamic arrays unless you do
some profiling and find that a static array is better in a particular case.
To program you need a less naive view. I sometimes start using dynamic arrays
everywhere because they are handy, then I profile code
strtr:
Too busy reading TDPL? ;)
I have not answered because my answer is not useful: I am sure that constant is
present in the binary, you probably need LDC with Link-Time Optimization
activated to remove them.
btw. how long until runtime mixins? :D
D compiler contains an interpreter.
On Thursday 15 July 2010 22:20:17 bearophile wrote:
Jonathan M Davis:
Personally, I'd advise you to just use dynamic arrays unless you do
some profiling and find that a static array is better in a particular
case.
To program you need a less naive view. I sometimes start using dynamic
http://d.puremagic.com/issues/show_bug.cgi?id=4106
Don clugd...@yahoo.com.au changed:
What|Removed |Added
Version|1.057 |D1
Summary|Error
http://d.puremagic.com/issues/show_bug.cgi?id=4463
Summary: double.init in associative array seems 0.0
Product: D
Version: D2
Platform: x86
OS/Version: Windows
Status: NEW
Severity: normal
Priority: P2
http://d.puremagic.com/issues/show_bug.cgi?id=4464
Summary: std.range.take does not always return Take!R
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
Severity: normal
Priority: P2
http://d.puremagic.com/issues/show_bug.cgi?id=4412
--- Comment #11 from Steven Schveighoffer schvei...@yahoo.com 2010-07-15
07:22:10 PDT ---
The output from comment 5 looks like this:
3
1.75
1.875
1.9375
1.96875
1.98438
1.99219
1.99609
1.99023
1.50001
1.47222
1.45
1.43015
1.41
1.40007
1.38002
http://d.puremagic.com/issues/show_bug.cgi?id=4466
Summary: std.conv: parse!(T,S)(S, uint radix) the opposite of
to to!(T,S)(S, uint radix)
Product: D
Version: D2
Platform: Other
OS/Version: All
Status: NEW
http://d.puremagic.com/issues/show_bug.cgi?id=4466
--- Comment #1 from Lionello Lunesu lio+bugzi...@lunesu.com 2010-07-15
07:46:57 PDT ---
Created an attachment (id=691)
patch to std.conv, adds parse!(T,S)(S, uint radix)
--
Configure issuemail:
http://d.puremagic.com/issues/show_bug.cgi?id=4466
Lionello Lunesu lio+bugzi...@lunesu.com changed:
What|Removed |Added
AssignedTo|nob...@puremagic.com
http://d.puremagic.com/issues/show_bug.cgi?id=4465
Lars T. Kyllingstad bugzi...@kyllingen.net changed:
What|Removed |Added
Summary|ICE: assigning power to |ICE:
http://d.puremagic.com/issues/show_bug.cgi?id=4450
Andrei Alexandrescu and...@metalanguage.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=3560
Don clugd...@yahoo.com.au changed:
What|Removed |Added
Keywords||patch
--- Comment #4 from
http://d.puremagic.com/issues/show_bug.cgi?id=4467
Summary: type deduction fails when combining array() and uniq()
Product: D
Version: D2
Platform: x86
OS/Version: Windows
Status: NEW
Keywords: rejects-valid
http://d.puremagic.com/issues/show_bug.cgi?id=4264
--- Comment #1 from bearophile_h...@eml.cc 2010-07-15 16:24:16 PDT ---
Another case, I don't know the cause of the problem:
import std.algorithm, std.conv, std.range;
void main() {
auto r1 = map!(to!(int, string))(iota(20));
}
dmd
http://d.puremagic.com/issues/show_bug.cgi?id=4468
Summary: std.string.join() for lazy iterable of strings
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
Severity: enhancement
Priority: P2
http://d.puremagic.com/issues/show_bug.cgi?id=4363
yebblies yebbl...@gmail.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=4467
yebblies yebbl...@gmail.com changed:
What|Removed |Added
Status|NEW |RESOLVED
88 matches
Mail list logo
