On Monday, 15 June 2015 at 00:05:59 UTC, Manfred Nowak wrote:
With my favorite LALR-CompilerCompiler I analyzed the current D
grammar. After preliminary eliminating the RR-conflicts around
Isn't the parser LL(*) or something? You could try ANTLR which
generate LL(*) parsers.
On Sunday, 14 June 2015 at 17:23:56 UTC, ZombineDev wrote:
Today, as I was browsing around the C++ Programming pages on
wikibooks looking for inspiration, I noticed that the
comparison page between C++ and D was quite outdated:
https://en.wikibooks.org/w/index.php?title=C%2B%2B_Programming/Prog
On Sunday, 14 June 2015 at 19:02:59 UTC, weaselcat wrote:
after playing around with ddmd built with ldc, it's still a
solid 30-40% slower than current dmd(with optimization flags,
obv.)
How did you build it? This is especially important given that
DDMD straight from the repo does not build wi
With my favorite LALR-CompilerCompiler I analyzed the current D grammar.
After preliminary eliminating the RR-conflicts around 1800 states remained,
from which around 100 states are still contaminated with SR-conflicts.
Two possibilities:
1) Those ambiguities are not in DMD but introduced by exc
On Saturday, 6 June 2015 at 20:27:12 UTC, anonymous wrote:
The seemingly obvious thing to do: Pass the source files that
need rebuilding and the object files of other modules to one
dmd invocation.
I implemented this. Preliminary pull request:
https://github.com/D-Programming-Language/tools/pu
On Sunday, 14 June 2015 at 14:30:00 UTC, Andrei Alexandrescu
wrote:
Interesting. Do you have a repro for this? Thanks! -- Andrei
Not yet, but while looking for one I found that this code
triggers an assertion in Region.expand()
```
module test;
import std.experimental.allocator;
import std.s
On Sunday, 14 June 2015 at 21:31:53 UTC, anonymous wrote:
2. Then write similar code with hardware optimized BLAS and
benchmark where the overhead between pure C/LLVM and BLAS
calls balance out to even.
may there are more important / beneficial things to work on -
assuming total time of contrib
1. Create generalised (only type template and my be flags)
BLAS algorithms (probably slow) with CBLAS like API.
See [1] (the Matmul benchmark) Julia Native is probably backed
with Intel MKL or OpenBLAS. D version was optimized by Martin
Nowak [2] and is still _much_ slower.
2. Allow users to
I've started exploring the use of std.experimental.logger for my
std.database work. Presumably it would get in before
std.database.
What does "finalize reference counting" mean? (discussion
thread?) Is it about RefCounted? I'm using that extensively.
erik
On Friday, 12 June 2015 at 19:20:41 UTC, Jeremy Powers wrote:
On Thu, Jun 11, 2015 at 11:09 PM, Andrei Alexandrescu via
Digitalmars-d < digitalmars-d@puremagic.com> wrote:
Just ran into this with Phobos:
https://github.com/D-Programming-Language/phobos/pull/3403
If unittest-only artifacts
On Thursday, 11 June 2015 at 00:26:39 UTC, Mike wrote:
On Wednesday, 10 June 2015 at 10:06:19 UTC, Adrian Matoga wrote:
Generally, if we stick to the pay-as-you-go approach most
features of D runtime (even exceptions and RTTI) can be ported.
They will not imply any costs when not used, but will
I think the way is fix all memory operations which cause UB and
enable GC.
Another thing worth noting is that I believe Intel has put some
effort into next gen (?) LLVM/Clang for autovectorizing into
AVX2. It might be worth looking into as it uses a mask that
allows the CPU to skip computations that would lead to no change,
but I think it is only available on last gen
On Sunday, 14 June 2015 at 18:49:21 UTC, Ilya Yaroshenko wrote:
Yes, but it would be hard to create SIMD optimised version.
Then again clang is getting better at this stuff.
What do you think about this chain of steps?
1. Create generalised (only type template and my be flags) BLAS
algorith
On Sunday, 7 June 2015 at 10:03:06 UTC, Jonathan M Davis wrote:
On Sunday, 7 June 2015 at 08:59:46 UTC, Iain Buclaw wrote:
I wouldn't have thought that not moving to 2.067 would be a
hold-up (there
is nothing in that release that blocks building DDMD as it is
*now*).
The biggest problem is th
On Sunday, 14 June 2015 at 18:05:33 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 15:15:38 UTC, Ilya Yaroshenko wrote:
A naive basic matrix library is simple to write, I don't need
standard library support for that + I get it to work the way
I want by using SIMD registers directl
On Sunday, 14 June 2015 at 15:15:38 UTC, Ilya Yaroshenko wrote:
A naive basic matrix library is simple to write, I don't need
standard library support for that + I get it to work the way I
want by using SIMD registers directly... => I probably would
not use it if I could implement it in less
I'm trying to mod dmd, and I'm totally confused about what's goin on.
-some things are allocated with 'new' and some are allocated with
'mem.malloc'
-most things don't ever seem to be freed
-no RAII is used for cleanup
-no clear ownership of pointers
How does memory get cleaned up? Is it just
On Sunday, 14 June 2015 at 16:53:19 UTC, bitwise wrote:
It's not just about the code increase though. What if I need
AndroidOrWP8, and I also need Win32OrWin64? This can quickly
become a much larger pita.
Yes, I think this is related to person-specific experiences. Some
people insist on keepi
Today, as I was browsing around the C++ Programming pages on
wikibooks looking for inspiration, I noticed that the comparison
page between C++ and D was quite outdated:
https://en.wikibooks.org/w/index.php?title=C%2B%2B_Programming/Programming_Languages/Comparisons/D&oldid=2129832
So I decided
On Sun, 14 Jun 2015 12:52:47 -0400, ketmar wrote:
On Sun, 14 Jun 2015 12:37:18 -0400, bitwise wrote:
How does memory get cleaned up?
yes. by OS when process terminates.
http://www.drdobbs.com/cpp/increasing-compiler-speed-by-over-75/240158941
a small quote: "DMD does memory allocation in
On Sun, 14 Jun 2015 06:35:30 -0400, Joakim wrote:
Walter is coming from long experience with this,and even with my limited
experience with such logic, I'm grateful for it, as dealing with more
complex versions of such logic is a royal PITA.
He's an expert, no doubt, but I've learned not to
On Sun, 14 Jun 2015 09:36:17 -0400, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 13:02:03 UTC, Manfred Nowak wrote:
bitwise wrote:
for at least adding "||" so that code can be shared between platforms?
Sureley it is a pita to write:
version( iOS) version= iOS;
else version( And
On Sun, 14 Jun 2015 12:37:18 -0400, bitwise wrote:
> How does memory get cleaned up?
yes. by OS when process terminates.
http://www.drdobbs.com/cpp/increasing-compiler-speed-by-over-75/240158941
a small quote: "DMD does memory allocation in a bit of a sneaky way.
Since compilers are short-live
On Sunday, 14 June 2015 at 16:37:19 UTC, bitwise wrote:
I'm trying to mod dmd, and I'm totally confused about what's
goin on.
-some things are allocated with 'new' and some are allocated
with 'mem.malloc'
-most things don't ever seem to be freed
-no RAII is used for cleanup
-no clear ownershi
On Sun, 14 Jun 2015 10:26:25 -0400, Joakim wrote:
Walter explained his thinking behind this decision in five comments on
this PR:
Thanks for the link ;)
Bit
On Sun, 14 Jun 2015 11:26:21 +, Ola Fosheim Grøstad wrote:
> I'm sure Walter will be much more open to changes if there is a proven
> demand for it
only if he like it. or at least indifferent to it.
"This is true IF you are trying to use version blocks in the same way one
does in C. Howeve
On Sun, 14 Jun 2015 15:49:40 +, Ola Fosheim Grøstad wrote:
> On Sunday, 14 June 2015 at 15:46:39 UTC, ketmar wrote:
>> On Sun, 14 Jun 2015 11:26:21 +, Ola Fosheim Grøstad wrote:
>>
>>> I'm sure Walter will be much more open to changes if there is a proven
>>> demand for it
>>
>> only i
On Sunday, 14 June 2015 at 15:46:39 UTC, ketmar wrote:
On Sun, 14 Jun 2015 11:26:21 +, Ola Fosheim Grøstad wrote:
I'm sure Walter will be much more open to changes if there is
a proven
demand for it
only if he like it. or at least indifferent to it.
"This is true IF you are trying to u
p.s. sorry, "stylistically", of course. mea maxima culpa.
signature.asc
Description: PGP signature
On Sun, 14 Jun 2015 14:26:25 +, Joakim wrote:
> Walter explained his thinking behind this decision in five comments on
> this PR:
exactly what i told: "I don't like it, so abandon all hope".
signature.asc
Description: PGP signature
On Sunday, 14 June 2015 at 14:27:57 UTC, Andrei Alexandrescu
wrote:
On 6/14/15 5:42 AM, Frank Fuente wrote:
Any news of the release date for the video from DConf 2015?
Got word from Chuck that they've had an urgent project until
now. They're starting working on the videos this week and will
A naive basic matrix library is simple to write, I don't need
standard library support for that + I get it to work the way I
want by using SIMD registers directly... => I probably would
not use it if I could implement it in less than 10 hours.
A naive std.algorithm and std.range is easy to w
On Sunday, 14 June 2015 at 14:46:36 UTC, Ola Fosheim Grøstad
wrote:
Yes, C++ templates are a hard nut to crack, if D had added
excellent pattern matching to its meta programming repertoire
the I think this would be enough to put D in a different league.
https://github.com/solodon4/Mach7
On Sunday, 14 June 2015 at 12:06:03 UTC, weaselcat wrote:
not really surprising considering rust was rushed out the door,
there were no breaks on that hype train.
I dunno if it was rushed. They have slashed the feature set quite
a lot over the years. At some point it makes a lot of sense to
s
On Sunday, 14 June 2015 at 14:25:11 UTC, Ilya Yaroshenko wrote:
I am sorry for this trolling:
Lisp is the best abstraction, thought.
Even it if was, it does not provide the meta info and alignment
type constraints that makes it possible to hardware/SIMD optimize
it behind the scenes.
For ex
On 6/13/15 11:49 PM, Dicebot wrote:
On Sunday, 14 June 2015 at 00:24:51 UTC, Andrei Alexandrescu wrote:
So we have:
* 1 request to change names;
* 3 requests to wank around the directory structure;
* 0 of everything else.
Sigh.
That is to be expected and intended for formal Phobos review.
Im
On 6/14/15 4:00 AM, Brian Schott wrote:
On Sunday, 14 June 2015 at 00:24:51 UTC, Andrei Alexandrescu wrote:
So we have:
* 1 request to change names;
* 3 requests to wank around the directory structure;
* 0 of everything else.
Sigh.
Andrei
How about this:
AllocatorList.allocate() calls All
On Sunday, 14 June 2015 at 11:03:49 UTC, ketmar wrote:
On Sun, 14 Jun 2015 10:35:30 +, Joakim wrote:
It does require more definitions, but it's worth it. A simple
example
like yours may seem excusable, but there's no way to limit
such logic to
just simple instances. Walter is coming from
On 6/14/15 5:42 AM, Frank Fuente wrote:
Any news of the release date for the video from DConf 2015?
Got word from Chuck that they've had an urgent project until now.
They're starting working on the videos this week and will make them
available one by one as each is ready. -- Andrei
On Sunday, 14 June 2015 at 14:02:59 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 13:48:23 UTC, Ilya Yaroshenko wrote:
Alignment, strides (windows on a stream - I understand it like
Sliding Windows) are not a problem.
It isn't a problem if you use the best possible abstraction
fr
On Sunday, 14 June 2015 at 13:48:23 UTC, Ilya Yaroshenko wrote:
Alignment, strides (windows on a stream - I understand it like
Sliding Windows) are not a problem.
It isn't a problem if you use the best possible abstraction from
the start. It is a problem if you don't focus on it from the
star
On Sunday, 14 June 2015 at 12:52:52 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 12:18:39 UTC, Ilya Yaroshenko wrote:
std.range has a lot of types + D arrays.
The power in unified API (structural type system).
Yeah, I agree that templates in C++/D more or less makes those
type s
On Sunday, 14 June 2015 at 13:02:03 UTC, Manfred Nowak wrote:
bitwise wrote:
for at least adding "||" so that code can be shared between
platforms?
Sureley it is a pita to write:
version( iOS) version= iOS;
else version( Android) version= Android;
else version= neither;
version( neither) ver
On 6/14/15 1:58 AM, weaselcat wrote:
On Sunday, 14 June 2015 at 08:52:26 UTC, Dicebot wrote:
On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
Yes, and it's an obvious issue. Some of the most frequently requested
things are real tuple syntax, pattern matching, etc. Short of getting
th
bitwise wrote:
> for at least adding "||" so that code can be shared between platforms?
Sureley it is a pita to write:
version( iOS) version= iOS;
else version( Android) version= Android;
else version= neither;
version( neither) version= neither;
else version=iOSorAndroid;
version( iOSorAndroid
On Sunday, 14 June 2015 at 12:18:39 UTC, Ilya Yaroshenko wrote:
std.range has a lot of types + D arrays.
The power in unified API (structural type system).
Yeah, I agree that templates in C++/D more or less makes those
type systems structural-like, even though C is using nominal
typing.
I'v
Hi,
Any news of the release date for the video from DConf 2015?
On Sunday, 14 June 2015 at 11:36:59 UTC, Paulo Pinto wrote:
On Sunday, 14 June 2015 at 11:03:00 UTC, Marc Schütz wrote:
As for arbitrary pointer arithmetic being allowed, I guess
that's because the language doesn't distinguish between GC and
non-GC pointers. And note that it is un-@safe anyway.
On Sunday, 14 June 2015 at 12:01:47 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 11:43:46 UTC, Ilya Yaroshenko wrote:
I am really don't understand what you mean with "generic"
keyword.
Do you want one matrix type that includes all cases???
I hope you does not.
Yes, that is what
On Sunday, 14 June 2015 at 11:33:52 UTC, Paulo Pinto wrote:
On Sunday, 14 June 2015 at 11:26:23 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 11:05:36 UTC, ketmar wrote:
p.s. i.e. it boils down to simple thing: Walter don't like
it. period.
any rationalizing of that is pointless.
On Sunday, 14 June 2015 at 11:43:46 UTC, Ilya Yaroshenko wrote:
I am really don't understand what you mean with "generic"
keyword.
Do you want one matrix type that includes all cases???
I hope you does not.
Yes, that is what generic programming is about. The type should
signify the semantics
On Sunday, 14 June 2015 at 11:36:59 UTC, Paulo Pinto wrote:
On Sunday, 14 June 2015 at 11:03:00 UTC, Marc Schütz wrote:
On Saturday, 13 June 2015 at 22:07:26 UTC, deadalnix wrote:
On Saturday, 13 June 2015 at 11:32:20 UTC, rsw0x wrote:
http://dlang.org/garbage.html
Do not take advantage of al
On Sunday, 14 June 2015 at 11:57:35 UTC, rsw0x wrote:
On Sunday, 14 June 2015 at 11:36:59 UTC, Paulo Pinto wrote:
On Sunday, 14 June 2015 at 11:03:00 UTC, Marc Schütz wrote:
On Saturday, 13 June 2015 at 22:07:26 UTC, deadalnix wrote:
On Saturday, 13 June 2015 at 11:32:20 UTC, rsw0x wrote:
htt
On Sunday, 14 June 2015 at 10:43:24 UTC, Ola Fosheim Grøstad
wrote:
I think there might be a disconnection in this thread. D only,
or D frontend?
There are hardware vendor and commercial libraries that are
heavily optimized for particular hardware configurations. There
is no way a D-only solu
On Sunday, 14 June 2015 at 10:15:08 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 09:59:22 UTC, Ilya Yaroshenko wrote:
We need D own BLAS implementation to do it.
Why can't you use "version" for those that want to use a BLAS
library for the implementation?
Those who want replic
On Sunday, 14 June 2015 at 11:33:52 UTC, Paulo Pinto wrote:
Not all of them
http://www.reddit.com/r/rust/comments/39f2t7/planned_breaking_change_in_rust_11/
AFAIK in the discussions it becomes clear that just about
everyone want the change, but some want the change to be saved
for 2.0 out o
On Sunday, 14 June 2015 at 11:03:00 UTC, Marc Schütz wrote:
On Saturday, 13 June 2015 at 22:07:26 UTC, deadalnix wrote:
On Saturday, 13 June 2015 at 11:32:20 UTC, rsw0x wrote:
http://dlang.org/garbage.html
Do not take advantage of alignment of pointers to store bit
flags in the low order bits
On Sunday, 14 June 2015 at 11:26:23 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 11:05:36 UTC, ketmar wrote:
p.s. i.e. it boils down to simple thing: Walter don't like it.
period.
any rationalizing of that is pointless.
The most sensible thing to do with all these may/may not be
On Sunday, 14 June 2015 at 11:05:36 UTC, ketmar wrote:
p.s. i.e. it boils down to simple thing: Walter don't like it.
period.
any rationalizing of that is pointless.
The most sensible thing to do with all these may/may not be an
improvement and also the break/don't break my code issues is to
On Saturday, 13 June 2015 at 17:33:06 UTC, Andrei Alexandrescu
wrote:
On 6/13/15 9:22 AM, weaselcat wrote:
"proper" reference counting would be trivial to implement with
a real
macro system.
The true Scotsman, eh :o). Well we don't have a real macro
system. -- Andrei
At the risk of soundin
On Sun, 14 Jun 2015 10:46:27 +, weaselcat wrote:
> On Sunday, 14 June 2015 at 10:16:18 UTC, ketmar wrote:
>> On Sun, 14 Jun 2015 08:58:12 +, weaselcat wrote:
>>
>>> On Sunday, 14 June 2015 at 08:52:26 UTC, Dicebot wrote:
On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
p.s. i.e. it boils down to simple thing: Walter don't like it. period.
any rationalizing of that is pointless.
signature.asc
Description: PGP signature
On Saturday, 13 June 2015 at 22:07:26 UTC, deadalnix wrote:
On Saturday, 13 June 2015 at 11:32:20 UTC, rsw0x wrote:
http://dlang.org/garbage.html
Do not take advantage of alignment of pointers to store bit
flags in the low order bits:
p = cast(void*)(cast(int)p | 1); // error: undefined beha
On Sun, 14 Jun 2015 10:35:30 +, Joakim wrote:
> It does require more definitions, but it's worth it. A simple example
> like yours may seem excusable, but there's no way to limit such logic to
> just simple instances. Walter is coming from long experience with this,
> and even with my limite
On Sunday, 14 June 2015 at 00:24:51 UTC, Andrei Alexandrescu
wrote:
So we have:
* 1 request to change names;
* 3 requests to wank around the directory structure;
* 0 of everything else.
Sigh.
Andrei
How about this:
AllocatorList.allocate() calls AllocatorList.owns(), but only if
you don't
On Sunday, 14 June 2015 at 10:16:18 UTC, ketmar wrote:
On Sun, 14 Jun 2015 08:58:12 +, weaselcat wrote:
On Sunday, 14 June 2015 at 08:52:26 UTC, Dicebot wrote:
On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
Yes, and it's an obvious issue. Some of the most frequently
requested
I think there might be a disconnection in this thread. D only, or
D frontend?
There are hardware vendor and commercial libraries that are
heavily optimized for particular hardware configurations. There
is no way a D-only solution can beat those. As an example Apple
provides various implementa
On Saturday, 13 June 2015 at 21:51:43 UTC, bitwise wrote:
On Sat, 13 Jun 2015 17:29:17 -0400, Xiaoxi
wrote:
On Saturday, 13 June 2015 at 21:19:28 UTC, bitwise wrote:
On Sat, 13 Jun 2015 17:16:04 -0400, weaselcat
wrote:>
iirc this falls under the "walter dislikes it so we won't
have it" cat
On Sunday, 14 June 2015 at 09:59:22 UTC, Ilya Yaroshenko wrote:
We need D own BLAS implementation to do it.
Why can't you use "version" for those that want to use a BLAS
library for the implementation?
Those who want replications of LAPACK/LINPACK APIs can use
separate bindings? And those w
On Sun, 14 Jun 2015 08:58:12 +, weaselcat wrote:
> On Sunday, 14 June 2015 at 08:52:26 UTC, Dicebot wrote:
>> On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
>>> Yes, and it's an obvious issue. Some of the most frequently requested
>>> things are real tuple syntax, pattern matching
On Sunday, 14 June 2015 at 09:25:25 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 09:19:19 UTC, Ilya Yaroshenko wrote:
The reason is general purpose matrixes allocated at heap, but
small graphic matrices are plain structs.
No, the reason is that LA-libraries are C-libraries that a
On 12/06/2015 10:37 PM, Nick Sabalausky wrote:
Yea, I'm fine with "ain't" being considered an actual word. Years ago, I
used to hear a lot of "'Ain't' isn't a real word", but meh, it's used as
a word, even the people who don't like it still know full-well exactly
what it means, so...I ain't got a
On 12/06/2015 12:48 PM, Chris wrote:
"man" is still used as a gender neutral pronoun in German, however, for
some reason it's frowned upon these days, just like "one" in English.
It's considered "arrogant" and old fashioned, but it's effin useful and
solves a lot of problems.
Mind you, decisions
On Sunday, 14 June 2015 at 09:19:19 UTC, Ilya Yaroshenko wrote:
The reason is general purpose matrixes allocated at heap, but
small graphic matrices are plain structs.
No, the reason is that LA-libraries are C-libraries that also
deal with variable sized matrices.
A good generic API can supp
On Sunday, 14 June 2015 at 09:07:19 UTC, Ola Fosheim Grøstad
wrote:
On Sunday, 14 June 2015 at 08:14:21 UTC, weaselcat wrote:
nobody uses general purpose linear matrix libraries for
games/graphics for a reason,
The reason is that C++ didn't provide anything. As a result
each framework provide
On 2015-06-14 02:24, Andrei Alexandrescu wrote:
* 1 request to change names;
* 3 requests to wank around the directory structure;
* 0 of everything else.
Sigh.
These are things that are easy to see right away, without looking deep
inside the code.
You can interpret this as:
1. Either your
On Sunday, 14 June 2015 at 08:14:21 UTC, weaselcat wrote:
nobody uses general purpose linear matrix libraries for
games/graphics for a reason,
The reason is that C++ didn't provide anything. As a result each
framework provide their own and you get N different libraries
that are incompatible.
On 2015-06-14 10:52, Dicebot wrote:
The fact that no one will implement custom pattern matching until it
comes into language officially is a Good Thing (TM).
I had plans to try and implement pattern matching as a library
component. Although, to do that properly I need better introspection for
On Sunday, 14 June 2015 at 08:52:26 UTC, Dicebot wrote:
On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
Yes, and it's an obvious issue. Some of the most frequently
requested things are real tuple syntax, pattern matching, etc.
Short of getting these into D itself(good luck,) any att
On Saturday, 13 June 2015 at 18:50:33 UTC, weaselcat wrote:
Yes, and it's an obvious issue. Some of the most frequently
requested things are real tuple syntax, pattern matching, etc.
Short of getting these into D itself(good luck,) any attempt at
these will end up being an ugly hack.
This is
On Sunday, 14 June 2015 at 08:36:16 UTC, extrawurst wrote:
On Friday, 12 June 2015 at 12:58:46 UTC, Robert burner Schadek
wrote:
std.(experimental.)logger has been in phobos for one release.
The idea was to mature stuff in experimental for one release
and then have a vote on inclusion into phob
On Friday, 12 June 2015 at 12:58:46 UTC, Robert burner Schadek
wrote:
std.(experimental.)logger has been in phobos for one release.
The idea was to mature stuff in experimental for one release
and then have a vote on inclusion into phobos as std.logger.
I would like to see this vote happen bef
https://issues.dlang.org/show_bug.cgi?id=14697
On Saturday, 13 June 2015 at 10:35:55 UTC, Tofu Ninja wrote:
On Saturday, 13 June 2015 at 08:45:20 UTC, John Colvin wrote:
The tiny subset of numerical linear algebra that is relevant
for graphics (mostly very basic operations, 2,3 or 4
dimensions) is not at all representative of the whole. The
On Sunday, 14 June 2015 at 02:56:04 UTC, jmh530 wrote:
On Saturday, 13 June 2015 at 11:18:54 UTC, Ola Fosheim Grøstad
wrote:
I think linear algebra should have the same syntax for small
and large matrices and switch representation behind the scenes.
Switching representations behind the scene
Thanks! Directly using opcodes does the trick.
87 matches
Mail list logo
