On Sunday, 10 August 2014 at 04:41:45 UTC, Puming wrote:
Photo processing app:
Disk space visualizer and redundancy searcher:
A tool for watching some folders and processing video files
there...
Interesting :-)
Unfortunately they are all windows only apps, I don't have a
windows machine.
Is the d compiler on the path?
Also, check the compiler settings for the d compiler and make sure that
the d compiler is the default compiler.
On 08/08/2014 11:15 AM, Borneq wrote:
I want use dmd compiler with COde:Blocks. IDE detect compiler but is
error "can't find compiler executable". I ha
Interesting :-)
Unfortunately they are all windows only apps, I don't have a
windows machine.
Can I link them on my bookmarks about D projects?
https://github.com/zhaopuming/awesome-d
On Saturday, 9 August 2014 at 17:14:39 UTC, thedeemon wrote:
On Saturday, 9 August 2014 at 00:34:43 UTC, P
On Saturday, 9 August 2014 at 15:19:35 UTC, ketmar via
Digitalmars-d-learn wrote:
On Sat, 09 Aug 2014 00:34:42 +
Puming via Digitalmars-d-learn
wrote:
yes, there is. all of ours apps are done with D and GtkD now.
alas,
it's in-house, but alot of people using them. ;-)
Can you give me
On Saturday, 9 August 2014 at 21:46:45 UTC, Peter Alexander wrote:
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate
applications like browser!
Rust was designed to build Servo
On Saturday, 9 August 2014 at 20:32:05 UTC, Vlad Levenfeld wrote:
Are there any specific cases where they're not?
Not that I know of, and it doesn't really make sense for them not
to be, but it could happen. If you want to be certain that
slicing a type will produce a valid range, you can do
On Saturday, 9 August 2014 at 09:52:02 UTC, Messenger wrote:
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate applications
like browser!
Rust was designed to build Servo. The people building Servo are
the people building Rust. With all
On Sat, Aug 09, 2014 at 08:43:32PM +, Remi Thebault via Digitalmars-d-learn
wrote:
> Hello D-community
>
> Sorry to dig an old post, but I have the exact same need.
> I have C++ background and I started to use D a few days ago only
> (a pity I didn't start sooner!)
>
> My needs are mostly ar
Hello D-community
Sorry to dig an old post, but I have the exact same need.
I have C++ background and I started to use D a few days ago only
(a pity I didn't start sooner!)
My needs are mostly around numerical calculations. I have a safe
and efficient matrix type in C++ that I am porting to D.
On Saturday, 9 August 2014 at 19:26:46 UTC, Meta wrote:
(which is why z[] gives you a type of (int, int, int) instead
of Tuple!(int, int, int)).
That makes sense, and on second thought it wouldn't make sense to
use a tuple as a range because it's not guaranteed to have only
one element type.
On Saturday, 9 August 2014 at 16:39:34 UTC, Vlad Levenfeld wrote:
I may be misunderstanding the intended semantics of the []
operator but I've come to interpret x[] to mean "give me x as a
range" and this is the meaning I intend when I overload it in
my own structs.
But -
auto z = tuple (1,1
On Saturday, 9 August 2014 at 17:14:39 UTC, thedeemon wrote:
We've got some.
Photo processing app:
http://www.infognition.com/blogsort/
Disk space visualizer and redundancy searcher:
http://www.infognition.com/undup/
A tool for watching some folders and processing video files
there:
http://w
Found this:
https://github.com/alvatar/snippets/blob/086f1714927df1338ac36b3633a3a91034a8347c/d/scrapple/bevutils/ServiceBase.d
Will be exploring it to see if I can make it work.
On Saturday, 9 August 2014 at 05:08:40 UTC, Tyler Jensen wrote:
I am very interested to find a good example for D2
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate applications
like browser!
Heh, Rust was initially created exactly to create a browser.
Servo project is its main driver and p
I may be misunderstanding the intended semantics of the []
operator but I've come to interpret x[] to mean "give me x as a
range" and this is the meaning I intend when I overload it in my
own structs.
But -
auto z = tuple (1,1,1);
pragma (msg, typeof(z)); // Tuple!(int, int, int)
pragma (msg,
On Saturday, 9 August 2014 at 07:07:42 UTC, Rikki Cattermole
wrote:
Cannot reproduce on either 2.065 or git head (according to
dpaste).
You are right. I had the functions in a unittest block that got
executed more than once so the second execution was a
redefinition. Thanks for taking the
On Saturday, 9 August 2014 at 05:42:09 UTC, H. S. Teoh via
Digitalmars-d-learn wrote:
Why would having opDispatch actually generate compile errors
cause
problems for __traits(compiles,...)? __traits(compiles...)
already works
fine with a whole bunch of other non-compiling stuff (by
gagging erro
On Sat, 09 Aug 2014 00:34:42 +
Puming via Digitalmars-d-learn
wrote:
yes, there is. all of ours apps are done with D and GtkD now. alas,
it's in-house, but alot of people using them. ;-)
signature.asc
Description: PGP signature
On Saturday, 9 August 2014 at 10:36:55 UTC, Artur Skawina via
Digitalmars-d-learn wrote:
On 08/09/14 03:20, Vlad Levenfeld via Digitalmars-d-learn wrote:
More opDispatch woes. This feature keeps biting me, yet I keep
trying to use it.
This time I'm trying to access elements of a vector GLSL-st
On Sat, 09 Aug 2014 09:08:14 +
via Digitalmars-d-learn wrote:
> really must use an integral type instead of a pointer, use
> `size_t`, which is defined to have the same size as a pointer.
ptr_t or uptr_t ;-) that is the reason why the std.string.indexOf()
using ptrdiff_t, for example.
sign
https://bitbucket.org/nriddick/phaser
So I made this thing for cross-thread data sharing/passing. It
has the functionality I wanted out of it. Here's the gist of how
I use it:
auto phaser = new Phaser!(type,power2_number);
foreach(i;0..threads) {
spawn(&pull_function, phaser.subscribe
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed
On 08/09/2014 01:43 PM, Gary Willoughby wrote:
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
Where is this implemented?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/util/hash.d
--
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
Where is this implemented?
On 08/09/14 03:20, Vlad Levenfeld via Digitalmars-d-learn wrote:
> More opDispatch woes. This feature keeps biting me, yet I keep trying to use
> it.
>
> This time I'm trying to access elements of a vector GLSL-style (without
> swizzling... for now).
>
> Here's the relevant code:
>
> struct Ve
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
The source is here:
https://github.com/D-Programm
On Saturday, 9 August 2014 at 09:33:12 UTC, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/aaA.d
I think it uses the object
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we
have to
use with(Fo
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we
have to
use with(Fo
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we have
to
use with(Foo){...} ?
It would be more in line with how other scope definiti
On Friday, 8 August 2014 at 18:51:49 UTC, ketmar wrote:
Why are void pointers better than ulong, if I may ask
there is at least one reason: GC. yes, it is conservative, but
there's no reason to scan ulong[] for any pointers, so you may
lost your objects if there is no other references to 'em.
On Friday, 8 August 2014 at 18:20:41 UTC, ketmar wrote:
yeah, chars (and bytes, and so on) are not aligned. i.e.
align(1) struct B {
int qtim;
int bid;
int ofr;
int bidsiz;
int ofrsiz;
short mode;
char ex;
byte mmid;
char z;
}
has sizeof == 25. not sure if specs mentions this,
On 9/08/2014 6:19 p.m., Paul D Anderson wrote:
When I try to compile these two functions, the second function is
flagged with an already defined error:
bool testRoundTrip(T, U)(T first, U second) if (isIntegral!T &&
isFloatingPoint!U)
{
return false;
}
bool testRoundTrip(U, T)(U first, T se
35 matches
Mail list logo
