- 04 Jun, 2018 4 commits
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
A queue for sorted blocks that has O(1) membership test, enqueue and dequeue.
-
Hans-Peter Deifel authored
The type `h` was only needed to make instance resolution unambiguous, but type application can do that, too.
-
- 03 Jun, 2018 3 commits
-
-
Hans-Peter Deifel authored
This completes phase 3 of split(). What's left is the queue handling and actually testing the code (which isn't possible until the queue is implemented).
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
We need to sort according to H3...
-
- 02 Jun, 2018 9 commits
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This adds a new target 'doctests' that checks examples in documentation comments.
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This will be needed to be able to do monadic array lookups in the the predicate function.
-
Hans-Peter Deifel authored
After changing RefinablePartition.statesOfBlock from list to vector, tests failed to compile.
-
Hans-Peter Deifel authored
The order of arguments to Vector.slice was accidentally reversed, leading to random results.
-
Hans-Peter Deifel authored
I forgot this when I changed the RefinementInterface context to require Eq for H3... A working CI would have found it.
-
Hans-Peter Deifel authored
This is monadic code and not lazy, so a vector is more memory/allocation and thus runtime efficient.
-
- 01 Jun, 2018 2 commits
-
-
Hans-Peter Deifel authored
This completes the second phase of the split algorithm: Compute new weights, update the lastW array and unmark states with zero weight. This is still all untested...
-
Hans-Peter Deifel authored
-
- 31 May, 2018 2 commits
-
-
Hans-Peter Deifel authored
This is needed to be able to iterate over marked states instead of just using them for splitting.
-
Hans-Peter Deifel authored
We will need this because we initially mark states that have v^x == v_0 and need to unmark those again later.
-
- 30 May, 2018 8 commits
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
Untested: This implements one half of the split algorithm.
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
Fixes the type used for W and introduces descriptive names for the constructors of Three to make the intent clearer.
-
- 29 May, 2018 1 commit
-
-
Hans-Peter Deifel authored
-
- 27 May, 2018 10 commits
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This is copy pasta from another project.
-
Hans-Peter Deifel authored
This allows to initialize the algorithm not only for one but for all morphisms and is needed to test initialization from main.
-
Hans-Peter Deifel authored
It's needed in other modules than the parser
-
Hans-Peter Deifel authored
This type should only be an artifact of the fromJSON machinery.
-
Hans-Peter Deifel authored
Previously, this was already computed in Encoding.new. But since `pred` requires knowledge about the size of the target set, this is much better done in the init phase.
-
Hans-Peter Deifel authored
This file is used as local emacs configuration
-
Hans-Peter Deifel authored
Instead of letting each individual functor parse the whole morphism, only let them influence the parsing of individual mappings.
-
Hans-Peter Deifel authored
This helps with debugging, because it formats the `show` output with more newlines and colors.
-
- 26 May, 2018 1 commit
-
-
Hans-Peter Deifel authored
-