andreacavalli/netty5
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add test cases for MathUtil. (#10071)

Browse Source 
Motivation:

MathUtil needs more test cases.

Modification:

Add several test cases for MathUtil.

Result:

Improve test coverage slightly.
This commit is contained in:
feijermu 2020-03-02 08:51:50 +01:00 committed by Norman Maurer
parent ae0fbb45e4
commit aec2c8e4e0
1 changed files with 72 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
common/src/test/java/io/netty/util/internal/MathUtilTest.java Normal file
View File

@ -0,0 +1,72 @@
/*
* Copyright 2020 The Netty Project
*
* The Netty Project licenses this file to you 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 io.netty.util.internal;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static io.netty.util.internal.MathUtil.*;
import org.junit.Test;
public class MathUtilTest {
@Test
public void testFindNextPositivePowerOfTwo() {
assertEquals(1, findNextPositivePowerOfTwo(0));
assertEquals(1, findNextPositivePowerOfTwo(1));
assertEquals(1024, findNextPositivePowerOfTwo(1000));
assertEquals(1024, findNextPositivePowerOfTwo(1023));
assertEquals(2048, findNextPositivePowerOfTwo(2048));
assertEquals(1 << 30, findNextPositivePowerOfTwo((1 << 30) - 1));
assertEquals(1, findNextPositivePowerOfTwo(-1));
assertEquals(1, findNextPositivePowerOfTwo(-10000));
}
@Test
public void testSafeFindNextPositivePowerOfTwo() {
assertEquals(1, safeFindNextPositivePowerOfTwo(0));
assertEquals(1, safeFindNextPositivePowerOfTwo(1));
assertEquals(1024, safeFindNextPositivePowerOfTwo(1000));
assertEquals(1024, safeFindNextPositivePowerOfTwo(1023));
assertEquals(2048, safeFindNextPositivePowerOfTwo(2048));
assertEquals(1 << 30, safeFindNextPositivePowerOfTwo((1 << 30) - 1));
assertEquals(1, safeFindNextPositivePowerOfTwo(-1));
assertEquals(1, safeFindNextPositivePowerOfTwo(-10000));
assertEquals(1 << 30, safeFindNextPositivePowerOfTwo(Integer.MAX_VALUE));
assertEquals(1 << 30, safeFindNextPositivePowerOfTwo((1 << 30) + 1));
assertEquals(1, safeFindNextPositivePowerOfTwo(Integer.MIN_VALUE));
assertEquals(1, safeFindNextPositivePowerOfTwo(Integer.MIN_VALUE + 1));
}
@Test
public void testIsOutOfBounds() {
assertFalse(isOutOfBounds(0, 0, 0));
assertFalse(isOutOfBounds(0, 0, 1));
assertFalse(isOutOfBounds(0, 1, 1));
assertTrue(isOutOfBounds(1, 1, 1));
assertTrue(isOutOfBounds(Integer.MAX_VALUE, 1, 1));
assertTrue(isOutOfBounds(Integer.MAX_VALUE, Integer.MAX_VALUE, 1));
assertTrue(isOutOfBounds(Integer.MAX_VALUE, Integer.MAX_VALUE, Integer.MAX_VALUE));
assertFalse(isOutOfBounds(0, Integer.MAX_VALUE, Integer.MAX_VALUE));
assertFalse(isOutOfBounds(0, Integer.MAX_VALUE - 1, Integer.MAX_VALUE));
assertTrue(isOutOfBounds(0, Integer.MAX_VALUE, Integer.MAX_VALUE - 1));
assertFalse(isOutOfBounds(Integer.MAX_VALUE - 1, 1, Integer.MAX_VALUE));
assertTrue(isOutOfBounds(Integer.MAX_VALUE - 1, 1, Integer.MAX_VALUE - 1));
assertTrue(isOutOfBounds(Integer.MAX_VALUE - 1, 2, Integer.MAX_VALUE));
assertTrue(isOutOfBounds(1, Integer.MAX_VALUE, Integer.MAX_VALUE));
}
}