@@ -0,0 +1,1709 @@
+/*%0A * Copyright (C) 2014 Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A * http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0Apackage problem70;%0A%0Aimport com.github.pedrovgs.problem70.ReverseOrderOfBinaryNumber;%0Aimport org.junit.Before;%0Aimport org.junit.Test;%0A%0Aimport static org.junit.Assert.assertEquals;%0A%0A/**%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class ReverseOrderOfBinaryNumberTest %7B%0A%0A  private ReverseOrderOfBinaryNumber reverseOrder;%0A%0A  @Before public void setUp() %7B%0A    reverseOrder = new ReverseOrderOfBinaryNumber();%0A  %7D%0A%0A  @Test public void shouldReturnZeroIfInputIsZero() %7B%0A    int input = 0; // 0%0A%0A    int result = reverseOrder.reverse(input);%0A%0A    assertEquals(0, result); // 0%0A  %7D%0A%0A  @Test public void shouldReturnOneIfInputIsOne() %7B%0A    int input = 1; // 1%0A%0A    int result = reverseOrder.reverse(input);%0A%0A    assertEquals(1, result); // 1%0A  %7D%0A%0A  @Test public void shouldReturnTheSameNumberIfIsFullOfOnes() %7B%0A    int input = 7; // 111%0A%0A    int result = reverseOrder.reverse(input);%0A%0A    assertEquals(7, result); // 11%0A  %7D%0A%0A  @Test public void shouldReturnBinaryNumberOrder() %7B%0A    int input = 13; // 1101%0A%0A    int result = reverseOrder.reverse(input);%0A%0A    assertEquals(11, result); // 1011%0A  %7D%0A%7D%0A

Add some tests to problem 70