git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Merge pull request #500 from hexx/change-to-unit-in-docs
154098bGary Burgess
docs/source/prelude.rst+6−6
@@ -285,17 +285,17 @@ Values
285
285
286 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
286 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
287
287
288− forE :: forall e. Prim.Number -> Prim.Number -> (Prim.Number -> Eff e { }) -> Eff e { }
288+ forE :: forall e. Prim.Number -> Prim.Number -> (Prim.Number -> Eff e Unit) -> Eff e Unit
289
289
290− foreachE :: forall e a. [a] -> (a -> Eff e { }) -> Eff e { }
290+ foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
291
291
292 returnE :: forall e a. a -> Eff e a
292 returnE :: forall e a. a -> Eff e a
293
293
294 runPure :: forall a. Pure a -> a
294 runPure :: forall a. Pure a -> a
295
295
296− untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
296+ untilE :: forall e. Eff e Prim.Boolean -> Eff e Unit
297
297
298− whileE :: forall e a. Eff e Prim.Boolean -> Eff e a -> Eff e { }
298+ whileE :: forall e a. Eff e Prim.Boolean -> Eff e a -> Eff e Unit
299
299
300Module Control.Monad.Eff.Unsafe
300Module Control.Monad.Eff.Unsafe
301-------------------------------
301-------------------------------
@@ -322,9 +322,9 @@ Values
322
322
323::
323::
324
324
325− print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) { }
325+ print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
326
326
327− trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
327+ trace :: forall r. Prim.String -> Eff (trace :: Trace | r) Unit
328
328
329Module Control.Monad.ST
329Module Control.Monad.ST
330-----------------------
330-----------------------
docs/source/syntax.rst+2−2
@@ -152,8 +152,8 @@ Here is an example, using the maybe monad::
152
152
153 data Maybe a = Nothing | Just a
153 data Maybe a = Nothing | Just a
154
154
155− isEven :: Number -> Maybe {}
155+ isEven :: Number -> Maybe Unit
156− isEven n | n % 2 == 0 = Just {}
156+ isEven n | n % 2 == 0 = Just unit
157 isEven _ = Nothing
157 isEven _ = Nothing
158
158
159 evenSum a b = do
159 evenSum a b = do
docs/source/typeclasses.rst+2−2
@@ -38,8 +38,8 @@ Superclass implications can be indicated in a class declaration with a backwards
38
38
39Superclass instances will be used when searching for an instance of a subclass. For example, in the code below, the ``Monad`` constraint introduced by the ``return`` function can be discharged since ``Monad`` is a superclass of ``MonadFail``::
39Superclass instances will be used when searching for an instance of a subclass. For example, in the code below, the ``Monad`` constraint introduced by the ``return`` function can be discharged since ``Monad`` is a superclass of ``MonadFail``::
40
40
41− assert :: forall m. (MonadFail m) => Bool -> m {}
41+ assert :: forall m. (MonadFail m) => Boolean -> m Unit
42− assert true = return {}
42+ assert true = return unit
43 assert false = fail "Assertion failed"
43 assert false = fail "Assertion failed"
44
44
45Type Annotations
45Type Annotations