🎨 Gradle 6 - Format code

gradle-6/dependency-constraints/src/main/java/com/baeldung/gradle/RxHelloWorld.java

@@ -2,17 +2,19 @@ package com.baeldung.gradle;
 
 import com.google.common.collect.ImmutableList;
 import io.reactivex.Observable;
+
 import java.util.List;
 
 /** Demonstrates a library type that returns an RxJava type. */
 public class RxHelloWorld {
 
-  /** @return an {@link Observable} that emits events "hello" and "world" before completing. */
+    /** @return an {@link Observable} that emits events "hello" and "world" before completing. */
-  public static Observable<String> hello() {
+    public static Observable<String> hello() {
-    // Guava ImmutableList class is an implementation detail.
+        // Guava ImmutableList class is an implementation detail.
-    List<String> values = ImmutableList.of("hello", "world");
+        List<String> values = ImmutableList.of("hello", "world");
-    return Observable.fromIterable(values);
+        return Observable.fromIterable(values);
-  }
+    }
 
-  private RxHelloWorld() {}
+    private RxHelloWorld() {
+    }
 }

gradle-6/dependency-constraints/src/test/java/com/baeldung/gradle/RxHelloWorldUnitTest.java

@@ -1,14 +1,13 @@
 package com.baeldung.gradle;
 
-import static com.baeldung.gradle.RxHelloWorld.hello;
-
 import org.junit.jupiter.api.Test;
 
+import static com.baeldung.gradle.RxHelloWorld.hello;
+
 /** Unit test for {@link RxHelloWorld}. */
 final class RxHelloWorldUnitTest {
 
-  @Test
+    @Test void it_emits_hello_world_values() {
-  void it_emits_hello_world_values() {
+        hello().test().assertValues("hello", "world").assertComplete();
-    hello().test().assertValues("hello", "world").assertComplete();
+    }
-  }
 }

gradle-6/fibonacci-recursive/src/main/java/com/baeldung/fibonacci/impl/RecursiveFibonacci.java

@@ -4,17 +4,15 @@ import com.baeldung.fibonacci.FibonacciSequenceGenerator;
 import com.google.auto.service.AutoService;
 
 /** Recursive implementation of the {@link FibonacciSequenceGenerator}. */
-@AutoService(FibonacciSequenceGenerator.class)
+@AutoService(FibonacciSequenceGenerator.class) public final class RecursiveFibonacci implements FibonacciSequenceGenerator {
-public final class RecursiveFibonacci implements FibonacciSequenceGenerator {
 
-  @Override
+    @Override public int generate(int nth) {
-  public int generate(int nth) {
+        if (nth < 0) {
-    if (nth < 0) {
+            throw new IllegalArgumentException("sequence number must be 0 or greater");
-      throw new IllegalArgumentException("sequence number must be 0 or greater");
+        }
+        if (nth <= 1) {
+            return nth;
+        }
+        return generate(nth - 1) + generate(nth - 2);
     }
-    if (nth <= 1) {
-      return nth;
-    }
-    return generate(nth - 1) + generate(nth - 2);
-  }
 }

gradle-6/fibonacci-recursive/src/test/java/com/baeldung/fibonacci/impl/RecursiveFibonacciUnitTest.java

@@ -8,9 +8,7 @@ import com.baeldung.fibonacci.FibonacciSequenceGeneratorFixture;
  * the fibonacci-spi project.
  */
 final class RecursiveFibonacciUnitTest implements FibonacciSequenceGeneratorFixture {
-
+    @Override public FibonacciSequenceGenerator provide() {
-  @Override
+        return new RecursiveFibonacci();
-  public FibonacciSequenceGenerator provide() {
+    }
-    return new RecursiveFibonacci();
-  }
 }

gradle-6/fibonacci-spi/src/main/java/com/baeldung/fibonacci/FibonacciSequenceGenerator.java

@@ -3,9 +3,9 @@ package com.baeldung.fibonacci;
 /** Describes an SPI for a Fibonacci sequence generator function. */
 public interface FibonacciSequenceGenerator {
 
-  /**
+    /**
-   * @param nth the index of the number in the fibonacci sequence
+     * @param nth the index of the number in the fibonacci sequence
-   * @return the nth number in the fibonacci sequence
+     * @return the nth number in the fibonacci sequence
-   */
+     */
-  int generate(int nth);
+    int generate(int nth);
 }

gradle-6/fibonacci-spi/src/testFixtures/java/com/baeldung/fibonacci/FibonacciSequenceGeneratorFixture.java

@@ -1,31 +1,29 @@
 package com.baeldung.fibonacci;
 
+import org.junit.jupiter.api.Test;
+
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 
-import org.junit.jupiter.api.Test;
-
 /**
  * Reusable test fixture for {@link FibonacciSequenceGenerator} implementations. Tests will be
  * skipped if no such implementation exists.
  */
 public interface FibonacciSequenceGeneratorFixture {
 
-  /** @return the implementation of {@link FibonacciSequenceGenerator} to test. Must not be null */
+    /** @return the implementation of {@link FibonacciSequenceGenerator} to test. Must not be null */
-  FibonacciSequenceGenerator provide();
+    FibonacciSequenceGenerator provide();
 
-  @Test
+    @Test default void when_sequence_index_is_negative_then_throws() {
-  default void when_sequence_index_is_negative_then_throws() {
+        final FibonacciSequenceGenerator generator = provide();
-    final FibonacciSequenceGenerator generator = provide();
+        assertThrows(IllegalArgumentException.class, () -> generator.generate(-1));
-    assertThrows(IllegalArgumentException.class, () -> generator.generate(-1));
+    }
-  }
+
-
+    @Test default void when_given_index_then_generates_fibonacci_number() {
-  @Test
+        final FibonacciSequenceGenerator generator = provide();
-  default void when_given_index_then_generates_fibonacci_number() {
+        final int[] sequence = { 0, 1, 1, 2, 3, 5, 8 };
-    final FibonacciSequenceGenerator generator = provide();
+        for (int i = 0; i < sequence.length; i++) {
-    final int[] sequence = {0, 1, 1, 2, 3, 5, 8};
+            assertEquals(sequence[i], generator.generate(i));
-    for (int i = 0; i < sequence.length; i++) {
+        }
-      assertEquals(sequence[i], generator.generate(i));
     }
-  }
 }