mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-27 22:43:30 +08:00
70 lines
2.5 KiB
Java
70 lines
2.5 KiB
Java
package com.thealgorithms.others;
|
|
|
|
import static org.junit.jupiter.api.Assertions.*;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.Arrays;
|
|
import org.junit.jupiter.api.Test;
|
|
|
|
/**
|
|
* author Alexandros Lemonaris
|
|
*/
|
|
class FirstFitCPUTest {
|
|
|
|
int[] sizeOfBlocks;
|
|
int[] sizeOfProcesses;
|
|
ArrayList<Integer> memAllocation = new ArrayList<>();
|
|
ArrayList<Integer> testMemAllocation;
|
|
MemoryManagementAlgorithms firstFit = new FirstFitCPU();
|
|
|
|
@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 };
|
|
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
|
|
testMemAllocation = new ArrayList<>(Arrays.asList(1, 0, 2, 1));
|
|
assertEquals(testMemAllocation, memAllocation);
|
|
}
|
|
|
|
@Test
|
|
void testFitForEqualProcecesses() {
|
|
//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);
|
|
}
|
|
|
|
@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 };
|
|
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
|
|
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 };
|
|
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
|
|
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 };
|
|
memAllocation = firstFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
|
|
testMemAllocation = new ArrayList<>(Arrays.asList(-255, -255));
|
|
assertEquals(testMemAllocation, memAllocation);
|
|
}
|
|
}
|