Add validity testing
Open
Nobody has claimed this yet.
testing
- Dominant language
- Haskell
- Stars
- 17
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Description
There are three invariants not enforced by the types:
- The child of a
Skipcan't beEmpty(i.e., no trailing zeros). - The key stored in the root node is minimal.
- The binomial trees are heap-ordered.
We should test that all operations produce valid queues.
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.
Research direction
Start by locating the queue type definitions and the implementations of all queue operations. Add validity tests covering the three stated invariants: no Empty child under Skip, a minimal root key, and heap-ordered binomial trees. Done means every operation is tested for producing valid queues.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100