getfit | simple app to track activities | Runtime Evironment library

No, don't use a comprehension for side-effects.

However, you can make it cleaner with enumerate:

Check if the MapleFitness is null and if it is, then create the object before returning like this

You seed the random number generator with the same value time(NULL). Two calls after eachother will return the same time_t. You'll generate one set of random numbers first, then reset the random number generator and generate them again.

Only call srand() once during the whole program run.

Also, use instead to get better/faster random number generators.

Instead of rand() % 5; using :

After some searching, I found the answer to my issue here:

https://github.com/stefvanbuuren/mice/issues/95

In short, mice throws the name_repair error when using lmerTest. There are two ways to get around this error:

If you do NOT need significance (p) values, then loading lme4 or using lme4::lmer will work with no issues.

If you DO need significance values, then you need to also load the package miceadds. With this loaded, you can use lmerTest with no issue.

The answer to the first question is yes. The missing individual of the population are created randomly. But more important, you made a mistake, when creating an initial population from file. I think you would like do something like the following.

I introduced the Constraint interface in the latest version of Jenetics. It is meant as the last line of defense, when it comes to check the validity of an individual. In your example you used the factory method of the Constraint interface, which only takes the validity predicate. The second important method of the Constraint is the repair method. This method tries to fix the given individual. Without defining this method, only a new, random phenotype is created. Since this interface is new, it seems that I haven't explained the intended use of the Constraint interface good enough. It's on my agenda #541. One possible usage example is given in #540, in the second example.

I would suggest making sure your list is sorted by fitness before passing it into some method like getTheNewList, and instead of making that method return a new list, just have it operate on the same list. For example, if your list is sorted in descending order, you can simply take out the last two elements since size of list/2 is 2 in this case. Then, combine elements in groups of 2 starting from the first element in the list, and insert this list into another list. Then, traverse through this list of combined elements and find out where this new element should be inserted into the list to preserve order. Here's what it would look like,

I think what may be happening is that you are not actually creating new chromosomes and are adding the same chromosome object twice. Objects in java are by reference so creating something like

One option to achieve this, would be CASE command. Your query could look as follows: