- Mar 10, 2019
-
-
Hans-Peter Deifel authored
This means that `insert undefined bag` now evaluates to undefined in WHNF.
-
- Mar 09, 2019
-
-
Hans-Peter Deifel authored
This was the intention all along.
-
Hans-Peter Deifel authored
-
- Mar 08, 2019
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This was a bug in the `delmin` helper that is used to delete the smallest element of the right tree. It deleted too much.
-
Hans-Peter Deifel authored
This caused erroneous calls to rotateDoubleRight instead of rotateSingleRight, thus disbalancing the tree and possibly failing to pattern match.
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This is used in the Eq instance and also makes debugging and testing easier.
-
Hans-Peter Deifel authored
This is not strictly required by copar but allows for easier testing.
-
Hans-Peter Deifel authored
This returns the size of the tree, not the actual number of elements (there can be more elements per node) and thus should not be in the public API.
-
Hans-Peter Deifel authored
This is a requirement for its use in copar and also allows for testing, since `shouldBe` from hspec requires those two instances.
-
- Mar 07, 2019
-
-
Hans-Peter Deifel authored
-
- Jan 06, 2019
-
-
Hans-Peter Deifel authored
Due to the way the functor expression is parsed, this led to two nested polynomial functors when functor rewriting is disabled. Without the parens we get just one polynomial functor.
-
- Jan 05, 2019
-
-
Hans-Peter Deifel authored
Alright, compromise. Word16 might have been a little too small
-
- Jan 04, 2019
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This should require 4 times less RAM and allow us to generate larger DFAs.
-
- Jan 03, 2019
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
This allows to disable the 1-elem-block optimization to be able to compare the running times with and with out it.
-
- Dec 23, 2018
-
-
Hans-Peter Deifel authored
Queue.empty was being called with negative sizes
-
Hans-Peter Deifel authored
-
- Dec 22, 2018
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
The same principle as when splitting blocks applies: The largest doesn't have to be in the queue, because we already refine with respect to it when refining the second-to-last block.
-
- Dec 21, 2018
-
-
Hans-Peter Deifel authored
-
- Dec 16, 2018
-
-
Hans-Peter Deifel authored
Checks if all weights are between 0 and 1.
-
- Dec 14, 2018
-
-
Hans-Peter Deifel authored
Switches from GADT syntax to a normal ADT. This is more easily presentable in writing as it doesn't require additional explanation and is shorter.
-
- Dec 13, 2018
-
-
Hans-Peter Deifel authored
-
- Dec 12, 2018
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
Although less explicit about the kind of `f`, it is more clear and easier to replicate in publications.
-
Hans-Peter Deifel authored
-
- Dec 11, 2018
-
-
Hans-Peter Deifel authored
This fixes up the haskell examples, so that tangling them to a file results in a useable powerset implementation.
-
Hans-Peter Deifel authored
-
- Dec 10, 2018
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-