jwaldmann

basic set "theory": in `union a b`, the two sets `a`, `b` might be disjoint, or not. I expect a combing function for `union` to handle the non-disjoint case, because...

forgive the advertisment - it seems to fit perfectly to the topic: discuss confluence in person at this workshop (September 2-3) https://iwc2025.github.io/ - we'd also appreciate Agda views on termination...

no change, see #274

Also, same behaviour when I write it like this ``` main = do let {-# noinline xs #-} xs = [1 .. 10^7 :: Int ] print $ sum xs...

I added your version. The ST version is still faster. ``` ghc-906.0 fromDistinctAscListN (ST, []) : (0.763300835s,Sum {getSum = 50000005000000}) ghc-906.0 fromDistinctAscListN (deserialize) : (0.993581475s,Sum {getSum = 50000005000000}) ``` I...

quiet: yes. consistent: yes - my run.sh does everything twice, see https://gitlab.imn.htwk-leipzig.de/waldmann/fdaln/-/blob/master/1.LOG

OK, with tasty-bench, some sanity is restored. Still, wild fluctations w.r.t. compiler version, see https://gitlab.imn.htwk-leipzig.de/waldmann/fdaln/-/blob/master/2.LOG

for a given set of elements, the IntSet representation is unique? E.g., "the mask is *the* largest position ..." https://github.com/haskell/containers/blob/master/containers/src/Data/IntSet/Internal.hs#L261 Then a hash function could just use structure and contents...

Ah yes, the Tip includes the prefix.

* serialize: could we write `instance Ord IntSet` with that? (#787 #470) * deserialize: don't know. what would be the use case?