Hedgehog.Gen.Michelson.Typed

Documentation

genBigMap :: forall k v m. (MonadGen m, Ord k, WellTypedToT k, WellTypedToT v, Comparable (ToT k)) => m k -> m v -> m (BigMap k v)

genEpAddress :: (MonadGen m, GenBase m ~ Identity) => m EpAddress

genValueKeyHash :: MonadGen m => m (Value' instr 'TKeyHash)

genValueMutez :: MonadGen m => m (Value' instr 'TMutez)

genValueInt :: MonadGen m => m (Value' instr 'TInt)

genValueList :: (MonadGen m, SingI a) => m (Value' instr a) -> m (Value' instr ('TList a))

genValueUnit :: Applicative m => m (Value' instr 'TUnit)

genValuePair :: MonadGen m => m (Value' instr a) -> m (Value' instr b) -> m (Value' instr ('TPair a b))

genValueTimestamp :: MonadGen m => m (Value' instr 'TTimestamp)

genValueChestAndKey :: MonadGen m => m (Value' instr 'TChest, Value' instr 'TChestKey)

genValue :: forall t m. (MonadGen m, GenBase m ~ Identity, HasNoOp t, WellTyped t) => m (Value' Instr t)

genValue' :: (MonadGen m, GenBase m ~ Identity, HasNoOp t, WellTyped t) => Sing t -> m (Value' Instr t)

genSimpleInstr :: (MonadGen m, inp ~ (x ': xs), SingI x) => m (Instr inp inp)

Generate a simple instruction. Ideally instruction generator should produce instructions containing all possible primitive instructions. In our case we consider only a few primitive instructions and pick one from a hardcoded list. Hence we call it "simple". Another limitation is that input stack and output stack types must be identical and non-empty.