Lorentz.Zip

Stack zipping.

This module provides functions for flattening stacks into tuples.

Also here we define an instance which turns any instruction, not only lambdas, into a valid value.

Documentation

class KnownIsoT (ZippedStack s) => ZipInstr (s :: [Type]) where

Zipping stack into tuple and back.

Associated Types

type ZippedStack s :: Type

A type which contains the whole stack zipped.

Methods

zipInstrTyped :: Instr (ToTs s) '[ToT (ZippedStack s)]

Fold given stack into single value in typed Michelson.

unzipInstrTyped :: Instr '[ToT (ZippedStack s)] (ToTs s)

Unfold given stack from a single value in typed Michelson.

Instances

ZipInstr ('[] :: [Type])

Defined in Lorentz.Zip

Associated Types

type ZippedStack '[]

Methods

zipInstrTyped :: Instr (ToTs '[]) '[ToT (ZippedStack '[])]

unzipInstrTyped :: Instr '[ToT (ZippedStack '[])] (ToTs '[])

(ZipInstr (b ': s), KnownIsoT a) => ZipInstr (a ': (b ': s))

Such definition seems the only possible one we can support efficiently.

Defined in Lorentz.Zip

Associated Types

type ZippedStack (a ': (b ': s))

Methods

zipInstrTyped :: Instr (ToTs (a ': (b ': s))) '[ToT (ZippedStack (a ': (b ': s)))]

unzipInstrTyped :: Instr '[ToT (ZippedStack (a ': (b ': s)))] (ToTs (a ': (b ': s)))

KnownIsoT a => ZipInstr '[a]

Defined in Lorentz.Zip

Associated Types

type ZippedStack '[a]

Methods

zipInstrTyped :: Instr (ToTs '[a]) '[ToT (ZippedStack '[a])]

unzipInstrTyped :: Instr '[ToT (ZippedStack '[a])] (ToTs '[a])

zipInstr :: forall s. ZipInstr s => s :-> '[ZippedStack s]

Fold given stack into single value.

unzipInstr :: forall s. ZipInstr s => '[ZippedStack s] :-> s

Unfold given stack from a single value.

type ZipInstrs ss = Each '[ZipInstr] ss

Require several stacks to comply ZipInstr constraint.

zippingStack :: ZipInstrs [inp, out] => (inp :-> out) -> Fn (ZippedStack inp) (ZippedStack out)

Flatten both ends of instruction stack.

unzippingStack :: ZipInstrs [inp, out] => Fn (ZippedStack inp) (ZippedStack out) -> inp :-> out

Unflatten both ends of instruction stack.

data ZippedStackRepr a b

A type used to represent a zipped stack of at least two elements, isomorphic to a pair and represented as such in Michelson.

Constructors

a ::: b infixr 5

Instances

(CanCastTo a1 a2, CanCastTo b1 b2) => CanCastTo (ZippedStackRepr a1 b1 :: Type) (ZippedStackRepr a2 b2 :: Type)

Defined in Lorentz.Coercions

Methods

castDummy :: Proxy (ZippedStackRepr a1 b1) -> Proxy (ZippedStackRepr a2 b2) -> ()

Generic (ZippedStackRepr a b)

Defined in Lorentz.Zip

Associated Types

type Rep (ZippedStackRepr a b) :: Type -> Type

Methods

from :: ZippedStackRepr a b -> Rep (ZippedStackRepr a b) x

to :: Rep (ZippedStackRepr a b) x -> ZippedStackRepr a b

(Show a, Show b) => Show (ZippedStackRepr a b)

Defined in Lorentz.Zip

Methods

showsPrec :: Int -> ZippedStackRepr a b -> ShowS

show :: ZippedStackRepr a b -> String

showList :: [ZippedStackRepr a b] -> ShowS

(Buildable a, Buildable b) => Buildable (ZippedStackRepr a b)

Defined in Lorentz.Zip

Methods

build :: ZippedStackRepr a b -> Builder

(Eq a, Eq b) => Eq (ZippedStackRepr a b)

Defined in Lorentz.Zip

Methods

(==) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool

(/=) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool

(HasAnnotation a, HasAnnotation b) => HasAnnotation (ZippedStackRepr a b)

Defined in Lorentz.Zip

Methods

getAnnotation :: FollowEntrypointFlag -> Notes (ToT (ZippedStackRepr a b))

annOptions :: Maybe AnnOptions

(IsoValue a, IsoValue b) => IsoValue (ZippedStackRepr a b)

Defined in Lorentz.Zip

Associated Types

type ToT (ZippedStackRepr a b) :: T

Methods

toVal :: ZippedStackRepr a b -> Value (ToT (ZippedStackRepr a b))

fromVal :: Value (ToT (ZippedStackRepr a b)) -> ZippedStackRepr a b

type Rep (ZippedStackRepr a b)

Defined in Lorentz.Zip

type Rep (ZippedStackRepr a b) = D1 ('MetaData "ZippedStackRepr" "Lorentz.Zip" "lorentz-0.15.1-inplace" 'False) (C1 ('MetaCons ":::" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 b)))

type ToT (ZippedStackRepr a b)

Defined in Lorentz.Zip

type ToT (ZippedStackRepr a b) = GValueType (Rep (ZippedStackRepr a b))

data ZSNil

A type used to represent an empty zipped stack, isomorphic to a unit and represented as such in Michelson.

Constructors

ZSNil

Instances

Generic ZSNil

Defined in Lorentz.Zip

Associated Types

type Rep ZSNil :: Type -> Type

Methods

from :: ZSNil -> Rep ZSNil x

to :: Rep ZSNil x -> ZSNil

Show ZSNil

Defined in Lorentz.Zip

Methods

showsPrec :: Int -> ZSNil -> ShowS

show :: ZSNil -> String

showList :: [ZSNil] -> ShowS

Buildable ZSNil

Defined in Lorentz.Zip

Methods

build :: ZSNil -> Builder

Eq ZSNil

Defined in Lorentz.Zip

Methods

(==) :: ZSNil -> ZSNil -> Bool

(/=) :: ZSNil -> ZSNil -> Bool

HasAnnotation ZSNil

Defined in Lorentz.Zip

Methods

getAnnotation :: FollowEntrypointFlag -> Notes (ToT ZSNil)

annOptions :: Maybe AnnOptions

IsoValue ZSNil

Defined in Lorentz.Zip

Associated Types

type ToT ZSNil :: T

Methods

toVal :: ZSNil -> Value (ToT ZSNil)

fromVal :: Value (ToT ZSNil) -> ZSNil

type Rep ZSNil

Defined in Lorentz.Zip

type Rep ZSNil = D1 ('MetaData "ZSNil" "Lorentz.Zip" "lorentz-0.15.1-inplace" 'False) (C1 ('MetaCons "ZSNil" 'PrefixI 'False) (U1 :: Type -> Type))

type ToT ZSNil

Defined in Lorentz.Zip

type ToT ZSNil = GValueType (Rep ZSNil)

(##) :: (a :-> b) -> (b :-> c) -> a :-> c

Version of # which performs some optimizations immediately.

In particular, this avoids glueing Nops and DIP Nops.