// Path: src/main/java/org/gololang/microbenchmarks/fibonacci/JavaRecursiveFibonacci.java
// public static Long withBoxing(Long n) {
//   if (n.longValue() <= Long.valueOf(2L)) {
//     return Long.valueOf(1L);
//   } else {
//     return Long.valueOf(withBoxing(Long.valueOf(n.longValue() - Long.valueOf(1L))) + withBoxing(Long.valueOf(n.longValue() - Long.valueOf(2L))));
//   }
// }
// 
// Path: src/main/java/org/gololang/microbenchmarks/fibonacci/JavaRecursiveFibonacci.java
// public static long withPrimitives(long n) {
//   if (n <= 2L) {
//     return 1L;
//   } else {
//     return withPrimitives(n - 1L) + withPrimitives(n - 2L);
//   }
// }


import org.junit.Test;
import static org.gololang.microbenchmarks.fibonacci.JavaRecursiveFibonacci.withBoxing;
import static org.gololang.microbenchmarks.fibonacci.JavaRecursiveFibonacci.withPrimitives;
import static org.junit.Assert.assertEquals;
/*
 * Copyright 2012-2016 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.gololang.microbenchmarks.fibonacci;



public class JavaRecursiveFibonacciTest {

  @Test
  public void test_withPrimitives() throws Exception {
// Path: src/main/java/org/gololang/microbenchmarks/fibonacci/JavaRecursiveFibonacci.java
// public static Long withBoxing(Long n) {
//   if (n.longValue() <= Long.valueOf(2L)) {
//     return Long.valueOf(1L);
//   } else {
//     return Long.valueOf(withBoxing(Long.valueOf(n.longValue() - Long.valueOf(1L))) + withBoxing(Long.valueOf(n.longValue() - Long.valueOf(2L))));
//   }
// }
// 
// Path: src/main/java/org/gololang/microbenchmarks/fibonacci/JavaRecursiveFibonacci.java
// public static long withPrimitives(long n) {
//   if (n <= 2L) {
//     return 1L;
//   } else {
//     return withPrimitives(n - 1L) + withPrimitives(n - 2L);
//   }
// }


// Path: src/test/java/org/gololang/microbenchmarks/fibonacci/JavaRecursiveFibonacciTest.java
import org.junit.Test;
import static org.gololang.microbenchmarks.fibonacci.JavaRecursiveFibonacci.withBoxing;
import static org.gololang.microbenchmarks.fibonacci.JavaRecursiveFibonacci.withPrimitives;
import static org.junit.Assert.assertEquals;

/*
 * Copyright 2012-2016 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.gololang.microbenchmarks.fibonacci;



public class JavaRecursiveFibonacciTest {

  @Test
  public void test_withPrimitives() throws Exception {
    assertEquals(1L, withPrimitives(1L));