@@ -56,7 +56,6 @@ module Reflex.Dom.Widget.Basic
5656 , module Reflex.Collection
5757 , module Reflex.Workflow
5858 , partitionMapBySetLT
59− , ChildResult (..)
6059 ) where
6160
6261import Reflex.Class
@@ -93,6 +92,7 @@ import Prelude hiding (mapM, mapM_, sequence, sequence_)
9392-- No empty pieces will be included in the output.
9493
9594--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." #-}
9696partitionMapBySetLT :: forall k v. Ord k => Set k -> Map k v -> Map (Either k ()) (Map k v)
9797partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
9898 where go :: [k] -> Map k v -> [(Either k (), Map k v)]
@@ -105,8 +105,7 @@ partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
105105 then go t geq
106106 else (Left h, lt) : go t geq
107107
108−newtype ChildResult t k a = ChildResult { unChildResult :: (a, Event t (Map k (Maybe (ChildResult t k a)))) }
109−
108+{-# INLINABLE text #-}
110109text :: DomBuilder t m => Text -> m ()
111110text t = void $ textNode $ def & textNodeConfig_initialContents .~ t
112111