Not a committer, just an interested observer, I got on this list because of
a PR I submitted to commons-math long ago, and have stayed on since.
There is a standard for commit messages I came across recently and which
our team is trying to apply to our own commit messages. Idea is to make
commit m
s well on contributing :)
> have a nice day!
> Simo
>
> http://people.apache.org/~simonetripodi/
> http://www.99soft.org/
>
>
>
> On Tue, Jun 7, 2011 at 11:21 PM, Sujit Pal wrote:
> > Not a committer nor a commons developer, but I've used neo4j in the past
> &g
Not a committer nor a commons developer, but I've used neo4j in the past
for this sort of thing. It provides a database backend and a few graph
algos to traverse the graph, and it works great. They also have a
community edition. Just pointing this out in case there is overlap.
On Tue, 2011-06-07 a
fwiw, this approach would be nicer... I frequently use ArrayUtils.toMap
to set maps with different key and value types statically from data.
-sujit
On Fri, 2010-08-06 at 18:44 -0400, James Carman wrote:
> For instance, this would work:
>
> Map map = toMap(new Object[][] {
> {"re
I am guessing methods such as StringUtils.trim() are included? If so, I
would like to say that a lot of times we use the StringUtils version
over the native String version because the StringUtils one is null-safe.
So taking these out would probably hurt users, at least until
null-safety (or NoneTyp
If OpenIntToDoubleHashMap returns NaN for non-existent keys, then the
Sparse Matrix could check for NaN to return 0 to its client.
-sujit
Phil Steitz wrote:
I am still working through this class and the sparse matrix class that
it was extracted from (thanks, Ismael and Sugit!), so I am not sur
FWIW, I like the calling pattern with the static DecompositionSolver
too...
RealVector solution =
DecompositionSolver.solve(constant, new QRDecompositionImpl(matrix));
-sujit
On Fri, 2008-12-05 at 10:37 +0100, [EMAIL PROTECTED] wrote:
> - "Phil Steitz" <[EMAIL PROTECTED]> a écrit :
>
Ok, thanks very much.
-sujit
On Wed, 2008-12-03 at 22:53 +0100, Luc Maisonobe wrote:
> Sujit Pal a écrit :
> > Thanks, added it to JIRA:
> > https://issues.apache.org/jira/browse/MATH-231
> >
> > Also, please let me know if you want me to go ahead and submit a patch
not. Not sure if I need to do anything here, if yes, please let me know.
-sujit
On Tue, 2008-12-02 at 23:02 +0100, Luc Maisonobe wrote:
> Sujit Pal a écrit :
> > I've updated MATH-230 with a fresh patch (this time against trunk, since
> > MATH_2_0 has been moved to trunk) putti
I've updated MATH-230 with a fresh patch (this time against trunk, since
MATH_2_0 has been moved to trunk) putting back the fallback code Luc
pointed out was used for performance.
Details are in the bug:
http://issues.apache.org/jira/browse/MATH-230
There are also some test times for running with
oaded methods, each taking a
particular impl.
-sujit
On Mon, 2008-12-01 at 23:52 +0100, Luc Maisonobe wrote:
> Sujit Pal a écrit :
> > Hello,
> >
> > I am a new, but fairly happy user of commons-math 1.2 and I have begun
> > to use it in my code. I needed a sparse matrix
onstructor.
-sujit
On Mon, 2008-12-01 at 14:13 -0800, Ted Dunning wrote:
> Sujit,
>
> What do you think the trade-offs are between the representation that you
> used and another one where you have a Map that contains
> rows or columns?
>
> On Mon, Dec 1, 2008 at 1:40 PM, Suji
Hello,
I am a new, but fairly happy user of commons-math 1.2 and I have begun
to use it in my code. I needed a sparse matrix implementation for some
data analysis work I was doing, and unfortunately the code with
RealMatrixImpl was coming back with an OOME. So I built a
SparseRealMatrixImpl as a s
13 matches
Mail list logo
