On Thursday, 5 October 2017 at 17:49:00 UTC, Tristan B. Kildaire
wrote:
On 2017/10/05 18:21, Tristan B. Kildaire wrote:
On Thursday, 5 October 2017 at 16:00:52 UTC, Tristan B.
Kildaire wrote:
link to it somewhere.
Beware this is my first bigg-ish program in D. You will
probably laugh at some
On 2017/10/05 18:21, Tristan B. Kildaire wrote:
On Thursday, 5 October 2017 at 16:00:52 UTC, Tristan B. Kildaire wrote:
link to it somewhere.
Beware this is my first bigg-ish program in D. You will probably laugh
at some of the things I did.
Sadly it has nothing to do with Euclidean Geometr
On Thursday, 5 October 2017 at 16:00:52 UTC, Tristan B. Kildaire
wrote:
link to it somewhere.
Beware this is my first bigg-ish program in D. You will
probably laugh at some of the things I did.
Sadly it has nothing to do with Euclidean Geometry (maybe next
time!).
Will post a link as soo
On 2017/09/30 17:17, fichtknick wrote:
Hello all
only for learning purposes and my interest for deeper network
programming. I wanted to write a program and filter the entire traffic
in my network. I have a server and various computers in my network, but
I dont know, as I in D the promiscous m
On 2017/09/30 17:17, fichtknick wrote:
Hello all
only for learning purposes and my interest for deeper network
programming. I wanted to write a program and filter the entire traffic
in my network. I have a server and various computers in my network, but
I dont know, as I in D the promiscous m
On 2017/09/30 17:17, fichtknick wrote:
Hello all
only for learning purposes and my interest for deeper network
programming. I wanted to write a program and filter the entire traffic
in my network. I have a server and various computers in my network, but
I dont know, as I in D the promiscous m
So I really felt like doing something in D today and decided to write a
database engine. I am still working on the scheme/protocol/format for
the database files (which is going well) (so far 111 lines of code in
the `database.d` module). Next will be to finish the Database class up
in said modu
On 2017/09/19 19:40, EntangledQuanta wrote:
writeln(x + ((_win[0] == '@') ? w/2 : 0));
writeln(x + (_win[0] == '@') ? w/2 : 0);
The first returns x + w/2 and the second returns w/2!
WTF!!! This stupid bug has caused me considerable waste of time. Thanks
Walter! I know you care so mu
On 2017/10/04 21:20, Jonathan M Davis wrote:
On Wednesday, October 04, 2017 17:26:36 ketmar via Digitalmars-d-learn
wrote:
Tristan B. Kildaire wrote:
Does this work?
btw. there is "D" newsgroup which you can use for testing your NNTP
client.
web interface: http://forum.dlang.org/group/D
NNTP
On Wednesday, 4 October 2017 at 14:26:36 UTC, ketmar wrote:
Tristan B. Kildaire wrote:
Does this work?
btw. there is "D" newsgroup which you can use for testing your
NNTP client.
web interface: http://forum.dlang.org/group/D
NNTP name: "D"
Ah okay. Thanks.
On 2017/10/03 08:54, eastanon wrote:
I have been reading the D forums for a while and following on its
amazing progress for a long time. Over time I have even written some
basic D programs for myself, nothing major or earth shuttering. I have
downloaded and read Ali's excellent book.
I would
On 2017/10/03 08:54, eastanon wrote:
I have been reading the D forums for a while and following on its
amazing progress for a long time. Over time I have even written some
basic D programs for myself, nothing major or earth shuttering. I have
downloaded and read Ali's excellent book.
I would
On 2017/10/04 16:20, Andrea Fontana wrote:
On Wednesday, 4 October 2017 at 14:18:52 UTC, Tristan B. Kildaire wrote:
Does this work?
No, I don't read you. Try again :)
Haha, thanks. :)
On Wednesday, 4 October 2017 at 14:18:52 UTC, Tristan B. Kildaire
wrote:
Does this work?
Sorry about this guys, just wanted to check out if NNTP access
worked on my side.
Won't happen again.
Does this work?
15 matches
Mail list logo
