@@ -56,7 +56,6 @@ module Reflex.Dom.Widget.Basic
56 , module Reflex.Collection
56 , module Reflex.Collection
57 , module Reflex.Workflow
57 , module Reflex.Workflow
58 , partitionMapBySetLT
58 , partitionMapBySetLT
62import Reflex.Class
61import Reflex.Class
@@ -93,6 +92,7 @@ import Prelude hiding (mapM, mapM_, sequence, sequence_)
93-- No empty pieces will be included in the output.
92-- No empty pieces will be included in the output.
95--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." #-}
96partitionMapBySetLT :: 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)
97partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
97partitionMapBySetLT s m0 = Map.fromDistinctAscList $ go (Set.toAscList s) m0
98 where go :: [k] -> Map k v -> [(Either k (), Map k v)]
98 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
105 then go t geq
105 then go t geq
106 else (Left h, lt) : go t geq
106 else (Left h, lt) : go t geq
108−newtype ChildResult t k a = ChildResult { unChildResult :: (a, Event t (Map k (Maybe (ChildResult t k a)))) }
108+{-# INLINABLE text #-}
110text :: DomBuilder t m => Text -> m ()
109text :: DomBuilder t m => Text -> m ()
111text t = void $ textNode $ def & textNodeConfig_initialContents .~ t
110text t = void $ textNode $ def & textNodeConfig_initialContents .~ t