Thanks for that! It'll need some digesting... but it's already giving me
some idea! :)
"Adam D. Ruppe" wrote in message news:it7rlo$2ql3$1...@digitalmars.com...
While my code is ugly as sin, it might be useful to look at the
prepareReflection function in my web.d
http://arsdnet.net/dcode/web
Andrej Mitrovic Wrote:
> I don't want to encourage newbies
> to use WinAPI threading functions
You shouldn't encourage newbies to use any system calls, not just winapi.
On Sun, 12 Jun 2011 02:47:01 -0400, XP1 wrote:
How do I truncate a file, delete bytes, or set the end of file from a
stream?
For example, what would be the easiest way to delete the last 4 bytes
from a file?
Anyone?
On Wed, 15 Jun 2011 13:30:25 -0400, XP1 wrote:
On Sun, 12 Jun 2011 02:47:01 -0400, XP1 wrote:
How do I truncate a file, delete bytes, or set the end of file from a
stream?
For example, what would be the easiest way to delete the last 4 bytes
from a file?
Anyone?
If you are on linu
Using 2.053 on win32 (XP), compiles and runs.
I've got a GUI (GtkD) and a game library (DAllegro5) going. But I'm
thinking a physics library would be wanted.
I had a go at making Blaze work with D2.0. I got it to compile and had
things fall down the screen with it, but the original it hasn't been
updated for 2 years, I think. Blaze is bas
Consider the following:
You have 10 million data points and you need to apply a multipass algorithm to
them. Each pass is like a cellular
automata: it can read from the previous pass but it doesn't know the "current"
values. This makes the actual
processing of each value trivially parallelizable
Hi, all. I'm implementing a little linked list that selection-sorts itself.
Basically, the sort code is:
swap this element with the minimum element in the list.
sort the rest of the list.
Obviously, one part of this is swapping elements. It seemed easiest to swap the
contents of two nodes, rathe
On 2011-06-15 16:57, Justin Whear wrote:
> Consider the following:
>
> You have 10 million data points and you need to apply a multipass algorithm
> to them. Each pass is like a cellular automata: it can read from the
> previous pass but it doesn't know the "current" values. This makes the
> actua
On 2011-06-15 17:38, Charles McAnany wrote:
> Hi, all. I'm implementing a little linked list that selection-sorts itself.
> Basically, the sort code is: swap this element with the minimum element in
> the list.
> sort the rest of the list.
>
> Obviously, one part of this is swapping elements. It s
On 6/15/2011 5:32 PM, Jos van Uden wrote:
Using 2.053 on win32 (XP), compiles and runs.
Ah! I found the problem. If you're using VisualD it compiles with the -g
flag (add symbolic debug info), which fails:
main.d(4): Error: Integer constant expression expected instead of "hello"
main.d(5): E
On 6/15/2011 10:11 PM, Johann MacDonagh wrote:
On 6/15/2011 5:32 PM, Jos van Uden wrote:
Using 2.053 on win32 (XP), compiles and runs.
Ah! I found the problem. If you're using VisualD it compiles with the -g
flag (add symbolic debug info), which fails:
main.d(4): Error: Integer constant expre
Ah, so does the compiler figure out which ones are strongly and weakly pure and
then optimize as
appropriate? Is there a way to indicate that a function is strongly pure?
Because it would seem odd
to call a function you thought was pure and wind up with a mutated argument.
-Charles
On 2011-06-15 20:29, Charles McAnany wrote:
> Ah, so does the compiler figure out which ones are strongly and weakly pure
> and then optimize as appropriate? Is there a way to indicate that a
> function is strongly pure? Because it would seem odd to call a function
> you thought was pure and wind u
Yes indeed, I'm using Visual D
Ho... good to know, thanks! :)
mm.. well hopefully it'll be fixed in the next release...
and I should pay a close look at the build script!
"Johann MacDonagh" wrote in message news:itbp22$28l2$1...@digitalmars.com...
On 6/15/2011 5:32 PM, Jos van Uden wrote:
15 matches
Mail list logo
