Hedgehog.Gen.Michelson.Typed

Documentation

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

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

genValueBigMap :: forall (k :: T) (v :: T) m instr. (MonadGen m, WellTyped k, WellTyped v, HasNoBigMap v, Comparable k) => Range Length -> m (Value' instr k) -> m (Value' instr v) -> m (Value' instr ('TBigMap k v))

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

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

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

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

genValueMap :: forall (k :: T) (v :: T) m instr. (MonadGen m, WellTyped k, WellTyped v, Comparable k) => Range Length -> m (Value' instr k) -> m (Value' instr v) -> m (Value' instr ('TMap k v))

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

genValueNat :: MonadGen m => Range (Value' instr 'TNat) -> m (Value' instr 'TNat)

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

genValueSet :: (MonadGen m, Comparable a, SingI a) => Range Length -> m (Value' instr a) -> m (Value' instr ('TSet a))

genValueString :: MonadGen f => Range Length -> f (Value' instr 'TString)

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

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

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.