Make an unlocks tree #54
Labels
No labels
beginner friendly
bug
chore
documentation
duplicate
feature
help wanted
invalid
needs-triage
question
size/L
size/M
size/S
size/XL
size/XS
urgent
wontfix
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set
Reference
ScottyLabs/dalmatian#54
Loading…
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
we are going to keep the prereqs checker strict, i.e. 15122 and 15150 will NOT return 15251
Some other incorrect examples we found that might be useful as testcases:
36202 AND 36208returns36303but it has prereqs36-208 or 36-202 or 36-309 or 36-220 or 36-226 or 36-326 or 70-208 or 36-236 or 36-21876106 AND 76102returns76390but it has prereqs(76-101) or (76-102) or (76-106 and 76-107) or (76-107 and 76-108) or (76-106 and 76-108)Two questions:
imagine the unlocks tree for a course A is
(B or C) and D, it would look something likeand then say, for course B, the unlocks are
E and Fso all the unlocks string that A would be in, would be anything that "fits" the "pant legs" of the unlocks tree (or in other words you can overlay it onto the tree)
examples:
B AND Dshould unlock AB AND Cshould not unlock A(C OR G) AND Dshould unlock AE AND D(who knows! please discuss with the rest of us because lowkey we have no idea right now)E AND Fshould unlock Afrom anish:


perhaps take this into account as well