diff --git a/semialign/src/Data/Semialign/Internal.hs b/semialign/src/Data/Semialign/Internal.hs index 04f5521..ef2e9cf 100644 --- a/semialign/src/Data/Semialign/Internal.hs +++ b/semialign/src/Data/Semialign/Internal.hs @@ -76,7 +76,7 @@ import qualified Data.IntMap as IntMap #if !(MIN_VERSION_base(4,16,0)) import Data.Semigroup (Option (..)) -#endif +#endif import Data.These import Data.These.Combinators @@ -95,7 +95,7 @@ oops = error . ("Data.Align: internal error: " ++) -- The laws of 'align' and 'zip' resemble lattice laws. -- There is a plenty of laws, but they are simply satisfied. -- --- And an addition property if @f@ is 'Foldable', +-- And an additional property if @f@ is 'Foldable', -- which tries to enforce 'align'-feel: -- neither values are duplicated nor lost. -- @@ -139,16 +139,6 @@ oops = error . ("Data.Align: internal error: " ++) -- ≡ mapMaybe justHere (toList (align x y)) -- @ -- --- --- And an addition property if @f@ is 'Foldable', --- which tries to enforce 'align'-feel: --- neither values are duplicated nor lost. --- --- @ --- toList x = toListOf (folded . here) (align x y) --- = mapMaybe justHere (toList (align x y)) --- @ --- class Functor f => Semialign f where -- | Analogous to @'zip'@, combines two structures by taking the union of -- their shapes and using @'These'@ to hold the elements.