forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBestFitCPUTest.java
More file actions
76 lines (70 loc) · 2.65 KB
/
BestFitCPUTest.java
File metadata and controls
76 lines (70 loc) · 2.65 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
package com.thealgorithms.others;
import org.junit.jupiter.api.Test;
import java.util.ArrayList;
import java.util.Arrays;
import static org.junit.jupiter.api.Assertions.*;
/**
* author Alexandros Lemonaris
*/
class BestFitCPUTest {
int [] sizeOfBlocks;
int [] sizeOfProcesses;
ArrayList<Integer> memAllocation = new ArrayList<>();
ArrayList<Integer> testMemAllocation ;
CPUalgorithms 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};
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
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};
memAllocation = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
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};
memAllocation = bestFit.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 = bestFit.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 = bestFit.fitProcess(sizeOfBlocks, sizeOfProcesses);
testMemAllocation = new ArrayList<>(
Arrays.asList( -255, -255)
);
assertEquals(testMemAllocation, memAllocation);
}
}