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

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
src/test/java/com/thealgorithms/others/BestFitCPUTest.java
View File

@ -1,76 +1,69 @@
package com.thealgorithms.others;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
import java.util.ArrayList;
import java.util.Arrays;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
/**
* author Alexandros Lemonaris
*/
class BestFitCPUTest {
int [] sizeOfBlocks;
int [] sizeOfProcesses;
int[] sizeOfBlocks;
int[] sizeOfProcesses;
ArrayList<Integer> memAllocation = new ArrayList<>();
ArrayList<Integer> testMemAllocation ;
MemoryManagementAlgorithms bestFit = new BestFitCPU();
ArrayList<Integer> testMemAllocation;
MemoryManagementAlgorithms bestFit = new BestFitCPU();
@Test
void testFitForUseOfOneBlock() {
//test1 - 2 processes shall fit to one block instead of using a different block each
sizeOfBlocks = new int[]{5, 12, 17, 10};
sizeOfProcesses = new int[]{10, 5, 15, 2};
sizeOfBlocks = new int[] { 5, 12, 17, 10 };
sizeOfProcesses = new int[] { 10, 5, 15, 2 };
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList(3, 0, 2, 2)
);
testMemAllocation = new ArrayList<>(Arrays.asList(3, 0, 2, 2));
assertEquals(testMemAllocation, memAllocation);
}
@Test
void testFitForEqualProcecesses() {
//test2
sizeOfBlocks = new int[]{5, 12, 17, 10};
sizeOfProcesses = new int[]{10, 10, 10, 10};
sizeOfBlocks = new int[] { 5, 12, 17, 10 };
sizeOfProcesses = new int[] { 10, 10, 10, 10 };
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList(3, 1, 2, -255)
);
testMemAllocation = new ArrayList<>(Arrays.asList(3, 1, 2, -255));
assertEquals(testMemAllocation, memAllocation);
}
@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};
sizeOfBlocks = new int[] { 5, 12, 17 };
sizeOfProcesses = new int[] { 5, 12, 10, 7 };
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList(0, 1, 2, 2)
);
testMemAllocation = new ArrayList<>(Arrays.asList(0, 1, 2, 2));
assertEquals(testMemAllocation, memAllocation);
}
@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};
sizeOfBlocks = new int[] { 5, 12, 17 };
sizeOfProcesses = new int[] { 5, 7, 10, 12 };
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList(0, 1, 2, -255)
);
testMemAllocation = new ArrayList<>(Arrays.asList(0, 1, 2, -255));
assertEquals(testMemAllocation, memAllocation);
}
@Test
void testFitForMoreBlocksNoFit() {
//test5 for more blocks than processes
sizeOfBlocks = new int[] {5, 4, -1, 3, 6};
sizeOfProcesses = new int [] {10, 11};
sizeOfBlocks = new int[] { 5, 4, -1, 3, 6 };
sizeOfProcesses = new int[] { 10, 11 };
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList( -255, -255)
);
testMemAllocation = new ArrayList<>(Arrays.asList(-255, -255));
assertEquals(testMemAllocation, memAllocation);
}
}