On 07/28/2016 12:38 AM, Dechcaudron wrote:
Giving my 20 votes to the issue (are votes even taken into account?). At
least now I know the source of attribute-enforcements breakdown is
basically delegate management. That should help me out enough so I don't
have this issue anymore.
Thanks a
On Wednesday, 27 July 2016 at 23:59:15 UTC, WhatMeWorry wrote:
I've been stumped for several days trying to resolve this run
time error. I'm pretty new with Linux. No problem on Windows.
DerelictFI.load("/home/generic/MySharedLibraries/libfreeimage.so");
before DerelictFI.load
I've been stumped for several days trying to resolve this run
time error. I'm pretty new with Linux. No problem on Windows.
DerelictFI.load("/home/generic/MySharedLibraries/libfreeimage.so");
before DerelictFI.load
Don't you just hate it when you google a problem and find a post
from yourself asking the same question?
In 2013 I ran into the UTF8 invalid char autodecode UTFException,
and the answer then was "use std.encoding.sanitize" and my
opinion looking at the implementation, was then, as is now...
On Wednesday, 27 July 2016 at 20:54:00 UTC, ag0aep6g wrote:
Looks pretty bad. There's an open issue on this:
https://issues.dlang.org/show_bug.cgi?id=16095
Giving my 20 votes to the issue (are votes even taken into
account?). At least now I know the source of
attribute-enforcements breakdown
On 07/27/2016 09:19 PM, Dechcaudron wrote:
struct Foo
{
[...]
void ping() shared
{
[...]
}
void fire()
{
spawn();
}
void explode() shared
{
ping();
}
}
void main()
{
auto a = Foo(1, 2);
a.fire();
thread_joinAll();
}
[...]
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
why it isn't the "big thing" already.
1. Less easy to explain
A big selling point is that D is good in all directions, and
stupidly easy to apply in many situations.
That is a lot harder to explain that a simple value proposal like
On Wednesday, 27 July 2016 at 16:26:47 UTC, Seb wrote:
My personal opinion is that the two biggest problems are
1) it has no unique selling point (USP):
I don't necessarily agree. I think that D's USPs as seen
externally are simplified and powerful metaprogramming abilities,
and being a
I keep getting data from within a struct shared across threads
for apparently no reason: the code is the following:
import std.stdio;
import std.concurrency;
import core.thread : Thread, thread_joinAll;
struct Foo
{
int a;
int b;
this(int a, int b)
{
this.a = a;
On 07/27/2016 06:46 AM, Rene Zwanenburg via Digitalmars-d-learn wrote:
On Wednesday, 27 July 2016 at 02:20:57 UTC, Charles Hixson wrote:
O, dear. It was sounding like such an excellent approach until this
last paragraph, but growing the file is going to be one of the common
operations.
On 07/27/2016 04:51 AM, drug wrote:
> I have the following:
>
> ```
> struct Foo
> {
> int[] i;
>
> this(int[] i)
> {
> this.i = i.dup;
> }
>
> ref Foo opAssign(ref const(this) other)
> {
> i = other.i.dup;
>
> return this;
> }
> }
You're
On 07/27/2016 08:42 AM, stunaep wrote:
On Wednesday, 27 July 2016 at 15:32:59 UTC, Meta wrote:
On Wednesday, 27 July 2016 at 13:59:54 UTC, stunaep wrote:
So how would I make a function that takes an enum and an id as a
parameter and returns a member in the enum? I tried for quite some
time to
On Wednesday, 27 July 2016 at 16:26:47 UTC, Seb wrote:
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
Hi guys,
I'm using D since a few month now and I was wondering why
people don't jump onto it that much and why it isn't the "big
thing" already.
Everybody is into javascript
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
Hi guys,
I'm using D since a few month now and I was wondering why
people don't jump onto it that much and why it isn't the "big
thing" already.
Everybody is into javascript nowadays, but IMO even for doing
web I found Vibe.d more
On Wednesday, 27 July 2016 at 14:56:13 UTC, Suliman wrote:
On Wednesday, 27 July 2016 at 12:47:14 UTC, chmike wrote:
On Wednesday, 27 July 2016 at 09:39:18 UTC, Suliman wrote:
clip
Sorry, its my issue I am thinging about polygons, but for me
would be enought points.
The problem is next. I
On Wednesday, 27 July 2016 at 15:32:59 UTC, Meta wrote:
On Wednesday, 27 July 2016 at 13:59:54 UTC, stunaep wrote:
So how would I make a function that takes an enum and an id as
a parameter and returns a member in the enum? I tried for
quite some time to do this but it wont let me pass Test as
On Wednesday, 27 July 2016 at 13:59:54 UTC, stunaep wrote:
So how would I make a function that takes an enum and an id as
a parameter and returns a member in the enum? I tried for quite
some time to do this but it wont let me pass Test as a
parameter unless I use templates. I finally came up
On Wednesday, 27 July 2016 at 12:47:14 UTC, chmike wrote:
On Wednesday, 27 July 2016 at 09:39:18 UTC, Suliman wrote:
...
Big thanks!
Ehm... Now I should add iteration on array of points in first
and second polygon? If it's not hard for you could you show
how it should look please.
Sorry, I
On Wednesday, 27 July 2016 at 10:17:57 UTC, NX wrote:
On Wednesday, 27 July 2016 at 09:28:49 UTC, chmike wrote:
4. Web server && IO performance (see:
https://www.techempower.com/benchmarks or
https://github.com/nanoant/WebFrameworkBenchmark).
Please, these are terribly outdated benchmarks.
On Wednesday, 20 July 2016 at 05:45:21 UTC, Jonathan M Davis
wrote:
On Wednesday, July 20, 2016 04:03:23 stunaep via
Digitalmars-d-learn wrote:
How can I search for an enum by its values? For example I have
>struct TestTraits {
>
> int value1;
> string value2;
>
>}
>
>enum Test : TestTraits {
On Thursday, 21 July 2016 at 19:54:34 UTC, Jonathan Marler wrote:
Is there a way to get the full path of the current source file?
Something like:
__FILE_FULL_PATH__
I'm asking because I'm rewriting a batch script in D, meant to
be ran with rdmd. However, the script needs to know it's own
On Wednesday, 27 July 2016 at 02:20:57 UTC, Charles Hixson wrote:
O, dear. It was sounding like such an excellent approach until
this
last paragraph, but growing the file is going to be one of the
common
operations. (Certainly at first.) (...)
So I'm probably better off sticking to using a
On Wednesday, 27 July 2016 at 09:39:18 UTC, Suliman wrote:
On Wednesday, 27 July 2016 at 08:40:15 UTC, chmike wrote:
The algorithm is to draw a horizontal (or vertical) half line
starting at your point and count the number of polygon edges
crossed by the line. If that number is even, the point
On Wednesday, 27 July 2016 at 09:39:18 UTC, Suliman wrote:
...
Big thanks!
Ehm... Now I should add iteration on array of points in first
and second polygon? If it's not hard for you could you show how
it should look please.
Sorry, I may have misunderstood the initial problem. You were
On Wednesday, 27 July 2016 at 11:11:56 UTC, llaine wrote:
On Wednesday, 27 July 2016 at 10:42:50 UTC, lkfsdg wrote:
Also I predict that the more it'll get popular the less it
will attract hobbyist. I did't realized at the beginning (I've
discovered D in 2012 then started to learn more
I have the following:
```
struct Foo
{
int[] i;
this(int[] i)
{
this.i = i.dup;
}
ref Foo opAssign(ref const(this) other)
{
i = other.i.dup;
return this;
}
}
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
Hi guys,
I'm using D since a few month now and I was wondering why
people don't jump onto it that much and why it isn't the "big
thing" already.
Because languages don't become big things. Good solutions to
particular problems become
On Wednesday, 27 July 2016 at 10:42:50 UTC, lkfsdg wrote:
Also I predict that the more it'll get popular the less it will
attract hobbyist. I did't realized at the beginning (I've
discovered D in 2012 then started to learn more seriously in
2014) but Alexandrescu clairly aims at a
On Wednesday, 27 July 2016 at 10:39:52 UTC, NX wrote:
Lack of production quality tools
like? no, "refactoring" and other crap is not "production quality
tools", they are only useful to pretend that you are doing
something useful, so you will look busy for your boss.
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
Hi guys,
I'm using D since a few month now and I was wondering why
people don't jump onto it that much and why it isn't the "big
thing" already.
Everybody is into javascript nowadays, but IMO even for doing
web I found Vibe.d more
Lack of production quality tools
Lack of good marketing
Lack of man power & corporate support
Lack of idiomatic D libraries
These are pretty much the core of all other negative
consequences. Ex: GDC is few versions behind DMD because lack of
man power.
If only we could break the vicious
On Wednesday, 27 July 2016 at 09:28:49 UTC, chmike wrote:
The reason I'm switching to Go is because
3. GC performance (no stop the world hiccups)
IIRC, there is a concurrent GC implementation used by sociomantic
but it's linux only. (It uses fork() sys call)
4. Web server && IO performance
On 07/26/2016 09:30 PM, ParticlePeter wrote:
So how can I achieve my goal the right way?
Here's one with CTFE:
void processMember(T, ignore...)()
{
import std.algorithm: canFind, filter;
import std.meta: aliasSeqOf;
enum selectedMembers = aliasSeqOf!(
On Wednesday, 27 July 2016 at 08:40:15 UTC, chmike wrote:
The algorithm is to draw a horizontal (or vertical) half line
starting at your point and count the number of polygon edges
crossed by the line. If that number is even, the point is
outside the polygon, if it's odd, the point is inside.
On Tuesday, 26 July 2016 at 15:11:00 UTC, llaine wrote:
Hi guys,
I'm using D since a few month now and I was wondering why
people don't jump onto it that much and why it isn't the "big
thing" already.
Everybody is into javascript nowadays, but IMO even for doing
web I found Vibe.d more
The algorithm is to draw a horizontal (or vertical) half line
starting at your point and count the number of polygon edges
crossed by the line. If that number is even, the point is outside
the polygon, if it's odd, the point is inside.
Let (x,y) be the point to test and (x1,y1)(x2,y2) the end
On Wednesday, 27 July 2016 at 00:52:30 UTC, Gorge Jingale wrote:
So, you can see D as a sort of dried up waste land desert with
a few nice palm trees growing here and there and a few
scorpions. C++, say, is a very lush forest with many tree
dwelling monkeys. Which environment would you rather
On Wednesday, 27 July 2016 at 00:52:30 UTC, Gorge Jingale wrote:
I think it is because D has some fundamental problems. It is a
risk to use software that is not proven to be safe, effective,
and easy to use. The fact there are so many bugs(and many are
big blockes) in D says something about
38 matches
Mail list logo
