environment["PATH"] ~= r";D:\folder\"; // Error
In my machine the following D code compiled with release flag and
LDC performs over 230ms while the similar Go code performs under
120ms.
string smallestRepr(const string arg) {
import std.format : format;
const repeated = format!"%s%s"(arg, arg);
string result;
On Thursday, 12 March 2020 at 16:02:14 UTC, H. S. Teoh wrote:
On Thu, Mar 12, 2020 at 08:51:24AM +, mark via
Digitalmars-d-learn wrote: [...]
YYY: The range() method is clearly not good D style but I
don't know
how to support foreach (item; aaset) ...
The usual idiom is to overload .opSli
On Thursday, 12 March 2020 at 04:33:42 UTC, Noor Wachid wrote:
I usually go with SFML (C++) library to write simple
visualization. Is there any similiar library in D?
I use the arsd library for everything. It allows multimedia and
much more, it's light, fast, small and very easy to use since i
On Thu, Mar 12, 2020 at 08:51:24AM +, mark via Digitalmars-d-learn wrote:
[...]
> YYY: The range() method is clearly not good D style but I don't know
> how to support foreach (item; aaset) ...
The usual idiom is to overload .opSlice, then you can do:
foreach (item; aaset[]) { ... }
Just in case anyone would like to use it, I've put it on github
and also added it as a dub package.
https://code.dlang.org/packages/aaset
On Thursday, 12 March 2020 at 11:33:25 UTC, Simen Kjærås wrote:
[snip]
I'd suggest simply testing if an AA with that key type is valid:
struct AAset(T) if (is(int[T]))
That's very subtle, but it works.
As Ferhat points out, you could use opApply for this. There's
also the option of imple
On Thursday, 12 March 2020 at 08:51:24 UTC, mark wrote:
I use sets a lot and since I believe that D's rbtree is O(lg n)
for add/remove/in and that D's AA is O(1) for these, I want to
implement a set in terms of an AA.
Below is the code I've got so far. It allows for add and
remove. However, i
On Thursday, 12 March 2020 at 08:51:24 UTC, mark wrote:
I use sets a lot and since I believe that D's rbtree is O(lg n)
for add/remove/in and that D's AA is O(1) for these, I want to
implement a set in terms of an AA.
XXX: I need to use an if on the struct to restrict T to be a
type that supp
I use sets a lot and since I believe that D's rbtree is O(lg n)
for add/remove/in and that D's AA is O(1) for these, I want to
implement a set in terms of an AA.
Below is the code I've got so far. It allows for add and remove.
However, it has three problems (that I know of):
XXX: I need to u
On 3/12/20 7:33 AM, Noor Wachid wrote:
I usually go with SFML (C++) library to write simple visualization. Is
there any similiar library in D?
https://code.dlang.org/packages/dsfml
I want to ask if vibe.d support scss files. I could not get
vibe.d to work with scss files.
As usual, I will appreciate any help and early reply
12 matches
Mail list logo
