Skip to content

Commit

Permalink
Get rid of separate subjects definition (#17)
Browse files Browse the repository at this point in the history
  • Loading branch information
mlange-42 authored Apr 18, 2024
1 parent c734aac commit ca2c196
Show file tree
Hide file tree
Showing 5 changed files with 9 additions and 45 deletions.
1 change: 1 addition & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -5,6 +5,7 @@
### Features

* Adds CSV as output format for solutions (#13)
* Separate definition of subjects is no longer required, but derived from requirements (#17)

### Other

Expand Down
4 changes: 0 additions & 4 deletions data/pareto.json
Original file line number Diff line number Diff line change
@@ -1,8 +1,4 @@
{
"Subjects": [
"Pest 1",
"Pest 2"
],
"Matrices": [
{
"Name": "fruits",
Expand Down
8 changes: 0 additions & 8 deletions data/problem.json
Original file line number Diff line number Diff line change
@@ -1,12 +1,4 @@
{
"Subjects": [
"Pest 1",
"Pest 2",
"Pest 3",
"Pest 4",
"Pest 5",
"Pest 6"
],
"Matrices": [
{
"Name": "fruits & shoots",
Expand Down
25 changes: 8 additions & 17 deletions isso.go
Original file line number Diff line number Diff line change
Expand Up @@ -70,7 +70,6 @@ type solution[F any] struct {
}

type ProblemDef struct {
Subjects []string
Matrices []Matrix
Capacity []int
Requirements []Requirement
Expand All @@ -97,13 +96,6 @@ func NewProblem(problem ProblemDef) Problem {
matrixNames[matrix(i)] = m.Name
}

subjectIDs := map[string]subject{}
subjectNames := map[subject]string{}
for i, s := range problem.Subjects {
subjectIDs[s] = subject(i)
subjectNames[subject(i)] = s
}

reusable := make([][]bool, len(problem.Matrices))
for i, m := range problem.Matrices {
reusable[i] = make([]bool, len(problem.Matrices))
Expand All @@ -118,17 +110,16 @@ func NewProblem(problem ProblemDef) Problem {
}

req := make([]requirement, len(problem.Requirements))
uniqueReq := map[subject]bool{}
subjectIDs := map[string]subject{}
subjectNames := map[subject]string{}
for i, r := range problem.Requirements {
subject, ok := subjectIDs[r.Subject]
if !ok {
log.Fatalf("unknown subject '%v'", r.Subject)
}

if _, ok := uniqueReq[subject]; ok {
if _, ok := subjectIDs[r.Subject]; ok {
log.Fatalf("duplicate subject '%v' in requirements", r.Subject)
}
uniqueReq[subject] = true
sub := subject(i)

subjectIDs[r.Subject] = sub
subjectNames[sub] = r.Subject

matrix, ok := matrixIDs[r.Matrix]
if !ok {
Expand All @@ -143,7 +134,7 @@ func NewProblem(problem ProblemDef) Problem {
}

req[i] = requirement{
Subject: subject,
Subject: sub,
Matrix: matrix,
Samples: r.Samples,
Times: times,
Expand Down
16 changes: 0 additions & 16 deletions isso_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -9,15 +9,6 @@ import (
)

func TestDefaultProblem(t *testing.T) {
subjects := []string{
"Pest 1",
"Pest 2",
"Pest 3",
"Pest 4",
"Pest 5",
"Pest 6",
}

matrices := []isso.Matrix{
{Name: "fruits & shoots", CanReuse: []string{}},
{Name: "fruits | shoots", CanReuse: []string{
Expand Down Expand Up @@ -78,7 +69,6 @@ func TestDefaultProblem(t *testing.T) {

p := isso.NewProblem(
isso.ProblemDef{
Subjects: subjects,
Matrices: matrices,
Capacity: capacity,
Requirements: requirements,
Expand Down Expand Up @@ -108,11 +98,6 @@ func TestDefaultProblem(t *testing.T) {
}

func TestParetoProblem(t *testing.T) {
subjects := []string{
"Pest 1",
"Pest 2",
}

matrices := []isso.Matrix{
{Name: "fruits", CanReuse: []string{}},
}
Expand All @@ -138,7 +123,6 @@ func TestParetoProblem(t *testing.T) {

p := isso.NewProblem(
isso.ProblemDef{
Subjects: subjects,
Matrices: matrices,
Capacity: capacity,
Requirements: requirements,
Expand Down

0 comments on commit ca2c196

Please sign in to comment.