@@ -92,6 +92,7 @@ import Prelude hiding (mapM, mapM_, sequence, sequence_)
92-- No empty pieces will be included in the output.
92-- No empty pieces will be included in the output.
94--TODO: This can probably be done more efficiently by dividing and conquering, re-using the structure of the Set instead of going through the Set linearally
94--TODO: This can probably be done more efficiently by dividing and conquering, re-using the structure of the Set instead of going through the Set linearally
95+{-# DEPRECATED partitionMapBySetLT "This will be removed in future releases." #-}
95partitionMapBySetLT :: forall k v. Ord k => Set k -> Map k v -> Map (Either k ()) (Map k v)
96partitionMapBySetLT :: forall k v. Ord k => Set k -> Map k v -> Map (Either k ()) (Map k v)
96partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
97partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
97 where go :: [k] -> Map k v -> [(Either k (), Map k v)]
98 where go :: [k] -> Map k v -> [(Either k (), Map k v)]