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

General performance improvement (#6078)

Browse Source
This commit is contained in:
Strange Developer
2024-11-01 18:52:42 +01:00
committed by GitHub
parent 7b962a4a1d
commit df0c997e4b
29 changed files with 92 additions and 75 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/test/java/com/thealgorithms/dynamicprogramming/AssignmentUsingBitmaskTest.java
View File

@@ -1,5 +1,6 @@
package com.thealgorithms.dynamicprogramming;
import static java.util.Collections.singletonList;
import static org.junit.jupiter.api.Assertions.assertEquals;
import java.util.Arrays;
@@ -23,7 +24,7 @@ public final class AssignmentUsingBitmaskTest {
public void testNoPossibleAssignments() {
int totalTasks = 3;
List<List<Integer>> taskPerformed = Arrays.asList(Arrays.asList(2), Arrays.asList(3));
List<List<Integer>> taskPerformed = Arrays.asList(singletonList(2), singletonList(3));
AssignmentUsingBitmask assignment = new AssignmentUsingBitmask(taskPerformed, totalTasks);
int ways = assignment.countNoOfWays();
@@ -34,7 +35,7 @@ public final class AssignmentUsingBitmaskTest {
public void testSinglePersonMultipleTasks() {
int totalTasks = 3;
List<List<Integer>> taskPerformed = Arrays.asList(Arrays.asList(1, 2, 3));
List<List<Integer>> taskPerformed = singletonList(Arrays.asList(1, 2, 3));
AssignmentUsingBitmask assignment = new AssignmentUsingBitmask(taskPerformed, totalTasks);
int ways = assignment.countNoOfWays();
@@ -45,7 +46,7 @@ public final class AssignmentUsingBitmaskTest {
public void testMultiplePeopleSingleTask() {
int totalTasks = 1;
List<List<Integer>> taskPerformed = Arrays.asList(Arrays.asList(1), Arrays.asList(1));
List<List<Integer>> taskPerformed = Arrays.asList(singletonList(1), singletonList(1));
AssignmentUsingBitmask assignment = new AssignmentUsingBitmask(taskPerformed, totalTasks);
int ways = assignment.countNoOfWays();