streamly-0.8.3: Dataflow programming and declarative concurrency
Copyright(c) 2019 Composewell Technologies
(c) 2013 Gabriel Gonzalez
LicenseBSD3
Maintainerstreamly@composewell.com
Stabilityexperimental
PortabilityGHC
Safe HaskellSafe-Inferred
LanguageHaskell2010

Streamly.Internal.Data.Maybe.Strict

Description

| Strict data types to be used as accumulator for strict left folds and scans. For more comprehensive strict data types see https://hackage.haskell.org/package/strict-base-types . The names have been suffixed by a prime so that programmers can easily distinguish the strict versions from the lazy ones.

One major advantage of strict data structures as accumulators in folds and scans is that it helps the compiler optimize the code much better by unboxing. In a big tight loop the difference could be huge.

Synopsis

Documentation

data Maybe' a Source #

A strict Maybe

Constructors

Just' !a 
Nothing' 

Instances

Instances details
Show a => Show (Maybe' a) Source # 
Instance details

Defined in Streamly.Internal.Data.Maybe.Strict

Methods

showsPrec :: Int -> Maybe' a -> ShowS #

show :: Maybe' a -> String #

showList :: [Maybe' a] -> ShowS #

toMaybe :: Maybe' a -> Maybe a Source #

Convert strict Maybe' to lazy Maybe

isJust' :: Maybe' a -> Bool Source #

Returns True iff its argument is of the form "Just' _".

fromJust' :: Maybe' a -> a Source #

Extract the element out of a Just' and throws an error if its argument is Nothing'.