algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 09:45:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
src/test/java/com/thealgorithms/others/FirstFitCPUTest.java
View File

@ -19,9 +19,9 @@ class FirstFitCPUTest {
@Test
void testFitForUseOfOneBlock() {
//test1 - no use of one block for two processes
sizeOfBlocks = new int[] { 5, 12, 17, 10 };
sizeOfProcesses = new int[] { 10, 5, 15, 2 };
// test1 - no use of one block for two processes
sizeOfBlocks = new int[] {5, 12, 17, 10};
sizeOfProcesses = new int[] {10, 5, 15, 2};
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(Arrays.asList(1, 0, 2, 1));
assertEquals(testMemAllocation, memAllocation);
@ -29,9 +29,9 @@ class FirstFitCPUTest {
@Test
void testFitForEqualProcecesses() {
//test2
sizeOfBlocks = new int[] { 5, 12, 17, 10 };
sizeOfProcesses = new int[] { 10, 10, 10, 10 };
// test2
sizeOfBlocks = new int[] {5, 12, 17, 10};
sizeOfProcesses = new int[] {10, 10, 10, 10};
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(Arrays.asList(1, 2, 3, -255));
assertEquals(testMemAllocation, memAllocation);
@ -39,9 +39,9 @@ class FirstFitCPUTest {
@Test
void testFitForNoEmptyBlockCell() {
//test3 for more processes than blocks - no empty space left to none of the blocks
sizeOfBlocks = new int[] { 5, 12, 17 };
sizeOfProcesses = new int[] { 5, 12, 10, 7 };
// test3 for more processes than blocks - no empty space left to none of the blocks
sizeOfBlocks = new int[] {5, 12, 17};
sizeOfProcesses = new int[] {5, 12, 10, 7};
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(Arrays.asList(0, 1, 2, 2));
assertEquals(testMemAllocation, memAllocation);
@ -49,9 +49,9 @@ class FirstFitCPUTest {
@Test
void testFitForSameInputDifferentQuery() {
//test4 for more processes than blocks - one element does not fit due to input series
sizeOfBlocks = new int[] { 5, 12, 17 };
sizeOfProcesses = new int[] { 5, 7, 10, 12 };
// test4 for more processes than blocks - one element does not fit due to input series
sizeOfBlocks = new int[] {5, 12, 17};
sizeOfProcesses = new int[] {5, 7, 10, 12};
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(Arrays.asList(0, 1, 2, -255));
assertEquals(testMemAllocation, memAllocation);
@ -59,9 +59,9 @@ class FirstFitCPUTest {
@Test
void testFitForMoreBlocksNoFit() {
//test5 for more blocks than processes
sizeOfBlocks = new int[] { 5, 4, -1, 3, 6 };
sizeOfProcesses = new int[] { 10, 11 };
// test5 for more blocks than processes
sizeOfBlocks = new int[] {5, 4, -1, 3, 6};
sizeOfProcesses = new int[] {10, 11};
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(Arrays.asList(-255, -255));
assertEquals(testMemAllocation, memAllocation);