Hi Benedikt,
thanks for investing your spare time on contributing on BeanUtils2!
Please read my inline comments:
> Complex methods: I know, that BeanUtils2 is just an experiment, and that the
> code was written to get it working fast for this purpose. But some methods
> are really hard to read. Ta
To whom it may engage...
This is an automated request, but not an unsolicited one. For
more information please visit http://gump.apache.org/nagged.html,
and/or contact the folk at gene...@gump.apache.org.
Project commons-proxy-test has an issue affecting its community integration.
This
To whom it may engage...
This is an automated request, but not an unsolicited one. For
more information please visit http://gump.apache.org/nagged.html,
and/or contact the folk at gene...@gump.apache.org.
Project commons-exec-test has an issue affecting its community integration.
This i
To whom it may engage...
This is an automated request, but not an unsolicited one. For
more information please visit http://gump.apache.org/nagged.html,
and/or contact the folk at gene...@gump.apache.org.
Project commons-digester3 has an issue affecting its community integration.
This i
On Mon, Jan 23, 2012 at 5:07 PM, Gary Gregory wrote:
> I committed a small refactoring. Please comment and/or continue refactoring.
Looks good to me, thanks for doing this.
Niall
> Thank you,
> Gary
>
> On Mon, Jan 23, 2012 at 11:38 AM, sebb wrote:
>
>> On 23 January 2012 15:27, Gary Gregory
Hi all,
this is a vote for releasing Commons Configuration 1.8 based on the
first release candidate. Configuration has been updated to support new
language features of Java 1.5 (which is now the minimum required JDK
version). This could be achieved in a binary compatible way.
Tag:
https://sv
Hi Luc,
thanks for this answer.
>>
>> My problem is that I do not know what getSolverAbsoluteAccuracy()
>> should return. I see three options
>> 1. Have getSolverAbsoluteAccuracy() throw an
>> UnsupportedOperationException, as the solver is *never* invoked.
>> 2. Return a default value, and specify
Le 27/01/2012 13:55, Sébastien Brisard a écrit :
> Hi
>>
>> It thus becomes urgent to tackle the remaining blocking issues.
>> Can we please make a list of those, and of all practical matters that
>> prevent the preparation of the release?
>>
>
> MATH-731 is pretty much solved, but I still need a
Le 27/01/2012 12:48, Gilles Sadowski a écrit :
> Hi.
Hi Gilles,
>
>
> It thus becomes urgent to tackle the remaining blocking issues.
> Can we please make a list of those, and of all practical matters that
> prevent the preparation of the release?
>
MATH-621 (s
On Fri, 27 Jan 2012, Simone Tripodi wrote:
as promised time ago, I finally found the slot to rollout the
[validator] RC and I am here today to open the VOTE for Apache Commons
validator 1.4.0 based on RC1. Follow details:
Artifacts look good to me, I'm +1
Nick
---
Hi,
now, that I have made myself more familiar with BeanUtils2, there are a
few things worth discussing regarding AccessibleObjectsRegistry.
Complex methods: I know, that BeanUtils2 is just an experiment, and that
the code was written to get it working fast for this purpose. But some
methods
Hi.
(1)
I suspect there might be a bug at line 207 in file "RandomDataTest.java"
(package "o.a.c.m.random"), indicate by "HERE" in the excerpt below:
---CUT---
private void checkNextLongUniform(int min, int max) throws Exception {
final Frequency freq = new Frequency();
for (in
http://people.apache.org/~simonetripodi/
http://simonetripodi.livejournal.com/
http://twitter.com/simonetripodi
http://www.99soft.org/
Hi Seb,
>>
>> https://svn.apache.org/repos/asf/commons/proper/validator/tags/VALIDATOR_1_4_0_RC1/
>
> That tag is not unique, as it was recreated.
> So please
On Fri, Jan 27, 2012 at 8:37 AM, wrote:
> Hi,
>
> I stumbled over the BasicTypeConverter
> (org.apache.commons.jxpath.util.BasicTypeConverter.java)
>
> Within this class the BeanUtils ConvertUtils class is used for looking up
> a matching converter. This is done by only supplying the target class
Hi,
I stumbled over the BasicTypeConverter
(org.apache.commons.jxpath.util.BasicTypeConverter.java)
Within this class the BeanUtils ConvertUtils class is used for looking up
a matching converter. This is done by only supplying the target class. I
think it is worthwhile to either change this to
On 27 January 2012 09:49, Simone Tripodi wrote:
> Good morning all mates :)
>
> as promised time ago, I finally found the slot to rollout the
> [validator] RC and I am here today to open the VOTE for Apache Commons
> validator 1.4.0 based on RC1. Follow details:
>
> Tag:
>
>
> https://svn.apac
Hi
>
> It thus becomes urgent to tackle the remaining blocking issues.
> Can we please make a list of those, and of all practical matters that
> prevent the preparation of the release?
>
MATH-731 is pretty much solved, but I still need a piece of advice.
Let me explain : the triangular distributio
On 27/01/2012 12:47, Claudio Squarcella wrote:
Hello,
On 27/01/2012 12:35, Marco Speranza wrote:
Hi all,
I'm trying to implement the Boruvka's algorithm and I need to know is a
grah is connected or not.
So I'd like to propose a simple algorithm to do that.
A simple way to implement that is r
Hi.
> >>>
> >>> It thus becomes urgent to tackle the remaining blocking issues.
> >>> Can we please make a list of those, and of all practical matters that
> >>> prevent the preparation of the release?
> >>>
> >>
> >>
> >> MATH-621 (see also MATH-728)
> >> * Unit test coverage: at least 6 branche
Hello,
On 27/01/2012 12:35, Marco Speranza wrote:
Hi all,
I'm trying to implement the Boruvka's algorithm and I need to know is a
grah is connected or not.
So I'd like to propose a simple algorithm to do that.
A simple way to implement that is run a depth-first or breadth-first search
starting
Hi Marco!
go for it!!! Just fill an issue and provide a patch ;)
thanks for your effort,
-Simo
http://people.apache.org/~simonetripodi/
http://simonetripodi.livejournal.com/
http://twitter.com/simonetripodi
http://www.99soft.org/
On Fri, Jan 27, 2012 at 12:35 PM, Marco Speranza
wrote:
> Hi a
Hi all,
I'm trying to implement the Boruvka's algorithm and I need to know is a
grah is connected or not.
So I'd like to propose a simple algorithm to do that.
A simple way to implement that is run a depth-first or breadth-first search
starting from an arbitrary vertex. If the number of the vertic
Good morning all mates :)
as promised time ago, I finally found the slot to rollout the
[validator] RC and I am here today to open the VOTE for Apache Commons
validator 1.4.0 based on RC1. Follow details:
Tag:
https://svn.apache.org/repos/asf/commons/proper/validator/tags/VALIDATOR_1_4_0_RC
23 matches
Mail list logo
