Use enumeration type in Markierungsalgorithmus
Nobody has claimed this yet.
Assessment
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Newbie friendliness
- 78/100
Research direction
Start with flex/markierungsalgorithmus.flex at lines 226-228 and read the surrounding Markierungsalgorithmus code to understand the numeric states. Replace those numeric values with a suitable custom enumeration type, then confirm the project still builds and the algorithm preserves its existing behavior.
Written by the indexing model from the issue text.
Description
Instead of 2, 1, ... a proper custom type should be used here: https://github.com/fmidue/logic-tasks/blob/ceefd0d7ff1d74ba113650a637911a8941e3baac/flex/markierungsalg.flex#L226-L228
- Dominant language
- Haskell
- Stars
- 0
- Forks
- 4
- PR merge metrics
- No merged PRs in 30d
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from fmidue/logic-tasks
-
fmidue/logic-tasks#381 · 1 comment · 1 assignee ·
-
fmidue/logic-tasks#380 · 2 comments · 1 assignee ·
-
Difficulty 5/5 Over a week Newbie friendliness 25/100
fmidue/logic-tasks#373 · 1 comment ·
-
fmidue/logic-tasks#358 · 2 comments · 1 assignee ·
-
fmidue/logic-tasks#323 · 1 assignee ·
All issues in fmidue/logic-tasks
Similar issues
-
chore
Difficulty 1/5 Under an hour Newbie friendliness 91/100
alunduil/alunduil-chezmoi#792 ·
-
Difficulty 1/5 Under an hour Newbie friendliness 85/100
koalaman/shellcheck#3539 ·
-
time-manager-0.4.0 Openfailure: bounds
Difficulty 1/5 Under an hour Newbie friendliness 72/100
commercialhaskell/stackage#8122 ·
-
bug
Difficulty 2/5 1-3 hours Newbie friendliness 72/100
objectionary/phino#1350 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 68/100