Merge branch 'topic/new_java_formatter' into 'master'

Introduce prettier as Java formatter

Closes #184

See merge request eng/libadalang/langkit-query-language!396

Author: HugoGGuerrier

lkql_jit/benchmarks/src/test/java/com/adacore/lkql_jit/BenchmarksMain.java

@@ -7,6 +7,7 @@
 
 /** Entry point for the LKQL benchmarks. */
 public class BenchmarksMain {
+
     public static void main(String[] args) throws Exception {
         org.openjdk.jmh.Main.main(args);
     }

lkql_jit/benchmarks/src/test/java/com/adacore/lkql_jit/benchmarks/FibonacciBenchmark.java

@@ -21,32 +21,30 @@ public class FibonacciBenchmark extends TruffleBenchmark {
 
     /** The fibonacci function in LKQL */
     private static final String lkqlFibo =
-            """
+        """
         fun fibo(n) =
             if n <= 0
             then 0
             else if n == 1
                  then 1
                  else fibo(n-1) + fibo(n-2)
         fibo(%d)
-        """
-                    .formatted(term);
+        """.formatted(term);
 
     /** The fibonacci function in JS */
     private static final String jsFibo =
-            """
+        """
         function fibo(n) {
             if (n == 0) return 0;
             else if (n == 1) return 1;
             return fibo(n-1) + fibo(n-2);
         }
         fibo(%d)
-        """
-                    .formatted(term);
+        """.formatted(term);
 
     /** The fibonacci function in SimpleLanguage */
     private static final String slFibo =
-            """
+        """
         function fibo(n) {
             if (n < 2) {
                 return 1;
@@ -56,8 +54,7 @@ function fibo(n) {
         function main() {
             fibo(%d);
         }
-        """
-                    .formatted(term);
+        """.formatted(term);
 
     /** Java recursive fibonacci implementation. */
     private static int javaFibo(int n) {

lkql_jit/benchmarks/src/test/java/com/adacore/lkql_jit/benchmarks/ListComprehensionBenchmark.java

@@ -30,17 +30,17 @@ public class ListComprehensionBenchmark extends TruffleBenchmark {
 
     /** The source for the LKQL list comprehension value. */
     private static final String lkqlSource =
-            """
-    val generator = [%s]
-    val result = [x * 2 for x in generator].to_list
-    """;
+        """
+        val generator = [%s]
+        val result = [x * 2 for x in generator].to_list
+        """;
 
     /** The fibonacci function in JS */
     private static final String jsSource =
-            """
-    var generator = [%s];
-    var result = generator.map(x => x * 2);
-    """;
+        """
+        var generator = [%s];
+        var result = generator.map(x => x * 2);
+        """;
 
     /** Java recursive fibonacci implementation. */
     private void javaListComp() {
@@ -55,9 +55,10 @@ public void setup() {
         for (int i = 0; i < size; i++) {
             this.generator[i] = i;
         }
-        final String generatorLiteral =
-                String.join(
-                        ",\n", Arrays.stream(this.generator).mapToObj(Integer::toString).toList());
+        final String generatorLiteral = String.join(
+            ",\n",
+            Arrays.stream(this.generator).mapToObj(Integer::toString).toList()
+        );
         this.lkqlListComp = lkqlSource.formatted(generatorLiteral);
         this.jsListComp = jsSource.formatted(generatorLiteral);
     }

lkql_jit/builtins_annotations/src/main/java/com/adacore/lkql_jit/annotations/BuiltInFunction.java

@@ -14,7 +14,6 @@
  */
 @Target(ElementType.TYPE)
 public @interface BuiltInFunction {
-
     /** Name for this built-in function */
     String name();
 

lkql_jit/builtins_annotations/src/main/java/com/adacore/lkql_jit/annotations/BuiltInMethod.java

@@ -13,7 +13,6 @@
  */
 @Target(ElementType.TYPE)
 public @interface BuiltInMethod {
-
     /** Name for this built-in method. */
     String name() default "";