#645: Cleanup.

jenetics.example/src/main/java/io/jenetics/example/MultiRootGP.java

@@ -67,14 +67,14 @@ public class MultiRootGP {
 				// First 'program'
 				ProgramChromosome.of(
 					5,
-					ch -> ch.getRoot().size() <= 50,
+					ch -> ch.root().size() <= 50,
 					OPERATIONS,
 					TERMINALS
 				),
 				// Second 'program'
 				ProgramChromosome.of(
 					5,
-					ch -> ch.getRoot().size() <= 50,
+					ch -> ch.root().size() <= 50,
 					OPERATIONS,
 					TERMINALS
 				)

jenetics.ext/src/main/java/io/jenetics/ext/TreeChromosome.java

@@ -36,8 +36,8 @@ public interface TreeChromosome<A, G extends TreeGene<A, G>>
 	 * Return the root gene of this chromosome. Since the gene type is also a
 	 * {@link io.jenetics.ext.util.Tree}, you are able to assign it to one.
 	 * <pre>{@code
-	 * final Tree<A, ?> t1 = getRoot();
-	 * final Tree<?, ?> t2 = getRoot();
+	 * final Tree<A, ?> t1 = root();
+	 * final Tree<?, ?> t2 = root();
 	 * }</pre>
 	 * This method is also an alias for {@link #gene()}, which returns the
 	 * first gene of the chromosome.
@@ -46,6 +46,26 @@ public interface TreeChromosome<A, G extends TreeGene<A, G>>
 	 *
 	 * @return the root tree gene of this chromosome
 	 */
+	public default G root() {
+		return gene();
+	}
+
+	/**
+	 * Return the root gene of this chromosome. Since the gene type is also a
+	 * {@link io.jenetics.ext.util.Tree}, you are able to assign it to one.
+	 * <pre>{@code
+	 * final Tree<A, ?> t1 = root();
+	 * final Tree<?, ?> t2 = root();
+	 * }</pre>
+	 * This method is also an alias for {@link #gene()}, which returns the
+	 * first gene of the chromosome.
+	 *
+	 * @see #gene()
+	 *
+	 * @return the root tree gene of this chromosome
+	 * @deprecated Use {@link #root()} instead
+	 */
+	@Deprecated
 	public default G getRoot() {
 		return gene();
 	}

jenetics.ext/src/test/java/io/jenetics/ext/AbstractTreeGeneTest.java

@@ -46,7 +46,7 @@ public IntTreeGene newTree(int levels, Random random) {
 			.map(n -> new IntTreeGene(n.value(), n.childOffset(), n.childCount()))
 			.collect(ISeq.toISeq());
 
-		return new IntTreeChromosome(genes).getRoot();
+		return new IntTreeChromosome(genes).root();
 	}
 
 }

jenetics.prog/src/main/java/io/jenetics/prog/ProgramChromosome.java

@@ -158,7 +158,7 @@ private boolean isSuperValid() {
 	 */
 	@Override
 	public A apply(final A[] args) {
-		return getRoot().apply(args);
+		return root().apply(args);
 	}
 
 	/**
@@ -173,7 +173,7 @@ public A apply(final A[] args) {
 	 */
 	@SafeVarargs
 	public final A eval(final A... args) {
-		return getRoot().eval(args);
+		return root().eval(args);
 	}
 
 	@Override
@@ -183,7 +183,7 @@ public ProgramChromosome<A> newInstance(final ISeq<ProgramGene<A>> genes) {
 
 	@Override
 	public ProgramChromosome<A> newInstance() {
-		return create(getRoot().depth(), _validator, _operations, _terminals);
+		return create(root().depth(), _validator, _operations, _terminals);
 	}
 
 	/**

jenetics.prog/src/main/java/io/jenetics/prog/regression/Regression.java

@@ -297,7 +297,7 @@ public static <T> Regression<T> of(
 			operations,
 			terminals,
 			depth,
-			ch -> ch.getRoot().size() <= max
+			ch -> ch.root().size() <= max
 		);
 	}
 

jenetics.prog/src/test/java/io/jenetics/prog/ProgramChromosomeTest.java

@@ -90,7 +90,7 @@ public void createFromTree() {
 		final ProgramChromosome<Double> chromosome = ProgramChromosome
 			.of(tree, OPERATIONS, TERMINALS);
 
-		Assert.assertTrue(Tree.equals(tree, chromosome.getRoot()));
+		Assert.assertTrue(Tree.equals(tree, chromosome.root()));
 	}
 
 	@Test(invocationCount = 10)
@@ -159,7 +159,7 @@ public void sameRootAndFirstGene() {
 			OPERATIONS,
 			TERMINALS
 		);
-		Assert.assertSame(ch.getRoot(), ch.gene());
+		Assert.assertSame(ch.root(), ch.gene());
 	}
 
 	@Test

jenetics.prog/src/test/java/io/jenetics/prog/ProgramGeneTest.java

@@ -53,7 +53,7 @@ public class ProgramGeneTest {
 
 	private static final ProgramGene<Double> PROG = ProgramChromosome
 		.of(5, OPERATIONS, TERMINALS)
-		.getRoot();
+		.root();
 
 	private static final TreeNode<Op<Double>> TREE = TreeNode.ofTree(PROG);