package com.abc.test;
import com.google.common.primitives.Ints;
import org.junit.Assert;
import org.junit.Test;
/**
*/
public class GuavaIntsTest {
final int[] array = new int[]{1000, 1, 2, 55, 56, 100, 200};
//数组array的反转之后的数组,后面测试用
final int[] reverseArray = new int[]{200, 100, 56, 55, 2, 1, 1000};
//数组array的升序排序之后的数组,后面测试用
final int[] sortedArray = new int[]{1, 2, 55, 56, 100, 200, 1000};
final int[] array2 = new int[]{-1, -31, 31};
//array3是array和array2合并在一起的数组,后面测试用
final int[] array3 = new int[]{1000, 1, 2, 55, 56, 100, 200, -1, -31, 31};
/**
*
*/
@Test
public void testInts() {
//array的最小值是1
Assert.assertEquals(Ints.min(array), 1);
//array的最大值是1000
Assert.assertEquals(Ints.max(array), 1000);
Assert.assertArrayEquals(Ints.concat(array, array2), array3);
//反转array
Ints.reverse(array);
Assert.assertArrayEquals(array, reverseArray);
//记得反转回来.方便后面测试.
Ints.reverse(array);
Assert.assertTrue(Ints.contains(array, 100));
Assert.assertEquals(Ints.indexOf(array, 2),2);
//降序再反转就是升序.
Ints.sortDescending(array);
Ints.reverse(array);
Assert.assertArrayEquals(array, sortedArray);
}
}
依赖为:
testImplementation(“com.google.guava:guava:31.0.1-jre”)