"Jason King" wrote in message news:kmupmtxrwlgzivuir...@forum.dlang.org...
If we can include newer windows system libs with DMD I'll be happy to
generate them. If copyrights prevent distributing new libs but we can
distribute the defs (so then all that's necessary is implib + the original
sy
On 2014-06-24 20:33, H. S. Teoh via Digitalmars-d wrote:
Once this goes in, ddoc anchors should be*much* saner. While I don't
have the confidence this is the last we'll hear of ddoc anchor issues, I
Well, that was quick!
I might contribute some documentation in phobos, there's obviously a
On Wednesday, 25 June 2014 at 00:50:48 UTC, Andrei Alexandrescu
wrote:
On 6/24/14, 4:41 PM, Xinok wrote:
On Tuesday, 24 June 2014 at 22:09:39 UTC, Andrei Alexandrescu
wrote:
On 6/24/14, 11:50 AM, Xinok wrote:
[snip]
See also https://issues.dlang.org/show_bug.cgi?id=12987.
Thanks! --
Andrei
On Wednesday, 25 June 2014 at 00:50:48 UTC, Andrei Alexandrescu
wrote:
On 6/24/14, 4:41 PM, Xinok wrote:
On Tuesday, 24 June 2014 at 22:09:39 UTC, Andrei Alexandrescu
wrote:
On 6/24/14, 11:50 AM, Xinok wrote:
[snip]
See also https://issues.dlang.org/show_bug.cgi?id=12987.
Thanks! --
Andrei
On 6/24/14, 4:41 PM, Xinok wrote:
On Tuesday, 24 June 2014 at 22:09:39 UTC, Andrei Alexandrescu wrote:
On 6/24/14, 11:50 AM, Xinok wrote:
[snip]
See also https://issues.dlang.org/show_bug.cgi?id=12987. Thanks! --
Andrei
Given that's a breaking change, I'd rather leave it open to discussion
fo
On Tue, Jun 24, 2014 at 10:23:45PM +0200, Jonathan M Davis via Digitalmars-d
wrote:
[...]
> > From: "H. S. Teoh via Digitalmars-d"
[...]
> > P.S. the problem with the table of contents links pointing to the
> > wrong place is a known bug:
> >
> > https://issues.dlang.org/show_bug.cgi?id=1157
On Tuesday, 24 June 2014 at 22:09:39 UTC, Andrei Alexandrescu
wrote:
On 6/24/14, 11:50 AM, Xinok wrote:
[snip]
See also https://issues.dlang.org/show_bug.cgi?id=12987.
Thanks! -- Andrei
Given that's a breaking change, I'd rather leave it open to
discussion for a while. It would be really bad
On 24.06.2014 21:32, Jacob Carlborg wrote:
Since we got UDA's that use the @attribute syntax, the idea of appending
an @ symbol in front of an attribute to avoid name collisions doesn't
work anymore.
From a user point of view, the attributes starting with an @ symbol are
just as much keywords a
On 6/24/14, 11:50 AM, Xinok wrote:
[snip]
See also https://issues.dlang.org/show_bug.cgi?id=12987. Thanks! -- Andrei
On 6/24/14, 12:39 PM, H. S. Teoh via Digitalmars-d wrote:
On Tue, Jun 24, 2014 at 12:36:12PM -0700, H. S. Teoh via Digitalmars-d wrote:
On Tue, Jun 24, 2014 at 02:07:20PM -0400, Etienne via Digitalmars-d wrote:
[...]
I think the documentation could use more code samples, and a smarter
table of
On 6/24/14, 10:07 AM, Etienne wrote:
On 2014-06-24 12:56 PM, H. S. Teoh via Digitalmars-d wrote:
On Tue, Jun 24, 2014 at 12:23:08PM -0400, Etienne via Digitalmars-d
wrote:
I'm currently brainstorming a persistent database scheme and it
surprised me that random-access reading/writing isn't imple
On 6/24/14, 11:50 AM, Xinok wrote:
From what I know of partitioning algorithms, they're either
intrinsically stable or intrinsically unstable. Implementing an
algorithm with the attribute you described would likely come with little
benefit. I could be wrong, but this is my intuition.
I'd say s
I have got the same error when using dmd to compile the program
"msmc" https://github.com/lepisorus/msmc.
Error:
Error: cannot find source code for runtime library file 'object.d'
dmd might not be correctly installed. Run 'dmd -man' for
installation instructions
Specify path to file 'object.d'
On Tuesday, 24 June 2014 at 19:56:14 UTC, H. S. Teoh via
Digitalmars-d wrote:
So D code is going to start looking like this now?!
if (myobj.elvis.subobj.memb.isAlive.or(false)) {
...
}
What about ifExists?
if (myObj.ifExists.subobj.member.isAlive.or(false))
{
On Tue, Jun 24, 2014 at 10:23:45PM +0200, Jonathan M Davis via Digitalmars-d
wrote:
> > From: "H. S. Teoh via Digitalmars-d"
[...]
> > P.S. the problem with the table of contents links pointing to the wrong
> > place is a known bug:
> >
> > https://issues.dlang.org/show_bug.cgi?id=11575
> >
On Wednesday, 18 June 2014 at 19:00:26 UTC, Andrei Alexandrescu
wrote:
A coworker brought this list to my attention:
https://xstackwiki.modelado.org/DSL%27s
The work on such DSLs (reminiscent of Don's work on optimizing
matrix operations years ago) seems be on the rise.
I didn't know most of
On 22 June 2014 09:52, Alix Pexton via Digitalmars-d
wrote:
> I feel that most of the new logos that have been proposed lately are too
> much of a departure from what we already have, so I'm throwing a few of my
> own designs into the ring.
>
> https://drive.google.com/file/d/0B3i8FWPuOpryQU9OQlMy
On 6/24/14, 4:43 PM, Jacob Carlborg wrote:
On 2014-06-24 18:52, Yota wrote:
On Sunday, 22 June 2014 at 08:15:45 UTC, Andrei Alexandrescu wrote:
On 6/21/14, 3:38 PM, H. S. Teoh via Digitalmars-d wrote:
On Sat, Jun 21, 2014 at 03:26:45PM -0700, Andrei Alexandrescu via
Digitalmars-d wrote:
On 6/
Le 24/06/2014 18:03, Alix Pexton a écrit :
On 22/06/2014 9:52 AM, Alix Pexton wrote:
I feel that most of the new logos that have been proposed lately are too
much of a departure from what we already have, so I'm throwing a few of
my own designs into the ring.
https://drive.google.com/file/d/0B3
> Sent: Tuesday, June 24, 2014 at 12:39 PM
> From: "H. S. Teoh via Digitalmars-d"
> To: digitalmars-d@puremagic.com
> Subject: Re: std.file read with start position
>
> P.S. the problem with the table of contents links pointing to the wrong
> place is a known bug:
>
> https://issues.dlang
On Tue, Jun 24, 2014 at 09:43:21PM +0200, Jacob Carlborg via Digitalmars-d
wrote:
> On 2014-06-24 18:52, Yota wrote:
> >On Sunday, 22 June 2014 at 08:15:45 UTC, Andrei Alexandrescu wrote:
> >>On 6/21/14, 3:38 PM, H. S. Teoh via Digitalmars-d wrote:
> >>>On Sat, Jun 21, 2014 at 03:26:45PM -0700, An
On 2014-06-24 18:52, Yota wrote:
On Sunday, 22 June 2014 at 08:15:45 UTC, Andrei Alexandrescu wrote:
On 6/21/14, 3:38 PM, H. S. Teoh via Digitalmars-d wrote:
On Sat, Jun 21, 2014 at 03:26:45PM -0700, Andrei Alexandrescu via
Digitalmars-d wrote:
On 6/19/14, 1:29 PM, Etienne wrote:
writeln(curr
On Tue, Jun 24, 2014 at 12:36:12PM -0700, H. S. Teoh via Digitalmars-d wrote:
> On Tue, Jun 24, 2014 at 02:07:20PM -0400, Etienne via Digitalmars-d wrote:
> [...]
> > I think the documentation could use more code samples, and a smarter
> > table of contents. e.g. http://dlang.org/phobos/std_stdio.h
On Tue, Jun 24, 2014 at 02:07:20PM -0400, Etienne via Digitalmars-d wrote:
[...]
> I think the documentation could use more code samples, and a smarter
> table of contents. e.g. http://dlang.org/phobos/std_stdio.html
> clicking on the "read" keyword redirects to... enum LockType.read
>
> There's n
On 2014-06-23 22:34, Jonathan M Davis via Digitalmars-d wrote:
It would be very cool if we could remove @ from all of the built-in
attributes, but the whole reason that they have them in the first place is
because it was decided that we didn't want to add new keywords - and that was
several year
On 6/23/2014 1:30 PM, Ali Çehreli wrote:
In C and C++, void* is for data pointers but it works (by accident?) for
function pointers on all popular platforms.
For 16 bit programs, function pointers can be different sizes from data
pointers. But D doesn't support 16 bit programming, and I know o
On Tuesday, 24 June 2014 at 16:03:26 UTC, Andrei Alexandrescu
wrote:
On 6/23/14, 3:47 PM, Xinok wrote:
I've managed to build a small laundry list the past couple
days, so why
not add another item? I've been tasked with implementing a
"deterministic topN", but I also noticed that topN is lacking
On 2014-06-24 1:46 PM, H. S. Teoh via Digitalmars-d wrote:
Easy:
auto f = File(myDataFile, "r");
f.seek(someOffset);
ubyte[] buf;
buf.length = sizeOfData;
ubyte[] dataRead = f.rawRead(buf);
if (dataRead.length != sizeOfData)
throw n
On Tue, 24 Jun 2014 12:55:09 -0400, H. S. Teoh via Digitalmars-d
wrote:
On Tue, Jun 24, 2014 at 11:36:26AM -0400, Steven Schveighoffer via
Digitalmars-d wrote:
On Tue, 24 Jun 2014 00:24:50 -0400, deadalnix
wrote:
[...]
>Anything that JIT is affected. Consider the pseudocode:
>
>void JIT
On Tue, Jun 24, 2014 at 01:07:42PM -0400, Etienne via Digitalmars-d wrote:
> On 2014-06-24 12:56 PM, H. S. Teoh via Digitalmars-d wrote:
> >On Tue, Jun 24, 2014 at 12:23:08PM -0400, Etienne via Digitalmars-d wrote:
> >>I'm currently brainstorming a persistent database scheme and it
> >>surprised me
On Monday, 23 June 2014 at 17:26:47 UTC, Andrei Alexandrescu
wrote:
Corollary: the default sorting algorithm in std will always be
unstable, even if for certain data types and inputs it will
produce stable sorting. -- Andrei
I'd also like to note that this whole discussion about
restrictions
On 2014-06-24 12:56 PM, H. S. Teoh via Digitalmars-d wrote:
On Tue, Jun 24, 2014 at 12:23:08PM -0400, Etienne via Digitalmars-d wrote:
I'm currently brainstorming a persistent database scheme and it
surprised me that random-access reading/writing isn't implemented in
std.file. With SSDs becoming
On Tuesday, 24 June 2014 at 16:37:06 UTC, Chris Cain wrote:
Of course, that's yet more playing around with restrictions.
Plus your proposed relaxed stable sort is also the same as
relaxed unstable sort so your restriction just made them
identically fast.
By "relaxed" here, I was thinking in t
On Tue, Jun 24, 2014 at 12:23:08PM -0400, Etienne via Digitalmars-d wrote:
> I'm currently brainstorming a persistent database scheme and it
> surprised me that random-access reading/writing isn't implemented in
> std.file. With SSDs becoming more commonplace, this practice is just
> fine. Any othe
On Tue, Jun 24, 2014 at 11:36:26AM -0400, Steven Schveighoffer via
Digitalmars-d wrote:
> On Tue, 24 Jun 2014 00:24:50 -0400, deadalnix wrote:
[...]
> >Anything that JIT is affected. Consider the pseudocode:
> >
> >void JIT() {
> > void* code = malloc(XXX);
> > // Write instructions into
On Sunday, 22 June 2014 at 08:15:45 UTC, Andrei Alexandrescu
wrote:
On 6/21/14, 3:38 PM, H. S. Teoh via Digitalmars-d wrote:
On Sat, Jun 21, 2014 at 03:26:45PM -0700, Andrei Alexandrescu
via Digitalmars-d wrote:
On 6/19/14, 1:29 PM, Etienne wrote:
writeln(currAssignment.safeDeref.typeInfo.iden
On Sunday, 22 June 2014 at 08:52:56 UTC, Alix Pexton wrote:
https://drive.google.com/file/d/0B3i8FWPuOpryQU9OQlMydXJmeTQ/edit
I like the ones with Mars and Phobos on the side the most, but I
feel like the top D is excessive and doesn't really communicate
anything.
Maybe something like that,
On Tuesday, 24 June 2014 at 09:22:24 UTC, Andrea Fontana wrote:
On Monday, 23 June 2014 at 16:33:13 UTC, Chris Cain wrote:
It's not really about the time complexity but the absolute
time it must take. But I showed the example that shows that
the fact that any stable sort must do extra work:
[
I'm currently brainstorming a persistent database scheme and it
surprised me that random-access reading/writing isn't implemented in
std.file. With SSDs becoming more commonplace, this practice is just
fine. Any other reason for this?
On 6/24/14, 9:03 AM, Alix Pexton wrote:
On 22/06/2014 9:52 AM, Alix Pexton wrote:
I feel that most of the new logos that have been proposed lately are too
much of a departure from what we already have, so I'm throwing a few of
my own designs into the ring.
https://drive.google.com/file/d/0B3i8F
On 6/23/14, 8:46 PM, Tofu Ninja wrote:
On Tuesday, 24 June 2014 at 03:29:52 UTC, H. S. Teoh via Digitalmars-d
wrote:
a compile-time DSL instead of hack tricks like expression
That sounds like a it will be very odd to use and most likely have very
little benefit. I think most people would agre
On 22/06/2014 9:52 AM, Alix Pexton wrote:
I feel that most of the new logos that have been proposed lately are too
much of a departure from what we already have, so I'm throwing a few of
my own designs into the ring.
https://drive.google.com/file/d/0B3i8FWPuOpryQU9OQlMydXJmeTQ/edit
https://drive
On Tuesday, 24 June 2014 at 12:46:10 UTC, AG wrote:
since D has Attribute lists e.g. @("string", 7, foo, bar)
make them work with build-in attributes or convert build-in
attributes to UDA's, then you can use them as single attributes
or with attribute lists
struct pure;
struct safe;
struct noth
On 6/23/14, 3:47 PM, Xinok wrote:
I've managed to build a small laundry list the past couple days, so why
not add another item? I've been tasked with implementing a
"deterministic topN", but I also noticed that topN is lacking a stable
implementation, so this seemed like an ideal opportunity to k
On Tue, 24 Jun 2014 00:24:50 -0400, deadalnix wrote:
On Tuesday, 24 June 2014 at 01:41:13 UTC, Steven Schveighoffer wrote:
This is because most CPUs consider the instructions as immutable.
Even x86 do not provide any guarantee (which makes it very hard
to swap implementation outside of a VM).
On Tuesday, 24 June 2014 at 09:34:44 UTC, seany wrote:
and could I as well write
class C2{
auto x
this(T)(T y)
{
this.x = y;
}
}
This would help me, for example, to use a single definition, to
cover, e.g. int and double, and not write them twice - as in
usual overload...
class C2(T)
On Tuesday, 24 June 2014 at 11:50:37 UTC, Xinok wrote:
On Tuesday, 24 June 2014 at 04:40:48 UTC, Peter Alexander wrote:
On Monday, 23 June 2014 at 22:47:20 UTC, Xinok wrote:
What do you all think? Do you agree with my definition of
stable topN? Do you know of a better algorithm/approach for
im
defs are not headers
You can compile them with dlltool or get precompiled import
libraries from mingw precompiled distribution.
Windows SDK EULA prohibits redistribution. You can get defs from
mingw project.
On Tuesday, 24 June 2014 at 13:55:27 UTC, Kagamin wrote:
Windows SDK EULA prohibits redistribution. You can get defs
from mingw project.
I know I can get headers, but headers aren't the problem. The
problem is that the libs already being distributed are woefully
out of date.
On Tuesday, 24 June 2014 at 09:31:08 UTC, seany wrote:
I recon, that D has the keyword "export", with which symbols
can be accessed accross different applications.
It declares symbols from dynamic library.
I just (with Rikki Catermolle's kind help) worked out a problem
who's genesis was an old version of oleaut32.lib in the dmd
directories. I wound up "creating" the missing entry via
coffimplib and the windows sdk. Were I less hard-headed that
would have stopped me in my tracks.
If we can inclu
since D has Attribute lists e.g. @("string", 7, foo, bar)
make them work with build-in attributes or convert build-in
attributes to UDA's, then you can use them as single attributes
or with attribute lists
struct pure;
struct safe;
struct nothrow;
...
@pure @safe @nothrow
or
@(pure, safe, nothr
On Tuesday, 24 June 2014 at 11:50:37 UTC, Xinok wrote:
On Tuesday, 24 June 2014 at 04:40:48 UTC, Peter Alexander wrote:
On Monday, 23 June 2014 at 22:47:20 UTC, Xinok wrote:
What do you all think? Do you agree with my definition of
stable topN? Do you know of a better algorithm/approach for
im
On Tuesday, 24 June 2014 at 04:40:48 UTC, Peter Alexander wrote:
On Monday, 23 June 2014 at 22:47:20 UTC, Xinok wrote:
What do you all think? Do you agree with my definition of
stable topN? Do you know of a better algorithm/approach for
implementing this function?
I agree with your definition
Shammah Chancellor:
Wouldn't that cause compiler errors that only happen depending
on what order you compile things?
If you refer to the first "solution", then the answer is yes. The
ability to catch bugs at compile-time is not fully deterministic,
it's a help for the programmer, but it's no
On 2014-06-23 13:13:37 +, bearophile said:
Daniel Murphy:
What happens when a function is called from different places with
values with different ranges? What about when it's called from another
compilation unit?
One solution is to ignore such cases, so that feature gives useful
resul
On Monday, 23 June 2014 at 18:09:46 UTC, Ilya Yaroshenko wrote:
Hello all!
very simple code:
--
double[] a, c;
...
c[] += a[];
--
The DMD version I can find in _arraySliceSliceAddass_d,
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/array
On Tuesday, 24 June 2014 at 07:01:14 UTC, Mason McGill wrote:
On Tuesday, 24 June 2014 at 04:36:04 UTC, ed wrote:
On Monday, 23 June 2014 at 21:08:03 UTC, Mason McGill wrote:
[snip]
Concepts:
InputGrid: anything with a size (size_t[n]) and n-dimensional
opIndex.
OutputGrid: anything with a si
Am 24.06.2014 11:34, schrieb seany:> Also, while we are at it,
>
> does d support declarations like:
>
> class C {
>
> public :
>
> int a;
> string b;
> double c;
>
> }
read the manual first http://dlang.org/class
> and could I as well write
>
> class C2{
>
> auto x
>
> this(T)(T y)
> {
> t
Thnak you, and what about the Export keywords?
seany:
does d support declarations like:
class C {
public :
int a;
string b;
double c;
}
Yes, that's possible.
and could I as well write
class C2{
auto x
this(T)(T y)
{
this.x = y;
}
}
This is not possible, and I see no plans in supporting that. You
have to use some workaround
Hello,
I am considering the follwoing:
I have a wide range of input filess formatted in various ways
(meteorological data, bathymetry data, geojson, rss warning about
meteorological events and so on). While I understand that perl is
the preffered language for processing formatted documents, I
Also, while we are at it,
does d support declarations like:
class C {
public :
int a;
string b;
double c;
}
etc? If not, could this be implemented in a future version? i.e.
are there ideas to do so? that would have been nice.
and could I as well write
class C2{
auto x
this(T)(T y)
{
Thank you.
On Monday, 23 June 2014 at 16:33:13 UTC, Chris Cain wrote:
It's not really about the time complexity but the absolute time
it must take. But I showed the example that shows that the fact
that any stable sort must do extra work:
[2,2,2,2,1]
[...]
I'm sorry if i'm going to say some stupid thin
David Bregman:
I think this approach would also be good for D, at least if the
idea is to target numeric computing people.
I am thinking about something slightly different, and with a
semantics more similar to that Haskell library. I don't think D
is going to compete with Julia and its high
David Bregman:
I didn't read the linked paper, but the performance quoted in
the abstract "comparable (from 48% to 100%) to that of
lower-level Java programs" sounds pretty underwhelming.
The design I've suggested is not that virtual/indirect, so the
performance is better.
Bye,
bearophile
On Tuesday, 24 June 2014 at 04:36:04 UTC, ed wrote:
On Monday, 23 June 2014 at 21:08:03 UTC, Mason McGill wrote:
[snip]
Concepts:
InputGrid: anything with a size (size_t[n]) and n-dimensional
opIndex.
OutputGrid: anything with a size (size_t[n]) and
n-dimensional opIndexAssign.
[snip]
Ch
70 matches
Mail list logo
