commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Phil Steitz <>
Subject Re: [math] random boolean arrays
Date Sat, 11 Jul 2015 19:43:30 GMT
On 7/11/15 12:29 PM, Thomas Neidhart wrote:
> On 07/11/2015 09:08 PM, Phil Steitz wrote:
>> The code implemented in MATH-1242 to improve performance of KS
>> monteCarloP in-lines efficient generation of random boolean arrays.
>>   Unfortunately, I think the implementation is not quite random (see
>> comments on the ticket).  To verify it, we need to be able to test
>> the random boolean array generation directly.  To do that, we have
>> to either expose the method (at least as protected) in the KS class
>> or add it somewhere else.  I propose the latter but am not sure
>> where to put it.  For speed, we need to avoid array copies, so the
>> API will have to be something like randomize(boolean[], nTrue).  It
>> could go in the swelling MathArrays class, or RandomDataGenerator. 
>> The latter probably makes more sense, but the API does not fit too
>> well.  Any ideas?
> If it is just for testing purposes, you can also access the method in
> question via reflection, see an example here:

Do you think it *should* be a private method of the K-S class?

> Thomas
> ---------------------------------------------------------------------
> To unsubscribe, e-mail:
> For additional commands, e-mail:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message