Cristi Cobzarenco wrote:
Unfortunately, my proposal was not picked up this year. I might try to work
on these ideas this summer anyway so I would still be very much interested
in ideas and feedback, but I will probably have much less time if I'll be
working somewhere else.
I'm less familiar
On 24 April 2012 08:32, Jens Mueller jens.k.muel...@gmx.de wrote:
Cristi Cobzarenco wrote:
Unfortunately, my proposal was not picked up this year. I might try to
work
on these ideas this summer anyway so I would still be very much
interested
in ideas and feedback, but I will probably
Cristi Cobzarenco wrote:
On 24 April 2012 08:32, Jens Mueller jens.k.muel...@gmx.de wrote:
Cristi Cobzarenco wrote:
Unfortunately, my proposal was not picked up this year. I might try to
work
on these ideas this summer anyway so I would still be very much
interested
in ideas and
Unfortunately, my proposal was not picked up this year. I might try to work
on these ideas this summer anyway so I would still be very much interested
in ideas and feedback, but I will probably have much less time if I'll be
working somewhere else.
---
Cristi Cobzarenco
BSc in Artificial
On 04/10/2012 03:24 AM, Cristi Cobzarenco wrote:
Thanks for the suggestions!
I don't think UFCS would help us. Our problem is that we can't do this:
triangular.d:
struct TriangularMatrix {
}
void sum( T )( T x ) if( is( T : TriangularMatrix ) ) {
}
diagonal.d:
struct
Timon is, of course, right. I got a bit confused when trying to simplify in
a hurry. What I meant was actually something like this:
ops.d:
import std.stdio;
int sum( T )( T mat ){
writeln(ops.sum);
// return reduce!a+b( 0, mat );
return 1;
}
int numelems( T )( T mat ) {
// return mat.rows *
Hi, Cristi,
From change log of D 2.059. I saw that uniform function call syntax
was implemented. I hope you can leverage this feature to make non
member function calls look nicer. Another suggestion, please use
shorter function name for example M.t() instead of M.transpose() so
that long
Thanks for the suggestions!
I don't think UFCS would help us. Our problem is that we can't do this:
triangular.d:
struct TriangularMatrix {
}
void sum( T )( T x ) if( is( T : TriangularMatrix ) ) {
}
diagonal.d:
struct DiagonalMatrix {
}
void sum( T )( T x ) if( is( T :
On Tue, Apr 3, 2012 at 6:20 AM, Cristi Cobzarenco
cristi.cobzare...@gmail.com wrote:
The point of these is to have light-weight element wise operation support.
It's true that in theory the built-in arrays do this. However, this library
is built on top BLAS/LAPACK, which means operations on
On Sun, Apr 08, 2012 at 12:59:08PM -0500, Caligo wrote:
On Tue, Apr 3, 2012 at 6:20 AM, Cristi Cobzarenco
cristi.cobzare...@gmail.com wrote:
[...]
Also I'm not sure how a case like this will be compiled, it may or
may not allocate a temporary:
a[] = b[] * c[] + d[] * 2.0;
The
On 8 April 2012 18:59, Caligo iteronve...@gmail.com wrote:
On Tue, Apr 3, 2012 at 6:20 AM, Cristi Cobzarenco
cristi.cobzare...@gmail.com wrote:
The point of these is to have light-weight element wise operation
support.
It's true that in theory the built-in arrays do this. However, this
Thanks for the explanation, now I get it. In case you are interested,
there is excellent article about monad style c++ template meta
programming by Bartosz Milewski which might be helpful for compile
time optimization for evaluation order.
Really looking forward to official release of the SciD. D
For the Point 4, I really like to have high order functions like
reduceRow and reduceCol. then the function argument is simply the
reduceRow!foo(0,mat), here the foo is not a function operating on the
whole column but simply a function of two elements (e.g.
reduceRow!(a+b)(0,mat)). Or even better
Thanks for the feedback!
On 4 April 2012 10:21, Michael Chen sth4...@gmail.com wrote:
another btw, there is also another great c++ linear algebra library
besides Eigen: Amardillo which has very simple matlab like interface
and performs on a par with Eigen.
I'll look into it, thanks.
On
Hello everyone,
My name is Cristian Cobzarenco and last year, mentored by David Simcha
and co-mentored by Fawzi Mohamed and Andrei Alexandrescu, I worked on
a fork of SciD as part of Google's Summer of Code. While we've got a
lot done last summer there's still plenty to do and my proposal this
Sorry for the follow-up, I just wanted to mention that I also uploaded
the proposal on Melange at
http://www.google-melange.com/gsoc/proposal/review/google/gsoc2012/cristicbz/41002#,
but I still recommend reading it on github.
Thank you,
Cristian.
---
Cristi Cobzarenco
BSc in Artificial
16 matches
Mail list logo
