dotnet: Fix indent

This commit is contained in:
Mizux Seiha
2021-05-25 14:13:52 +02:00
parent 0514d81022
commit a7d511bf77
3 changed files with 8 additions and 8 deletions

View File

@@ -128,7 +128,7 @@ public class NetworkRoutingSat
}
}
private static (bool IsSet, string Value) getArgValue(string[] args, string arg)
private static(bool IsSet, string Value) getArgValue(string[] args, string arg)
{
string lookup = $"--{arg}=";
@@ -766,11 +766,10 @@ public class NetworkRoutingSat
cpModel.Minimize(LinearExpr.Sum(obj));
CpSolver solver = new CpSolver();
solver.StringParameters =
parameters + " enumerate_all_solutions:true";
solver.StringParameters = parameters + " enumerate_all_solutions:true";
CpSolverStatus status = solver.Solve(
cpModel, new FeasibleSolutionChecker2(maxUsageCost, comfortableTrafficVars, trafficVars));
CpSolverStatus status =
solver.Solve(cpModel, new FeasibleSolutionChecker2(maxUsageCost, comfortableTrafficVars, trafficVars));
return (long)solver.ObjectiveValue;
}

View File

@@ -380,7 +380,7 @@ public class ShiftSchedulingSat
/// base name for penalty literals.</param> <returns>A tuple (costLiterals,
/// costCoefficients) containing the different penalties created by the
/// sequence constraint.</returns>
static (IntVar[] costLiterals, int[] costCoefficients)
static(IntVar[] costLiterals, int[] costCoefficients)
AddSoftSequenceConstraint(CpModel model, IntVar[] works, int hardMin, int softMin, int minCost, int softMax,
int hardMax, int maxCost, string prefix)
{
@@ -473,7 +473,7 @@ public class ShiftSchedulingSat
/// base name for penalty literals.</param> <returns>A tuple (costVariables,
/// costCoefficients) containing the different penalties created by the
/// sequence constraint.</returns>
static (IntVar[] costVariables, int[] costCoefficients)
static(IntVar[] costVariables, int[] costCoefficients)
AddSoftSumConstraint(CpModel model, IntVar[] works, int hardMin, int softMin, int minCost, int softMax,
int hardMax, int maxCost, string prefix)
{

View File

@@ -64,7 +64,8 @@ public class SpeakerScheduling
matching.AddArcWithCost(dummy, value - first_slot_, 0);
}
}
if (matching.Solve() == LinearSumAssignment.Status.OPTIMAL && matching.OptimalCost() < large) // No violated arcs.
if (matching.Solve() == LinearSumAssignment.Status.OPTIMAL &&
matching.OptimalCost() < large) // No violated arcs.
{
for (int speaker = 0; speaker < number_of_variables; ++speaker)
{