GitHub user kaching88 opened a pull request:
https://github.com/apache/commons-collections/pull/12
Add CollectionUtils#deepMerge method.
This method provides fast and convenient way to merge all deepest content
in iterableOfiterablesOfiterables... etc. in one chosen collection.
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 generat
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
On 11 July 2015 at 20:29, 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
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
>
How about a Randomize utility class?
Cheers,
- Ole
On 07/11/2015 02:40 PM, sebb wrote:
On 11 July 2015 at 20:29, 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 ran
On Sat, 11 Jul 2015 12:08:16 -0700, 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
On 7/11/15 3:06 PM, Gilles wrote:
> On Sat, 11 Jul 2015 12:08:16 -0700, 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
On Sat, 11 Jul 2015 15:12:29 -0700, Phil Steitz wrote:
On 7/11/15 3:06 PM, Gilles wrote:
On Sat, 11 Jul 2015 12:08:16 -0700, 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 t
On 7/11/15 3:38 PM, Gilles wrote:
> On Sat, 11 Jul 2015 15:12:29 -0700, Phil Steitz wrote:
>> On 7/11/15 3:06 PM, Gilles wrote:
>>> On Sat, 11 Jul 2015 12:08:16 -0700, Phil Steitz wrote:
The code implemented in MATH-1242 to improve performance of KS
monteCarloP in-lines efficient generati
10 matches
Mail list logo
