Safe Haskell	Safe-Inferred
Language	Haskell2010

ZkFold.Symbolic.Data.Maybe

Documentation

data Maybe u a Source #

Instances

Instances details

SymbolicData a (u (ArithmeticCircuit a)) => SymbolicData a (Maybe u (ArithmeticCircuit a)) Source #
Instance details Defined in ZkFold.Symbolic.Data.Maybe Methods pieces :: Maybe u (ArithmeticCircuit a) -> [ArithmeticCircuit a] Source # restore :: [ArithmeticCircuit a] -> Maybe u (ArithmeticCircuit a) Source # typeSize :: Natural Source #
Foldable u => Foldable (Maybe u) Source #
Instance details Defined in ZkFold.Symbolic.Data.Maybe Methods fold :: Monoid m => Maybe u m -> m # foldMap :: Monoid m => (a -> m) -> Maybe u a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe u a -> m # foldr :: (a -> b -> b) -> b -> Maybe u a -> b # foldr' :: (a -> b -> b) -> b -> Maybe u a -> b # foldl :: (b -> a -> b) -> b -> Maybe u a -> b # foldl' :: (b -> a -> b) -> b -> Maybe u a -> b # foldr1 :: (a -> a -> a) -> Maybe u a -> a # foldl1 :: (a -> a -> a) -> Maybe u a -> a # toList :: Maybe u a -> [a] # null :: Maybe u a -> Bool # length :: Maybe u a -> Int # elem :: Eq a => a -> Maybe u a -> Bool # maximum :: Ord a => Maybe u a -> a # minimum :: Ord a => Maybe u a -> a # sum :: Num a => Maybe u a -> a # product :: Num a => Maybe u a -> a #
Traversable u => Traversable (Maybe u) Source #
Instance details Defined in ZkFold.Symbolic.Data.Maybe Methods traverse :: Applicative f => (a -> f b) -> Maybe u a -> f (Maybe u b) # sequenceA :: Applicative f => Maybe u (f a) -> f (Maybe u a) # mapM :: Monad m => (a -> m b) -> Maybe u a -> m (Maybe u b) # sequence :: Monad m => Maybe u (m a) -> m (Maybe u a) #
Functor u => Functor (Maybe u) Source #
Instance details Defined in ZkFold.Symbolic.Data.Maybe Methods fmap :: (a -> b) -> Maybe u a -> Maybe u b # (<$) :: a -> Maybe u b -> Maybe u a #
(Eq a, Eq (u a)) => Eq (Maybe u a) Source #
Instance details Defined in ZkFold.Symbolic.Data.Maybe Methods (==) :: Maybe u a -> Maybe u a -> Bool # (/=) :: Maybe u a -> Maybe u a -> Bool #

maybe :: forall a b f. Conditional (Bool a) b => DiscreteField (Bool a) a => b -> (f a -> b) -> Maybe f a -> b Source #

just :: Field a => u a -> Maybe u a Source #

nothing :: forall a u. SymbolicData a (u (ArithmeticCircuit a)) => Maybe u (ArithmeticCircuit a) Source #

fromMaybe :: SymbolicData a (u (ArithmeticCircuit a)) => u (ArithmeticCircuit a) -> Maybe u (ArithmeticCircuit a) -> u (ArithmeticCircuit a) Source #

isNothing :: DiscreteField (Bool a) a => Maybe u a -> Bool a Source #

isJust :: DiscreteField (Bool a) a => Maybe u a -> Bool a Source #

find :: forall a f t. Foldable t => AdditiveMonoid (f a) => Conditional (Bool a) (Maybe f a) => DiscreteField (Bool a) a => (f a -> Bool a) -> t (f a) -> Maybe f a Source #