keiro-dsl-0.9.0.0: src/Keiro/Dsl/Scaffold.hs
-- | The scaffold engine. Given an 'Aggregate' (and a 'Context' naming the
-- service and output module-namespace root), it emits deterministic
-- @-- \@generated@ modules plus create-if-absent Hole modules for the behavior
-- that remains explicitly hand-owned.
--
-- The load-bearing invariant of this module is the __firewall__: only a
-- generated aggregate @Transducer.hs@ may contain Keiki symbolic operators
-- (@./=@, @.==@, @.||@, @lit@, @B.slot@, @B.requireGuard@). Hand-owned Hole
-- modules remain the other intentional construction boundary. A generated-text
-- scan enforces the exception by path.
--
-- Version-2 generated-owned transition bodies are rendered authoritatively in
-- that transducer. Explicit Hole-owned transitions keep only predicate/update
-- ownership; the generated command/event/target envelope remains authoritative.
-- Read-model SQL (the projection @apply@) is still a DB-coupled Hole delegated
-- to @codd@/the agent; the @Generated@ Projection module emits deterministic
-- @InlineProjection@ wiring and the pure event→status mapping. The decode emitted
-- here is /strict/ (every field required); lenient\/optional decode is EP-4's
-- concern.
module Keiro.Dsl.Scaffold
( ScaffoldModule (..),
ModuleKind (..),
Context (..),
Placement (..),
defaultContext,
genPrefixFor,
holePrefixFor,
generatedNominalModule,
NominalUseSite (..),
NominalGenerationOwner (..),
planNominalGeneration,
planNominalGenerationForService,
generatedNominalsInTypes,
generatedNominalTypeImports,
generatedNominalTypeImportsForService,
generatedIdSampleHaskell,
scaffoldReplayAudit,
scaffoldStructural,
scaffoldStructuralForService,
scaffoldStructuralOwners,
scaffoldStructuralOwnersForService,
codecComparisonModule,
codecComparisonBanner,
bindingSkeletonModules,
bindingSkeletonOwners,
scaffoldAggregateForService,
scaffoldAggregate,
obsoleteGeneratedOutputHooks,
scaffoldProcess,
scaffoldRouter,
scaffoldContract,
scaffoldContractForService,
scaffoldIntake,
scaffoldPublisher,
scaffoldWorkqueue,
scaffoldReadModel,
scaffoldRefusals,
windowSeconds,
-- * Firewall self-check (M3)
FirewallSurface (..),
firewallSurface,
firewallBreaches,
-- * Internal resolution, shared with "Keiro.Dsl.Harness"
Agg (..),
aggregateCheckedService,
ResolvedRegister (..),
ResolvedCtor (..),
StructuralProjection (..),
resolveAggForService,
resolveAgg,
nominalEqualityUsedInGeneratedExpressions,
projectionSpecs,
resolveProjectionModules,
nominalProjectionModule,
codecMappedDeclarations,
FieldCat (..),
fieldCat,
vertexCtor,
initialVertex,
firstEnumCtor,
lowerFirst,
pascal,
pascalFromKebab,
generatedBanner,
generatedBannerFor,
isGeneratedBannerLine,
stampGeneratedModule,
stampGeneratedModules,
)
where
import Data.Char (isAlpha, isAlphaNum, isDigit, isUpper, toLower, toUpper)
import Data.List (find, findIndex, groupBy, isSuffixOf, nub, sort, sortOn)
import Data.List.NonEmpty (NonEmpty)
import Data.List.NonEmpty qualified as NE
import Data.Map.Strict qualified as Map
import Data.Maybe (fromMaybe, isJust, mapMaybe)
import Data.Set qualified as Set
import Data.Text (Text)
import Data.Text qualified as T
import Data.Version (showVersion)
import Keiro.Dsl.AggregateType
import Keiro.Dsl.BehaviorCoverage qualified as Behavior
import Keiro.Dsl.CodecCompare (BranchArm (..), BranchField (..), BranchSchema (..))
import Keiro.Dsl.EventOutput
import Keiro.Dsl.ExplainBindings (BindingObligation (..), BindingObligationKind (..), bindingObligations)
import Keiro.Dsl.Expression
import Keiro.Dsl.FoldFingerprint (aggregateFoldFingerprintForService, renderFoldSurfaceError)
import Keiro.Dsl.Grammar
import Keiro.Dsl.IdDomain (IdDomainContract, contractIdDomainContractFor, idDomainContractFor, idDomainPrefix, idDomainSampleText)
import Keiro.Dsl.LanguageVersion (SourceLanguage (LegacyUnversioned), languageVersionText)
import Keiro.Dsl.NominalType
import Keiro.Dsl.PrettyPrint (renderExpr)
import Keiro.Dsl.ReadModelShape (fnv1a64, registryNameFor, subscriptionNameFor)
import Keiro.Dsl.SemanticContract (CheckedService (..), EffectiveLanguageContract, effectiveContractLanguageVersion, effectiveLanguageContract, legacyCheckedService)
import Keiro.Dsl.TypeGraph
import Keiro.Dsl.Validate (sagaCategoryError)
import Paths_keiro_dsl qualified as Package
import Text.Read (readMaybe)
-- | One emitted module: its on-disk path (relative to the scaffold @--out@
-- directory), its full text, and whether it is overwritten every run
-- ('Generated') or written only when absent ('HoleStub').
data ScaffoldModule = ScaffoldModule
{ modulePath :: !FilePath,
moduleText :: !Text,
kind :: !ModuleKind,
origin :: !Text
}
deriving stock (Eq, Show)
data ModuleKind
= -- | @-- \@generated@; overwritten on every scaffold.
Generated
| -- | Hand-owned; created only when absent, never overwritten.
HoleStub
deriving stock (Eq, Show)
-- | The threading context: the spec's @context@ name, the chosen output
-- module-namespace root, and the placement style. Extended additively (never
-- re-shaped) by later verticals.
data Context = Context
{ contextName :: !Text,
-- | @""@ means no namespace prefix (the historical default).
moduleRoot :: !Text,
-- | 'GeneratedPrefix' is the historical default.
placement :: !Placement
}
deriving stock (Eq, Show)
-- | One aggregate-level reason a generated nominal declaration must be visible.
-- The declaration itself is context-owned; these use sites determine the
-- aggregate modules that import it.
data NominalUseSite = NominalUseSite
{ nominalUseAggregate :: !Name,
nominalUseKind :: !AggregateUseSite
}
deriving stock (Eq, Ord, Show)
-- | The checked generation owner for one unbound ID or enum. Every owner in a
-- service points at the same context-level module, while retaining its source
-- location through 'ResolvedNominalType' and all aggregate use sites explicitly.
data NominalGenerationOwner = NominalGenerationOwner
{ nominalDeclaration :: !ResolvedNominalType,
nominalModule :: !Text,
nominalUseSites :: !(Set.Set NominalUseSite),
nominalEqualityUsed :: !Bool
}
deriving stock (Eq, Show)
-- | A context with today's default placement ('GeneratedPrefix', no root prefix)
-- for the given @context@ name. Callers that do not care about placement (the
-- @parse@ path, tests) build their context with this.
defaultContext :: Text -> Context
defaultContext name = Context {contextName = name, moduleRoot = "", placement = GeneratedPrefix}
-- | The generated-layer namespace for a node, honouring the root prefix and the
-- placement style. The 'Text' argument is the already-pascalised node name (e.g.
-- @Reservation@, @HospitalSurge@). For 'GeneratedPrefix' this is
-- @\<root\>.Generated.\<Ctx\>.\<Node\>@ (identical to the historical layout); for
-- 'CollocatedLeaf' it is @\<root\>.\<Ctx\>.\<Node\>.Generated@.
genPrefixFor :: Context -> Text -> Text
genPrefixFor ctx node = case placement ctx of
GeneratedPrefix -> rootPrefix ctx <> "Generated." <> ctxPascalOf ctx <> "." <> node
CollocatedLeaf -> rootPrefix ctx <> ctxPascalOf ctx <> "." <> node <> ".Generated"
-- | The hand-owned (hole) namespace for a node: @\<root\>.\<Ctx\>.\<Node\>@ —
-- the same for both placement styles (holes always sit beside the domain).
holePrefixFor :: Context -> Text -> Text
holePrefixFor ctx node = rootPrefix ctx <> ctxPascalOf ctx <> "." <> node
-- | The one context-level Haskell owner for generated IDs and enums.
generatedNominalModule :: Context -> Text
generatedNominalModule ctx = case placement ctx of
GeneratedPrefix -> rootPrefix ctx <> "Generated." <> ctxPascalOf ctx <> ".Nominals"
CollocatedLeaf -> rootPrefix ctx <> ctxPascalOf ctx <> ".Generated.Nominals"
-- | The root namespace prefix, dot-terminated, or @""@ when no root is set.
rootPrefix :: Context -> Text
rootPrefix ctx = case moduleRoot ctx of r | T.null r -> ""; r -> r <> "."
-- | The context name in PascalCase, e.g. @hospital-capacity@ -> @HospitalCapacity@.
ctxPascalOf :: Context -> Text
ctxPascalOf = pascalFromKebab . contextName
--------------------------------------------------------------------------------
-- Firewall self-check (M3)
--------------------------------------------------------------------------------
-- | The canonical keiki surface forbidden in generated modules. Symbolic
-- operators are matched as maximal Haskell symbol tokens, identifiers as complete
-- tokens, qualifiers by their leading module alias, and imports structurally.
data FirewallSurface = FirewallSurface
{ forbiddenSymbolic :: ![Text],
forbiddenIdents :: ![Text],
forbiddenQualifiers :: ![Text],
forbiddenImports :: ![Text],
restrictedImports :: ![(Text, [Text])]
}
deriving stock (Eq, Show)
firewallSurface :: FirewallSurface
firewallSurface =
FirewallSurface
{ forbiddenSymbolic = [".==", "./=", ".<", ".<=", ".>", ".>=", ".&&", ".||", ".+", ".-", ".*", "=:", "*:"],
forbiddenIdents = ["lit", "pnot", "tadd", "tsub", "tmul"],
forbiddenQualifiers = ["B"],
forbiddenImports = ["Keiki.Builder", "Keiki.Operators", "Keiki.Symbolic"],
-- Generated aggregate modules use the first two names; generated
-- harnesses validate, step, and replay filled holes register by register.
restrictedImports =
[ ( "Keiki.Core",
[ "RegFile",
"HsPred",
"FieldProjection",
"ExactFieldProjection",
"FieldWitness",
"fieldWitness",
"exactFieldWitness",
"fieldWitnessAgrees",
"applyEventsEither",
"defaultValidationOptions",
"step",
"validateTransducer",
"EdgeMode",
"EdgeRef",
"StepSuccess",
"StepFailure",
"ReplayEventSpan",
"ReplayAttribution",
"ReplaySuccess",
"applyEventsDetailedEither",
"stepDetailedEither",
"!"
]
)
]
}
-- | Scan generated modules for firewall breaches, returning every offending
-- @(module path, token, 1-based line number)@. Only modules whose 'kind' is
-- 'Generated' are scanned. Strings and comments are skipped, symbol runs use
-- maximal munch, and keiki imports are checked independently of token spelling.
firewallBreaches :: [ScaffoldModule] -> [(FilePath, Text, Int)]
firewallBreaches mods =
[ (modulePath m, breach, n)
| m <- mods,
kind m == Generated,
not (authoritativeScalarModule (modulePath m)),
(n, line) <- zip [1 ..] (T.lines (moduleText m)),
breach <- lineBreaches line
]
-- The version-2 aggregate transducer is the narrow, intentional exception to
-- the generated symbolic-operator firewall: it is precisely the generated
-- authority that constructs Keiki terms. Every other generated module remains
-- subject to the original firewall.
authoritativeScalarModule :: FilePath -> Bool
authoritativeScalarModule path = "/Transducer.hs" `isSuffixOf` path
lineBreaches :: Text -> [Text]
lineBreaches line = case importModule line of
Just _ -> importBreaches line
Nothing -> tokenBreaches (codeTokens line)
where
tokenBreaches = mapMaybe breachFor
breachFor (IdentToken ident)
| ident `elem` forbiddenIdents firewallSurface = Just ident
breachFor (QualifiedToken qualifier)
| qualifier `elem` forbiddenQualifiers firewallSurface = Just (qualifier <> ".*")
breachFor (SymbolToken symbol)
| symbol `elem` forbiddenSymbolic firewallSurface = Just symbol
breachFor _ = Nothing
data CodeToken = IdentToken !Text | QualifiedToken !Text | SymbolToken !Text
codeTokens :: Text -> [CodeToken]
codeTokens = go . T.unpack
where
go [] = []
go ('-' : '-' : _) = []
go ('"' : rest) = go (dropString rest)
go ('\'' : rest) = go (dropChar rest)
go (c : rest)
| isIdentStart c =
let (identTail, afterIdent) = span isIdentContinue rest
ident = T.pack (c : identTail)
in case afterIdent of
'.' : next : more
| isUpper c && isIdentStart next ->
let (_member, afterMember) = span isIdentContinue more
in QualifiedToken ident : go afterMember
_ -> IdentToken ident : go afterIdent
| isSymbolChar c =
let (symbolTail, afterSymbol) = span isSymbolChar rest
in SymbolToken (T.pack (c : symbolTail)) : go afterSymbol
| otherwise = go rest
isIdentStart c = isAlpha c || c == '_'
isIdentContinue c = isAlphaNum c || c == '_' || c == '\''
isSymbolChar c = c `elem` ("!#$%&*+./<=>?@\\^|-~:" :: String)
dropString [] = []
dropString ('\\' : _escaped : rest) = dropString rest
dropString ('"' : rest) = rest
dropString (_ : rest) = dropString rest
dropChar [] = []
dropChar ('\\' : _escaped : rest) = dropChar rest
dropChar ('\'' : rest) = rest
dropChar (_ : rest) = dropChar rest
importBreaches :: Text -> [Text]
importBreaches line = case importModule line of
Nothing -> []
Just imported
| imported `elem` forbiddenImports firewallSurface -> ["import:" <> imported]
| Just allowed <- lookup imported (restrictedImports firewallSurface),
not (hasAllowedExplicitImportList allowed line) ->
["import:" <> imported]
| otherwise -> []
importModule :: Text -> Maybe Text
importModule line = case T.words (T.strip line) of
"import" : rest -> find (T.isPrefixOf "Keiki.") rest
_ -> Nothing
hasAllowedExplicitImportList :: [Text] -> Text -> Bool
hasAllowedExplicitImportList allowed line =
case (T.breakOn "(" line, T.breakOnEnd ")" line) of
((_, open), (close, _))
| not (T.null open) && not (T.null close) ->
let inside = T.takeWhile (/= ')') (T.drop 1 open)
names = filter (not . T.null) (T.split (not . isAlphaNum) inside)
in all (`elem` allowed) names
_ -> False
--------------------------------------------------------------------------------
-- Derived naming
--------------------------------------------------------------------------------
-- | Resolved, denormalized view of an aggregate used by every emitter.
data Agg = Agg
{ aContext :: !Context,
aLanguageContract :: !EffectiveLanguageContract,
aSpec :: !Spec,
aAggregate :: !Aggregate,
aCtxPascal :: !Text,
aName :: !Text,
aLoc :: !Loc,
aVertexType :: !Text,
aIds :: ![IdDecl],
aEnums :: ![EnumDecl],
aRegs :: ![ResolvedRegister],
aStates :: ![StateDecl],
aCommands :: ![ResolvedCtor],
aEvents :: ![ResolvedCtor],
-- | Generated IDs and enums used by this aggregate, in stable name order.
aGeneratedNominals :: ![ResolvedNominalType],
aTransitions :: ![Transition],
aOutputMappings :: !(Map.Map (Int, Int) EventOutputMapping),
aWire :: !WireSpec,
aProjection :: !(Maybe ProjectionSpec),
aSnapshot :: !(Maybe SnapshotSpec),
aFoldFingerprint :: !Text,
aReadModels :: ![ReadModelNode],
aTypeGraph :: !(Maybe TypeGraph),
aSymbols :: !AggregateSymbols,
-- | e.g. @Generated.HospitalCapacity.Reservation@
aGenPrefix :: !Text,
-- | e.g. @HospitalCapacity.Reservation@
aHolePrefix :: !Text
}
aggregateCheckedService :: Agg -> CheckedService
aggregateCheckedService aggregate =
CheckedService
{ checkedLanguageContract = aLanguageContract aggregate,
checkedSpec = aSpec aggregate
}
data ResolvedRegister = ResolvedRegister
{ rrName :: !Name,
rrType :: !ResolvedAggregateType,
rrInitial :: !ResolvedRegisterInitial,
rrLoc :: !Loc
}
deriving stock (Eq, Show)
-- | A command or event constructor with its fully-resolved field types.
data ResolvedCtor = ResolvedCtor
{ rcName :: !Text,
-- | (field name, canonical aggregate type)
rcFields :: ![(Text, ResolvedAggregateType)],
-- | EP-2: schema version (1 for commands and unversioned events).
rcVersion :: !Int,
-- | EP-2: the source version this event migrates from (the upcaster step).
rcUpcastFrom :: !(Maybe Int)
}
defaultWire :: WireSpec
defaultWire = WireSpec {wireKind = "ctorName", wireFields = "camelCase", wireSchemaVersion = 1}
resolveAgg :: Context -> Spec -> Aggregate -> Agg
resolveAgg ctx spec = resolveAggForService ctx (legacyCheckedService spec)
-- | Resolve one aggregate under the service's effective runtime semantics.
resolveAggForService :: Context -> CheckedService -> Aggregate -> Agg
resolveAggForService ctx service agg =
Agg
{ aContext = ctx,
aLanguageContract = checkedLanguageContract service,
aSpec = spec,
aAggregate = agg,
aCtxPascal = ctxPascal,
aName = nm,
aLoc = aggLoc agg,
aVertexType = vertexType,
aIds = specIds spec,
aEnums = specEnums spec,
aRegs = map resolveRegister (aggRegs agg),
aStates = aggStates agg,
aCommands = map resolveCommand (aggCommands agg),
aEvents = map resolveEvent (aggEvents agg),
aGeneratedNominals = generatedNominalsInTypes aggregateResolvedTypes,
aTransitions = aggTransitions agg,
aOutputMappings =
Map.fromList
[ ( (transitionIndex, emitIndex),
orDieOutput (eventOutputMapping spec agg transition emitIndex eventName)
)
| (transitionIndex, transition) <- zip [1 ..] (aggTransitions agg),
(emitIndex, eventName) <- zip [1 ..] (tEmits transition)
],
aWire = fromMaybe defaultWire (aggWire agg),
aProjection = aggProjection agg,
aSnapshot = aggSnapshot agg,
aFoldFingerprint = either (error . T.unpack . renderFoldSurfaceError) id (aggregateFoldFingerprintForService service agg),
aReadModels = [readModel | NReadModel readModel <- specNodes spec],
aTypeGraph = either (const Nothing) Just (resolveTypeGraph spec),
aSymbols = symbols,
aGenPrefix = genPrefixFor ctx nm,
aHolePrefix = holePrefixFor ctx nm
}
where
spec = checkedSpec service
nm = aggName agg
symbols = aggregateSymbols spec
ctxPascal = pascalFromKebab (contextName ctx)
vertexType = nm <> "Vertex"
commandFieldTypes = [(cmdName c, cmdFields c) | c <- aggCommands agg]
resolveCommand c = (mkCtor CommandFieldUse (cmdName c) (cmdFields c)) {rcVersion = 1, rcUpcastFrom = Nothing}
resolveEvent e =
(mkCtor EventFieldUse (evName e) (eventFields e))
{ rcVersion = evVersion e,
rcUpcastFrom = fst <$> evUpcastFrom e
}
where
eventFields ev = case evBody ev of
EventFields fs -> fs
EventFromCommand cn -> fromMaybe [] (lookup cn commandFieldTypes)
mkCtor useSite cn fs =
ResolvedCtor
{ rcName = cn,
rcFields = map (\field -> (aggregateFieldName field, orDie (inferAggregateFieldType symbols agg useSite field))) fs,
rcVersion = 1,
rcUpcastFrom = Nothing
}
aggregateResolvedTypes =
map rrType (map resolveRegister (aggRegs agg))
<> map snd (concatMap rcFields (map resolveCommand (aggCommands agg)))
<> map snd (concatMap rcFields (map resolveEvent (aggEvents agg)))
resolveRegister register =
let resolvedType = orDie (resolveAggregateType symbols (regLoc register) RegisterUse (regType register))
resolvedInitial = orDie (resolveRegisterInitial symbols (regLoc register) resolvedType (regInitial register))
in ResolvedRegister
{ rrName = regName register,
rrType = resolvedType,
rrInitial = resolvedInitial,
rrLoc = regLoc register
}
orDie = either (error . ("validated aggregate resolution failed: " <>) . show) id
orDieOutput = either (error . ("validated aggregate output resolution failed: " <>) . show) id
-- | Keep only generated nominal IDs/enums from a resolved aggregate type list.
-- The map both deduplicates and makes declaration/import order independent of
-- member and field order.
generatedNominalsInTypes :: [ResolvedAggregateType] -> [ResolvedNominalType]
generatedNominalsInTypes resolvedTypes =
Map.elems . Map.fromList $
[ (resolvedNominalName nominal, nominal)
| AggregateNominal nominal <- resolvedTypes,
GeneratedNominal <- [resolvedNominalOwnership nominal]
]
-- | Plan declaration ownership and use closure without emitting text. Parsing
-- and validation already reject malformed declarations; retaining the checked
-- error here keeps this function total for direct library callers.
planNominalGeneration :: Context -> Spec -> Either (NonEmpty NominalTypeError) [NominalGenerationOwner]
planNominalGeneration ctx spec = planNominalGenerationForService ctx (legacyCheckedService spec)
planNominalGenerationForService :: Context -> CheckedService -> Either (NonEmpty NominalTypeError) [NominalGenerationOwner]
planNominalGenerationForService ctx service = do
registry <- resolveNominalTypes spec
let aggregates = [resolveAggForService ctx service aggregate | NAggregate aggregate <- specNodes spec]
generated =
[ nominal
| nominal <- Map.elems (nominalTypes registry),
GeneratedNominal <- [resolvedNominalOwnership nominal]
]
pure
[ NominalGenerationOwner
{ nominalDeclaration = nominal,
nominalModule = generatedNominalModule ctx,
nominalUseSites = Set.fromList (concatMap (usesFor nominal) aggregates),
nominalEqualityUsed = any (nominalEqualityUsedInGeneratedExpressions nominal) aggregates
}
| nominal <- generated
]
where
spec = checkedSpec service
usesFor nominal aggregate =
[ NominalUseSite (aName aggregate) useKind
| useKind <- aggregateUseKinds nominal aggregate
]
nominalEqualityUsedInGeneratedExpressions :: ResolvedNominalType -> Agg -> Bool
nominalEqualityUsedInGeneratedExpressions nominal aggregate =
any (anyTypedExpression comparesNominal) (resolvedGeneratedExpressions aggregate)
where
comparesNominal expression = case typedScalarNode expression of
TypedEqual left _ -> typedScalarType left == AggregateNominal nominal
TypedNotEqual left _ -> typedScalarType left == AggregateNominal nominal
_ -> False
aggregateUseKinds :: ResolvedNominalType -> Agg -> [AggregateUseSite]
aggregateUseKinds nominal aggregate =
nub $
[RegisterUse | nominal `elem` registerNominals]
<> [CommandFieldUse | nominal `elem` commandNominals]
<> [EventFieldUse | nominal `elem` eventNominals]
<> [CodecUse | nominal `elem` eventNominals]
<> [SnapshotUse | hasSnapshot aggregate && nominal `elem` registerNominals]
<> [HarnessSampleUse | nominal `elem` commandNominals || nominal `elem` eventNominals]
<> [HaskellLoweringUse | nominal `elem` aGeneratedNominals aggregate]
where
registerNominals = generatedNominalsInTypes (map rrType (aRegs aggregate))
commandNominals = generatedNominalsInTypes (map snd (concatMap rcFields (aCommands aggregate)))
eventNominals = generatedNominalsInTypes (map snd (concatMap rcFields (aEvents aggregate)))
--------------------------------------------------------------------------------
-- Entry point
--------------------------------------------------------------------------------
-- | Emit the context-level private structural stratum. Shape modules contain
-- only generated wire representations. The projection facade contains only
-- schema-derived Keiki field witnesses; neither layer owns consumer behavior.
scaffoldStructural :: Context -> Spec -> [ScaffoldModule]
scaffoldStructural ctx spec = scaffoldStructuralForService ctx (legacyCheckedService spec)
scaffoldStructuralForService :: Context -> CheckedService -> [ScaffoldModule]
scaffoldStructuralForService ctx service = map fst (scaffoldStructuralOwnersForService ctx service)
-- | 'scaffoldStructural' paired with the mapped declarations each module was
-- emitted for. A shape module names exactly one declaration; a binding skeleton
-- names every declaration whose obligations it carries (several declarations may
-- share one leaf binding module); the projection facade names __none__, because it
-- is emitted once for the whole context from the complete resolved graph.
--
-- This is the attribution seam whole-workspace scaffolding needs: a workspace
-- emits from one merged spec, and this list says which declaration — and therefore
-- which member file — produced each structural module, without parsing the
-- human-readable 'origin' string.
scaffoldStructuralOwners :: Context -> Spec -> [(ScaffoldModule, [Name])]
scaffoldStructuralOwners ctx spec = scaffoldStructuralOwnersForService ctx (legacyCheckedService spec)
scaffoldStructuralOwnersForService :: Context -> CheckedService -> [(ScaffoldModule, [Name])]
scaffoldStructuralOwnersForService ctx service = case resolveTypeGraph (checkedSpec service) of
Left _ -> []
Right graph ->
[(shapeModule ctx graph entry, [sdName (fst entry)]) | entry <- structural]
<> projectionModules
<> generatedNominalOwners ctx service
<> nominalRepresentationOwners ctx spec
<> nominalProjectionOwners ctx service
<> bindingSkeletonOwners ctx spec graph
where
structural =
[ (declaration, shape)
| ResolvedStructural declaration shape <- Map.elems (tgDeclarations graph)
]
projectionModules =
[ ( ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (structuralProjectionModule ctx) <> ".hs"),
moduleText = emitStructuralProjections ctx graph,
kind = Generated,
origin = "context " <> specContext spec <> " mapped structural facade"
},
[]
)
| not (null (projectionSpecs graph))
]
spec = checkedSpec service
-- | Plan one opt-in, non-production historical-codec comparison module.
--
-- The module is intentionally absent from 'scaffoldStructural' and therefore
-- from production manifests and scaffold records. It must be requested by name
-- and is compiled only by consumer-owned test/tool components.
codecComparisonModule :: Context -> Spec -> Name -> Either Text ScaffoldModule
codecComparisonModule ctx spec requestedName = do
graph <- either (Left . ("mapped type graph did not resolve: " <>) . T.pack . show) Right (resolveTypeGraph spec)
(declaration, shape) <- case Map.lookup (MappedKey requestedName) (tgDeclarations graph) of
Nothing -> Left ("codec comparison target is not a mapped declaration: " <> requestedName)
Just (ResolvedOpaque _) ->
Left
( "codec comparison target "
<> requestedName
<> " is opaque; finite evidence must never upgrade an opaque declaration to a structural claim"
)
Just (ResolvedStructural declaration shape) -> Right (declaration, shape)
owner <- case sortOn aggName (comparisonOwners declaration) of
[] ->
Left
( "codec comparison target "
<> requestedName
<> " is not reachable from a persisted private event payload"
)
aggregate : _ -> Right aggregate
let moduleName = structuralPrefix ctx <> ".CodecCompare." <> requestedName
pure
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" moduleName <> ".hs"),
moduleText = emitCodecComparison ctx moduleName graph declaration shape owner,
kind = Generated,
origin = "non-production codec comparison " <> requestedName
}
where
comparisonOwners declaration =
[ aggregate
| NAggregate aggregate <- specNodes spec,
let resolved = resolveAgg ctx spec aggregate,
any ((== sdName declaration) . mappedName) (codecMappedDeclarations resolved)
]
where
mappedName (ResolvedStructural structural _) = sdName structural
mappedName (ResolvedOpaque opaque) = odName opaque
codecComparisonBanner :: Text
codecComparisonBanner =
"-- @generated by keiro-dsl codec comparison; non-production migration evidence; do not edit."
emitCodecComparison :: Context -> Text -> TypeGraph -> StructuralDecl -> ResolvedMappedShape -> Aggregate -> Text
emitCodecComparison ctx moduleName graph declaration shape owner =
nl
[ "",
codecComparisonBanner,
"-- This module compares historical and generated codecs in consumer-owned tests only.",
"-- It is never a runtime fallback and never changes the generated codec's authority.",
"module " <> moduleName <> " (compareWithHistorical) where",
"",
"import Control.Monad (filterM)",
"import Data.Aeson (Value)",
"import Data.Aeson qualified as Aeson",
"import Data.List (sort)",
"import Data.List.NonEmpty qualified as NonEmpty",
"import Data.Text (Text)",
"import Data.Text qualified",
"import " <> codecModule <> " qualified as GeneratedCodec",
"import Keiro.Codec.Structural (FixtureCases (..))",
"import Keiro.Dsl.CodecCompare",
"import Keiro.Dsl.TypeGraph (BindingVersion (..), CanonicalTypeId (..), QualifiedValueName (..))",
"import System.Directory (doesFileExist, listDirectory)",
"import System.FilePath (takeExtension, (</>))",
"",
"import " <> fixtureModule <> " qualified as ConsumerFixtures",
"import " <> hsModule (sdHaskell declaration) <> " qualified as ConsumerDomain",
"",
"compareWithHistorical :: HistoricalCodec " <> domainType <> " -> FilePath -> IO CompareReport",
"compareWithHistorical historicalCodec goldenDirectory = do",
" names <- sort . filter ((== \".json\") . takeExtension) <$> listDirectory goldenDirectory",
" files <- filterM doesFileExist [goldenDirectory </> name | name <- names]",
" loaded <- traverse (loadGolden historicalCodec) files",
" let inputIssues = [issue | Left issue <- loaded]",
" entries = [entry | Right entry <- loaded]",
" typedCases = NonEmpty.toList (fixtureCases ConsumerFixtures." <> fixtureSymbol <> ")",
" encodeObservations =",
" [ EncodeObservation label (hcEncode historicalCodec value) (GeneratedCodec.encode" <> name <> "Mapped value)",
" | (label, value) <- typedCases",
" ]",
" decodeObservations = [observation | (observation, _) <- entries]",
" typedObserved =",
" concat",
" [ observedBranchesFor FromBinding branchSchema (GeneratedCodec.encode" <> name <> "Mapped value)",
" | (_, value) <- typedCases",
" ]",
" historicalObserved =",
" concat [observedBranchesFor HistoricalGolden branchSchema value | (_, values) <- entries, value <- values]",
" declared = declaredBranchesFor FromBinding branchSchema <> declaredBranchesFor HistoricalGolden branchSchema",
" provenance =",
" CompareProvenance",
" { cpHistoricalCodecIdentity = hcIdentity historicalCodec",
" , cpHistoricalCodecVersion = hcVersion historicalCodec",
" , cpCanonicalType = CanonicalTypeId " <> tshow (unCanonicalTypeId (sdCanonical declaration)),
" , cpBindingSymbol = QualifiedValueName " <> tshow (unQualifiedValueName (sdBinding declaration)),
" , cpBindingVersion = BindingVersion " <> tshow (unBindingVersion (sdBindingVersion declaration)),
" , cpWireFingerprint = " <> tshow (wireFingerprint graph name),
" }",
" pure (compareReport provenance inputIssues (encodeObservations <> decodeObservations) declared (typedObserved <> historicalObserved))",
"",
"loadGolden :: HistoricalCodec " <> domainType <> " -> FilePath -> IO (Either CompareInputIssue (CompareObservation, [Value]))",
"loadGolden historicalCodec path = do",
" decoded <- Aeson.eitherDecodeFileStrict path",
" pure $ case decoded of",
" Left reason -> Left (HistoricalGoldenUnreadable path (fromString reason))",
" Right inputValue ->",
" let historicalDecoded = hcDecode historicalCodec inputValue",
" historicalOutcome = normalizeDecode historicalDecoded",
" generatedOutcome = normalizeDecode (GeneratedCodec.decode" <> name <> "Mapped inputValue)",
" observation = DecodeObservation path inputValue historicalOutcome generatedOutcome",
" coveredValues = case historicalDecoded of",
" Right value -> [inputValue, GeneratedCodec.encode" <> name <> "Mapped value]",
" Left _ -> []",
" in Right (observation, coveredValues)",
"",
"normalizeDecode :: Either Text " <> domainType <> " -> DecodeOutcome",
"normalizeDecode = either DecodeFailed (DecodedShape . GeneratedCodec.encode" <> name <> "Mapped)",
"",
"fromString :: String -> Text",
"fromString = Data.Text.pack",
"",
"branchSchema :: BranchSchema",
"branchSchema = " <> renderBranchSchema (branchSchemaFor graph (ResolvedStructural declaration shape))
]
where
name = sdName declaration
domainType = "ConsumerDomain." <> hsType (sdHaskell declaration)
codecModule = genPrefixFor ctx (aggName owner) <> ".Codec"
fixtureModule = qualifiedModule (sdFixtures declaration)
fixtureSymbol = lastSegment (unQualifiedValueName (sdFixtures declaration))
branchSchemaFor :: TypeGraph -> ResolvedMappedDecl -> BranchSchema
branchSchemaFor graph =
foldMappedDecl
MappedDeclAlgebra
{ onStructuralDecl = \_ shape ->
foldMappedShape
MappedShapeAlgebra
{ onRecord = \_ _ fields ->
BranchRecord
[ BranchField
(rwfKey field)
(rwfPresence field == POptional)
(branchExpr graph (rwfType field))
| field <- fields
],
onEnum = const BranchScalar,
onUnion = \encoding arms ->
BranchUnion
(ueTagField encoding)
(ueContentsField encoding)
[BranchArm (rwaTag arm) (branchExpr graph <$> rwaPayload arm) | arm <- arms]
}
shape,
onOpaqueDecl = const BranchScalar
}
branchExpr :: TypeGraph -> ResolvedTypeExpr -> BranchSchema
branchExpr graph =
foldTypeExpr
TypeExprAlgebra
{ onText = BranchScalar,
onInt = BranchScalar,
onInteger = BranchScalar,
onBool = BranchScalar,
onNatural = BranchScalar,
onTime = BranchScalar,
onJson = BranchScalar,
onOptional = BranchOptional,
onList = BranchList,
onMap = BranchMap,
onRef = \key -> maybe BranchScalar (branchSchemaFor graph) (Map.lookup key (tgDeclarations graph))
}
renderBranchSchema :: BranchSchema -> Text
renderBranchSchema schema = case schema of
BranchScalar -> "BranchScalar"
BranchOptional nested -> "BranchOptional (" <> renderBranchSchema nested <> ")"
BranchList nested -> "BranchList (" <> renderBranchSchema nested <> ")"
BranchMap nested -> "BranchMap (" <> renderBranchSchema nested <> ")"
BranchRecord fields ->
"BranchRecord ["
<> T.intercalate
", "
[ "BranchField "
<> tshow (bfWireKey field)
<> " "
<> (if bfPresenceOptional field then "True" else "False")
<> " ("
<> renderBranchSchema (bfSchema field)
<> ")"
| field <- fields
]
<> "]"
BranchUnion tagField contentsField arms ->
"BranchUnion "
<> tshow tagField
<> " "
<> tshow contentsField
<> " ["
<> T.intercalate
", "
[ "BranchArm "
<> tshow (baWireTag arm)
<> " "
<> maybe "Nothing" (\nested -> "(Just (" <> renderBranchSchema nested <> "))") (baPayloadSchema arm)
| arm <- arms
]
<> "]"
-- | Emit one create-once consumer module per distinct qualified obligation
-- owner. Multiple mapped declarations may intentionally share a leaf binding
-- module, so grouping happens by module rather than by declaration.
bindingSkeletonModules :: Context -> Spec -> TypeGraph -> [ScaffoldModule]
bindingSkeletonModules ctx spec graph = map fst (bindingSkeletonOwners ctx spec graph)
-- | 'bindingSkeletonModules' paired with the mapped declarations whose
-- obligations each skeleton carries, in first-appearance order. A skeleton shared
-- by declarations from different member files therefore names all of them, which
-- is what lets whole-workspace scaffolding treat it as context-level rather than
-- attributing it to an arbitrary member.
bindingSkeletonOwners :: Context -> Spec -> TypeGraph -> [(ScaffoldModule, [Name])]
bindingSkeletonOwners ctx spec graph = case bindingObligations spec of
Left _ -> []
Right obligations ->
[ (emitBindingSkeleton ctx spec graph owner entries, nub (map obligationMappedName entries))
| (owner, entries) <- Map.toAscList (Map.fromListWith (<>) [(obligationModule obligation, [obligation]) | obligation <- obligations])
]
emitBindingSkeleton :: Context -> Spec -> TypeGraph -> Text -> [BindingObligation] -> ScaffoldModule
emitBindingSkeleton ctx spec graph owner obligations =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" owner <> ".hs"),
moduleText =
nl $
[ "{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE LambdaCase #-}",
"",
"-- This is a HAND-OWNED consumer binding skeleton. keiro-dsl creates it once",
"-- and never overwrites it. Fill each HOLE and run the generated harness.",
"module " <> owner <> " ("
]
<> exportLines
<> [") where", ""]
<> map ("import " <>) imports
<> [""]
<> intercalateBlank (map renderObligation obligations),
kind = HoleStub,
origin = "consumer binding skeleton " <> owner
}
where
exportLines =
[ (if index == (0 :: Int) then " " else " , ") <> obligationSymbol obligation
| (index, obligation) <- zip [0 ..] obligations
]
imports =
sort . nub $
[ hsModule (sdHaskell declaration) <> " qualified"
| obligation <- obligations,
Just (declaration, _) <- [structuralFor obligation]
]
<> [ structuralShapeModule ctx (sdName declaration) <> " qualified"
| obligation <- obligations,
obligationKind obligation == BindingValue,
Just (declaration, _) <- [structuralFor obligation]
]
<> [ "Keiro.Codec.Structural (FixtureCases, StructuralBinding (..))"
| any (\obligation -> obligationCategory obligation == "structural" && obligationKind obligation `elem` [BindingValue, FixtureValue]) obligations
]
<> [ hsModule (consumerNominalHaskell binding) <> " qualified"
| obligation <- obligations,
Just (_, binding) <- [nominalFor obligation]
]
<> [ nominalRepresentationModule ctx (resolvedNominalName nominal) <> " qualified"
| obligation <- obligations,
obligationKind obligation == BindingValue,
Just (nominal, _) <- [nominalFor obligation],
EnumRepresentation {} <- [resolvedNominalRepresentation nominal]
]
<> [ "Keiro.Codec.Nominal (NominalBinding (..), NominalFixtureCases)"
| any ((/= "structural") . obligationCategory) obligations
]
<> [ "Data.KindID (KindID)"
| obligation <- obligations,
Just (nominal, _) <- [nominalFor obligation],
IdRepresentation {} <- [resolvedNominalRepresentation nominal]
]
<> [ "Data.Text (Text)"
| obligation <- obligations,
Just (nominal, _) <- [nominalFor obligation],
ScalarRepresentation NominalText <- [resolvedNominalRepresentation nominal]
]
<> [ "Data.Time (UTCTime)"
| obligation <- obligations,
Just (nominal, _) <- [nominalFor obligation],
ScalarRepresentation NominalTime <- [resolvedNominalRepresentation nominal]
]
<> [ "Numeric.Natural (Natural)"
| obligation <- obligations,
Just (nominal, _) <- [nominalFor obligation],
ScalarRepresentation NominalNatural <- [resolvedNominalRepresentation nominal]
]
renderObligation obligation = case structuralFor obligation of
Nothing -> case nominalFor obligation of
Just (nominal, _) -> renderNominalObligation nominal obligation
Nothing -> ["-- HOLE: declaration disappeared before skeleton rendering"]
Just (declaration, shape) -> case obligationKind obligation of
BindingValue -> renderBinding ctx declaration shape obligation
FixtureValue ->
[ "-- HOLE: provide deterministic labelled conformance fixtures for " <> sdName declaration,
obligationSignature obligation,
obligationSymbol obligation <> " = error " <> tshow ("HOLE: fill " <> sdName declaration <> " fixtures")
]
InitialValue ->
[ "-- HOLE: provide the initial register value for " <> sdName declaration,
obligationSignature obligation,
obligationSymbol obligation <> " = error " <> tshow ("HOLE: fill " <> sdName declaration <> " initial value")
]
structuralFor obligation = case Map.lookup (MappedKey (obligationMappedName obligation)) (tgDeclarations graph) of
Just (ResolvedStructural declaration shape) -> Just (declaration, shape)
_ -> Nothing
nominalFor obligation = do
registry <- either (const Nothing) Just (resolveNominalTypes spec)
nominal <- lookupNominalType (obligationMappedName obligation) registry
binding <- case resolvedNominalOwnership nominal of
ConsumerNominal value -> Just value
GeneratedNominal -> Nothing
pure (nominal, binding)
renderNominalObligation nominal obligation = case obligationKind obligation of
BindingValue ->
[ "-- HOLE: complete both total directions; the generated codec remains wire authority.",
obligationSignature obligation,
obligationSymbol obligation <> " =",
" NominalBinding",
" { nominalToRepresentation = \\_domainValue -> error " <> tshow ("HOLE: fill " <> resolvedNominalName nominal <> " nominalToRepresentation"),
" , nominalFromRepresentation = \\_representationValue -> error " <> tshow ("HOLE: fill " <> resolvedNominalName nominal <> " nominalFromRepresentation"),
" }"
]
FixtureValue ->
[ "-- HOLE: provide deterministic labelled expected-wire fixtures for " <> resolvedNominalName nominal,
obligationSignature obligation,
obligationSymbol obligation <> " = error " <> tshow ("HOLE: fill " <> resolvedNominalName nominal <> " fixtures")
]
InitialValue ->
[ "-- HOLE: provide the initial register value for " <> resolvedNominalName nominal,
obligationSignature obligation,
obligationSymbol obligation <> " = error " <> tshow ("HOLE: fill " <> resolvedNominalName nominal <> " initial value")
]
intercalateBlank [] = []
intercalateBlank (section : rest) = section <> concatMap ("" :) rest
renderBinding :: Context -> StructuralDecl -> ResolvedMappedShape -> BindingObligation -> [Text]
renderBinding ctx declaration shape obligation =
[ "-- HOLE: complete both total directions; wire policy remains in the generated codec.",
obligationSymbol obligation <> " :: StructuralBinding " <> domainType <> " " <> shapeType,
obligationSymbol obligation <> " =",
" StructuralBinding",
" { bindingToShape = \\case"
]
<> indentCases (bindingCases True)
<> [" , bindingFromShape = \\case"]
<> indentCases (bindingCases False)
<> [" }"]
where
domainModule = hsModule (sdHaskell declaration)
domainType = domainModule <> "." <> hsType (sdHaskell declaration)
shapeModuleName = structuralShapeModule ctx (sdName declaration)
shapeType = shapeModuleName <> "." <> sdName declaration <> "Shape"
domainCtor constructor = domainModule <> "." <> constructor
shapeCtor constructor = shapeModuleName <> "." <> constructor
indentCases = map (" " <>)
bindingCases toShapeDirection =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \constructor _ fields -> [recordCase toShapeDirection constructor fields],
onEnum = \entries -> map (enumCase toShapeDirection . weCtor) entries,
onUnion = \_ arms -> map (unionCase toShapeDirection) arms
}
shape
recordCase toShapeDirection constructor fields =
sourceCtor
<> arguments variables
<> " -> "
<> targetCtor
<> arguments (map (holeFor toShapeDirection . rwfHaskell) fields)
where
variables = map (("_" <>) . (<> "Value") . rwfHaskell) fields
sourceCtor = if toShapeDirection then domainCtor constructor else shapeCtor constructor
targetCtor = if toShapeDirection then shapeCtor constructor else domainCtor constructor
enumCase toShapeDirection constructor =
sourceCtor <> " -> " <> holeFor toShapeDirection constructor
where
sourceCtor = if toShapeDirection then domainCtor constructor else shapeCtor constructor
unionCase toShapeDirection arm =
sourceCtor
<> maybe "" (const " _payloadValue") (rwaPayload arm)
<> " -> "
<> case rwaPayload arm of
Nothing -> holeFor toShapeDirection (rwaCtor arm)
Just _ -> targetCtor <> " " <> holeFor toShapeDirection (rwaCtor arm <> ".payload")
where
sourceCtor = if toShapeDirection then domainCtor (rwaCtor arm) else shapeCtor (rwaCtor arm)
targetCtor = if toShapeDirection then shapeCtor (rwaCtor arm) else domainCtor (rwaCtor arm)
arguments [] = ""
arguments values = " " <> T.unwords values
holeFor toShapeDirection fieldName =
"(error "
<> tshow
( "HOLE: fill "
<> sdName declaration
<> (if toShapeDirection then " bindingToShape." else " bindingFromShape.")
<> fieldName
)
<> ")"
shapeModule :: Context -> TypeGraph -> (StructuralDecl, ResolvedMappedShape) -> ScaffoldModule
shapeModule ctx graph (declaration, shape) =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (structuralShapeModule ctx (sdName declaration)) <> ".hs"),
moduleText = emitShape ctx graph declaration shape,
kind = Generated,
origin = nodeOrigin "mapped structural" (sdName declaration) (sdLoc declaration)
}
structuralPrefix :: Context -> Text
structuralPrefix ctx = case placement ctx of
GeneratedPrefix -> rootPrefix ctx <> "Generated." <> ctxPascalOf ctx <> ".Structural"
CollocatedLeaf -> rootPrefix ctx <> ctxPascalOf ctx <> ".Generated.Structural"
structuralShapeModule :: Context -> Name -> Text
structuralShapeModule ctx name = structuralPrefix ctx <> ".Shape." <> name
nominalRepresentationModule :: Context -> Name -> Text
nominalRepresentationModule ctx name = case placement ctx of
GeneratedPrefix -> rootPrefix ctx <> "Generated." <> ctxPascalOf ctx <> ".Nominal.Shape." <> name
CollocatedLeaf -> rootPrefix ctx <> ctxPascalOf ctx <> ".Nominal.Shape." <> name <> ".Generated"
-- | Emit the one generated nominal authority for the complete context. The
-- empty declaration attribution is intentional: in a workspace this module is
-- context-level even when all declarations currently happen to live in one
-- member, so moving that member cannot move Haskell type ownership.
generatedNominalOwners :: Context -> CheckedService -> [(ScaffoldModule, [Name])]
generatedNominalOwners ctx service = case planNominalGenerationForService ctx service of
Left _ -> []
Right [] -> []
Right owners ->
[ ( ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (generatedNominalModule ctx) <> ".hs"),
moduleText = emitGeneratedNominals languageContract ctx owners,
kind = Generated,
origin = "context " <> specContext spec <> " generated nominal declarations"
},
[]
)
]
<> [ ( ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (generatedNominalInternalModule ctx) <> ".hs"),
moduleText = emitGeneratedNominalInternals ctx enforcingIds,
kind = Generated,
origin = "context " <> specContext spec <> " generated nominal ID internals"
},
[]
)
| not (null enforcingIds)
]
where
enforcingIds =
[ (nominal, contract)
| owner <- owners,
let nominal = nominalDeclaration owner,
IdRepresentation prefix <- [resolvedNominalRepresentation nominal],
Just contract <- [idDomainContractFor languageContract prefix]
]
where
spec = checkedSpec service
languageContract = checkedLanguageContract service
generatedNominalInternalModule :: Context -> Text
generatedNominalInternalModule ctx = generatedNominalModule ctx <> ".Internal"
emitGeneratedNominals :: EffectiveLanguageContract -> Context -> [NominalGenerationOwner] -> Text
emitGeneratedNominals languageContract ctx owners =
nl
( equalityPragmas
<> [ "{-# LANGUAGE DeriveAnyClass #-}",
"{-# LANGUAGE DeriveGeneric #-}",
"{-# LANGUAGE LambdaCase #-}",
generatedBanner,
moduleHeader,
"",
"import Data.Aeson (FromJSON, ToJSON)",
"import Data.Text (Text)",
"import GHC.Generics (Generic)",
"import Keiki.Shape (CanonicalTypeName)"
]
<> internalImports
<> equalityImports
<> [ "",
sectionsOf [map emitOwner owners]
]
)
where
usesEquality = any nominalEqualityUsed owners
usesExactEquality = any (\owner -> nominalEqualityUsed owner && exactOwner (nominalDeclaration owner)) owners
enforcingIds =
[ nominal
| owner <- owners,
let nominal = nominalDeclaration owner,
IdRepresentation prefix <- [resolvedNominalRepresentation nominal],
Just _ <- [idDomainContractFor languageContract prefix]
]
moduleHeader
| null enforcingIds = "module " <> generatedNominalModule ctx <> " where"
| otherwise =
nl
[ "module " <> generatedNominalModule ctx,
" ( " <> T.intercalate "\n , " (concatMap ownerExports owners),
" ) where"
]
ownerExports owner =
baseExports <> equalityExports
where
nominal = nominalDeclaration owner
name = resolvedNominalName nominal
baseExports = case resolvedNominalRepresentation nominal of
IdRepresentation prefix
| Just _ <- idDomainContractFor languageContract prefix ->
[name, "parse" <> name, "mk" <> name, nominalTextName nominal]
_ -> [name <> " (..)", nominalTextName nominal]
equalityExports =
if nominalEqualityUsed owner
then [nominalEqualityTagName nominal, nominalEqualityWitnessName nominal]
else []
equalityPragmas =
if usesEquality
then
[ "{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE TypeApplications #-}",
"{-# LANGUAGE TypeFamilies #-}"
]
else []
equalityImports =
["import Keiki.Core (ExactFieldProjection (..), FieldProjection (..), FieldWitness, exactFieldWitness, fieldWitness)" | usesEquality]
<> ["import Data.List.NonEmpty (NonEmpty (..))" | usesExactEquality]
<> ["import Keiki.ProjectionDomain (finiteProjectionDomain)" | usesExactEquality && null enforcingIds]
<> ["import Keiki.ProjectionDomain (TextPattern, finiteProjectionDomain, textProjectionDomain)" | usesExactEquality && not (null enforcingIds)]
<> ["import Keiro.Codec.IdDomain (idDomainTextPattern, typeIdV7Domain)" | not (null enforcingIds)]
internalImports =
[ "import "
<> generatedNominalInternalModule ctx
<> " ("
<> T.intercalate
", "
(concatMap (\nominal -> [resolvedNominalName nominal, "mk" <> resolvedNominalName nominal, "parse" <> resolvedNominalName nominal, nominalTextName nominal]) enforcingIds)
<> ")"
| not (null enforcingIds)
]
emitOwner owner = emitGeneratedNominal languageContract (nominalEqualityUsed owner) (nominalDeclaration owner)
exactOwner nominal = case resolvedNominalRepresentation nominal of
EnumRepresentation {} -> True
IdRepresentation prefix -> isJust (idDomainContractFor languageContract prefix)
ScalarRepresentation {} -> False
emitGeneratedNominal :: EffectiveLanguageContract -> Bool -> ResolvedNominalType -> Text
emitGeneratedNominal languageContract equalityUsed nominal = case resolvedNominalRepresentation nominal of
IdRepresentation prefix
| Just _ <- idDomainContractFor languageContract prefix ->
nl $
["instance CanonicalTypeName " <> name]
<> equalitySection
IdRepresentation {} ->
nl $
[ "newtype " <> name <> " = " <> name <> " Text",
" deriving stock (Generic, Eq, Ord, Show)",
" deriving anyclass (ToJSON, FromJSON)",
"",
"instance CanonicalTypeName " <> name,
"",
nominalTextName nominal <> " :: " <> name <> " -> Text",
nominalTextName nominal <> " (" <> name <> " value) = value"
]
<> equalitySection
EnumRepresentation constructors ->
nl $
[ "data " <> name <> " = " <> T.intercalate " | " (map fst (NE.toList constructors)),
" deriving stock (Generic, Eq, Ord, Show, Enum, Bounded)",
" deriving anyclass (ToJSON, FromJSON)",
"",
"instance CanonicalTypeName " <> name,
"",
nominalTextName nominal <> " :: " <> name <> " -> Text",
nominalTextName nominal <> " = \\case",
nl [" " <> constructor <> " -> " <> tshow wire | (constructor, wire) <- NE.toList constructors]
]
<> equalitySection
ScalarRepresentation {} ->
error "generated nominal scalar reached generated declaration emission"
where
name = resolvedNominalName nominal
equalitySection = if equalityUsed then ["", emitGeneratedNominalEquality languageContract nominal] else []
emitGeneratedNominalEquality :: EffectiveLanguageContract -> ResolvedNominalType -> Text
emitGeneratedNominalEquality languageContract nominal =
nl $
[ "data " <> tagName,
"",
"instance FieldProjection " <> tagName <> " where",
" type FieldName " <> tagName <> " = " <> tshow name,
" type FieldOwner " <> tagName <> " = " <> name,
" type FieldResult " <> tagName <> " = Text",
" fieldShapeId _ = " <> tshow equalityIdentity,
" projectFieldValue _ = " <> nominalTextName nominal
]
<> exactInstance
<> [ "",
witnessName <> " :: FieldWitness " <> tagName,
witnessName <> " = " <> witnessConstructor <> " @" <> tagName
]
where
name = resolvedNominalName nominal
tagName = nominalEqualityTagName nominal
witnessName = nominalEqualityWitnessName nominal
equalityIdentity = fromMaybe (error "generated nominal equality contract missing") (nominalEqualityIdentityForService languageContract nominal)
(exactInstance, witnessConstructor) = case resolvedNominalRepresentation nominal of
IdRepresentation prefix -> case idDomainContractFor languageContract prefix of
Nothing -> ([], "fieldWitness")
Just _ ->
( [ "",
patternName <> " :: TextPattern",
patternName <> " = either (error . show) id (idDomainTextPattern (typeIdV7Domain " <> tshow prefix <> "))",
"",
"instance ExactFieldProjection " <> tagName <> " where",
" fieldProjectionDomain _ = textProjectionDomain " <> patternName,
" reconstructFieldOwner _ = either (const Nothing) Just . parse" <> name
],
"exactFieldWitness"
)
EnumRepresentation constructors ->
( [ "",
"instance ExactFieldProjection " <> tagName <> " where",
" fieldProjectionDomain _ = finiteProjectionDomain (" <> renderNonEmpty (map (tshow . snd) (NE.toList constructors)) <> ")",
" reconstructFieldOwner _ = \\case"
]
<> [" " <> tshow wire <> " -> Just " <> constructor | (constructor, wire) <- NE.toList constructors]
<> [" _ -> Nothing"],
"exactFieldWitness"
)
ScalarRepresentation {} -> error "generated nominal scalar equality emission"
patternName = lowerFirst name <> "IdDomainPattern"
emitGeneratedNominalInternals :: Context -> [(ResolvedNominalType, IdDomainContract)] -> Text
emitGeneratedNominalInternals ctx nominals =
nl
[ "{-# LANGUAGE DeriveGeneric #-}",
generatedBanner,
"module " <> generatedNominalInternalModule ctx,
" ( " <> T.intercalate "\n , " (concatMap exportsFor nominals),
" ) where",
"",
"import Data.Aeson (FromJSON (..), ToJSON (..), withText)",
"import Data.Text (Text)",
"import Data.Text qualified as T",
"import GHC.Generics (Generic)",
"import Keiro.Codec.IdDomain (typeIdV7Domain, validateIdDomainText)",
"",
sectionsOf [map emitInternal nominals]
]
where
exportsFor (nominal, _) =
[ resolvedNominalName nominal,
"parse" <> resolvedNominalName nominal,
"mk" <> resolvedNominalName nominal,
nominalTextName nominal,
legacyNominalConstructorName nominal
]
emitInternal (nominal, contract) =
nl
[ "newtype " <> name <> " = " <> name <> " Text",
" deriving stock (Generic, Eq, Ord, Show)",
"",
"instance ToJSON " <> name <> " where",
" toJSON = toJSON . " <> textName,
"",
"instance FromJSON " <> name <> " where",
" parseJSON = withText " <> tshow name <> " (either (fail . T.unpack) pure . parse" <> name <> ")",
"",
"parse" <> name <> " :: Text -> Either Text " <> name,
"parse" <> name <> " input = case validateIdDomainText (typeIdV7Domain " <> tshow (idDomainPrefix contract) <> ") input of",
" Left reason -> Left (T.pack (show reason))",
" Right () -> Right (" <> name <> " input)",
"",
"mk" <> name <> " :: Text -> Either Text " <> name,
"mk" <> name <> " = parse" <> name,
"",
textName <> " :: " <> name <> " -> Text",
textName <> " (" <> name <> " value) = value",
"",
legacyNominalConstructorName nominal <> " :: Text -> " <> name,
legacyNominalConstructorName nominal <> " = " <> name
]
where
name = resolvedNominalName nominal
textName = nominalTextName nominal
nominalEqualityTagName :: ResolvedNominalType -> Text
nominalEqualityTagName nominal = resolvedNominalName nominal <> "EqualityProjection"
nominalEqualityWitnessName :: ResolvedNominalType -> Text
nominalEqualityWitnessName nominal = lowerFirst (resolvedNominalName nominal) <> "EqualityWitness"
renderNonEmpty :: [Text] -> Text
renderNonEmpty values = case values of
[] -> error "cannot render an empty exact projection domain"
firstValue : rest -> firstValue <> " :| [" <> T.intercalate ", " rest <> "]"
nominalTextName :: ResolvedNominalType -> Text
nominalTextName = (<> "Text") . lowerFirst . resolvedNominalName
-- | Explicit type/constructor imports for exactly the generated declarations a
-- generated aggregate module uses. Keeping an import list avoids making every
-- aggregate depend on every service declaration merely because they share the
-- one owner module.
generatedNominalTypeImports :: Context -> [ResolvedNominalType] -> [Text]
generatedNominalTypeImports _ [] = []
generatedNominalTypeImports ctx nominals =
[ "import "
<> generatedNominalModule ctx
<> " ("
<> T.intercalate ", " [resolvedNominalName nominal <> " (..)" | nominal <- stableNominals nominals]
<> ")"
]
generatedNominalTypeImportsForService :: CheckedService -> Context -> [ResolvedNominalType] -> [Text]
generatedNominalTypeImportsForService _ _ [] = []
generatedNominalTypeImportsForService service ctx nominals =
[ "import "
<> generatedNominalModule ctx
<> " ("
<> T.intercalate ", " (concatMap importsFor (stableNominals nominals))
<> ")"
]
where
importsFor nominal = case resolvedNominalRepresentation nominal of
IdRepresentation prefix
| Just _ <- idDomainContractFor (checkedLanguageContract service) prefix ->
[resolvedNominalName nominal, "parse" <> resolvedNominalName nominal]
_ -> [resolvedNominalName nominal <> " (..)"]
generatedNominalCodecImports :: CheckedService -> Context -> [ResolvedNominalType] -> [Text]
generatedNominalCodecImports _ _ [] = []
generatedNominalCodecImports service ctx nominals =
[ "import "
<> generatedNominalModule ctx
<> " ("
<> T.intercalate
", "
( concat
[ [typeImport nominal, nominalTextName nominal]
| nominal <- stableNominals nominals
]
)
<> ")"
]
<> [ "import "
<> generatedNominalInternalModule ctx
<> " ("
<> T.intercalate ", " [legacyNominalConstructorName nominal | nominal <- enforcingIds]
<> ")"
| not (null enforcingIds)
]
where
typeImport nominal = case resolvedNominalRepresentation nominal of
IdRepresentation prefix
| Just _ <- idDomainContractFor (checkedLanguageContract service) prefix -> resolvedNominalName nominal
_ -> resolvedNominalName nominal <> " (..)"
enforcingIds =
[ nominal
| nominal <- stableNominals nominals,
IdRepresentation prefix <- [resolvedNominalRepresentation nominal],
Just _ <- [idDomainContractFor (checkedLanguageContract service) prefix]
]
legacyNominalConstructorName :: ResolvedNominalType -> Text
legacyNominalConstructorName nominal = "unsafe" <> resolvedNominalName nominal <> "FromLegacyText"
stableNominals :: [ResolvedNominalType] -> [ResolvedNominalType]
stableNominals = Map.elems . Map.fromList . map (\nominal -> (resolvedNominalName nominal, nominal))
nominalRepresentationOwners :: Context -> Spec -> [(ScaffoldModule, [Name])]
nominalRepresentationOwners ctx spec = case resolveNominalTypes spec of
Left _ -> []
Right registry ->
[ (nominalRepresentationModuleValue ctx nominal constructors, [resolvedNominalName nominal])
| nominal <- Map.elems (nominalTypes registry),
ConsumerNominal {} <- [resolvedNominalOwnership nominal],
EnumRepresentation constructors <- [resolvedNominalRepresentation nominal]
]
nominalRepresentationModuleValue :: Context -> ResolvedNominalType -> NonEmpty (Name, Text) -> ScaffoldModule
nominalRepresentationModuleValue ctx nominal constructors =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" moduleName <> ".hs"),
moduleText =
nl
[ "{-# LANGUAGE DeriveGeneric #-}",
"{-# LANGUAGE LambdaCase #-}",
generatedBanner,
"module " <> moduleName <> " (" <> representationType <> " (..), " <> encoderName <> ") where",
"",
"import Data.Text (Text)",
"import GHC.Generics (Generic)",
"",
"data " <> representationType <> " = " <> T.intercalate " | " (map fst (NE.toList constructors)),
" deriving stock (Eq, Generic, Ord, Show, Enum, Bounded)",
"",
encoderName <> " :: " <> representationType <> " -> Text",
encoderName <> " = \\case",
nl [" " <> constructor <> " -> " <> tshow wire | (constructor, wire) <- NE.toList constructors]
],
kind = Generated,
origin = nodeOrigin "bound nominal enum representation" (resolvedNominalName nominal) (resolvedNominalLoc nominal)
}
where
moduleName = nominalRepresentationModule ctx (resolvedNominalName nominal)
representationType = resolvedNominalName nominal <> "Representation"
encoderName = lowerFirst (resolvedNominalName nominal) <> "RepresentationText"
nominalProjectionModule :: Context -> Text
nominalProjectionModule ctx = case placement ctx of
GeneratedPrefix -> rootPrefix ctx <> "Generated." <> ctxPascalOf ctx <> ".NominalProjections"
CollocatedLeaf -> rootPrefix ctx <> ctxPascalOf ctx <> ".Generated.NominalProjections"
nominalProjectionOwners :: Context -> CheckedService -> [(ScaffoldModule, [Name])]
nominalProjectionOwners ctx service = case nominalProjectionTypes spec of
[] -> []
nominals ->
[ ( ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (nominalProjectionModule ctx) <> ".hs"),
moduleText = emitNominalProjections (checkedLanguageContract service) ctx nominals,
kind = Generated,
origin = "context " <> specContext spec <> " nominal scalar projection facade"
},
[]
)
]
where
spec = checkedSpec service
nominalProjectionTypes :: Spec -> [ResolvedNominalType]
nominalProjectionTypes spec =
Map.elems . Map.fromList $
[ (resolvedNominalName nominal, nominal)
| aggregate <- [value | NAggregate value <- specNodes spec],
resolved <- registerTypes aggregate <> commandTypes aggregate,
AggregateNominal nominal <- [resolved],
ConsumerNominal {} <- [resolvedNominalOwnership nominal]
]
where
symbols = aggregateSymbols spec
registerTypes aggregate =
[ resolved
| register <- aggRegs aggregate,
Right resolved <- [resolveAggregateType symbols (regLoc register) RegisterUse (regType register)]
]
commandTypes aggregate =
[ resolved
| command <- aggCommands aggregate,
field <- cmdFields command,
Right resolved <- [inferAggregateFieldType symbols aggregate CommandFieldUse field]
]
emitNominalProjections :: EffectiveLanguageContract -> Context -> [ResolvedNominalType] -> Text
emitNominalProjections languageContract ctx nominals =
nl $
[ "{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE TypeApplications #-}",
"{-# LANGUAGE TypeFamilies #-}",
generatedBanner,
"module " <> moduleName <> " where",
""
]
<> map ("import " <>) imports
<> [""]
<> [T.intercalate "\n\n" (map emitNominalProjection nominals)]
where
moduleName = nominalProjectionModule ctx
imports =
sort . nub $
[ "Keiki.Core (ExactFieldProjection (..), FieldProjection (..), FieldWitness, exactFieldWitness, fieldWitness)",
"Keiro.Codec.Nominal (nominalFromRepresentation, nominalToRepresentation)"
]
<> [hsModule (consumerNominalHaskell binding) <> " qualified" | nominal <- nominals, ConsumerNominal binding <- [resolvedNominalOwnership nominal]]
<> [qualifiedModule (consumerNominalBinding binding) <> " qualified" | nominal <- nominals, ConsumerNominal binding <- [resolvedNominalOwnership nominal]]
<> [nominalRepresentationModule ctx (resolvedNominalName nominal) <> " qualified" | nominal <- nominals, EnumRepresentation {} <- [resolvedNominalRepresentation nominal]]
<> ["Data.KindID qualified as KindID" | any hasId nominals]
<> ["Keiro.Codec.IdDomain (idDomainTextPattern, typeIdV7Domain, validateIdDomainText)" | any hasEnforcedId nominals]
<> ["Data.List.NonEmpty (NonEmpty (..))" | any hasExactDomain nominals]
<> ["Data.Text (Text)" | any usesText nominals]
<> ["Data.Time (UTCTime)" | any (hasScalar NominalTime) nominals]
<> ["Keiki.ProjectionDomain (TextPattern, finiteProjectionDomain, matchesTextPattern, textCharSet, textConcat, textLiteral, textProjectionDomain, textRepeatBetween)" | any hasExactDomain nominals]
<> ["Numeric.Natural (Natural)" | any (hasScalar NominalNatural) nominals]
hasScalar wanted nominal = resolvedNominalRepresentation nominal == ScalarRepresentation wanted
hasId nominal = case resolvedNominalRepresentation nominal of IdRepresentation {} -> True; _ -> False
hasEnforcedId nominal = case resolvedNominalRepresentation nominal of
IdRepresentation prefix -> isJust (idDomainContractFor languageContract prefix)
_ -> False
hasExactDomain nominal = case resolvedNominalRepresentation nominal of ScalarRepresentation {} -> False; _ -> True
usesText nominal = case resolvedNominalRepresentation nominal of ScalarRepresentation NominalText -> True; IdRepresentation {} -> True; EnumRepresentation {} -> True; _ -> False
emitNominalProjection nominal = case resolvedNominalOwnership nominal of
GeneratedNominal -> ""
ConsumerNominal binding -> case resolvedNominalRepresentation nominal of
ScalarRepresentation {} -> emitScalarProjection nominal binding
IdRepresentation prefix -> emitConsumerIdProjection nominal binding prefix
EnumRepresentation constructors -> emitConsumerEnumProjection nominal binding constructors
emitScalarProjection nominal binding =
nl
[ "data " <> tagName,
"",
"instance FieldProjection " <> tagName <> " where",
" type FieldName " <> tagName <> " = " <> tshow name,
" type FieldOwner " <> tagName <> " = " <> renderHaskellSource (consumerNominalHaskell binding),
" type FieldResult " <> tagName <> " = " <> scalarHaskellType (resolvedNominalRepresentation nominal),
" fieldShapeId _ = " <> tshow (unCanonicalTypeId (consumerNominalCanonical binding)),
" projectFieldValue _ = nominalToRepresentation " <> unQualifiedValueName (consumerNominalBinding binding),
"",
witnessName <> " :: FieldWitness " <> tagName,
witnessName <> " = fieldWitness @" <> tagName
]
where
name = resolvedNominalName nominal
tagName = name <> "NominalProjection"
witnessName = lowerFirst name <> "Witness"
emitConsumerIdProjection nominal binding prefix =
nl
( patternLines
<> [ "",
"data " <> tagName,
"",
"instance FieldProjection " <> tagName <> " where",
" type FieldName " <> tagName <> " = " <> tshow name,
" type FieldOwner " <> tagName <> " = " <> ownerType,
" type FieldResult " <> tagName <> " = Text",
" fieldShapeId _ = " <> tshow equalityIdentity,
" projectFieldValue _ = KindID.toText . nominalToRepresentation " <> bindingName,
"",
"instance ExactFieldProjection " <> tagName <> " where",
" fieldProjectionDomain _ = textProjectionDomain " <> patternName,
" reconstructFieldOwner _ value"
]
<> validationGuard
<> [ " | not (matchesTextPattern " <> patternName <> " value) = Nothing",
" | otherwise = case KindID.parseText @" <> tshow prefix <> " value of",
" Left _ -> Nothing",
" Right representation -> Just (nominalFromRepresentation " <> bindingName <> " representation)",
"",
witnessName <> " :: FieldWitness " <> tagName,
witnessName <> " = exactFieldWitness @" <> tagName
]
)
where
name = resolvedNominalName nominal
tagName = nominalEqualityTagName nominal
witnessName = nominalEqualityWitnessName nominal
patternName = lowerFirst name <> "EqualityPattern"
ownerType = renderHaskellSource (consumerNominalHaskell binding)
bindingName = unQualifiedValueName (consumerNominalBinding binding)
equalityIdentity = fromMaybe (error "consumer ID equality contract missing") (nominalEqualityIdentityForService languageContract nominal)
enforced = isJust (idDomainContractFor languageContract prefix)
patternLines
| enforced =
[ patternName <> " :: TextPattern",
patternName <> " = either (error . show) id (idDomainTextPattern (typeIdV7Domain " <> tshow prefix <> "))"
]
| otherwise =
[ patternName <> " :: TextPattern",
patternName <> " = either (error . show) id $ do",
" prefix <- textLiteral " <> tshow (prefix <> "_"),
" leading <- textCharSet ('0' :| \"1234567\")",
" crockford <- textCharSet ('0' :| \"123456789abcdefghjkmnpqrstvwxyz\")",
" suffix <- textRepeatBetween 25 25 crockford",
" pure (textConcat (prefix :| [leading, suffix]))"
]
validationGuard =
[ " | Left _ <- validateIdDomainText (typeIdV7Domain " <> tshow prefix <> ") value = Nothing"
| enforced
]
emitConsumerEnumProjection nominal binding constructors =
nl $
[ "data " <> tagName,
"",
"instance FieldProjection " <> tagName <> " where",
" type FieldName " <> tagName <> " = " <> tshow name,
" type FieldOwner " <> tagName <> " = " <> ownerType,
" type FieldResult " <> tagName <> " = Text",
" fieldShapeId _ = " <> tshow equalityIdentity,
" projectFieldValue _ = " <> encoderName <> " . nominalToRepresentation " <> bindingName,
"",
"instance ExactFieldProjection " <> tagName <> " where",
" fieldProjectionDomain _ = finiteProjectionDomain (" <> renderNonEmpty (map (tshow . snd) (NE.toList constructors)) <> ")",
" reconstructFieldOwner _ = \\case"
]
<> [ " " <> tshow wire <> " -> Just (nominalFromRepresentation " <> bindingName <> " " <> representationModule <> "." <> constructor <> ")"
| (constructor, wire) <- NE.toList constructors
]
<> [ " _ -> Nothing",
"",
witnessName <> " :: FieldWitness " <> tagName,
witnessName <> " = exactFieldWitness @" <> tagName
]
where
name = resolvedNominalName nominal
tagName = nominalEqualityTagName nominal
witnessName = nominalEqualityWitnessName nominal
ownerType = renderHaskellSource (consumerNominalHaskell binding)
bindingName = unQualifiedValueName (consumerNominalBinding binding)
representationModule = nominalRepresentationModule ctx name
encoderName = representationModule <> "." <> lowerFirst name <> "RepresentationText"
equalityIdentity = fromMaybe (error "consumer enum equality contract missing") (nominalEqualityIdentityForService languageContract nominal)
scalarHaskellType representation = case representation of
ScalarRepresentation NominalText -> "Text"
ScalarRepresentation NominalInt -> "Int"
ScalarRepresentation NominalNatural -> "Natural"
ScalarRepresentation NominalBool -> "Bool"
ScalarRepresentation NominalTime -> "UTCTime"
IdRepresentation {} -> "()"
EnumRepresentation {} -> "()"
structuralProjectionModule :: Context -> Text
structuralProjectionModule ctx = structuralPrefix ctx <> "Projections"
emitShape :: Context -> TypeGraph -> StructuralDecl -> ResolvedMappedShape -> Text
emitShape ctx graph declaration shape =
nl $
languagePragmas
<> [ generatedBanner,
"module " <> moduleName <> " (" <> shapeType <> " (..)) where",
""
]
<> map ("import " <>) imports
<> ["" | not (null imports)]
<> [shapeDeclaration]
where
moduleName = structuralShapeModule ctx (sdName declaration)
shapeType = sdName declaration <> "Shape"
requirements = shapeRequirements ctx graph shape
languagePragmas =
["{-# LANGUAGE DeriveGeneric #-}"]
<> ["{-# LANGUAGE DuplicateRecordFields #-}" | shapeHasRecord shape]
imports =
sort . nub $
["Data.Aeson (Value)" | ReqJson `elem` requirements]
<> ["Data.Map.Strict (Map)" | ReqMap `elem` requirements]
<> ["Data.Text (Text)" | ReqText `elem` requirements]
<> ["Data.Time (UTCTime)" | ReqTime `elem` requirements]
<> ["GHC.Generics (Generic)"]
<> ["Numeric.Natural (Natural)" | ReqNatural `elem` requirements]
<> [m <> " qualified" | ReqModule m <- requirements]
shapeDeclaration =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \constructor _ fields ->
nl $
["data " <> shapeType <> " = " <> constructor]
<> recordFields
[ (rwfHaskell field, renderShapeType ctx graph (rwfType field))
| field <- fields
]
<> [" deriving stock (Eq, Generic, Show)"],
onEnum = \entries ->
"data "
<> shapeType
<> " = "
<> T.intercalate " | " (map weCtor entries)
<> "\n deriving stock (Eq, Generic, Show)",
onUnion = \_ arms ->
nl $
case arms of
[] -> ["data " <> shapeType <> " = " <> shapeType <> "Empty", " deriving stock (Eq, Generic, Show)"]
firstArm : rest ->
["data " <> shapeType <> " = " <> renderArm firstArm]
<> [" | " <> renderArm arm | arm <- rest]
<> [" deriving stock (Eq, Generic, Show)"]
}
shape
renderArm arm = rwaCtor arm <> maybe "" ((" !" <>) . renderShapeType ctx graph) (rwaPayload arm)
data ShapeRequirement
= ReqJson
| ReqMap
| ReqText
| ReqTime
| ReqNatural
| ReqModule !Text
deriving stock (Eq, Ord, Show)
shapeHasRecord :: ResolvedMappedShape -> Bool
shapeHasRecord =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \_ _ _ -> True,
onEnum = const False,
onUnion = \_ _ -> False
}
shapeRequirements :: Context -> TypeGraph -> ResolvedMappedShape -> [ShapeRequirement]
shapeRequirements ctx graph =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \_ _ fields -> concatMap (exprRequirements ctx graph . rwfType) fields,
onEnum = const [],
onUnion = \_ arms -> concatMap (maybe [] (exprRequirements ctx graph) . rwaPayload) arms
}
exprRequirements :: Context -> TypeGraph -> ResolvedTypeExpr -> [ShapeRequirement]
exprRequirements ctx graph =
foldTypeExpr
TypeExprAlgebra
{ onText = [ReqText],
onInt = [],
onInteger = [],
onBool = [],
onNatural = [ReqNatural],
onTime = [ReqTime],
onJson = [ReqJson],
onOptional = id,
onList = id,
onMap = (ReqMap :) . (ReqText :),
onRef = \key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural declaration _) -> [ReqModule (structuralShapeModule ctx (sdName declaration))]
Just (ResolvedOpaque declaration) -> [ReqModule (hsModule (odHaskell declaration))]
Nothing -> []
}
renderShapeType :: Context -> TypeGraph -> ResolvedTypeExpr -> Text
renderShapeType ctx graph =
foldTypeExpr
TypeExprAlgebra
{ onText = "Text",
onInt = "Int",
onInteger = "Integer",
onBool = "Bool",
onNatural = "Natural",
onTime = "UTCTime",
onJson = "Value",
onOptional = \value -> "(Maybe (" <> value <> "))",
onList = \value -> "([" <> value <> "])",
onMap = \value -> "(Map Text (" <> value <> "))",
onRef = \key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural nested _) ->
structuralShapeModule ctx (sdName nested) <> "." <> sdName nested <> "Shape"
Just (ResolvedOpaque opaque) ->
hsModule (odHaskell opaque) <> "." <> hsType (odHaskell opaque)
Nothing -> "()"
}
data StructuralProjection = StructuralProjection
{ spTag :: !Text,
spWitness :: !Text,
spPointer :: !Text,
spOwner :: !HaskellSource,
spResult :: !Text,
spCanonical :: !CanonicalTypeId,
spBinding :: !QualifiedValueName,
spSelectors :: ![(Text, Text)]
}
deriving stock (Eq, Show)
projectionSpecs :: TypeGraph -> [StructuralProjection]
projectionSpecs graph =
sortOn spTag . allocateProjectionNames . concat $
[ projectionsForRoot graph declaration shape
| ResolvedStructural declaration shape <- Map.elems (tgDeclarations graph)
]
projectionsForRoot :: TypeGraph -> StructuralDecl -> ResolvedMappedShape -> [StructuralProjection]
projectionsForRoot graph root rootShape = case rootShape of
RRecord _ _ fields -> concatMap (walkField [] []) fields
REnum {} -> []
RUnion {} -> []
where
walkField keys selectors field
| rwfPresence field /= PRequired = []
| otherwise = case projectionScalar (rwfType field) of
Just result -> [mkProjection (keys <> [rwfKey field]) (selectors <> [(shapeModuleForOwner, rwfHaskell field)]) result]
Nothing -> case rwfType field of
RRef key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural nested (RRecord _ _ nestedFields)) ->
concatMap
(walkNested nested (keys <> [rwfKey field]) (selectors <> [(shapeModuleForOwner, rwfHaskell field)]))
nestedFields
_ -> []
_ -> []
where
shapeModuleForOwner = "__SHAPE__." <> sdName root
walkNested owner keys selectors field
| rwfPresence field /= PRequired = []
| otherwise = case projectionScalar (rwfType field) of
Just result -> [mkProjection (keys <> [rwfKey field]) (selectors <> [(shapeModuleFor owner, rwfHaskell field)]) result]
Nothing -> case rwfType field of
RRef key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural nested (RRecord _ _ nestedFields)) ->
concatMap
(walkNested nested (keys <> [rwfKey field]) (selectors <> [(shapeModuleFor owner, rwfHaskell field)]))
nestedFields
_ -> []
_ -> []
-- Context is supplied when rendering; this marker is replaced there.
shapeModuleFor declaration = "__SHAPE__." <> sdName declaration
mkProjection keys selectors result =
StructuralProjection
{ spTag = nameStem <> "Projection",
spWitness = lowerFirst nameStem <> "Witness",
spPointer = pointer,
spOwner = sdHaskell root,
spResult = result,
spCanonical = sdCanonical root,
spBinding = sdBinding root,
spSelectors = selectors
}
where
pointer = T.concat ["/" <> escapePointer key | key <- keys]
nameStem = projectionNameStem (sdName root) pointer
projectionScalar :: ResolvedTypeExpr -> Maybe Text
projectionScalar = \case
RText -> Just "Text"
RInt -> Just "Int"
RInteger -> Just "Integer"
RBool -> Just "Bool"
RTime -> Just "UTCTime"
RNatural -> Just "Natural"
RJson -> Nothing
ROptional {} -> Nothing
RList {} -> Nothing
RMap {} -> Nothing
RRef {} -> Nothing
escapePointer :: Text -> Text
escapePointer = T.replace "/" "~1" . T.replace "~" "~0"
projectionNameStem :: Name -> Text -> Text
projectionNameStem owner pointer =
pascal owner
<> T.concat
[ normaliseAliasPart (unescapePointer segment)
| segment <- filter (not . T.null) (T.splitOn "/" pointer)
]
-- | Add a stable digest only when two distinct wire paths normalize to the
-- same Haskell name. Digest collisions receive a deterministic ordinal, so the
-- emitter never produces duplicate declarations even in that unlikely case.
allocateProjectionNames :: [StructuralProjection] -> [StructuralProjection]
allocateProjectionNames specs = concatMap allocateGroup groups
where
groups = groupBy (\left right -> spTag left == spTag right) (sortOn spTag specs)
allocateGroup [spec] = [spec]
allocateGroup collided = reverse named
where
ordered = sortOn projectionIdentity collided
digest spec = T.take 8 (fnv1a64 (projectionIdentity spec))
digestCounts = Map.fromListWith (+) [(digest spec, 1 :: Int) | spec <- ordered]
(_, named) = foldl allocate (Map.empty, []) ordered
allocate (seen, allocated) spec =
let shortDigest = digest spec
occurrence = Map.findWithDefault 0 shortDigest seen + 1
suffix =
shortDigest
<> if Map.findWithDefault 0 shortDigest digestCounts == 1
then ""
else tshow' occurrence
in (Map.insert shortDigest occurrence seen, renameWithSuffix suffix spec : allocated)
projectionIdentity spec = unCanonicalTypeId (spCanonical spec) <> "#" <> spPointer spec
renameWithSuffix suffix spec =
spec
{ spTag = nameStem <> suffix <> "Projection",
spWitness = lowerFirst nameStem <> suffix <> "Witness"
}
where
nameStem = fromMaybe (spTag spec) (T.stripSuffix "Projection" (spTag spec))
projectionWitnessName :: TypeGraph -> MappedKey -> Text -> Maybe Text
projectionWitnessName graph owner pointer = do
ResolvedStructural declaration _ <- Map.lookup owner (tgDeclarations graph)
spWitness
<$> find
(\spec -> spCanonical spec == sdCanonical declaration && spPointer spec == pointer)
(projectionSpecs graph)
emitStructuralProjections :: Context -> TypeGraph -> Text
emitStructuralProjections ctx graph =
nl $
[ "{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE TypeApplications #-}",
"{-# LANGUAGE TypeFamilies #-}",
generatedBanner,
"-- Equality witnesses are emitted for Text, Int, Bool, Natural, and UTCTime.",
"-- Int, Natural, and UTCTime belong to Keiki's ordered subset.",
"module " <> moduleName,
" ( " <> T.intercalate "\n , " (map spWitness specs),
" ) where",
"",
"import Data.Text (Text)",
"import Data.Time (UTCTime)",
"import Numeric.Natural (Natural)",
"import Keiro.Codec.Structural (bindingToShape)",
"import Keiki.Core (FieldProjection (..), FieldWitness, fieldWitness)"
]
<> map ("import " <>) imports
<> concatMap renderProjection specs
where
moduleName = structuralProjectionModule ctx
specs = map (resolveProjectionModules ctx) (projectionSpecs graph)
imports =
sort . nub $
[hsModule (spOwner spec) <> " qualified" | spec <- specs]
<> [qualifiedModule (spBinding spec) <> " qualified" | spec <- specs]
<> [shapeModuleName <> " qualified" | spec <- specs, (shapeModuleName, _) <- spSelectors spec]
renderProjection spec =
[ "",
"data " <> spTag spec,
"",
"instance FieldProjection " <> spTag spec <> " where",
" type FieldName " <> spTag spec <> " = " <> tshow (spPointer spec),
" type FieldOwner " <> spTag spec <> " = " <> renderHaskellSource (spOwner spec),
" type FieldResult " <> spTag spec <> " = " <> spResult spec,
" fieldShapeId _ = " <> tshow (unCanonicalTypeId (spCanonical spec)),
" projectFieldValue _ owner = " <> renderGetter spec,
"",
spWitness spec <> " :: FieldWitness " <> spTag spec,
spWitness spec <> " = fieldWitness @" <> spTag spec
]
renderGetter spec =
foldl
(\value (shapeModuleName, selector) -> shapeModuleName <> "." <> selector <> " (" <> value <> ")")
("bindingToShape " <> unQualifiedValueName (spBinding spec) <> " owner")
(spSelectors spec)
resolveProjectionModules :: Context -> StructuralProjection -> StructuralProjection
resolveProjectionModules ctx spec =
spec
{ spSelectors =
[ (replaceModule marker, selector)
| (marker, selector) <- spSelectors spec
]
}
where
replaceModule marker
| Just name <- T.stripPrefix "__SHAPE__." marker = structuralShapeModule ctx name
| otherwise = structuralShapeModule ctx (lastSegment marker)
qualifiedModule :: QualifiedValueName -> Text
qualifiedModule = fst . splitQualified . unQualifiedValueName
renderHaskellSource :: HaskellSource -> Text
renderHaskellSource source = hsModule source <> "." <> hsType source
splitQualified :: Text -> (Text, Text)
splitQualified value =
let (prefix, name) = T.breakOnEnd "." value
in (T.dropEnd 1 prefix, name)
lastSegment :: Text -> Text
lastSegment = snd . T.breakOnEnd "."
-- | Emit all modules for one aggregate. The 'Spec' is needed for the shared
-- id\/enum declarations.
scaffoldAggregate :: Context -> Spec -> Aggregate -> [ScaffoldModule]
scaffoldAggregate ctx spec = scaffoldAggregateForService ctx (legacyCheckedService spec)
-- | Emit all modules for one aggregate after selecting the effective semantic
-- contract. This is the normal source/workspace generation entry point.
scaffoldAggregateForService :: Context -> CheckedService -> Aggregate -> [ScaffoldModule]
scaffoldAggregateForService ctx service agg =
[ genModule a "Domain" (emitDomain a),
genModule a "Codec" (emitCodec a)
]
++ ( if hasVersion2Ownership a
then
[ genModule a "Transducer" (emitGeneratedTransducer a),
genModule a "BehaviorContract" (emitBehaviorContract a),
behaviorHoleModule a
]
else []
)
++ [ genModule a "EventStream" (emitEventStream a),
genModule a "Projection" (emitProjection a)
]
++ [holeModule a (emitHoles a) | aggregateNeedsHoleModule a]
where
a = resolveAggForService ctx service agg
aggregateNeedsHoleModule :: Agg -> Bool
aggregateNeedsHoleModule aggregate
| hasVersion2Ownership aggregate = not (null (version2HoleExports aggregate))
| otherwise = True
-- | The generated behavioral contract is deliberately separate from both the
-- authoritative transducer and the create-once witness list. Regeneration can
-- replace this module freely while stale textual keys in @BehaviorHoles@ keep
-- compiling and are reported by reconciliation.
emitBehaviorContract :: Agg -> Text
emitBehaviorContract aggregate =
nl $
[ "{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE OverloadedLabels #-}",
"{-# OPTIONS_GHC -Wno-missing-signatures -Wno-name-shadowing #-}",
generatedBanner,
"module " <> aGenPrefix aggregate <> ".BehaviorContract where",
"",
"import " <> aGenPrefix aggregate <> ".Codec (encode" <> name <> "Event, parse" <> name <> "Event, " <> valueStem <> "Codec)",
"import " <> aGenPrefix aggregate <> ".Domain",
"import " <> aGenPrefix aggregate <> ".Transducer (" <> valueStem <> "Transducer)",
"import Data.Aeson (ToJSON (..), object, (.=))",
"import Data.List (sortOn)",
"import Data.List.NonEmpty (NonEmpty)",
"import Data.List.NonEmpty qualified as NonEmpty",
"import Data.Map.Strict qualified as Map",
"import Data.Text (Text)",
"import Data.Text qualified as T",
"import Keiki.Core qualified as K (EdgeMode (..), EdgeRef (..), RegFile, ReplayAttribution (..), ReplayEventSpan (..), ReplaySuccess (..), StepFailure (..), StepSuccess (..), applyEventsDetailedEither, stepDetailedEither, (!))",
"import Keiro.Codec qualified as Codec (Codec (eventType), EventType (..))",
"",
"newtype BehaviorKey = BehaviorKey { unBehaviorKey :: Text }",
" deriving stock (Eq, Ord, Show)",
"",
"data ObligationKind = LiveTransition | RequiredRejection | ReplayTransition",
" deriving stock (Eq, Ord, Show)",
"",
"data EvidenceLevel = GeneratedAuthoritative | HoleWitnessed | LegacyRuntimeWitness",
" deriving stock (Eq, Ord, Show)",
"",
"data GuardCoverage = GuardTotal | GuardPartial | GuardUnknown | GuardNotApplicable",
" deriving stock (Eq, Ord, Show)",
"",
"data BehaviorRequirement = BehaviorRequirement",
" { requirementKey :: !BehaviorKey",
" , requirementKind :: !ObligationKind",
" , requirementEvidence :: !EvidenceLevel",
" , requirementGuardCoverage :: !GuardCoverage",
" , requirementSource :: !" <> aVertexType aggregate,
" , requirementCommandName :: !Text",
" , requirementExpectedEdge :: !(Maybe (K.EdgeRef " <> aVertexType aggregate <> "))",
" , requirementTarget :: !(Maybe " <> aVertexType aggregate <> ")",
" , requirementEventKinds :: ![Text]",
" , requirementLine :: !Int",
" }",
" deriving stock (Eq, Show)",
"",
"data RejectionClass = RejectNoOutgoingEdges | RejectNoMatchingEdge",
" deriving stock (Eq, Show)",
"",
"data LiveExpectation",
" = Emits (NonEmpty " <> name <> "Event)",
" | Rejects RejectionClass",
" | NoOp",
" deriving stock (Eq, Show)",
"",
"data BehaviorWitness",
" = Pending BehaviorKey",
" | LiveWitness",
" { witnessKey :: BehaviorKey",
" , witnessHistory :: [" <> name <> "Event]",
" , witnessCommand :: " <> name <> "Command",
" , witnessExpected :: LiveExpectation",
" }",
" | ReplayWitness",
" { witnessKey :: BehaviorKey",
" , witnessHistoryPrefix :: [" <> name <> "Event]",
" , witnessObservedChunk :: [" <> name <> "Event]",
" }",
" deriving stock (Eq, Show)",
"",
"data BehaviorFailure = BehaviorFailure",
" { failureKey :: !BehaviorKey",
" , failureCode :: !Text",
" , failureDetail :: !Text",
" }",
" deriving stock (Eq, Show)",
"",
"instance ToJSON BehaviorFailure where",
" toJSON failure = object",
" [ \"key\" .= unBehaviorKey (failureKey failure)",
" , \"code\" .= failureCode failure",
" , \"detail\" .= failureDetail failure",
" ]",
"",
"data BehaviorConformanceReport = BehaviorConformanceReport",
" { reportRequired :: ![BehaviorKey]",
" , reportFilled :: ![BehaviorKey]",
" , reportPending :: ![BehaviorKey]",
" , reportMissing :: ![BehaviorKey]",
" , reportDuplicate :: ![BehaviorKey]",
" , reportStale :: ![BehaviorKey]",
" , reportFailed :: ![BehaviorFailure]",
" , reportVerified :: ![BehaviorKey]",
" , reportUnverified :: ![BehaviorKey]",
" }",
" deriving stock (Eq, Show)",
"",
"instance ToJSON BehaviorConformanceReport where",
" toJSON report = object",
" [ \"schema\" .= (\"keiro/behavior-conformance/1\" :: Text)",
" , \"required\" .= keyTexts (reportRequired report)",
" , \"filled\" .= keyTexts (reportFilled report)",
" , \"pending\" .= keyTexts (reportPending report)",
" , \"missing\" .= keyTexts (reportMissing report)",
" , \"duplicate\" .= keyTexts (reportDuplicate report)",
" , \"stale\" .= keyTexts (reportStale report)",
" , \"failed\" .= reportFailed report",
" , \"verified\" .= keyTexts (reportVerified report)",
" , \"unverified\" .= keyTexts (reportUnverified report)",
" ]",
"",
"behaviorRequirements :: [BehaviorRequirement]",
"behaviorRequirements ="
]
<> renderBehaviorRequirementList aggregate
<> [ "",
"behaviorCoverageReport :: [BehaviorWitness] -> BehaviorConformanceReport",
"behaviorCoverageReport witnesses =",
" BehaviorConformanceReport",
" { reportRequired = sortedKeys (Map.keys requiredByKey)",
" , reportFilled = sortedKeys [key | (key, [witness]) <- Map.toList witnessGroups, Map.member key requiredByKey, not (isPending witness)]",
" , reportPending = sortedKeys [key | (key, rows) <- Map.toList witnessGroups, Map.member key requiredByKey, any isPending rows]",
" , reportMissing = sortedKeys [key | key <- Map.keys requiredByKey, Map.notMember key witnessGroups]",
" , reportDuplicate = sortedKeys [key | (key, rows) <- Map.toList witnessGroups, length rows > 1]",
" , reportStale = sortedKeys [key | key <- Map.keys witnessGroups, Map.notMember key requiredByKey]",
" , reportFailed = sortOn (unBehaviorKey . failureKey) failures",
" , reportVerified = sortedKeys [requirementKey requirement | (requirement, Right ()) <- executions, proofStrength requirement]",
" , reportUnverified = sortedKeys [requirementKey requirement | (requirement, Right ()) <- executions, not (proofStrength requirement)]",
" }",
" where",
" requiredByKey = Map.fromList [(requirementKey requirement, requirement) | requirement <- behaviorRequirements]",
" witnessGroups = Map.fromListWith (flip (<>)) [(behaviorWitnessKey witness, [witness]) | witness <- witnesses]",
" executions =",
" [ (requirement, runWitness requirement witness)",
" | (key, [witness]) <- Map.toList witnessGroups",
" , not (isPending witness)",
" , Just requirement <- [Map.lookup key requiredByKey]",
" ]",
" failures = [failure | (_, Left failure) <- executions]",
"",
"behaviorConformancePassed :: BehaviorConformanceReport -> Bool",
"behaviorConformancePassed = behaviorConformancePassedWith False",
"",
"behaviorConformancePassedWith :: Bool -> BehaviorConformanceReport -> Bool",
"behaviorConformancePassedWith failOnUnverified report =",
" null (reportPending report)",
" && null (reportMissing report)",
" && null (reportDuplicate report)",
" && null (reportStale report)",
" && null (reportFailed report)",
" && (not failOnUnverified || null (reportUnverified report))",
"",
"renderBehaviorConformanceText :: BehaviorConformanceReport -> Text",
"renderBehaviorConformanceText report = T.unlines",
" [ \"behavior conformance: " <> name <> "\"",
" , \"schema: keiro/behavior-conformance/1\"",
" , countLine \"required\" (reportRequired report)",
" , countLine \"filled\" (reportFilled report)",
" , countLine \"pending\" (reportPending report)",
" , countLine \"missing\" (reportMissing report)",
" , countLine \"duplicate\" (reportDuplicate report)",
" , countLine \"stale\" (reportStale report)",
" , \"failed: \" <> tshow (length (reportFailed report))",
" , countLine \"verified\" (reportVerified report)",
" , countLine \"unverified\" (reportUnverified report)",
" ] <> T.unlines [\"FAIL \" <> unBehaviorKey (failureKey failure) <> \" [\" <> failureCode failure <> \"] \" <> failureDetail failure | failure <- reportFailed report]",
"",
"runWitness :: BehaviorRequirement -> BehaviorWitness -> Either BehaviorFailure ()",
"runWitness requirement witness = case witness of",
" Pending _ -> failure requirement \"pending\" \"witness is still Pending\"",
" LiveWitness _ history command expectation -> runLive requirement history command expectation",
" ReplayWitness _ prefix chunk -> runReplay requirement prefix chunk",
"",
"runLive :: BehaviorRequirement -> [" <> name <> "Event] -> " <> name <> "Command -> LiveExpectation -> Either BehaviorFailure ()",
"runLive requirement history command expectation = do",
" settled <- settleHistory requirement \"history\" history",
" ensure requirement (K.replaySuccessState settled == requirementSource requirement) \"history-wrong-source\" \"history does not settle at the required source vertex\"",
" ensure requirement (commandKind command == requirementCommandName requirement) \"command-mismatch\" \"witness command constructor does not match the required state/command cell\"",
" case requirementKind requirement of",
" ReplayTransition -> failure requirement \"witness-kind\" \"a replay-only requirement needs ReplayWitness\"",
" RequiredRejection -> runRejection requirement (K.replaySuccessState settled, K.replaySuccessRegs settled) command expectation",
" LiveTransition -> runAcceptance requirement (K.replaySuccessState settled, K.replaySuccessRegs settled) command expectation",
"",
"runRejection requirement seed command expectation = case expectation of",
" Emits _ -> failure requirement \"expectation-kind\" \"a rejection requirement cannot expect emitted events\"",
" NoOp -> failure requirement \"expectation-kind\" \"a rejection requirement cannot expect an accepted no-op\"",
" Rejects expectedClass -> case K.stepDetailedEither " <> valueStem <> "Transducer seed command of",
" Left K.NoOutgoingEdges {} -> ensure requirement (expectedClass == RejectNoOutgoingEdges) \"rejection-class\" \"expected NoMatchingEdge but runtime returned NoOutgoingEdges\"",
" Left K.NoMatchingEdge {} -> ensure requirement (expectedClass == RejectNoMatchingEdge) \"rejection-class\" \"expected NoOutgoingEdges but runtime returned NoMatchingEdge\"",
" Left K.AmbiguousEdges {} -> failure requirement \"ambiguous-edges\" \"AmbiguousEdges can never satisfy a rejection witness\"",
" Right _ -> failure requirement \"unexpected-acceptance\" \"runtime accepted a command required to reject\"",
"",
"runAcceptance requirement seed command expectation = case expectation of",
" Rejects _ -> failure requirement \"expectation-kind\" \"a live-transition requirement needs Emits or NoOp\"",
" NoOp -> case K.stepDetailedEither " <> valueStem <> "Transducer seed command of",
" Left stepFailure -> failure requirement \"unexpected-rejection\" (tshow stepFailure)",
" Right success -> do",
" checkAcceptedEnvelope requirement success",
" ensure requirement (null (K.stepSuccessOutputs success)) \"noop-emitted\" \"NoOp emitted one or more events\"",
" ensure requirement (K.stepSuccessState success == fst seed) \"noop-vertex-change\" \"NoOp changed the control vertex\"",
" ensure requirement (regsEqual (K.stepSuccessRegs success) (snd seed)) \"noop-register-change\" \"NoOp changed one or more registers\"",
" Emits expectedEvents -> case K.stepDetailedEither " <> valueStem <> "Transducer seed command of",
" Left stepFailure -> failure requirement \"unexpected-rejection\" (tshow stepFailure)",
" Right success -> do",
" checkAcceptedEnvelope requirement success",
" let expected = NonEmpty.toList expectedEvents",
" actual = K.stepSuccessOutputs success",
" ensure requirement (actual == expected) \"event-value-mismatch\" \"runtime event values differ from the exact witness expectation\"",
" ensure requirement (map eventKind actual == requirementEventKinds requirement) \"event-envelope-mismatch\" \"runtime event kinds differ from the declared ordered envelope\"",
" decoded <- either (failure requirement \"emitted-codec-decode\") Right (decodeEvents actual)",
" replayed <- case K.applyEventsDetailedEither " <> valueStem <> "Transducer seed decoded of",
" Left replayFailure -> failure requirement \"emitted-replay-failed\" (tshow replayFailure)",
" Right replaySuccess -> Right replaySuccess",
" ensure requirement (K.replaySuccessState replayed == K.stepSuccessState success) \"forward-replay-vertex\" \"decoded emissions replay to a different vertex\"",
" ensure requirement (regsEqual (K.replaySuccessRegs replayed) (K.stepSuccessRegs success)) \"forward-replay-registers\" \"decoded emissions replay to different registers\"",
" checkSingleAttribution requirement K.Live (length decoded) (K.replaySuccessTrace replayed)",
"",
"checkAcceptedEnvelope requirement success = do",
" ensure requirement (K.stepSuccessMode success == K.Live) \"forward-mode\" \"forward execution selected a non-live edge\"",
" ensure requirement (Just (K.stepSuccessEdge success) == requirementExpectedEdge requirement) \"edge-attribution\" \"runtime selected a different guarded sibling\"",
" ensure requirement (Just (K.stepSuccessState success) == requirementTarget requirement) \"target-mismatch\" \"runtime reached a different target vertex\"",
"",
"runReplay :: BehaviorRequirement -> [" <> name <> "Event] -> [" <> name <> "Event] -> Either BehaviorFailure ()",
"runReplay requirement prefix chunk = case requirementKind requirement of",
" ReplayTransition -> do",
" settled <- settleHistory requirement \"history-prefix\" prefix",
" ensure requirement (K.replaySuccessState settled == requirementSource requirement) \"history-wrong-source\" \"history prefix does not settle at the replay edge source\"",
" ensure requirement (not (null chunk)) \"empty-replay-chunk\" \"a replay-only edge has no observable empty chunk\"",
" decoded <- either (failure requirement \"replay-chunk-codec-decode\") Right (decodeEvents chunk)",
" replayed <- case K.applyEventsDetailedEither " <> valueStem <> "Transducer (K.replaySuccessState settled, K.replaySuccessRegs settled) decoded of",
" Left replayFailure -> failure requirement \"replay-chunk-failed\" (tshow replayFailure)",
" Right replaySuccess -> Right replaySuccess",
" ensure requirement (Just (K.replaySuccessState replayed) == requirementTarget requirement) \"target-mismatch\" \"replay chunk reached a different target vertex\"",
" checkSingleAttribution requirement K.ReplayOnly (length decoded) (K.replaySuccessTrace replayed)",
" _ -> failure requirement \"witness-kind\" \"ReplayWitness supplied for a non-replay requirement\"",
"",
"checkSingleAttribution requirement expectedMode eventCount trace = case trace of",
" [attribution] -> do",
" ensure requirement (Just (K.replayAttributionEdge attribution) == requirementExpectedEdge requirement) \"replay-edge-attribution\" \"replay selected a different edge\"",
" ensure requirement (K.replayAttributionMode attribution == expectedMode) \"replay-mode-attribution\" \"replay selected the wrong live/replay-only phase\"",
" ensure requirement (K.replayAttributionSource attribution == requirementSource requirement) \"replay-source-attribution\" \"replay attribution starts at the wrong source\"",
" ensure requirement (Just (K.replayAttributionTarget attribution) == requirementTarget requirement) \"replay-target-attribution\" \"replay attribution ends at the wrong target\"",
" ensure requirement (K.replayAttributionSpan attribution == K.ReplayEventSpan 0 eventCount) \"replay-span-attribution\" \"replay attribution did not consume the exact chunk\"",
" _ -> failure requirement \"replay-trace-cardinality\" \"expected exactly one completed-edge attribution\"",
"",
"settleHistory requirement label history = do",
" decoded <- either (failure requirement (label <> \"-codec-decode\")) Right (decodeEvents history)",
" case K.applyEventsDetailedEither " <> valueStem <> "Transducer (" <> initialVertex aggregate <> ", initial" <> name <> "Regs) decoded of",
" Left replayFailure -> failure requirement (label <> \"-replay-failed\") (tshow replayFailure)",
" Right replaySuccess -> Right replaySuccess",
"",
"decodeEvents :: [" <> name <> "Event] -> Either Text [" <> name <> "Event]",
"decodeEvents = traverse (\\event -> parse" <> name <> "Event (Codec.eventType " <> valueStem <> "Codec event) (encode" <> name <> "Event event))"
]
<> renderCommandKind aggregate
<> [ "",
"eventKind event = case Codec.eventType " <> valueStem <> "Codec event of Codec.EventType tag -> tag",
"",
"regsEqual :: K.RegFile " <> name <> "Regs -> K.RegFile " <> name <> "Regs -> Bool",
regsEqualityExpression aggregate,
"",
"proofStrength requirement =",
" requirementEvidence requirement == GeneratedAuthoritative",
" && requirementGuardCoverage requirement `elem` [GuardTotal, GuardNotApplicable]",
"",
"behaviorWitnessKey witness = case witness of",
" Pending key -> key",
" LiveWitness { witnessKey = key } -> key",
" ReplayWitness { witnessKey = key } -> key",
"",
"isPending Pending {} = True",
"isPending _ = False",
"",
"ensure requirement condition code detail = if condition then Right () else failure requirement code detail",
"failure requirement code detail = Left (BehaviorFailure (requirementKey requirement) code detail)",
"sortedKeys = sortOn unBehaviorKey",
"keyTexts = map unBehaviorKey",
"countLine label values = label <> \": \" <> tshow (length values)",
"tshow :: Show value => value -> Text",
"tshow = T.pack . show"
]
where
name = aName aggregate
valueStem = lowerFirst name
renderCommandKind :: Agg -> [Text]
renderCommandKind aggregate = case aCommands aggregate of
[] -> ["", "commandKind _ = \"\""]
commands ->
[ "",
"commandKind command = case command of"
]
<> [" " <> rcName command <> " _ -> " <> tshow (rcName command) | command <- commands]
renderBehaviorRequirementList :: Agg -> [Text]
renderBehaviorRequirementList aggregate =
case behaviorRequirementsFor aggregate of
[] -> [" []"]
requirements ->
[ (if index == (0 :: Int) then " [ " else " , ") <> render requirement
| (index, requirement) <- zip [0 ..] requirements
]
<> [" ]"]
where
render requirement =
"BehaviorRequirement "
<> keyExpr requirement
<> " "
<> T.pack (show (Behavior.requirementKind requirement))
<> " "
<> T.pack (show (Behavior.requirementEvidence requirement))
<> " "
<> T.pack (show (Behavior.requirementGuardCoverage requirement))
<> " "
<> vertexCtor aggregate (Behavior.requirementSource requirement)
<> " "
<> tshow (Behavior.requirementCommand requirement)
<> " "
<> edgeExpr aggregate requirement
<> " "
<> maybe "Nothing" (\target -> "(Just " <> vertexCtor aggregate target <> ")") (Behavior.requirementTarget requirement)
<> " "
<> renderBehaviorTextList (Behavior.requirementEvents requirement)
<> " "
<> tshow' (unLoc (Behavior.requirementLocation requirement))
keyExpr requirement = "(BehaviorKey " <> tshow (Behavior.unBehaviorKey (Behavior.requirementKey requirement)) <> ")"
edgeExpr :: Agg -> Behavior.BehaviorRequirement -> Text
edgeExpr aggregate requirement = case Behavior.requirementKind requirement of
Behavior.RequiredRejection -> "Nothing"
_ -> case behaviorEdgeIndex aggregate requirement of
Nothing -> error ("required behavior transition missing from resolved aggregate: " <> T.unpack (Behavior.requirementCanonical requirement))
Just edgeIndex ->
"(Just (K.EdgeRef "
<> vertexCtor aggregate (Behavior.requirementSource requirement)
<> " "
<> tshow' edgeIndex
<> "))"
behaviorEdgeIndex :: Agg -> Behavior.BehaviorRequirement -> Maybe Int
behaviorEdgeIndex aggregate requirement =
findIndex
matches
[ transition
| transition <- aTransitions aggregate,
tSource transition == Behavior.requirementSource requirement
]
where
matches transition =
unLoc (tLoc transition) == unLoc (Behavior.requirementLocation requirement)
&& tCommand transition == Behavior.requirementCommand requirement
behaviorRequirementsFor :: Agg -> [Behavior.BehaviorRequirement]
behaviorRequirementsFor aggregate =
case Behavior.deriveAggregateBehaviorRequirements (aSpec aggregate) (aAggregate aggregate) of
Left derivationError -> error ("validated aggregate failed behavior derivation: " <> show derivationError)
Right requirements -> sortOn Behavior.requirementKey requirements
renderBehaviorTextList :: [Text] -> Text
renderBehaviorTextList values = "[" <> T.intercalate ", " (map tshow values) <> "]"
regsEqualityExpression :: Agg -> Text
regsEqualityExpression aggregate = case aRegs aggregate of
[] -> "regsEqual _ _ = True"
registers ->
"regsEqual left right = "
<> T.intercalate
" && "
[ "(left K.! #" <> rrName register <> ") == (right K.! #" <> rrName register <> ")"
| register <- registers
]
behaviorHoleModule :: Agg -> ScaffoldModule
behaviorHoleModule aggregate =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (aHolePrefix aggregate) <> "/BehaviorHoles.hs"),
moduleText = emitBehaviorHoles aggregate,
kind = HoleStub,
origin = nodeOrigin "aggregate behavior witnesses" (aName aggregate) (aLoc aggregate)
}
emitBehaviorHoles :: Agg -> Text
emitBehaviorHoles aggregate =
nl $
[ "-- Consumer-owned behavioral witnesses. Created once; never overwritten.",
"module " <> aHolePrefix aggregate <> ".BehaviorHoles (behaviorWitnesses) where",
"",
"import " <> aGenPrefix aggregate <> ".BehaviorContract",
"",
"behaviorWitnesses :: [BehaviorWitness]",
"behaviorWitnesses ="
]
<> case behaviorRequirementsFor aggregate of
[] -> [" []"]
requirements ->
[ (if index == (0 :: Int) then " [ " else " , ")
<> "Pending (BehaviorKey "
<> tshow (Behavior.unBehaviorKey (Behavior.requirementKey requirement))
<> ")"
| (index, requirement) <- zip [0 ..] requirements
]
<> [" ]"]
-- | Emit the context-wide replay-audit target assembly.
--
-- There is one existential target per aggregate declaration. Process saga
-- aggregates are ordinary aggregate nodes referenced by 'SagaRef', so they are
-- included by the same single source of truth rather than being duplicated from
-- the process declaration.
scaffoldReplayAudit :: Context -> Spec -> [ScaffoldModule]
scaffoldReplayAudit ctx spec
| null aggregates = []
| otherwise =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" moduleName <> ".hs"),
moduleText = emitReplayAudit,
kind = Generated,
origin = "context " <> specContext spec <> " replay-audit assembly"
}
]
where
aggregates = [aggregate | NAggregate aggregate <- specNodes spec]
moduleName = contextGeneratedPrefix ctx <> ".ReplayAudit"
contextGeneratedPrefix context = case placement context of
GeneratedPrefix -> rootPrefix context <> "Generated." <> ctxPascalOf context
CollocatedLeaf -> rootPrefix context <> ctxPascalOf context <> ".Generated"
emitReplayAudit =
nl $
[ "{-# LANGUAGE GADTs #-}",
generatedBanner,
"--",
"-- Deployment contract:",
"-- * replay-neutral diff: no data audit is required;",
"-- * affected diff: run AuditTargeted with the emitted affected set",
"-- against a production copy under the candidate binary;",
"-- * one-time runtime cutover: run AuditFull;",
"-- * any non-zero audit exit blocks deployment.",
"module " <> moduleName <> " (auditTargets) where",
""
]
++ [ "import " <> genPrefixFor ctx (aggName aggregate) <> ".EventStream qualified as " <> aggName aggregate
| aggregate <- aggregates
]
++ [ "import Keiro.ReplayAudit (AuditTarget (..), SomeAuditTarget (..), streamInCategory)",
"import Keiro.Stream qualified as Stream",
"",
"auditTargets :: [SomeAuditTarget]",
"auditTargets ="
]
++ concat
[ [ if index == (0 :: Int) then " [ SomeAuditTarget" else " , SomeAuditTarget",
" AuditTarget",
" { eventStream = " <> aggregateName <> "." <> lowerFirst aggregateName <> "EventStream",
" , category = Stream.categoryText " <> aggregateName <> "." <> lowerFirst aggregateName <> "Category",
" , mkStream = streamInCategory (Stream.categoryText " <> aggregateName <> "." <> lowerFirst aggregateName <> "Category)",
" }"
]
| (index, aggregate) <- zip [0 ..] aggregates,
let aggregateName = aggName aggregate
]
++ [" ]"]
genModule :: Agg -> Text -> Text -> ScaffoldModule
genModule a name body =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (aGenPrefix a) <> "/" <> name <> ".hs"),
moduleText = body,
kind = Generated,
origin = nodeOrigin "aggregate" (aName a) (aLoc a)
}
holeModule :: Agg -> Text -> ScaffoldModule
holeModule a body =
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" (aHolePrefix a) <> "/" <> "Holes.hs"),
moduleText = body,
kind = HoleStub,
origin = nodeOrigin "aggregate" (aName a) (aLoc a)
}
--------------------------------------------------------------------------------
-- Integration contract (EP-4): a self-contained payload ADT + codec
--------------------------------------------------------------------------------
-- | Emit the deterministic, symbol-free contract layer: a payload ADT
-- (per-event records), the topic constants, the @messageType@ discriminator, and a
-- strict encode\/decode keyed by it. Self-contained (base\/text\/aeson), so it
-- compiles standalone — the cross-service schema both producer and consumer agree
-- on. No keiki symbolic operator (firewall holds).
scaffoldContract :: Context -> ContractNode -> [ScaffoldModule]
scaffoldContract ctx = scaffoldContractWithLanguage ctx (effectiveLanguageContract LegacyUnversioned)
-- | Emit a contract under the checked service's released semantic contract.
-- Language versions 1 through 3 retain the legacy Text representation; only
-- runtime semantics 3 lowers declared TypeID fields to prefix-indexed KindIDs.
scaffoldContractForService :: Context -> CheckedService -> ContractNode -> [ScaffoldModule]
scaffoldContractForService ctx service = scaffoldContractWithLanguage ctx (checkedLanguageContract service)
scaffoldContractWithLanguage :: Context -> EffectiveLanguageContract -> ContractNode -> [ScaffoldModule]
scaffoldContractWithLanguage ctx languageContract c =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/Contract.hs"),
moduleText = emitContractGen languageContract genPrefix c,
kind = Generated,
origin = nodeOrigin "contract" (ctrName c) (ctrLoc c)
}
]
where
genPrefix = genPrefixFor ctx (pascal (ctrName c))
emitContractGen :: EffectiveLanguageContract -> Text -> ContractNode -> Text
emitContractGen languageContract genPrefix c =
( nl $
pragmas
++ ["" | hasTypedTypeIds]
++ [generatedBanner]
++ moduleHeader
++ [ "",
"import Data.Aeson (Value, object, withObject, withText, (.:), (.=))",
aesonTypesImport
]
++ typedKindIdImports
++ [ "import Data.Text (Text)",
"import qualified Data.Text as T"
]
++ ["import Keiro.Codec.IdDomain (parseKindIdV7Value)" | hasTypedTypeIds]
++ [ "",
"-- topic constants"
]
++ topicConstants
++ [ "",
"-- the closed payload set (discriminated by " <> tshow (ctrDiscriminator c) <> ")"
]
++ [emitPayloadAdt languageContract payloadTy (ctrEvents c)]
++ [ "",
"messageTypeOf :: " <> payloadTy <> " -> Text",
"messageTypeOf = \\case"
]
++ [" " <> ceName e <> " {} -> " <> tshow (ceName e) | e <- ctrEvents c]
++ [ "",
"encode" <> payloadTy <> " :: " <> payloadTy <> " -> Value",
"encode" <> payloadTy <> " = \\case"
]
++ concatMap encodeArm (ctrEvents c)
++ [ "",
"parse" <> payloadTy <> " :: Value -> Either Text " <> payloadTy,
"parse" <> payloadTy <> " = mapLeftText . parseEither (withObject " <> tshow payloadTy <> " go)",
" where",
" go o = do",
" kind <- explicitParseField (withText " <> tshow (ctrDiscriminator c) <> " validateMessageType) o " <> tshow (ctrDiscriminator c),
" case kind of"
]
++ concatMap decodeArm (ctrEvents c)
++ [ " _ -> fail \"validated message type was not handled\"",
"",
"mapLeftText :: Either String b -> Either Text b",
"mapLeftText = either (Left . T.pack) Right",
"",
"validateMessageType :: Text -> Parser Text",
"validateMessageType kind",
" | kind `elem` " <> renderTextList (map ceName (ctrEvents c)) <> " = pure kind",
" | otherwise = " <> renderUnknownFailure "message type" "kind" (map ceName (ctrEvents c))
]
)
<> if hasTypedTypeIds then "\n" else ""
where
payloadTy = pascal (ctrName c) <> "Payload"
hasTypedTypeIds = any (any (isTypedTypeId . cfType) . ceFields) (ctrEvents c)
pragmas =
["{-# LANGUAGE DataKinds #-}" | hasTypedTypeIds]
++ [ "{-# LANGUAGE DuplicateRecordFields #-}",
"{-# LANGUAGE OverloadedRecordDot #-}"
]
++ ["{-# LANGUAGE TypeApplications #-}" | hasTypedTypeIds]
typedKindIdImports
| hasTypedTypeIds = ["import Data.KindID (KindID)", "import qualified Data.KindID as KindID"]
| otherwise = []
moduleHeader =
[ "module " <> genPrefix <> ".Contract",
" ( " <> payloadTy <> " (..)"
]
++ [" , " <> ceName event <> "Data (..)" | event <- ctrEvents c]
++ [" , " <> lowerFirst alias <> "Topic" | (alias, _) <- ctrTopics c]
++ [ " , messageTypeOf",
" , encode" <> payloadTy,
" , parse" <> payloadTy,
" ) where"
]
topicConstants
| hasTypedTypeIds =
[ T.intercalate
"\n\n"
[lowerFirst alias <> "Topic :: Text\n" <> lowerFirst alias <> "Topic = " <> tshow topic | (alias, topic) <- ctrTopics c]
]
| otherwise = [lowerFirst alias <> "Topic :: Text\n" <> lowerFirst alias <> "Topic = " <> tshow topic | (alias, topic) <- ctrTopics c]
isTypedTypeId (CTypeId prefix) = isJust (contractIdDomainContractFor languageContract prefix)
isTypedTypeId _ = False
aesonTypesImport = "import Data.Aeson.Types (Parser, explicitParseField, parseEither)"
encodeArm e =
[ " " <> ceName e <> " payload ->",
" object"
]
++ objectEntriesFor ((tshow (ctrDiscriminator c) <> " .= (" <> tshow (ceName e) <> " :: Text)") : map encodeField (ceFields e))
++ [" ]"]
lead 0 kv = " [ " <> kv
lead _ kv = " , " <> kv
objectEntriesFor entries
| hasTypedTypeIds =
[ (if index == 0 then " [ " else " ")
<> entry
<> if index < length entries - 1 then "," else ""
| (index, entry) <- zip [(0 :: Int) ..] entries
]
| otherwise = [lead index entry | (index, entry) <- zip [(0 :: Int) ..] entries]
decodeArm e =
[" " <> tshow (ceName e) <> " ->"]
++ case ceFields e of
[] -> [" pure (" <> ceName e <> " " <> ceName e <> "Data)"]
fields ->
[ " " <> ceName e,
" <$> ( " <> ceName e <> "Data"
]
++ [ (if index == 0 then " <$> " else " <*> ") <> decodeField field
| (index, field) <- zip [(0 :: Int) ..] fields
]
++ [" )"]
encodeField field =
tshow (cfName field)
<> " .= "
<> case cfType field of
CTypeId prefix
| isJust (contractIdDomainContractFor languageContract prefix) -> "KindID.toText payload." <> cfName field
_ -> "payload." <> cfName field
decodeField field = case cfType field of
CTypeId prefix
| isJust (contractIdDomainContractFor languageContract prefix) ->
"explicitParseField (parseKindIdV7Value @" <> tshow prefix <> ") o " <> tshow (cfName field)
_ -> "o .: " <> tshow (cfName field)
emitPayloadAdt :: EffectiveLanguageContract -> Text -> [ContractEvent] -> Text
emitPayloadAdt languageContract tyName events =
sectionsOf [map dataRecord events, [sumDecl]]
where
hasTypedTypeIds = any (any (isTypedTypeId . cfType) . ceFields) events
isTypedTypeId (CTypeId prefix) = isJust (contractIdDomainContractFor languageContract prefix)
isTypedTypeId _ = False
hsType CText = "Text"
hsType CInt = "Int"
hsType (CTypeId prefix)
| isJust (contractIdDomainContractFor languageContract prefix) = "(KindID " <> tshow prefix <> ")"
| otherwise = "Text"
dataRecord e =
"data "
<> ceName e
<> "Data = "
<> ceName e
<> (if hasTypedTypeIds then "Data {" else "Data { ")
<> T.intercalate ", " [cfName f <> " :: !" <> hsType (cfType f) | f <- ceFields e]
<> (if hasTypedTypeIds then "}\n deriving stock (Eq, Show)" else " }\n deriving stock (Eq, Show)")
arm e = ceName e <> " !" <> ceName e <> "Data"
sumDecl = case events of
[] -> "data " <> tyName <> " = " <> tyName <> "Empty\n deriving stock (Eq, Show)"
(e : es) ->
nl
( (if hasTypedTypeIds then ["data " <> tyName, " = " <> arm e] else ["data " <> tyName <> " = " <> arm e])
++ [" | " <> arm e2 | e2 <- es]
++ [" deriving stock (Eq, Show)"]
)
--------------------------------------------------------------------------------
-- Integration intake (EP-4): inbox disposition vs the live Keiro.Inbox runtime
--------------------------------------------------------------------------------
-- | Emit the inbox node's deterministic disposition wiring compiled against the
-- LIVE @Keiro.Inbox.Types@: the dedupe policy (a real 'InboxDedupePolicy') and a
-- disposition function over the real @InboxResult@ (including handler
-- failures). This pins the dangerous inversions
-- (duplicate ⇒ ackOk, previouslyFailed ⇒ deadLetter) as compiled code over the
-- runtime types. The complete declared classification table is also available
-- to handler holes through a closed generated outcome type. Firewall holds (no
-- keiki symbolic operator).
scaffoldIntake :: Context -> IntakeNode -> [ScaffoldModule]
scaffoldIntake ctx i =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/Inbox.hs"),
moduleText = emitIntakeGen genPrefix i,
kind = Generated,
origin = nodeOrigin "intake" (inkName i) (inkLoc i)
}
]
where
genPrefix = genPrefixFor ctx (pascal (inkName i))
emitIntakeGen :: Text -> IntakeNode -> Text
emitIntakeGen genPrefix i =
nl $
[ "{-# LANGUAGE OverloadedStrings #-}",
generatedBanner,
"module " <> genPrefix <> ".Inbox",
" ( InboxFailure (..)",
" , " <> outcomeType <> " (..)",
" , " <> dispositionType <> " (..)",
" , inboxDedupePolicy",
" , inboxPersistence",
" , inboxDispositionFor",
" , inboxDisposition",
" ) where",
"",
"import Data.Text (Text)",
"import Keiro.Inbox.Types (InboxDedupePolicy (..), InboxPersistence (..), InboxResult (..), RetryDelay (..))",
"",
"-- The dedupe policy (hole-kind 4), lowered to the live InboxDedupePolicy.",
"inboxDedupePolicy :: InboxDedupePolicy",
"inboxDedupePolicy = " <> inkDedupePolicy i,
"",
"-- | Success-path envelope retention passed to runInboxTransactionWith.",
"-- Failures always retain their full operator-facing dead-letter envelope.",
"-- Dedupe-only success rows decode with an empty payload.",
"inboxPersistence :: InboxPersistence",
"inboxPersistence = " <> persistenceCtor (inkPersist i),
"",
"-- Runtime failure detail retained when the inbox wrapper reports a failed handler attempt.",
"data InboxFailure = InboxFailure",
" { inboxFailureReason :: !Text",
" , inboxFailureAttempt :: !(Maybe Int)",
" }",
" deriving stock (Eq, Show)",
"",
"-- Every classification named by the spec. Keeping this closed makes the",
"-- generated table exhaustive and gives handler holes typed inputs.",
"data " <> outcomeType,
" = " <> T.intercalate "\n | " outcomeConstructors,
" deriving stock (Eq, Show)",
"",
"-- The service's declared acknowledgement decision, including its details.",
"data " <> dispositionType,
" = InboxAccept",
" | InboxRetryAfter !RetryDelay !(Maybe InboxFailure)",
" | InboxDeadLetter !(Maybe Text) !(Maybe InboxFailure)",
" deriving stock (Eq, Show)",
"",
"-- The complete disposition table (hole-kind 2).",
"inboxDispositionFor :: " <> outcomeType <> " -> " <> dispositionType,
"inboxDispositionFor outcome = case outcome of"
]
++ [" " <> outcomeConstructor (drOutcome row) <> " -> " <> actionExpression (drAction row) | row <- inkDisposition i]
++ [ "",
"-- Lower the LIVE Keiro.Inbox.Types.InboxResult without an open fallback.",
"inboxDisposition :: InboxResult a -> " <> dispositionType,
"inboxDisposition r = case r of",
" InboxProcessed _ -> inboxDispositionFor " <> outcomeConstructor "processed",
" InboxDuplicate -> inboxDispositionFor " <> outcomeConstructor "duplicate",
" InboxInProgress -> inboxDispositionFor " <> outcomeConstructor "inProgress",
" InboxPreviouslyFailed failureReason ->",
" maybe (inboxDispositionFor " <> outcomeConstructor "previouslyFailed" <> ")",
" (\\reason -> attachFailure (InboxFailure reason Nothing) (inboxDispositionFor " <> outcomeConstructor "previouslyFailed" <> "))",
" failureReason",
" InboxHandlerFailed reason attempts ->",
" attachFailure (InboxFailure reason (Just attempts)) (inboxDispositionFor " <> outcomeConstructor "storeFailed" <> ")",
"",
"attachFailure :: InboxFailure -> " <> dispositionType <> " -> " <> dispositionType,
"attachFailure failure disposition = case disposition of",
" InboxRetryAfter delay _ -> InboxRetryAfter delay (Just failure)",
" InboxDeadLetter reason _ -> InboxDeadLetter reason (Just failure)",
" InboxAccept -> InboxAccept"
]
where
stem = pascal (inkName i)
outcomeType = stem <> "Outcome"
dispositionType = stem <> "Disposition"
outcomeConstructor = (stem <>) . pascal
outcomeConstructors = map (outcomeConstructor . drOutcome) (inkDisposition i)
actionExpression IAckOk = "InboxAccept"
actionExpression (IRetry win) = "InboxRetryAfter (RetryDelay " <> windowText win <> ") Nothing"
actionExpression (IDeadLetter mr) = "InboxDeadLetter " <> maybe "Nothing" (\reason -> "(Just " <> tshow reason <> ")") mr <> " Nothing"
persistenceCtor InkPersistFull = "PersistFullEnvelope"
persistenceCtor InkPersistDedupeOnly = "PersistDedupeOnly"
--------------------------------------------------------------------------------
-- Integration publisher (EP-4): config vs the live Keiro.Outbox runtime
--------------------------------------------------------------------------------
-- | Emit the publisher's at-least-once policy compiled against the LIVE
-- @Keiro.Outbox.Types@: the ordering policy (a real 'OrderingPolicy'), the backoff
-- curve (a real 'BackoffSchedule'), and the max-attempts ceiling. Firewall holds.
scaffoldPublisher :: Context -> PublisherNode -> [ScaffoldModule]
scaffoldPublisher ctx pb =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/Publisher.hs"),
moduleText = emitPublisherGen genPrefix pb,
kind = Generated,
origin = nodeOrigin "publisher" (pubName pb) (pubLoc pb)
}
]
where
genPrefix = genPrefixFor ctx (pascal (pubName pb))
emitPublisherGen :: Text -> PublisherNode -> Text
emitPublisherGen genPrefix pb =
nl
[ generatedBanner,
"module " <> genPrefix <> ".Publisher",
" ( publisherOrdering",
" , publisherBackoff",
" , publisherMaxAttempts",
" ) where",
"",
"import Keiro.Outbox.Types (BackoffSchedule (..), ExponentialBackoffOptions (..), OrderingPolicy (..))",
"",
"publisherOrdering :: OrderingPolicy",
"publisherOrdering = " <> pubOrdering pb,
"",
"publisherBackoff :: BackoffSchedule",
"publisherBackoff = " <> backoffExpr (pubBackoff pb),
"",
"publisherMaxAttempts :: Int",
"publisherMaxAttempts = " <> tshow' (pubMaxAttempts pb)
]
where
backoffExpr b = case boKind b of
"constant" -> "ConstantBackoff " <> windowText (boWindow b)
"exponential" ->
"ExponentialBackoff ExponentialBackoffOptions { initial = "
<> windowText (boWindow b)
<> ", maxDelay = "
<> maybe "0" windowText (boMax b)
<> ", multiplier = "
<> fromMaybe "0" (boMultiplier b)
<> " }"
_ -> "error \"keiro-dsl: unlowerable backoff kind\""
--------------------------------------------------------------------------------
-- pgmq workqueue (EP-5): a self-contained Job payload record + codec
--------------------------------------------------------------------------------
-- | Emit the deterministic, symbol-free pgmq layer: the Job payload record, the
-- field→wire-name JSON codec, and the captured physical\/dlq\/table name constants.
-- Self-contained (base\/text\/aeson). The fan-out body and the raw-SQL dedup
-- predicate are holes (not emitted). Firewall holds.
scaffoldWorkqueue :: Context -> WorkqueueNode -> [ScaffoldModule]
scaffoldWorkqueue ctx w =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/Queue.hs"),
moduleText = emitWorkqueueGen genPrefix w,
kind = Generated,
origin = nodeOrigin "workqueue" (wqName w) (wqLoc w)
},
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/QueuePolicy.hs"),
moduleText = emitQueuePolicy genPrefix w,
kind = Generated,
origin = nodeOrigin "workqueue" (wqName w) (wqLoc w)
},
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/QueueCodec.hs"),
moduleText = emitQueueCodec genPrefix w,
kind = Generated,
origin = nodeOrigin "workqueue" (wqName w) (wqLoc w)
}
]
where
genPrefix = genPrefixFor ctx (pascal (wqName w))
emitWorkqueueGen :: Text -> WorkqueueNode -> Text
emitWorkqueueGen genPrefix w =
nl $
[ "{-# LANGUAGE OverloadedRecordDot #-}",
generatedBanner,
"module " <> genPrefix <> ".Queue",
" ( " <> payloadTy <> " (..)",
" , encode" <> payloadTy,
" , parse" <> payloadTy,
" , queuePhysical, queueDlq, queueTable",
groupKeyExport,
" ) where",
"",
"import Data.Aeson (Value, object, withObject, (.:), (.=))",
"import Data.Aeson.Types (parseEither)",
"import Data.Text (Text)",
"import qualified Data.Text as T",
"",
"queuePhysical, queueDlq, queueTable :: Text",
"queuePhysical = " <> tshow (wqPhysical w),
"queueDlq = " <> tshow (wqDlq w),
"queueTable = " <> tshow (wqTable w),
""
]
++ groupKeyLines
++ [ "data " <> payloadTy <> " = " <> payloadTy,
" { " <> T.intercalate "\n , " [wqfName f <> " :: !" <> hsType (wqfType f) | f <- wqPayload w],
" }",
" deriving stock (Eq, Show)",
"",
"encode" <> payloadTy <> " :: " <> payloadTy <> " -> Value",
"encode" <> payloadTy <> " p =",
" object"
]
++ [lead i (tshow (wqfWire f) <> " .= p." <> wqfName f) | (i, f) <- zip [(0 :: Int) ..] (wqPayload w)]
++ [ " ]",
"",
"parse" <> payloadTy <> " :: Value -> Either Text " <> payloadTy,
"parse" <> payloadTy <> " = mapLeftText . parseEither (withObject " <> tshow payloadTy <> " go)",
" where",
" go o = " <> payloadTy <> fieldApps (wqPayload w),
"",
"mapLeftText :: Either String b -> Either Text b",
"mapLeftText = either (Left . T.pack) Right"
]
where
payloadTy = wqPayloadName w
groupKeyExport = case wqGroupKey w of
Nothing -> ""
Just groupKey
| gkVia groupKey == "raw" -> " , groupKeyField, groupKeyFor"
| otherwise -> " , groupKeyField"
groupKeyLines = case wqGroupKey w of
Nothing -> []
Just groupKey -> common <> derivationLines groupKey
where
common =
[ "groupKeyField :: Text",
"groupKeyField = " <> tshow (gkField groupKey),
""
]
derivationLines key
| gkVia key == "raw" =
[ "groupKeyFor :: " <> payloadTy <> " -> Text",
"groupKeyFor payload = payload." <> gkField key,
""
]
| otherwise =
[ "-- Opaque group-key derivation '" <> gkVia key <> "' remains hand-owned.",
"-- Captured fixture: " <> fromMaybe "<missing>" (gkFixture key),
""
]
hsType "bool" = "Bool"
hsType "int" = "Int"
hsType _ = "Text"
lead 0 kv = " [ " <> kv
lead _ kv = " , " <> kv
fieldApps [] = ""
fieldApps fs = " <$> " <> T.intercalate " <*> " ["o .: " <> tshow (wqfWire f) | f <- fs]
-- | Emit the versioned PGMQ envelope adapter. The payload record remains
-- symbol-free and dependency-light in Queue.hs; this runtime-facing module is
-- the opt-in assembly point applications import into their Job values.
emitQueueCodec :: Text -> WorkqueueNode -> Text
emitQueueCodec genPrefix w =
nl
[ generatedBanner,
"-- | Versioned job payload envelope: @{\\\"v\\\",\\\"t\\\",\\\"data\\\"}@.",
"--",
"-- Deploy workers before producers when raising its schema version. Do not",
"-- adopt this codec on a non-empty bare-payload queue without draining it",
"-- (or supplying a transitional codec), or in-flight messages will",
"-- dead-letter. This is telemetry-neutral:",
"-- docs/adr/0001-keiro-pgmq-job-processing-telemetry-contract.md owns",
"-- spans and acknowledgement vocabulary.",
"module " <> genPrefix <> ".QueueCodec (" <> stem <> "PayloadCodec, " <> stem <> "JobCodec) where",
"",
"import Data.List.NonEmpty (NonEmpty (..))",
"import Keiro.Codec (Codec (..), EventType (..))",
"import Keiro.PGMQ.Codec (JobCodec, keiroJobCodec)",
"import " <> genPrefix <> ".Queue (" <> payloadTy <> ", encode" <> payloadTy <> ", parse" <> payloadTy <> ")",
"",
stem <> "PayloadCodec :: Codec " <> payloadTy,
stem <> "PayloadCodec =",
" Codec",
" { eventTypes = EventType " <> tshow payloadTy <> " :| []",
" , eventType = \\_ -> EventType " <> tshow payloadTy,
" , schemaVersion = 1",
" , encode = encode" <> payloadTy,
" , decode = \\_ -> parse" <> payloadTy,
" , upcasters = []",
" }",
"",
stem <> "JobCodec :: JobCodec " <> payloadTy,
stem <> "JobCodec = keiroJobCodec " <> stem <> "PayloadCodec"
]
where
payloadTy = wqPayloadName w
stem = lowerFirst (T.concat (map pascal (T.splitOn "_" (wqName w))))
-- | Emit the pgmq retry policy + JobOutcome disposition compiled against the
-- LIVE @Keiro.PGMQ.Job@ runtime (RetryPolicy / JobOutcome / RetryDelay). This pins
-- the dangerous inversions over the runtime types: storeFailure ⇒ Retry (transient)
-- and decodeFailure ⇒ Dead (poison).
emitQueuePolicy :: Text -> WorkqueueNode -> Text
emitQueuePolicy genPrefix w =
nl $
[ generatedBanner,
"module " <> genPrefix <> ".QueuePolicy",
" ( " <> outcomeType <> " (..)",
" , retryPolicy, jobOutcomeFor",
" , jobOrdering, jobTuningFor, queueProvision",
" ) where",
"",
"import Keiro.PGMQ.Job (JobOrdering (..), JobOutcome (..), JobTuning, PartitionSpec (..), QueueProvision, RetryDelay (..), RetryPolicy (..), partitionedProvision, standardProvision, unloggedProvision, withFifoIndexProvision, withOrdering)",
"",
"jobOrdering :: JobOrdering",
"jobOrdering = " <> orderingCtor,
"",
"-- Deployment owns visibility timeout, batch size, and polling; the spec owns ordering.",
"jobTuningFor :: JobTuning -> JobTuning",
"jobTuningFor = withOrdering jobOrdering",
"",
"-- Pass this to ensureJobQueueWith at worker startup. FIFO adds the required GIN index; the DLQ remains standard.",
"queueProvision :: QueueProvision",
"queueProvision = " <> provisionExpr,
"",
"retryPolicy :: RetryPolicy",
"retryPolicy =",
" RetryPolicy",
" { maxRetries = " <> tshow' (wqMaxRetries w),
" , defaultRetryDelay = RetryDelay " <> windowText (wqDelay w),
" , useDeadLetter = " <> (if wqDlqOn w then "True" else "False"),
" }",
"",
"-- The consumer JobOutcome disposition over the spec's named domain outcomes,",
"-- lowered to the live Keiro.PGMQ.Job.JobOutcome.",
"data " <> outcomeType,
" = " <> T.intercalate "\n | " (map (pascal . wqdOutcome) (wqDisposition w)),
" deriving stock (Eq, Show)",
"",
"jobOutcomeFor :: " <> outcomeType <> " -> JobOutcome",
"jobOutcomeFor o = case o of"
]
++ [" " <> pascal (wqdOutcome r) <> " -> " <> outcome (wqdAction r) | r <- wqDisposition w]
where
outcomeType = T.concat (map pascal (T.splitOn "_" (wqName w))) <> "Outcome"
orderingCtor = case wqOrdering w of
WqUnordered -> "Unordered"
WqFifoThroughput -> "FifoThroughput"
WqFifoRoundRobin -> "FifoRoundRobin"
provisionExpr = fifoWrap baseProvision
fifoWrap expression = case wqOrdering w of
WqUnordered -> expression
_ -> "withFifoIndexProvision (" <> expression <> ")"
baseProvision = case wqProvision w of
WqStandard -> "standardProvision"
WqUnlogged -> "unloggedProvision"
WqPartitioned interval retention ->
"partitionedProvision (PartitionSpec { partitionInterval = "
<> tshow interval
<> ", retentionInterval = "
<> tshow retention
<> " })"
outcome IAckOk = "Done"
outcome (IRetry win) = "Retry (RetryDelay " <> windowText win <> ")"
outcome (IDeadLetter mr) = "Dead " <> tshow (fromMaybe "dead-lettered" mr)
--------------------------------------------------------------------------------
-- First-class read models (EP-107)
--------------------------------------------------------------------------------
-- | Emit an acyclic three-module read-model vertical. @ReadModelTable@ owns the
-- qualified-table constant shared by the hand-owned query and the generated
-- runtime record; @ReadModel@ re-exports it as part of the public surface.
scaffoldReadModel :: Context -> ReadModelNode -> [ScaffoldModule]
scaffoldReadModel ctx readModel =
[ generated "ReadModelTable" (emitReadModelTable tableModule stem readModel),
generated "ReadModel" (emitReadModelGen ctx readModelModule tableModule readModelHolePrefix stem readModel),
ScaffoldModule
{ modulePath = modulePathFor readModelHolePrefix "ReadModelHoles",
moduleText = emitReadModelHoles tableModule readModelHolePrefix stem readModel,
kind = HoleStub,
origin = readModelOrigin
}
]
where
nodeSegment = pascal (rmName readModel)
stem = readModelStem readModel
readModelModule = genPrefixFor ctx nodeSegment
tableModule = readModelModule <> ".ReadModelTable"
readModelHolePrefix = holePrefixFor ctx nodeSegment
readModelOrigin = nodeOrigin "readmodel" (rmName readModel) (rmLoc readModel)
generated leaf body =
ScaffoldModule
{ modulePath = modulePathFor readModelModule leaf,
moduleText = body,
kind = Generated,
origin = readModelOrigin
}
modulePathFor :: Text -> Text -> FilePath
modulePathFor prefix leaf = T.unpack (T.replace "." "/" prefix <> "/" <> leaf <> ".hs")
readModelStem :: ReadModelNode -> Text
readModelStem = lowerFirst . T.concat . map pascal . T.splitOn "_" . rmName
emitReadModelTable :: Text -> Text -> ReadModelNode -> Text
emitReadModelTable tableModule stem readModel =
nl
[ generatedBanner,
"module " <> tableModule <> " (" <> qualifiedName <> ") where",
"",
"import Data.Text (Text)",
"import Keiro.Connection (qualifyTable)",
"",
"-- The fully-qualified, double-quoted data-table reference.",
qualifiedName <> " :: Text",
qualifiedName <> " = qualifyTable " <> tshow (rmSchema readModel) <> " " <> tshow (rmTable readModel)
]
where
qualifiedName = stem <> "QualifiedTable"
emitReadModelGen :: Context -> Text -> Text -> Text -> Text -> ReadModelNode -> Text
emitReadModelGen ctx readModelModule tableModule readModelHolePrefix stem readModel =
nl $
[ "{-# LANGUAGE OverloadedRecordDot #-}",
generatedBanner,
"module " <> readModelModule <> ".ReadModel",
" ( " <> T.intercalate "\n , " exports,
" ) where",
"",
"import Data.Functor (void)",
"import Effectful (Eff, (:>))",
"import " <> tableModule <> " (" <> qualifiedName <> ")",
"import " <> readModelHolePrefix <> ".ReadModelHoles (" <> T.intercalate ", " holeImports <> ")"
]
++ asyncImports
++ [ "import Keiro.ReadModel (ConsistencyMode (..), ReadModel (..), ReadModelMetadata, StrongScope (..), registerReadModel)",
"import Keiro.ReadModel.Rebuild qualified as Rebuild",
"import Kiroku.Store.Effect (Store)",
"import Kiroku.Store.Types (" <> kirokuTypes <> ")",
"",
readModelName <> " :: ReadModel " <> queryInputType <> " " <> queryResultType,
readModelName <> " =",
" ReadModel",
" { name = " <> tshow registryName,
" , tableName = " <> tshow (rmTable readModel),
" , schema = " <> tshow (rmSchema readModel),
" , subscriptionName = " <> tshow subscriptionName,
" , version = " <> tshow' (rmVersion readModel),
" , shapeHash = " <> tshow (rmShape readModel),
" , defaultConsistency = " <> consistencyExpr (rmConsistency readModel),
" , strongScope = " <> scopeExpr (rmScope readModel),
" , query = " <> queryName,
" }",
"",
"-- Call once at projection startup before serving queries.",
registerName <> " :: (Store :> es) => Eff es ()",
registerName <> " =",
" void (registerReadModel " <> tshow registryName <> " " <> tshow' (rmVersion readModel) <> " " <> tshow (rmShape readModel) <> ")",
"",
startName <> " :: (Store :> es) => GlobalPosition -> Eff es ReadModelMetadata",
startName <> " =",
" Rebuild.startRebuild " <> readModelName <> " " <> projectionNames,
"",
finishName <> " :: (Store :> es) => GlobalPosition -> Eff es (Either Rebuild.RebuildError ReadModelMetadata)",
finishName <> " =",
" Rebuild.finishRebuild " <> readModelName <> " " <> projectionNames,
"",
abandonName <> " :: (Store :> es) => Eff es ReadModelMetadata",
abandonName <> " = Rebuild.abandonRebuild " <> readModelName
]
++ asyncDefinition
where
registryName = registryNameFor (contextName ctx) readModel
subscriptionName = subscriptionNameFor (contextName ctx) readModel
asyncName = registryName <> "-async"
readModelName = stem <> "ReadModel"
qualifiedName = stem <> "QualifiedTable"
registerName = "register" <> pascal stem
startName = "start" <> pascal stem <> "Rebuild"
finishName = "finish" <> pascal stem <> "Rebuild"
abandonName = "abandon" <> pascal stem <> "Rebuild"
asyncValueName = stem <> "AsyncProjection"
queryInputType = pascal stem <> "QueryInput"
queryResultType = pascal stem <> "QueryResult"
queryName = stem <> "Query"
applyName = "apply" <> pascal stem
exports =
[ readModelName,
qualifiedName,
registerName,
startName,
finishName,
abandonName
]
++ [asyncValueName | rmFeed readModel == RmSubscription]
holeImports = [queryInputType, queryResultType, queryName] ++ [applyName | rmFeed readModel == RmSubscription]
asyncImports = case rmFeed readModel of
RmInline -> []
RmSubscription -> ["import Keiro.Projection (AsyncProjection (..))"]
kirokuTypes = case rmFeed readModel of
RmInline -> "GlobalPosition"
RmSubscription -> "GlobalPosition, RecordedEvent (..)"
projectionNames = case rmFeed readModel of
RmInline -> "[]"
RmSubscription -> "[" <> tshow asyncName <> "]"
asyncDefinition = case rmFeed readModel of
RmInline -> []
RmSubscription ->
[ "",
asyncValueName <> " :: AsyncProjection",
asyncValueName <> " =",
" AsyncProjection",
" { name = " <> tshow asyncName,
" , readModelName = " <> tshow registryName,
" , subscriptionName = " <> tshow subscriptionName,
" , applyRecorded = " <> applyName,
" , idempotencyKey = \\recorded -> recorded.eventId",
" }"
]
consistencyExpr Strong = "Strong"
consistencyExpr Eventual = "Eventual"
scopeExpr Nothing = "EntireLog"
scopeExpr (Just RmEntireLog) = "EntireLog"
scopeExpr (Just (RmCategory categoryName)) = "CategoryHead " <> tshow categoryName
emitReadModelHoles :: Text -> Text -> Text -> ReadModelNode -> Text
emitReadModelHoles tableModule readModelHolePrefix stem readModel =
nl $
[ "-- This is a HAND-OWNED hole module. keiro-dsl creates it once and never overwrites it.",
"module " <> readModelHolePrefix <> ".ReadModelHoles",
" ( " <> T.intercalate "\n , " exports,
" ) where",
"",
"import " <> tableModule <> " (" <> qualifiedName <> ")",
"import Hasql.Transaction qualified as Tx"
]
++ ["import Kiroku.Store.Types (RecordedEvent(..))" | rmFeed readModel == RmSubscription]
++ [ "",
"-- HOLE: replace these aliases with the real query input and result types.",
"type " <> queryInputType <> " = ()",
"type " <> queryResultType <> " = ()",
"",
"-- HOLE: query " <> qualifiedTableLiteral readModel <> " via " <> qualifiedName <> "; never rely on search_path.",
"-- Declared columns:"
]
++ map (("-- " <>) . readModelColumnDoc) (rmColumns readModel)
++ [ queryName <> " :: " <> queryInputType <> " -> Tx.Transaction " <> queryResultType,
queryName <> " _input = " <> qualifiedName <> " `seq` error " <> tshow ("HOLE: fill " <> rmName readModel <> " query")
]
++ applyStub
where
qualifiedName = stem <> "QualifiedTable"
queryInputType = pascal stem <> "QueryInput"
queryResultType = pascal stem <> "QueryResult"
queryName = stem <> "Query"
applyName = "apply" <> pascal stem
exports = [queryInputType, queryResultType, queryName] ++ [applyName | rmFeed readModel == RmSubscription]
applyStub = case rmFeed readModel of
RmInline -> []
RmSubscription ->
[ "",
"-- HOLE: apply one recorded event; runtime deduplication makes redelivery safe.",
applyName <> " :: RecordedEvent -> Tx.Transaction ()",
applyName <> " _recorded = error " <> tshow ("HOLE: fill " <> rmName readModel <> " async apply")
]
qualifiedTableLiteral :: ReadModelNode -> Text
qualifiedTableLiteral readModel = quoteSqlIdentifier (rmSchema readModel) <> "." <> quoteSqlIdentifier (rmTable readModel)
quoteSqlIdentifier :: Text -> Text
quoteSqlIdentifier identifier = "\"" <> T.replace "\"" "\"\"" identifier <> "\""
readModelColumnDoc :: RmColumn -> Text
readModelColumnDoc columnDecl =
rmcName columnDecl
<> " "
<> rmcType columnDecl
<> if rmcRequired columnDecl then " NOT NULL" else ""
--------------------------------------------------------------------------------
-- Router + shared worker-policy lowering (EP-108)
--------------------------------------------------------------------------------
scaffoldRouter :: Context -> RouterNode -> [ScaffoldModule]
scaffoldRouter ctx router =
[ ScaffoldModule
{ modulePath = modulePathFor genPrefix "Router",
moduleText = emitRouterGen genPrefix router,
kind = Generated,
origin = routerOrigin
},
ScaffoldModule
{ modulePath = modulePathFor holePrefix "RouterHoles",
moduleText = emitRouterHoles holePrefix router,
kind = HoleStub,
origin = routerOrigin
}
]
where
genPrefix = genPrefixFor ctx (rtId router)
holePrefix = holePrefixFor ctx (rtId router)
routerOrigin = nodeOrigin "router" (rtId router) (rtLoc router)
emitRouterGen :: Text -> RouterNode -> Text
emitRouterGen genPrefix router =
nl $
[ generatedBanner,
"module " <> genPrefix <> ".Router",
" ( " <> stem <> "Name",
" , " <> stem <> "WorkerOptions",
" ) where",
"",
"import Data.Text (Text)"
]
++ workerPolicyImports (rtPoison router)
++ [ "",
"-- The STABLE router name. It participates in every target-keyed",
"-- deterministicRouterCommandId; renaming it re-keys replayed dispatches.",
stem <> "Name :: Text",
stem <> "Name = " <> tshow (rtName router),
"",
"-- Runtime-owned dispatch id inputs: (name, key, sourceEventId,",
"-- targetStreamName, occurrence). Target-keyed, not positional.",
"",
"-- Node-level worker policy lowered from the spec. Pass this value to",
"-- Keiro.Router.runRouterWorkerWith; do not silently use defaultWorkerOptions."
]
++ workerOptionsLines (stem <> "WorkerOptions") (rtRejected router) (rtPoison router)
where
stem = lowerFirst (rtId router)
emitRouterHoles :: Text -> RouterNode -> Text
emitRouterHoles holePrefix router =
nl
[ "-- HAND-OWNED hole module for the router's behaviour-bearing bodies.",
"-- keiro-dsl creates it once and never overwrites it.",
"module " <> holePrefix <> ".RouterHoles () where",
"",
"-- HOLE resolve :: " <> inName (rtInput router) <> " -> Eff es [PMCommand targetCommand]",
"-- Spec source: " <> resolveSourceText (rvSource (rtResolve router)) <> ".",
"-- The spec's 'stable' keyword acknowledges that retry attempts accumulate",
"-- the UNION of resolved target identities. Keep the recipient set stable",
"-- for a source event whenever an exact recipient set matters.",
"-- HOLE router value: assemble Keiro.Router.Router with name = " <> lowerFirst (rtId router) <> "Name,",
"-- key, resolve, targetEventStream, and targetProjections; run it with",
"-- runRouterWorkerWith " <> lowerFirst (rtId router) <> "WorkerOptions.",
"-- HOLE targetProjections: spec projections = " <> renderNames (rtProjections router) <> ".",
"-- NOTE on-duplicate AckOk is sound because Keiro.Router confirms a duplicate",
"-- event id against the TARGET stream via confirmBenignDuplicate before",
"-- returning PMCommandDuplicate. Hand-rolled dispatch paths must do likewise."
]
where
renderNames names = "[" <> T.intercalate ", " names <> "]"
resolveSourceText :: ResolveSource -> Text
resolveSourceText (ResolveReadModel name) = "read-model " <> name <> " (typically Keiro.ReadModel.runQuery)"
resolveSourceText ResolveHole = "typed resolver hole"
workerPolicyImports :: PolicyChoice -> [Text]
workerPolicyImports poison =
[ "import Keiro.ProcessManager (PoisonPolicy (..), RejectedCommandPolicy (..), WorkerOptions (..))",
"import Shibuya.Core.Ack (RetryDelay (..))"
]
++ if poison == PolHalt
then []
else ["import Effectful (Eff)", "import Shibuya.Core.Types (Envelope)"]
workerOptionsLines :: Text -> PolicyChoice -> PolicyChoice -> [Text]
workerOptionsLines valueName rejected poison =
[ valueName <> signature,
valueName <> argument <> " =",
" WorkerOptions",
" { poisonPolicy = " <> poisonExpr <> ",",
" rejectedCommandPolicy = " <> rejectedExpr rejected <> ",",
" transientRetryDelay = RetryDelay 5, -- matches defaultWorkerOptions; runtime tuning",
" metrics = Nothing -- runtime configuration; install at call site",
" }"
]
where
signature = case poison of
PolHalt -> " :: WorkerOptions es msg"
_ -> " :: (Envelope msg -> Eff es ()) -> WorkerOptions es msg"
argument = case poison of
PolHalt -> ""
_ -> " poisonCallback"
poisonExpr = case poison of
PolHalt -> "PoisonHalt"
PolDeadLetter -> "PoisonDeadLetter poisonCallback"
PolSkip -> "PoisonSkip poisonCallback"
rejectedExpr = \case
PolHalt -> "RejectedHalt"
PolDeadLetter -> "RejectedDeadLetter"
PolSkip -> "RejectedSkip"
--------------------------------------------------------------------------------
-- Process manager + durable timer (EP-3)
--------------------------------------------------------------------------------
-- | Emit the symbol-free deterministic wiring for a process manager + its timer
-- into a @Generated@ module, plus a create-if-absent @ProcessHoles@ module for the
-- behaviour-bearing bodies (the @handle@ reaction, the deadline window, and the
-- fire command). The @Generated@ module contains no keiki symbolic operator (the
-- saga's transducer is the separate aggregate hole), so the firewall invariant
-- holds. The timer worker uses the spec's @max-attempts@ ceiling, never the
-- dangerous @defaultTimerWorkerOptions@ (@Nothing@) default.
scaffoldProcess :: Context -> ProcessNode -> [ScaffoldModule]
scaffoldProcess ctx p =
[ ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" genPrefix <> "/Process.hs"),
moduleText = emitProcessGen sagaGenPrefix genPrefix holePrefix p,
kind = Generated,
origin = nodeOrigin "process" (procId p) (procLoc p)
},
ScaffoldModule
{ modulePath = T.unpack (T.replace "." "/" holePrefix <> "/ProcessHoles.hs"),
moduleText = emitProcessHoles genPrefix holePrefix p,
kind = HoleStub,
origin = nodeOrigin "process" (procId p) (procLoc p)
}
]
where
genPrefix = genPrefixFor ctx (procId p)
holePrefix = holePrefixFor ctx (procId p)
sagaGenPrefix = genPrefixFor ctx (pascal (sagaAgg (procSaga p)))
emitProcessGen :: Text -> Text -> Text -> ProcessNode -> Text
emitProcessGen sagaGenPrefix genPrefix _holePrefix p =
nl $
[ generatedBanner,
"module " <> genPrefix <> ".Process",
" ( " <> lo <> "ProcessName",
" , " <> lo <> "Category",
" , " <> lo <> "ProcessWorkerOptions",
" , " <> lo <> "TimerRequest",
" , " <> lo <> "FireOutcome",
" ) where",
"",
"import Data.Aeson (Value, object, (.=))",
"import Data.Text (Text)",
"import qualified Data.Text as T",
"import Data.Time (UTCTime)",
"import Data.UUID (UUID)",
"import qualified Data.UUID.V5 as UUID.V5",
"import " <> sagaGenPrefix <> ".EventStream (" <> sagaEventStreamType <> ")",
"import Keiro.Command (CommandError (..))",
"import Keiro.Stream qualified as Stream",
"import Keiro.Timer (TimerId (..), TimerRequest (..))"
]
++ workerPolicyImports (procPoison p)
++ [ "",
"-- The define-once ProcessManager name (hole-kind 5: referenced, never retyped).",
lo <> "ProcessName :: Text",
lo <> "ProcessName = " <> tshow (procName p),
"",
"-- The validated saga stream category (hole-kind 5: referenced, never retyped).",
"-- Saga streams are '<category>-<correlationId>' via Keiro.Stream.entityStream.",
"-- categoryUnsafe is safe here because keiro-dsl check proved the literal legal.",
lo <> "Category :: Stream.StreamCategory " <> sagaEventStreamType,
lo <> "Category = Stream.categoryUnsafe " <> tshow categoryName,
"",
"-- Node-level worker policy lowered from the spec. Pass this value to",
"-- Keiro.ProcessManager.runProcessManagerWorkerWith."
]
++ workerOptionsLines (lo <> "ProcessWorkerOptions") (procRejected p) (procPoison p)
++ [ "",
"-- The deterministic timer-request builder: id derived from the correlation",
"-- key (hole-kind 1), processManagerName referenced, payload from the spec.",
"-- (timer id derived as uuidv5 of " <> tshow (idePrefix (tmId timer)) <> " <> correlationId)",
lo <> "TimerRequest :: Text -> UTCTime -> TimerRequest",
lo <> "TimerRequest correlationId fireAtTime =",
" TimerRequest",
" { timerId = TimerId (namedUuid (" <> tshow (idePrefix (tmId timer)) <> " <> correlationId))",
" , processManagerName = " <> lo <> "ProcessName",
" , correlationId = correlationId",
" , fireAt = fireAtTime",
" , payload = " <> payloadExpr (tmPayload timer),
" }",
"",
"-- The timer-fire disposition table (hole-kind 2), derived from the spec.",
"-- on-reject => " <> showOutcome (onReject fd) <> " is the benign inversion.",
"-- A duplicate append reaches on-error unless it is confirmed against the",
"-- target stream. Use Keiro.ProcessManager.confirmBenignDuplicate:",
"-- StreamName -> EventId -> CommandError -> Eff es Bool",
"-- Fold True into the duplicate result and surface False as the failure.",
lo <> "FireOutcome :: Either CommandError a -> Maybe ()",
lo <> "FireOutcome result = case result of",
" Right{} -> " <> outcomeToMaybe (onOk fd),
" Left CommandRejected -> " <> outcomeToMaybe (onReject fd),
" Left (CommandAmbiguous _) -> " <> outcomeToMaybe (onAmbiguous fd) <> " -- explicit definition-bug arm",
" Left{} -> " <> outcomeToMaybe (onError fd),
"",
"-- max-attempts = " <> tshow' (tmMaxAttempts timer) <> ", dead-letter = " <> tshow (tmDeadLetter timer),
"-- (the timer worker must pass Just " <> tshow' (tmMaxAttempts timer) <> " to runTimerWorkerWith, never the",
"-- defaultTimerWorkerOptions Nothing ceiling that retries forever).",
"",
"-- deterministic v5 UUID of a correlation-keyed string (hole-kind 1).",
"namedUuid :: Text -> UUID",
"namedUuid v = UUID.V5.generateNamed UUID.V5.namespaceURL (map (fromIntegral . fromEnum) (T.unpack v))"
]
where
lo = lowerFirst (procId p)
sagaEventStreamType = pascal (sagaAgg (procSaga p)) <> "EventStreamDef"
categoryName = staticCategory ("process " <> procId p) (sagaCategory (procSaga p))
timer = procTimer p
fd = fireDisposition (tmFire timer)
-- | The timer payload, restricted to the spec's literal (@name=\"value\"@)
-- bindings so it compiles in the deterministic builder. Bare fields and
-- ref-valued bindings are input-driven (the agent-written hole), not emitted.
payloadExpr :: [FieldBinding] -> Text
payloadExpr fs = case [b | b <- fs, isLiteral b] of
[] -> "object []"
lits -> "object [ " <> T.intercalate ", " (map kv lits) <> " ]"
where
isLiteral b = maybe False (const True) (fbValue b >>= stripWrappingQuotes)
kv b = tshow (fbName b) <> " .= (" <> maybe "\"\"" tshow (fbValue b >>= stripWrappingQuotes) <> " :: Value)"
stripWrappingQuotes value = T.stripPrefix "\"" value >>= T.stripSuffix "\""
showOutcome :: FireOutcome -> Text
showOutcome OFired = "Fired"
showOutcome ORetry = "Retry"
outcomeToMaybe :: FireOutcome -> Text
outcomeToMaybe OFired = "Just () -- Fired"
outcomeToMaybe ORetry = "Nothing -- Retry"
emitProcessHoles :: Text -> Text -> ProcessNode -> Text
emitProcessHoles _genPrefix holePrefix p =
nl
[ "-- HAND-OWNED hole module for the process manager's behaviour-bearing bodies.",
"-- keiro-dsl creates it once and never overwrites it.",
"module " <> holePrefix <> ".ProcessHoles () where",
"",
"-- HOLE handle: build the ProcessManagerAction (the self-advance",
"-- '" <> advCommand (hAdvance (procHandle p)) <> "', the dispatch(es), and the timer) from the input.",
"-- HOLE streams: build streamFor with entityStream " <> lowerFirst (procId p) <> "Category;",
"-- build target streams with entityStream " <> lowerFirst (procTarget p) <> "CommandCategory. Never concatenate raw stream names.",
"-- HOLE window: the deadline policy, e.g. surgeWindow :: NominalDiffTime;",
"-- surgeDeadline observedAt = addUTCTime surgeWindow observedAt (TIME INJECTED).",
"-- HOLE fire command: construct " <> fireCommand (tmFire (procTimer p)) <> " for the timer fire,",
"-- keyed by correlationId; the fired-event-id is the deterministic uuidv5 of",
"-- " <> tshow (idePrefix (fireFiredEventId (tmFire (procTimer p)))) <> " <> correlationId.",
"-- NOTE on-duplicate AckOk is sound because the runtime confirms a duplicate",
"-- event id against the TARGET stream via confirmBenignDuplicate before",
"-- returning PMCommandDuplicate. Its effective signature is:",
"-- StreamName -> EventId -> CommandError -> Eff es Bool",
"-- Hand-rolled paths must call it with the target stream and attempted event id,",
"-- fold True into the duplicate result, and surface False as the original failure.",
"-- Never pattern-match DuplicateEvent as success: event ids are globally unique."
]
--------------------------------------------------------------------------------
-- Domain module
--------------------------------------------------------------------------------
emitDomain :: Agg -> Text
emitDomain a =
nl $
[ "{-# LANGUAGE DataKinds #-}"
]
++ ["{-# LANGUAGE DeriveAnyClass #-}" | hasSnapshot a]
++ ["{-# LANGUAGE EmptyDataDecls #-}" | null (aCommands a) || null (aEvents a)]
++ [ "{-# LANGUAGE DuplicateRecordFields #-}",
"{-# LANGUAGE TemplateHaskell #-}",
"{-# LANGUAGE TypeApplications #-}",
generatedBanner,
"module " <> aGenPrefix a <> ".Domain where",
""
]
++ ["import Data.Aeson (FromJSON, ToJSON)" | hasSnapshot a]
++ [ "import Data.Proxy (Proxy (..))",
"import Data.Text (Text)",
"import GHC.Generics (Generic)",
"import Keiki.Core (RegFile (..))"
]
++ ["import Keiki.Shape (CanonicalStateShape, CanonicalTypeName)" | hasSnapshot a]
++ generatedNominalTypeImportsForService (aggregateCheckedService a) (aContext a) (aGeneratedNominals a)
++ map ("import " <>) (domainConsumerImports a)
++ [ "import Keiki.Generics.TH (deriveAggregateCtorsAll, deriveWireCtorsAll)",
"",
sectionsOf
[ [emitVertex a],
map (emitRecord a) (aCommands a),
[emitSum (aName a <> "Command") (aCommands a)],
map (emitRecord a) (aEvents a),
[emitSum (aName a <> "Event") (aEvents a)],
[emitRegsType a, emitInitialRegs a],
[ "$(deriveAggregateCtorsAll ''" <> aName a <> "Command ''" <> aName a <> "Regs)",
"",
"$(deriveWireCtorsAll ''" <> aName a <> "Event)"
]
]
]
hasSnapshot :: Agg -> Bool
hasSnapshot = maybe False (const True) . aSnapshot
emitVertex :: Agg -> Text
emitVertex a =
nl $
[ "data " <> aVertexType a <> " = " <> T.intercalate " | " (map (vertexCtor a . stName) (aStates a)),
" deriving stock (Generic, Eq, Ord, Show, Enum, Bounded)"
]
++ [" deriving anyclass (ToJSON, FromJSON)" | hasSnapshot a]
++ [ line
| hasSnapshot a,
line <-
[ "instance CanonicalStateShape " <> aVertexType a,
"instance CanonicalTypeName " <> aVertexType a
]
]
emitRecord :: Agg -> ResolvedCtor -> Text
emitRecord a rc =
nl $
[ "data " <> rcName rc <> "Data = " <> rcName rc <> "Data"
]
++ recordFields [(name, renderDomainType a fieldType) | (name, fieldType) <- rcFields rc]
++ [" deriving stock (Generic, Eq, Show)"]
recordFields :: [(Text, Text)] -> [Text]
recordFields [] =
[" {"]
<> [" }"]
recordFields fs =
[ lead i <> n <> " :: !" <> ty
| (i, (n, ty)) <- zip [(0 :: Int) ..] fs
]
++ [" }"]
where
lead 0 = " { "
lead _ = " , "
emitSum :: Text -> [ResolvedCtor] -> Text
emitSum tyName ctors =
nl $
[firstLine] ++ restLines ++ [" deriving stock (Generic, Eq, Show)"]
where
arm rc = rc' rc
rc' rc = rcName rc <> " !" <> rcName rc <> "Data"
(firstLine, restLines) = case ctors of
[] -> ("data " <> tyName, [])
(c : cs) ->
( "data " <> tyName <> " = " <> arm c,
[" | " <> arm c2 | c2 <- cs]
)
emitRegsType :: Agg -> Text
emitRegsType a =
nl $
["type " <> aName a <> "Regs ="]
++ regListLines a (aRegs a)
regListLines :: Agg -> [ResolvedRegister] -> [Text]
regListLines _ [] = [" '[]"]
regListLines a rs =
[ lead i <> "'(" <> tshow (rrName r) <> ", " <> renderDomainType a (rrType r) <> ")"
| (i, r) <- zip [(0 :: Int) ..] rs
]
++ [" ]"]
where
lead 0 = " '[ "
lead _ = " , "
emitInitialRegs :: Agg -> Text
emitInitialRegs a =
nl $
[ "initial" <> aName a <> "Regs :: RegFile " <> aName a <> "Regs",
"initial" <> aName a <> "Regs ="
]
++ chain (aRegs a)
where
chain [] = [" RNil"]
chain rs =
[ " RCons (Proxy @" <> tshow (rrName r) <> ") " <> regInitialValue a r <> " $"
| r <- init rs
]
++ [" RCons (Proxy @" <> tshow (rrName lastR) <> ") " <> regInitialValue a lastR <> " RNil"]
where
lastR = last rs
-- | The Haskell initial value for a register, by the category of its type.
regInitialValue :: Agg -> ResolvedRegister -> Text
regInitialValue aggregate register = case rrInitial register of
InitialId name -> case find ((== name) . resolvedNominalName) (aGeneratedNominals aggregate) >>= generatedIdSampleHaskell aggregate of
Just value -> value
Nothing -> renderRegisterInitial (rrInitial register)
_ -> renderRegisterInitial (rrInitial register)
domainConsumerImports :: Agg -> [Text]
domainConsumerImports a =
sort . nub $
Set.toList (Set.unions [aggregateImports (aSymbols a) resolved | resolved <- aggregateTypes])
<> [ qualifiedModule initialValue <> " qualified"
| declaration <- mappedUses a,
initialValue <- maybeToListText (mappedInitial declaration)
]
<> [ qualifiedModule initialValue <> " qualified"
| resolvedType <- aggregateTypes,
AggregateNominal nominal <- [resolvedType],
ConsumerNominal binding <- [resolvedNominalOwnership nominal],
initialValue <- maybeToListText (consumerNominalInitial binding)
]
where
aggregateTypes = map snd (concatMap rcFields (aCommands a <> aEvents a)) <> map rrType (aRegs a)
mappedUses :: Agg -> [ResolvedMappedDecl]
mappedUses a =
[ declaration
| resolvedType <-
map snd (concatMap rcFields (aCommands a <> aEvents a))
<> map rrType (aRegs a),
declaration <- maybeToListText (mappedDeclFor a resolvedType)
]
mappedDeclFor :: Agg -> ResolvedAggregateType -> Maybe ResolvedMappedDecl
mappedDeclFor a resolvedType = do
key <- case resolvedType of
AggregateMapped mappedKey -> Just mappedKey
_ -> Nothing
graph <- aTypeGraph a
Map.lookup key (tgDeclarations graph)
mappedInitial :: ResolvedMappedDecl -> Maybe QualifiedValueName
mappedInitial (ResolvedStructural declaration _) = sdInitial declaration
mappedInitial (ResolvedOpaque declaration) = odInitial declaration
renderDomainType :: Agg -> ResolvedAggregateType -> Text
renderDomainType a = aggregateHaskellType (aSymbols a)
maybeToListText :: Maybe value -> [value]
maybeToListText = maybe [] pure
--------------------------------------------------------------------------------
-- Codec module
--------------------------------------------------------------------------------
emitCodec :: Agg -> Text
emitCodec a =
nl $
["{-# LANGUAGE DataKinds #-}" | hasConsumerNominalIdCodec a]
++ ["{-# LANGUAGE TypeApplications #-}" | hasConsumerNominalIdCodec a]
++ ["{-# LANGUAGE LambdaCase #-}" | hasConsumerNominalCodec a || hasGeneratedNominalEnumCodec a]
++ [ "{-# LANGUAGE OverloadedRecordDot #-}",
generatedBanner,
"module " <> aGenPrefix a <> ".Codec (",
" " <> lowerFirst (aName a) <> "Codec,",
" parse" <> aName a <> "Event,",
" encode" <> aName a <> "Event,"
]
++ concatMap mappedExports (codecMappedDeclarations a)
++ [ ") where",
"",
"import " <> aGenPrefix a <> ".Domain"
]
++ generatedNominalCodecImports (aggregateCheckedService a) (aContext a) (codecGeneratedNominals a)
++ ( if hasMappedCodec a
then
[ "import Control.Monad (unless)",
"import Data.Aeson (Value (..), object, parseJSON, toJSON, withObject, withText, (.:), (.=))",
"import Data.Aeson.Key qualified as Key",
"import Data.Aeson.KeyMap qualified as KeyMap"
]
else ["import Data.Aeson (Value, object, withObject, withText, (.:), (.=))"]
)
++ [ "import Data.Aeson.Types (Parser, explicitParseField, parseEither)",
"import Data.List.NonEmpty (NonEmpty (..))"
]
++ ( if hasMappedCodec a
then ["import Data.Map.Strict (Map)", "import Data.Map.Strict qualified as Map"]
else []
)
++ [ "import Data.Text (Text)",
"import qualified Data.Text as T"
]
++ ["import Data.KindID qualified as KindID" | hasConsumerNominalIdCodec a]
++ ["import Keiro.Codec.IdDomain (typeIdV7Domain, validateIdDomainText)" | hasEnforcedConsumerNominalIdCodec a]
++ ["import Keiro.Codec.Nominal (nominalFromRepresentation, nominalToRepresentation)" | hasConsumerNominalCodec a]
++ ["import Keiro.Codec.Structural (bindingFromShape, bindingToShape)" | hasMappedCodec a]
++ [ "import Keiro.Codec (Codec (..), EventType (..))",
upcasterImport a
]
++ [nl (map ("import " <>) (codecMappedImports a)) | hasMappedCodec a]
++ [nl (map ("import " <>) (codecNominalImports a)) | hasConsumerNominalCodec a]
++ [ "",
emitEnumParsers a,
emitConsumerNominalParsers a
]
++ [emitMappedCodecs a | hasMappedCodec a]
++ [ "",
emitCodecValue a,
"",
emitEncode a,
"",
emitDecode a,
"",
"mapLeftText :: Either String b -> Either Text b",
"mapLeftText = either (Left . T.pack) Right"
]
++ ( if hasMappedCodec a
then
[ "",
"rejectUnknownFields :: String -> [Text] -> KeyMap.KeyMap Value -> Parser ()",
"rejectUnknownFields label allowed objectValue =",
" unless (null extras) (fail (label <> \" contains unknown fields: \" <> show extras))",
" where",
" extras = filter (`notElem` allowed) (map Key.toText (KeyMap.keys objectValue))"
]
else []
)
where
mappedExports (ResolvedStructural declaration _) =
[ " encode" <> sdName declaration <> "Mapped,",
" decode" <> sdName declaration <> "Mapped,"
]
mappedExports ResolvedOpaque {} = []
hasMappedCodec :: Agg -> Bool
hasMappedCodec = not . null . codecMappedDeclarations
hasConsumerNominalCodec :: Agg -> Bool
hasConsumerNominalCodec = not . null . codecConsumerNominals
hasConsumerNominalIdCodec :: Agg -> Bool
hasConsumerNominalIdCodec aggregate =
any
(\nominal -> case resolvedNominalRepresentation nominal of IdRepresentation {} -> True; _ -> False)
(codecConsumerNominals aggregate)
hasEnforcedConsumerNominalIdCodec :: Agg -> Bool
hasEnforcedConsumerNominalIdCodec aggregate =
any
( \nominal -> case resolvedNominalRepresentation nominal of
IdRepresentation prefix -> isJust (idDomainContractFor (aLanguageContract aggregate) prefix)
_ -> False
)
(codecConsumerNominals aggregate)
hasGeneratedNominalEnumCodec :: Agg -> Bool
hasGeneratedNominalEnumCodec aggregate =
any
(\nominal -> case resolvedNominalRepresentation nominal of EnumRepresentation {} -> True; _ -> False)
(codecGeneratedNominals aggregate)
emitEnumParsers :: Agg -> Text
emitEnumParsers a =
sectionsOf
[ [emitEnumParser nominal | nominal <- codecGeneratedNominals a, EnumRepresentation {} <- [resolvedNominalRepresentation nominal]]
]
emitEnumParser :: ResolvedNominalType -> Text
emitEnumParser nominal = case resolvedNominalRepresentation nominal of
EnumRepresentation constructors ->
nl $
[ "parse" <> name <> " :: Text -> Parser " <> name,
"parse" <> name <> " = \\case"
]
++ [" " <> tshow wire <> " -> pure " <> constructor | (constructor, wire) <- NE.toList constructors]
++ [" tag -> " <> renderUnknownFailure name "tag" (map snd (NE.toList constructors))]
_ -> error "non-enum reached generated enum parser emission"
where
name = resolvedNominalName nominal
emitConsumerNominalParsers :: Agg -> Text
emitConsumerNominalParsers aggregate = sectionsOf [map emitParser (codecConsumerNominals aggregate)]
where
emitParser nominal = case (resolvedNominalRepresentation nominal, resolvedNominalOwnership nominal) of
(IdRepresentation prefix, ConsumerNominal binding) ->
nl $
[ parserName nominal <> " :: Text -> Parser " <> renderHaskellSource (consumerNominalHaskell binding)
]
<> parserBody nominal prefix binding
(EnumRepresentation constructors, ConsumerNominal binding) ->
nl $
[ parserName nominal <> " :: Text -> Parser " <> renderHaskellSource (consumerNominalHaskell binding),
parserName nominal <> " = \\case"
]
<> [ " "
<> tshow wire
<> " -> pure (nominalFromRepresentation "
<> unQualifiedValueName (consumerNominalBinding binding)
<> " "
<> nominalRepresentationModule (aContext aggregate) (resolvedNominalName nominal)
<> "."
<> constructor
<> ")"
| (constructor, wire) <- NE.toList constructors
]
<> [" tag -> " <> renderUnknownFailure (resolvedNominalName nominal <> " wire value") "tag" (map snd (NE.toList constructors))]
_ -> ""
parserName nominal = "parse" <> resolvedNominalName nominal <> "Nominal"
parserBody nominal prefix binding = case idDomainContractFor (aLanguageContract aggregate) prefix of
Nothing ->
[ parserName nominal <> " input = case KindID.parseText @" <> tshow prefix <> " input of",
" Left reason -> fail (show reason)",
" Right representation -> pure (nominalFromRepresentation " <> unQualifiedValueName (consumerNominalBinding binding) <> " representation)"
]
Just _ ->
[ parserName nominal <> " input = case validateIdDomainText (typeIdV7Domain " <> tshow prefix <> ") input of",
" Left reason -> fail (show reason)",
" Right () -> case KindID.parseText @" <> tshow prefix <> " input of",
" Left reason -> fail (show reason)",
" Right representation -> pure (nominalFromRepresentation " <> unQualifiedValueName (consumerNominalBinding binding) <> " representation)"
]
emitCodecValue :: Agg -> Text
emitCodecValue a =
nl $
[ lowerFirst (aName a) <> "Codec :: Codec " <> aName a <> "Event",
lowerFirst (aName a) <> "Codec =",
" Codec",
" { eventTypes = " <> eventTypesExpr,
" , eventType = \\case"
]
++ [" " <> rcName e <> "{} -> EventType " <> tshow (rcName e) | e <- aEvents a]
++ [ " , schemaVersion = " <> tshow' (maxEventVersion a),
" , encode = encode" <> aName a <> "Event",
" , decode = parse" <> aName a <> "Event",
" , upcasters = " <> upcastersExpr a,
" }"
]
++ upcasterRungDecls a
where
eventTypesExpr = case map rcName (aEvents a) of
[] -> "error \"no events\""
(e : es) -> "EventType " <> tshow e <> " :| [" <> T.intercalate ", " (map (("EventType " <>) . tshow) es) <> "]"
-- | The codec's @schemaVersion@: the maximum declared event version (EP-2).
maxEventVersion :: Agg -> Int
maxEventVersion a = maximum (1 : map rcVersion (aEvents a))
-- | One @(sourceVersion, upcasterName)@ entry per event that declares an
-- @upcast from@. The upcaster name is per-event (e.g. @upcastFooV1@) and its
-- body is a hole in the hand-owned Holes module.
upcasterEntries :: Agg -> [(Int, Text, Text)]
upcasterEntries a =
[ (m, rcName e, "upcast" <> rcName e <> "V" <> tshow' m)
| e <- aEvents a,
Just m <- [rcUpcastFrom e]
]
upcastersExpr :: Agg -> Text
upcastersExpr a =
"[" <> T.intercalate ", " ["(" <> tshow' m <> ", upcastRungV" <> tshow' m <> ")" | (m, _) <- upcasterRungs a] <> "]"
-- | Group event-specific holes into one migration rung per aggregate-global
-- source version. Event metadata stamps every kind with the aggregate's
-- schema version, so a rung must explicitly pass foreign event kinds through.
upcasterRungs :: Agg -> [(Int, [(Text, Text)])]
upcasterRungs a =
[ (source, [(eventName, fn) | (_, eventName, fn) <- entries])
| entries@((source, _, _) : _) <- groupBy sameSource (sortOn firstSource (upcasterEntries a))
]
where
firstSource (source, _, _) = source
sameSource (source, _, _) (otherSource, _, _) = source == otherSource
upcasterRungDecls :: Agg -> [Text]
upcasterRungDecls a = concatMap rung (upcasterRungs a)
where
rung (source, entries) =
[ "",
"upcastRungV" <> tshow' source <> " :: EventType -> Value -> Either Text Value"
]
++ [ "upcastRungV" <> tshow' source <> " (EventType " <> tshow eventName <> ") value = " <> fn <> " value"
| (eventName, fn) <- entries
]
++ [ "-- Kinds whose shape did not change at this rung pass through unchanged; their",
"-- stamped version is aggregate-global, not their own shape history.",
"upcastRungV" <> tshow' source <> " _ value = Right value"
]
-- | When the codec references upcasters, it imports their (hole) definitions
-- from the hand-owned Holes module.
upcasterImport :: Agg -> Text
upcasterImport a = case upcasterEntries a of
[] -> ""
es -> "import " <> aHolePrefix a <> ".Holes (" <> T.intercalate ", " [fn | (_, _, fn) <- es] <> ")"
emitEncode :: Agg -> Text
emitEncode a =
nl $
[ "encode" <> aName a <> "Event :: " <> aName a <> "Event -> Value",
"encode" <> aName a <> "Event = \\case"
]
++ concatMap encodeArm (aEvents a)
where
encodeArm e =
[ " " <> rcName e <> " payload ->",
" object"
]
++ [ lead i <> kv
| (i, kv) <- zip [(0 :: Int) ..] (("\"kind\" .= (" <> tshow (rcName e) <> " :: Text)") : map encodeField (rcFields e))
]
++ [" ]"]
lead 0 = " [ "
lead _ = " , "
encodeField (n, ty) =
tshow n
<> " .= "
<> encodeFieldValue n ty
encodeFieldValue name ty = case ty of
AggregateNominal nominal -> encodeNominalValue nominal ("payload." <> name)
_ -> case fieldCat a ty of
MappedStructuralCat declaration _ -> "encode" <> sdName declaration <> "Mapped payload." <> name
MappedOpaqueCat {} -> "toJSON payload." <> name
_ -> "payload." <> name
encodeNominalValue nominal value = case resolvedNominalOwnership nominal of
GeneratedNominal -> case resolvedNominalRepresentation nominal of
IdRepresentation {} -> lowerFirst (resolvedNominalName nominal) <> "Text " <> value
EnumRepresentation {} -> lowerFirst (resolvedNominalName nominal) <> "Text " <> value
ScalarRepresentation {} -> value
ConsumerNominal binding -> case resolvedNominalRepresentation nominal of
IdRepresentation {} -> "KindID.toText (nominalToRepresentation " <> bindingName binding <> " " <> value <> ")"
EnumRepresentation {} ->
nominalRepresentationModule (aContext a) (resolvedNominalName nominal)
<> "."
<> lowerFirst (resolvedNominalName nominal)
<> "RepresentationText (nominalToRepresentation "
<> bindingName binding
<> " "
<> value
<> ")"
ScalarRepresentation {} -> "nominalToRepresentation " <> bindingName binding <> " " <> value
bindingName = unQualifiedValueName . consumerNominalBinding
emitDecode :: Agg -> Text
emitDecode a =
nl $
[ "parse" <> aName a <> "Event :: EventType -> Value -> Either Text " <> aName a <> "Event",
"parse" <> aName a <> "Event (EventType tag) = mapLeftText . parseEither (withObject " <> tshow (aName a <> "Event") <> " go)",
" where",
" go o = do",
" case tag of"
]
++ concatMap decodeArm (aEvents a)
++ [" _ -> " <> renderUnknownFailure "event type" "tag" (map rcName (aEvents a))]
where
decodeArm e =
[" " <> tshow (rcName e) <> " ->"]
++ case rcFields e of
[] -> [" pure (" <> rcName e <> " " <> rcName e <> "Data)"]
fields ->
[ " " <> rcName e,
" <$> ( " <> rcName e <> "Data"
]
++ [ (if index == 0 then " <$> " else " <*> ") <> decodeField field
| (index, field) <- zip [(0 :: Int) ..] fields
]
++ [" )"]
decodeField (n, ty) = case ty of
AggregateNominal nominal -> decodeNominalField n nominal
_ -> case fieldCat a ty of
MappedStructuralCat declaration _ -> "explicitParseField parse" <> sdName declaration <> "Mapped o " <> tshow n
MappedOpaqueCat {} -> "o .: " <> tshow n
_ -> "o .: " <> tshow n
decodeNominalField name nominal = case resolvedNominalOwnership nominal of
GeneratedNominal -> case resolvedNominalRepresentation nominal of
IdRepresentation prefix -> case idDomainContractFor (aLanguageContract a) prefix of
Nothing -> "(" <> resolvedNominalName nominal <> " <$> o .: " <> tshow name <> ")"
Just _ -> "(" <> legacyNominalConstructorName nominal <> " <$> o .: " <> tshow name <> ")"
EnumRepresentation {} ->
"explicitParseField (withText "
<> tshow (resolvedNominalName nominal)
<> " parse"
<> resolvedNominalName nominal
<> ") o "
<> tshow name
ScalarRepresentation {} -> "o .: " <> tshow name
ConsumerNominal binding -> case resolvedNominalRepresentation nominal of
IdRepresentation {} -> consumerNominalFieldParser name nominal
EnumRepresentation {} -> consumerNominalFieldParser name nominal
ScalarRepresentation {} -> "(nominalFromRepresentation " <> unQualifiedValueName (consumerNominalBinding binding) <> " <$> o .: " <> tshow name <> ")"
consumerNominalFieldParser fieldName nominal =
"explicitParseField (withText "
<> tshow (resolvedNominalName nominal)
<> " parse"
<> resolvedNominalName nominal
<> "Nominal) o "
<> tshow fieldName
codecConsumerNominals :: Agg -> [ResolvedNominalType]
codecConsumerNominals aggregate =
Map.elems . Map.fromList $
[ (resolvedNominalName nominal, nominal)
| event <- aEvents aggregate,
(_, AggregateNominal nominal) <- rcFields event,
ConsumerNominal {} <- [resolvedNominalOwnership nominal]
]
codecGeneratedNominals :: Agg -> [ResolvedNominalType]
codecGeneratedNominals aggregate =
generatedNominalsInTypes
[ resolvedType
| event <- aEvents aggregate,
(_, resolvedType) <- rcFields event
]
codecNominalImports :: Agg -> [Text]
codecNominalImports aggregate =
sort . nub $
concat
[ [ hsModule (consumerNominalHaskell binding) <> " qualified",
qualifiedModule (consumerNominalBinding binding) <> " qualified"
]
<> [ nominalRepresentationModule (aContext aggregate) (resolvedNominalName nominal) <> " qualified"
| EnumRepresentation {} <- [resolvedNominalRepresentation nominal]
]
| nominal <- codecConsumerNominals aggregate,
ConsumerNominal binding <- [resolvedNominalOwnership nominal]
]
codecMappedImports :: Agg -> [Text]
codecMappedImports a = case aTypeGraph a of
Nothing -> []
Just graph ->
sort . nub $
[ structuralShapeModule (aContext a) (sdName declaration) <> " qualified"
| ResolvedStructural declaration _ <- codecMappedDeclarations a
]
<> [ hsModule (sdHaskell declaration) <> " qualified"
| ResolvedStructural declaration _ <- codecMappedDeclarations a
]
<> [ qualifiedModule (sdBinding declaration) <> " qualified"
| ResolvedStructural declaration _ <- codecMappedDeclarations a
]
<> [ hsModule (odHaskell declaration) <> " qualified"
| ResolvedOpaque declaration <- codecMappedDeclarations a
]
<> [ hsModule (odHaskell declaration) <> " qualified"
| ResolvedStructural _ shape <- codecMappedDeclarations a,
key <- directShapeRefs shape,
Just (ResolvedOpaque declaration) <- [Map.lookup key (tgDeclarations graph)]
]
codecMappedDeclarations :: Agg -> [ResolvedMappedDecl]
codecMappedDeclarations a = case aTypeGraph a of
Nothing -> []
Just graph ->
mapMaybe (\key -> Map.lookup key (tgDeclarations graph)) (sort (Map.keys selected))
where
roots =
[ key
| event <- aEvents a,
(_, AggregateMapped key) <- rcFields event,
Map.member key (tgDeclarations graph)
]
selected =
Map.fromList
[ (key, ())
| root <- roots,
key <- root : maybe [] (Map.keys . Map.fromSet (const ())) (Map.lookup root (tgReachability graph))
]
directShapeRefs :: ResolvedMappedShape -> [MappedKey]
directShapeRefs =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \_ _ fields -> concatMap (exprRefs . rwfType) fields,
onEnum = const [],
onUnion = \_ arms -> concatMap (maybe [] exprRefs . rwaPayload) arms
}
exprRefs :: ResolvedTypeExpr -> [MappedKey]
exprRefs =
foldTypeExpr
TypeExprAlgebra
{ onText = [],
onInt = [],
onInteger = [],
onBool = [],
onNatural = [],
onTime = [],
onJson = [],
onOptional = id,
onList = id,
onMap = id,
onRef = pure
}
emitMappedCodecs :: Agg -> Text
emitMappedCodecs a = case aTypeGraph a of
Nothing -> ""
Just graph ->
T.intercalate
"\n\n"
[ emitStructuralCodec a graph declaration shape
| ResolvedStructural declaration shape <- codecMappedDeclarations a
]
emitStructuralCodec :: Agg -> TypeGraph -> StructuralDecl -> ResolvedMappedShape -> Text
emitStructuralCodec a graph declaration shape =
nl
[ "encode" <> name <> "Mapped :: " <> consumerType <> " -> Value",
"encode" <> name <> "Mapped = encode" <> name <> "Shape . bindingToShape " <> binding,
"",
"parse" <> name <> "Mapped :: Value -> Parser " <> consumerType,
"parse" <> name <> "Mapped value = bindingFromShape " <> binding <> " <$> parse" <> name <> "Shape value",
"",
"decode" <> name <> "Mapped :: Value -> Either Text " <> consumerType,
"decode" <> name <> "Mapped = mapLeftText . parseEither parse" <> name <> "Mapped",
"",
"encode" <> name <> "Shape :: " <> shapeType <> " -> Value",
emitShapeEncoder a graph declaration shape,
"",
"parse" <> name <> "Shape :: Value -> Parser " <> shapeType,
emitShapeDecoder a graph declaration shape
]
where
name = sdName declaration
consumerType = renderHaskellSource (sdHaskell declaration)
shapeType = structuralShapeModule (aContext a) name <> "." <> name <> "Shape"
binding = unQualifiedValueName (sdBinding declaration)
emitShapeEncoder :: Agg -> TypeGraph -> StructuralDecl -> ResolvedMappedShape -> Text
emitShapeEncoder a graph declaration =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \_ _ fields ->
nl $
["encode" <> name <> "Shape shape =", " object"]
<> objectEntries
[ tshow (rwfKey field)
<> " .= "
<> encodeShapeExpr a graph (rwfType field) (shapeModuleName <> "." <> rwfHaskell field <> " shape")
| field <- fields
],
onEnum = \entries ->
nl $
["encode" <> name <> "Shape = \\case"]
<> [" " <> shapeModuleName <> "." <> weCtor entry <> " -> String " <> tshow (weTag entry) | entry <- entries],
onUnion = \encoding arms ->
nl $
["encode" <> name <> "Shape = \\case"]
<> concatMap (unionEncodeArm encoding) arms
}
where
name = sdName declaration
shapeModuleName = structuralShapeModule (aContext a) name
unionEncodeArm encoding arm =
[ " " <> shapeModuleName <> "." <> rwaCtor arm <> payloadPattern <> " ->",
" object"
]
<> objectEntries
( [tshow (ueTagField encoding) <> " .= (" <> tshow (rwaTag arm) <> " :: Text)"]
<> [ tshow (ueContentsField encoding) <> " .= " <> encodeShapeExpr a graph payload "payload"
| payload <- maybeToListText (rwaPayload arm)
]
)
where
payloadPattern = maybe "" (const " payload") (rwaPayload arm)
emitShapeDecoder :: Agg -> TypeGraph -> StructuralDecl -> ResolvedMappedShape -> Text
emitShapeDecoder a graph declaration =
foldMappedShape
MappedShapeAlgebra
{ onRecord = \constructor unknownFields fields ->
nl $
[ "parse" <> name <> "Shape = withObject " <> tshow (name <> "Shape") <> " $ \\objectValue -> do"
]
<> rejectLine " " unknownFields (map rwfKey fields) "objectValue"
<> [ " " <> shapeModuleName <> "." <> constructor,
" <$> " <> T.intercalate "\n <*> " (map (decodeRecordField a graph) fields)
],
onEnum = \entries ->
nl $
[ "parse" <> name <> "Shape = withText " <> tshow (name <> "Shape") <> " $ \\tag -> case tag of"
]
<> [" " <> tshow (weTag entry) <> " -> pure " <> shapeModuleName <> "." <> weCtor entry | entry <- entries]
<> [" tag -> " <> renderUnknownFailure (name <> " wire value") "tag" (map weTag entries)],
onUnion = \encoding arms ->
nl $
[ "parse" <> name <> "Shape = withObject " <> tshow (name <> "Shape") <> " $ \\objectValue -> do",
" tag <- explicitParseField (withText " <> tshow (name <> " tag") <> " validate" <> name <> "Tag) objectValue " <> tshow (ueTagField encoding),
" case tag of"
]
<> concatMap (unionDecodeArm encoding) arms
<> [ " _ -> fail \"validated union tag was not handled\"",
"",
"validate" <> name <> "Tag :: Text -> Parser Text",
"validate" <> name <> "Tag tag",
" | tag `elem` " <> renderTextList (map rwaTag arms) <> " = pure tag",
" | otherwise = " <> renderUnknownFailure (name <> " union tag") "tag" (map rwaTag arms)
]
}
where
name = sdName declaration
shapeModuleName = structuralShapeModule (aContext a) name
rejectLine _ IgnoreUnknown _ _ = []
rejectLine indent RejectUnknown allowed objectName =
[indent <> "rejectUnknownFields " <> tshow name <> " " <> renderTextList allowed <> " " <> objectName]
unionDecodeArm encoding arm =
[" " <> tshow (rwaTag arm) <> " -> do"]
<> rejectLine " " (ueUnknownFields encoding) allowed "objectValue"
<> [ case rwaPayload arm of
Nothing -> " pure " <> shapeModuleName <> "." <> rwaCtor arm
Just payload ->
" "
<> shapeModuleName
<> "."
<> rwaCtor arm
<> " <$> explicitParseField ("
<> decodeShapeExpr a graph payload
<> ") objectValue "
<> tshow (ueContentsField encoding)
]
where
allowed = ueTagField encoding : [ueContentsField encoding | rwaPayload arm /= Nothing]
decodeRecordField :: Agg -> TypeGraph -> ResolvedWireField -> Text
decodeRecordField a graph field = case rwfPresence field of
PRequired ->
"explicitParseField (" <> decoder <> ") objectValue " <> key
POptional ->
"(case KeyMap.lookup (Key.fromText "
<> key
<> ") objectValue of Nothing -> "
<> missing
<> "; Just _ -> explicitParseField ("
<> decoder
<> ") objectValue "
<> key
<> ")"
where
key = tshow (rwfKey field)
decoder = decodeShapeExpr a graph (rwfType field)
missing = case rwfOnMissing field of
Nothing -> "fail " <> tshow ("missing optional field without default: " <> rwfKey field)
Just onMissing -> "pure " <> renderMissingDefault a graph (rwfType field) onMissing
encodeShapeExpr :: Agg -> TypeGraph -> ResolvedTypeExpr -> Text -> Text
encodeShapeExpr _a graph expression value =
foldTypeExpr
TypeExprAlgebra
{ onText = \v -> "toJSON (" <> v <> ")",
onInt = \v -> "toJSON (" <> v <> ")",
onInteger = \v -> "toJSON (" <> v <> ")",
onBool = \v -> "toJSON (" <> v <> ")",
onNatural = \v -> "toJSON (" <> v <> ")",
onTime = \v -> "toJSON (" <> v <> ")",
onJson = id,
onOptional = \encode v -> "maybe Null (\\item -> " <> encode "item" <> ") (" <> v <> ")",
onList = \encode v -> "toJSON (map (\\item -> " <> encode "item" <> ") (" <> v <> "))",
onMap = \encode v -> "toJSON (Map.map (\\item -> " <> encode "item" <> ") (" <> v <> "))",
onRef = \key v -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural nested _) -> "encode" <> sdName nested <> "Shape (" <> v <> ")"
Just (ResolvedOpaque _) -> "toJSON (" <> v <> ")"
Nothing -> "toJSON (" <> v <> ")"
}
expression
value
decodeShapeExpr :: Agg -> TypeGraph -> ResolvedTypeExpr -> Text
decodeShapeExpr _a graph =
foldTypeExpr
TypeExprAlgebra
{ onText = "parseJSON",
onInt = "parseJSON",
onInteger = "parseJSON",
onBool = "parseJSON",
onNatural = "parseJSON",
onTime = "parseJSON",
onJson = "pure",
onOptional = \decode -> "\\value -> case value of Null -> pure Nothing; other -> Just <$> " <> decode <> " other",
onList = \decode -> "\\value -> (parseJSON value :: Parser [Value]) >>= traverse (" <> decode <> ")",
onMap = \decode -> "\\value -> (parseJSON value :: Parser (Map Text Value)) >>= traverse (" <> decode <> ")",
onRef = \key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural nested _) -> "parse" <> sdName nested <> "Shape"
Just (ResolvedOpaque _) -> "parseJSON"
Nothing -> "parseJSON"
}
renderMissingDefault :: Agg -> TypeGraph -> ResolvedTypeExpr -> OnMissing -> Text
renderMissingDefault a graph expression = \case
OmNull -> "Nothing"
OmText value -> tshow value
OmInt value -> T.pack (show value)
OmBool value -> if value then "True" else "False"
OmEmptyList -> "[]"
OmEmptyMap -> "Map.empty"
OmCtor constructor -> case expression of
RRef key -> case Map.lookup key (tgDeclarations graph) of
Just (ResolvedStructural declaration _) -> structuralShapeModule (aContext a) (sdName declaration) <> "." <> constructor
_ -> constructor
_ -> constructor
objectEntries :: [Text] -> [Text]
objectEntries entries =
[lead index <> entry | (index, entry) <- zip [(0 :: Int) ..] entries]
<> [" ]"]
where
lead 0 = " [ "
lead _ = " , "
renderTextList :: [Text] -> Text
renderTextList values = "[" <> T.intercalate ", " (map tshow values) <> "]"
-- | Emit a parser failure that names the rejected runtime value and the full,
-- deterministic wire set accepted at that point.
renderUnknownFailure :: Text -> Text -> [Text] -> Text
renderUnknownFailure label variable expected =
"fail ("
<> tshow ("unknown " <> label <> " ")
<> " <> show "
<> variable
<> " <> "
<> tshow ("; expected one of: " <> expectedText)
<> ")"
where
expectedText = case expected of
[] -> "<none>"
values -> T.intercalate ", " values
--------------------------------------------------------------------------------
-- Authoritative version-2 expressions and transducer
--------------------------------------------------------------------------------
hasVersion2Ownership :: Agg -> Bool
hasVersion2Ownership = any ((/= LegacyHoleImplementation) . tImplementation) . aTransitions
transitionEntries :: Agg -> [(Int, Transition)]
transitionEntries aggregate = zip [1 ..] (aTransitions aggregate)
transitionStem :: Int -> Transition -> Text
transitionStem index transition =
"transition"
<> tshow' index
<> pascal (tSource transition)
<> pascal (tCommand transition)
guardFunctionName :: Int -> Transition -> Text
guardFunctionName index transition = transitionStem index transition <> "Guard"
writeFunctionName :: Int -> Transition -> Name -> Text
writeFunctionName index transition registerName =
transitionStem index transition <> "Write" <> pascal registerName
holeFunctionName :: Int -> Transition -> Text
holeFunctionName index transition = transitionStem index transition <> "Hole"
holeFoldVersionName :: Int -> Transition -> Text
holeFoldVersionName index transition = holeFunctionName index transition <> "FoldVersion"
outputFunctionName :: Int -> Transition -> Int -> Name -> Text
outputFunctionName transitionIndex transition emitIndex eventName =
transitionStem transitionIndex transition
<> "Output"
<> tshow' emitIndex
<> pascal eventName
-- | Legacy create-once output-hook names made obsolete by authoritative
-- version-2 @fields(Command)@ generation. Scaffolding reports these names as
-- safe-to-remove candidates without parsing or modifying consumer Haskell.
obsoleteGeneratedOutputHooks :: Spec -> [(Name, Text)]
obsoleteGeneratedOutputHooks spec =
[ ( aggName aggregate,
outputFunctionName transitionIndex transition emitIndex eventName
)
| aggregate <- [value | NAggregate value <- specNodes spec],
(transitionIndex, transition) <- zip [1 ..] (aggTransitions aggregate),
(emitIndex, eventName) <- zip [1 ..] (tEmits transition),
Right GeneratedCommandIdentity {} <- [eventOutputMapping spec aggregate transition emitIndex eventName]
]
commandForTransition :: Agg -> Transition -> ResolvedCtor
commandForTransition aggregate transition =
fromMaybe
(error ("validated aggregate command disappeared: " <> T.unpack (tCommand transition)))
(find ((== tCommand transition) . rcName) (aCommands aggregate))
eventForName :: Agg -> Name -> ResolvedCtor
eventForName aggregate eventName =
fromMaybe
(error ("validated aggregate event disappeared: " <> T.unpack eventName))
(find ((== eventName) . rcName) (aEvents aggregate))
commandFieldsType :: Transition -> Text
commandFieldsType transition = "RegFieldsOf " <> tCommand transition <> "Data"
payloadProjectionType :: Agg -> Transition -> Text
payloadProjectionType aggregate transition =
"B.PayloadProj "
<> aName aggregate
<> "Regs "
<> aName aggregate
<> "Command ("
<> commandFieldsType transition
<> ")"
data ResolvedGeneratedTransition = ResolvedGeneratedTransition
{ resolvedTransitionIndex :: !Int,
resolvedTransitionSource :: !Transition,
resolvedTransitionGuard :: !(Maybe TypedScalarExpr),
resolvedTransitionWrites :: ![(Name, TypedScalarExpr)]
}
deriving stock (Eq, Show)
-- Resolve each generated-owned transition exactly once. Import analysis,
-- projection planning, and Haskell emission all consume this inventory.
resolvedGeneratedTransitions :: Agg -> [ResolvedGeneratedTransition]
resolvedGeneratedTransitions aggregate =
[ ResolvedGeneratedTransition
{ resolvedTransitionIndex = index,
resolvedTransitionSource = transition,
resolvedTransitionGuard = resolvedGuard index transition <$> tGuard transition,
resolvedTransitionWrites =
[ (registerName, resolvedWrite index transition registerName expression)
| (registerName, expression) <- tWrites transition
]
}
| (index, transition) <- transitionEntries aggregate,
tImplementation transition == GeneratedImplementation
]
where
environment transition = expressionEnvironment (aSpec aggregate) (aAggregate aggregate) transition
resolvedGuard index transition expression =
expressionOrDie (guardFunctionName index transition) (resolveGuardExpr (environment transition) expression)
resolvedWrite index transition registerName expression =
expressionOrDie (writeFunctionName index transition registerName) (resolveWriteExpr (environment transition) registerName expression)
resolvedGeneratedExpressions :: Agg -> [TypedScalarExpr]
resolvedGeneratedExpressions = generatedTransitionExpressions . resolvedGeneratedTransitions
generatedTransitionExpressions :: [ResolvedGeneratedTransition] -> [TypedScalarExpr]
generatedTransitionExpressions = concatMap transitionExpressions
where
transitionExpressions resolved =
maybe [] pure (resolvedTransitionGuard resolved)
<> map snd (resolvedTransitionWrites resolved)
anyTypedExpression :: (TypedScalarExpr -> Bool) -> TypedScalarExpr -> Bool
anyTypedExpression predicate expression =
predicate expression || any (anyTypedExpression predicate) (typedExpressionChildren expression)
typedExpressionChildren :: TypedScalarExpr -> [TypedScalarExpr]
typedExpressionChildren expression = case typedScalarNode expression of
TypedLiteral {} -> []
TypedRoot {} -> []
TypedProject {} -> []
TypedAdd _ left right -> [left, right]
TypedSubtract _ left right -> [left, right]
TypedMultiply _ left right -> [left, right]
TypedEqual left right -> [left, right]
TypedNotEqual left right -> [left, right]
TypedCompare _ left right -> [left, right]
TypedAnd left right -> [left, right]
TypedOr left right -> [left, right]
typedConsumerLiteralNominals :: TypedScalarExpr -> [ResolvedNominalType]
typedConsumerLiteralNominals expression = own <> concatMap typedConsumerLiteralNominals (typedExpressionChildren expression)
where
own = case (typedScalarType expression, typedScalarNode expression) of
(AggregateNominal nominal, TypedLiteral ScalarEnumValue {})
| ConsumerNominal {} <- resolvedNominalOwnership nominal -> [nominal]
(AggregateNominal nominal, TypedLiteral ScalarIdValue {})
| ConsumerNominal {} <- resolvedNominalOwnership nominal -> [nominal]
_ -> []
typedGeneratedNominals :: TypedScalarExpr -> [ResolvedNominalType]
typedGeneratedNominals expression = own <> concatMap typedGeneratedNominals (typedExpressionChildren expression)
where
own = case typedScalarType expression of
AggregateNominal nominal
| GeneratedNominal <- resolvedNominalOwnership nominal -> [nominal]
_ -> []
expressionOrDie :: Text -> Either (NonEmpty ExpressionDiagnostic) TypedScalarExpr -> TypedScalarExpr
expressionOrDie owner = either (error . (("validated expression disappeared for " <> T.unpack owner <> ": ") <>) . show) id
data ProjectionAliasTarget
= StructuralProjectionAlias !ScalarRootProvenance !ResolvedScalarProjection
| NominalProjectionAlias !ResolvedNominalType !ScalarRootProvenance
deriving stock (Eq, Show)
data ProjectionAlias = ProjectionAlias
{ projectionAliasTarget :: !ProjectionAliasTarget,
projectionAliasName :: !Text
}
deriving stock (Eq, Show)
projectionAliasesForTransition :: ResolvedGeneratedTransition -> [ProjectionAlias]
projectionAliasesForTransition resolved = allocateAliases targets
where
expressions =
maybe [] pure (resolvedTransitionGuard resolved)
<> map snd (resolvedTransitionWrites resolved)
targets = nub (concatMap projectionAliasTargets expressions)
projectionAliasTargets :: TypedScalarExpr -> [ProjectionAliasTarget]
projectionAliasTargets expression = own <> comparisonTargets <> concatMap projectionAliasTargets children
where
children = typedExpressionChildren expression
own = case typedScalarNode expression of
TypedProject provenance projection -> [StructuralProjectionAlias provenance projection]
_ -> []
comparisonTargets = case typedScalarNode expression of
TypedEqual left right -> mapMaybe nominalTarget [left, right]
TypedNotEqual left right -> mapMaybe nominalTarget [left, right]
_ -> []
nominalTarget operand = case (typedScalarType operand, typedScalarNode operand) of
(AggregateNominal nominal, TypedRoot provenance)
| nominalComparisonProjection nominal -> Just (NominalProjectionAlias nominal provenance)
_ -> Nothing
allocateAliases :: [ProjectionAliasTarget] -> [ProjectionAlias]
allocateAliases = snd . foldl allocate (Map.empty, [])
where
allocate (counts, aliases) target =
let base = projectionAliasBase target
occurrence = Map.findWithDefault 0 base counts + 1
alias = if occurrence == 1 then base else base <> tshow' occurrence
in (Map.insert base occurrence counts, aliases <> [ProjectionAlias target alias])
projectionAliasBase :: ProjectionAliasTarget -> Text
projectionAliasBase target = prefix <> pascal rootName <> pathSuffix
where
provenance = case target of
StructuralProjectionAlias value _ -> value
NominalProjectionAlias _ value -> value
(prefix, rootName) = case provenance of
ScalarRegisterRoot name _ -> ("register", name)
ScalarCommandRoot name _ -> ("command", name)
pathSuffix = case target of
NominalProjectionAlias {} -> ""
StructuralProjectionAlias _ projection ->
T.concat
[ normaliseAliasPart (unescapePointer segment)
| segment <- filter (not . T.null) (T.splitOn "/" (scalarProjectionPointer projection))
]
normaliseAliasPart :: Text -> Text
normaliseAliasPart value = case filter (not . T.null) (T.split (not . isAlphaNum) value) of
[] -> "Field"
pieces -> T.concat (map pascal pieces)
unescapePointer :: Text -> Text
unescapePointer = T.replace "~0" "~" . T.replace "~1" "/"
projectionAliasFor :: [ProjectionAlias] -> ProjectionAliasTarget -> Text
projectionAliasFor aliases target =
maybe
(error ("resolved projection alias disappeared: " <> show target))
projectionAliasName
(find ((== target) . projectionAliasTarget) aliases)
data RenderAssociativity = RenderLeft | RenderRight | RenderNonAssociative
deriving stock (Eq, Show)
data RenderOperandSide = RenderLeftOperand | RenderRightOperand
deriving stock (Eq, Show)
data RenderedKeikiExpr = RenderedKeikiExpr
{ renderedKeikiText :: !Text,
renderedKeikiPrecedence :: !Int
}
deriving stock (Eq, Show)
renderedAtom :: Text -> RenderedKeikiExpr
renderedAtom value = RenderedKeikiExpr value 10
renderedInfix :: Int -> RenderAssociativity -> Text -> RenderedKeikiExpr -> RenderedKeikiExpr -> RenderedKeikiExpr
renderedInfix precedence associativity operator left right =
RenderedKeikiExpr
( renderInfixChild precedence associativity RenderLeftOperand left
<> " "
<> operator
<> " "
<> renderInfixChild precedence associativity RenderRightOperand right
)
precedence
renderInfixChild :: Int -> RenderAssociativity -> RenderOperandSide -> RenderedKeikiExpr -> Text
renderInfixChild parentPrecedence associativity side child
| renderedKeikiPrecedence child > parentPrecedence = renderedKeikiText child
| renderedKeikiPrecedence child < parentPrecedence = parenthesized
| otherwise = case associativity of
RenderLeft
| side == RenderLeftOperand -> renderedKeikiText child
RenderRight
| side == RenderRightOperand -> renderedKeikiText child
_ -> parenthesized
where
parenthesized = "(" <> renderedKeikiText child <> ")"
renderKeikiPredicate :: [ProjectionAlias] -> Agg -> Transition -> TypedScalarExpr -> Text
renderKeikiPredicate aliases aggregate transition =
renderedKeikiText . renderPredicate
where
renderPredicate expression = case typedScalarNode expression of
TypedEqual left right -> comparison ".==" left right
TypedNotEqual left right -> comparison "./=" left right
TypedCompare operator left right -> comparison (renderComparisonOperator operator) left right
TypedAnd left right -> boolean 3 RenderRight ".&&" left right
TypedOr left right -> boolean 2 RenderRight ".||" left right
_ ->
renderedInfix
4
RenderNonAssociative
".=="
(renderKeikiTerm aliases aggregate transition expression)
(renderedAtom "K.lit True")
comparison operator left right =
renderedInfix
4
RenderNonAssociative
operator
(renderComparisonTerm aliases aggregate transition left)
(renderComparisonTerm aliases aggregate transition right)
boolean precedence associativity operator left right =
renderedInfix precedence associativity operator (renderPredicate left) (renderPredicate right)
renderComparisonOperator :: CmpOp -> Text
renderComparisonOperator = \case
OpEq -> ".=="
OpNeq -> "./="
OpLt -> ".<"
OpLe -> ".<="
OpGt -> ".>"
OpGe -> ".>="
renderComparisonTerm :: [ProjectionAlias] -> Agg -> Transition -> TypedScalarExpr -> RenderedKeikiExpr
renderComparisonTerm aliases aggregate transition expression = case (typedScalarType expression, typedScalarNode expression) of
(AggregateNominal nominal, TypedRoot provenance)
| nominalComparisonProjection nominal ->
renderedAtom (projectionAliasFor aliases (NominalProjectionAlias nominal provenance))
(AggregateNominal nominal, TypedLiteral (ScalarEnumValue _ constructor)) ->
renderedAtom ("K.lit (" <> tshow (enumWireFor nominal constructor) <> " :: Text)")
(AggregateNominal _, TypedLiteral (ScalarIdValue _ value)) ->
renderedAtom ("K.lit (" <> tshow value <> " :: Text)")
_ -> renderKeikiTerm aliases aggregate transition expression
nominalComparisonProjection :: ResolvedNominalType -> Bool
nominalComparisonProjection nominal = case resolvedNominalRepresentation nominal of
IdRepresentation {} -> True
EnumRepresentation {} -> True
ScalarRepresentation {} -> case resolvedNominalOwnership nominal of
ConsumerNominal {} -> True
GeneratedNominal -> False
enumWireFor :: ResolvedNominalType -> Name -> Text
enumWireFor nominal constructor = case resolvedNominalRepresentation nominal of
EnumRepresentation constructors -> fromMaybe (error "validated enum literal lost its wire spelling") (lookup constructor (NE.toList constructors))
_ -> error "validated enum literal lost its enum representation"
renderNominalProjectionTerm :: Agg -> Transition -> ResolvedNominalType -> ScalarRootProvenance -> Text
renderNominalProjectionTerm aggregate transition nominal provenance = case provenance of
ScalarRegisterRoot registerName ownerType ->
"K.regProj "
<> projectionQualifier
<> "."
<> witness
<> " (#"
<> registerName
<> " :: K.Index "
<> aName aggregate
<> "Regs "
<> renderDomainType aggregate ownerType
<> ")"
ScalarCommandRoot fieldName ownerType ->
"K.inpProj "
<> projectionQualifier
<> "."
<> witness
<> " inCtor"
<> tCommand transition
<> " (#"
<> fieldName
<> " :: K.Index ("
<> commandFieldsType transition
<> ") "
<> renderDomainType aggregate ownerType
<> ")"
where
projectionQualifier = case resolvedNominalOwnership nominal of
GeneratedNominal -> "GeneratedNominals"
ConsumerNominal {} -> "NominalProjections"
witness = case resolvedNominalRepresentation nominal of
ScalarRepresentation {} -> lowerFirst (resolvedNominalName nominal) <> "Witness"
IdRepresentation {} -> nominalEqualityWitnessName nominal
EnumRepresentation {} -> nominalEqualityWitnessName nominal
renderKeikiTerm :: [ProjectionAlias] -> Agg -> Transition -> TypedScalarExpr -> RenderedKeikiExpr
renderKeikiTerm aliases aggregate transition expression = case typedScalarNode expression of
TypedLiteral value -> renderedAtom (renderKeikiLiteral aggregate (typedScalarType expression) value)
TypedRoot (ScalarRegisterRoot registerName _) -> renderedAtom ("B.reg @" <> tshow registerName)
TypedRoot (ScalarCommandRoot fieldName _) -> renderedAtom ("d." <> fieldName)
TypedProject provenance projection ->
renderedAtom (projectionAliasFor aliases (StructuralProjectionAlias provenance projection))
TypedAdd _ left right -> arithmetic 6 ".+" left right
TypedSubtract _ left right -> arithmetic 6 ".-" left right
TypedMultiply _ left right -> arithmetic 7 ".*" left right
TypedEqual {} -> impossiblePredicate
TypedNotEqual {} -> impossiblePredicate
TypedCompare {} -> impossiblePredicate
TypedAnd {} -> impossiblePredicate
TypedOr {} -> impossiblePredicate
where
arithmetic precedence operator left right =
renderedInfix
precedence
RenderLeft
operator
(renderKeikiTerm aliases aggregate transition left)
(renderKeikiTerm aliases aggregate transition right)
impossiblePredicate = error "predicate-valued Boolean expressions cannot be lowered as register terms"
renderStructuralProjectionTerm :: Agg -> Transition -> ScalarRootProvenance -> ResolvedScalarProjection -> Text
renderStructuralProjectionTerm aggregate transition provenance projection = case provenance of
ScalarRegisterRoot registerName ownerType ->
"K.regProj StructuralProjections."
<> witness
<> " (#"
<> registerName
<> " :: K.Index "
<> aName aggregate
<> "Regs "
<> renderDomainType aggregate ownerType
<> ")"
ScalarCommandRoot fieldName ownerType ->
"K.inpProj StructuralProjections."
<> witness
<> " inCtor"
<> tCommand transition
<> " (#"
<> fieldName
<> " :: K.Index ("
<> commandFieldsType transition
<> ") "
<> renderDomainType aggregate ownerType
<> ")"
where
witness =
fromMaybe
(error ("resolved structural projection witness disappeared: " <> show projection))
(aTypeGraph aggregate >>= \graph -> projectionWitnessName graph (scalarProjectionOwner projection) (scalarProjectionPointer projection))
renderKeikiLiteral :: Agg -> ResolvedAggregateType -> ScalarValue -> Text
renderKeikiLiteral aggregate scalarType = \case
ScalarTextValue value -> "K.lit (" <> tshow value <> " :: Text)"
ScalarIntValue value -> "K.lit (" <> tshow' value <> " :: Int)"
ScalarIntegerValue value -> "K.lit (" <> T.pack (show value) <> " :: Integer)"
ScalarNaturalValue value -> "K.lit (" <> T.pack (show value) <> " :: Natural)"
ScalarBoolValue value -> "K.lit " <> if value then "True" else "False"
ScalarTimeValue value -> "K.lit " <> renderRegisterInitial (InitialTime value)
ScalarEnumValue typeName constructor -> case scalarType of
AggregateNominal nominal -> case resolvedNominalOwnership nominal of
GeneratedNominal -> "K.lit " <> constructor
ConsumerNominal binding ->
"K.lit (nominalFromRepresentation "
<> unQualifiedValueName (consumerNominalBinding binding)
<> " "
<> nominalRepresentationModule (aContext aggregate) typeName
<> "."
<> constructor
<> ")"
_ -> error "validated enum literal lost its nominal type"
ScalarIdValue typeName value -> case scalarType of
AggregateNominal nominal -> case resolvedNominalOwnership nominal of
GeneratedNominal -> case idDomainContractFor (aLanguageContract aggregate) =<< idPrefixOf nominal of
Nothing -> "K.lit (" <> typeName <> " " <> tshow value <> ")"
Just _ ->
"K.lit (case parse"
<> typeName
<> " "
<> tshow value
<> " of Right parsed -> parsed; Left _ -> error \"validated ID literal failed to parse\")"
ConsumerNominal binding -> case resolvedNominalRepresentation nominal of
IdRepresentation prefix ->
"K.lit (nominalFromRepresentation "
<> unQualifiedValueName (consumerNominalBinding binding)
<> " (case KindID.parseText @"
<> tshow prefix
<> " "
<> tshow value
<> " of Right parsed -> parsed; Left _ -> error \"validated ID literal failed to parse\"))"
_ -> error "validated ID literal lost its ID representation"
_ -> error "validated ID literal lost its nominal type"
where
idPrefixOf nominal = case resolvedNominalRepresentation nominal of
IdRepresentation prefix -> Just prefix
_ -> Nothing
generatedIdSampleHaskell :: Agg -> ResolvedNominalType -> Maybe Text
generatedIdSampleHaskell aggregate nominal = do
prefix <- case resolvedNominalRepresentation nominal of
IdRepresentation value -> Just value
_ -> Nothing
contract <- idDomainContractFor (aLanguageContract aggregate) prefix
let name = resolvedNominalName nominal
sample = idDomainSampleText contract
pure
( "(case parse"
<> name
<> " "
<> tshow sample
<> " of Right parsed -> parsed; Left _ -> error \"generated valid ID sample failed to parse\")"
)
emitGeneratedTransducer :: Agg -> Text
emitGeneratedTransducer aggregate =
nl $
[ "{-# LANGUAGE BlockArguments #-}",
"{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE GADTs #-}",
"{-# LANGUAGE OverloadedRecordDot #-}"
]
++ ["{-# LANGUAGE OverloadedLabels #-}" | not (null projectionAliases)]
++ [ "{-# LANGUAGE QualifiedDo #-}",
"{-# LANGUAGE TypeApplications #-}",
generatedBanner,
"module " <> aGenPrefix aggregate <> ".Transducer",
" ( " <> lowerFirst (aName aggregate) <> "Transducer",
" , " <> lowerFirst (aName aggregate) <> "FoldFingerprint",
" , BehaviorOwnership (..)",
" , " <> lowerFirst (aName aggregate) <> "PredicateVerifications",
" ) where",
"",
"import " <> aGenPrefix aggregate <> ".Domain",
"import Data.Text (Text)"
]
++ ["import Data.Time.Calendar (fromGregorian)" | expressionUsesTimeLiteral]
++ ["import Data.Time.Clock (UTCTime (..), picosecondsToDiffTime)" | expressionUsesTimeLiteral]
++ ["import Numeric.Natural (Natural)" | expressionUsesNaturalLiteral]
++ generatedNominalTypeImportsForService (aggregateCheckedService aggregate) (aContext aggregate) generatedExpressionNominals
++ structuralProjectionImport
++ generatedNominalProjectionImport
++ consumerNominalProjectionImport
++ consumerImports
++ ["import Data.KindID qualified as KindID" | expressionUsesConsumerIdLiteral]
++ ["import Keiro.Codec.Nominal (nominalFromRepresentation)" | expressionUsesConsumerNominalLiteral]
++ consumerLiteralImports
++ [ "import Keiki.Builder qualified as B",
"import Keiki.Core (" <> T.intercalate ", " keikiCoreImports <> ")",
"import Keiki.Core qualified as K",
"import Keiki.Symbolic qualified as S"
]
++ ["import " <> aHolePrefix aggregate <> ".Holes qualified as Holes" | transducerUsesHoles aggregate]
++ ["import Data.Text qualified as T" | anyHoleOwned aggregate]
++ ["import Keiki.Builder ((=:))" | any (not . null . tWrites . snd) (transitionEntries aggregate)]
++ ["import Keiki.Generics (RegFieldsOf)" | not (null projectionAliases)]
++ ["import Keiro.Snapshot.Codec (FoldVersion (..))" | anyHoleOwned aggregate]
++ [ "",
lowerFirst (aName aggregate) <> "Transducer",
" :: SymTransducer",
" (HsPred " <> aName aggregate <> "Regs " <> aName aggregate <> "Command)",
" " <> aName aggregate <> "Regs",
" " <> aVertexType aggregate,
" " <> aName aggregate <> "Command",
" " <> aName aggregate <> "Event",
lowerFirst (aName aggregate) <> "Transducer =",
" B.buildTransducer " <> initialVertex aggregate <> " initial" <> aName aggregate <> "Regs isTerminal do",
nl (concatMap (generatedFromBlock aggregate resolvedTransitions) (groupTransitionEntriesBySource aggregate)),
" where",
" isTerminal = \\case",
nl [" " <> vertexCtor aggregate (stName state) <> " -> True" | state <- aStates aggregate, stTerminal state],
" _ -> False",
"",
lowerFirst (aName aggregate) <> "FoldFingerprint :: Text",
lowerFirst (aName aggregate) <> "FoldFingerprint = " <> foldFingerprintExpression aggregate,
"",
"data BehaviorOwnership = GeneratedOwned | HoleOwned",
" deriving stock (Eq, Show)",
"",
"-- Every checked transition predicate is audited through Keiki's conservative",
"-- symbolic verifier. Opaque Hole terms remain explicitly unverified.",
lowerFirst (aName aggregate) <> "PredicateVerifications :: IO [(Text, BehaviorOwnership, S.PredicateVerification)]",
lowerFirst (aName aggregate) <> "PredicateVerifications = sequence",
nl (renderVerificationList aggregate),
" where",
" verifyTransition label owner source edgeIndex =",
" case drop edgeIndex (K.edgesOut " <> lowerFirst (aName aggregate) <> "Transducer source) of",
" K.Edge predicate _ _ _ _ : _ -> (\\result -> (label, owner, result)) <$> S.verifyPredicate predicate",
" [] -> pure (label, owner, S.UnverifiedSolverFailure \"generated transition edge missing\")"
]
where
resolvedTransitions = resolvedGeneratedTransitions aggregate
resolvedExpressions = generatedTransitionExpressions resolvedTransitions
projectionAliases = concatMap projectionAliasesForTransition resolvedTransitions
projectionTargets = map projectionAliasTarget projectionAliases
structuralProjectionImport =
[ "import " <> structuralProjectionModule (aContext aggregate) <> " qualified as StructuralProjections"
| any isStructuralProjection projectionTargets
]
generatedNominalProjectionImport =
[ "import " <> generatedNominalModule (aContext aggregate) <> " qualified as GeneratedNominals"
| any isGeneratedNominalProjection projectionTargets
]
consumerNominalProjectionImport =
[ "import " <> nominalProjectionModule (aContext aggregate) <> " qualified as NominalProjections"
| any isConsumerNominalProjection projectionTargets
]
consumerImports =
map ("import " <>)
. filter (not . builtinExpressionImport)
. sort
. nub
. Set.toList
. Set.unions
$ [ aggregateImports (aSymbols aggregate) resolvedType
| resolvedType <- expressionImportTypes
]
expressionImportTypes = nub (concatMap typedExpressionImportTypes resolvedExpressions)
consumerLiteralImports =
[ "import " <> nominalRepresentationModule (aContext aggregate) (resolvedNominalName nominal) <> " qualified"
| nominal <- consumerLiteralNominals,
EnumRepresentation {} <- [resolvedNominalRepresentation nominal]
]
<> [ "import " <> qualifiedModule (consumerNominalBinding binding) <> " qualified"
| nominal <- consumerLiteralNominals,
ConsumerNominal binding <- [resolvedNominalOwnership nominal]
]
consumerLiteralNominals = nub [nominal | expression <- resolvedExpressions, nominal <- typedConsumerLiteralNominals expression]
generatedExpressionNominals =
stableNominals
[ nominal
| expression <- resolvedExpressions,
nominal <- typedGeneratedNominals expression
]
expressionUsesTimeLiteral = any (anyTypedExpression isTimeLiteral) resolvedExpressions
expressionUsesNaturalLiteral = any (anyTypedExpression isNaturalLiteral) resolvedExpressions
expressionUsesConsumerNominalLiteral = not (null consumerLiteralNominals)
expressionUsesConsumerIdLiteral = any (isIdRepresentation . resolvedNominalRepresentation) consumerLiteralNominals
usedOperators = nub (concatMap generatedTransitionOperators resolvedTransitions)
keikiCoreImports = ["HsPred", "SymTransducer"] <> ["(" <> operator <> ")" | operator <- expressionOperatorOrder, operator `elem` usedOperators]
isTimeLiteral expression = case typedScalarNode expression of
TypedLiteral ScalarTimeValue {} -> True
_ -> False
isNaturalLiteral expression = case typedScalarNode expression of
TypedLiteral ScalarNaturalValue {} -> True
_ -> False
isIdRepresentation IdRepresentation {} = True
isIdRepresentation _ = False
builtinExpressionImport :: Text -> Bool
builtinExpressionImport imported =
any (`T.isPrefixOf` imported) ["Data.Text", "Data.Time", "Numeric.Natural"]
typedExpressionImportTypes :: TypedScalarExpr -> [ResolvedAggregateType]
typedExpressionImportTypes expression = own <> concatMap typedExpressionImportTypes (typedExpressionChildren expression)
where
own = case typedScalarNode expression of
TypedLiteral {} -> [typedScalarType expression]
TypedRoot provenance -> [scalarRootType provenance]
TypedProject provenance _ -> [scalarRootType provenance]
_ -> []
scalarRootType :: ScalarRootProvenance -> ResolvedAggregateType
scalarRootType = \case
ScalarRegisterRoot _ resolvedType -> resolvedType
ScalarCommandRoot _ resolvedType -> resolvedType
isStructuralProjection :: ProjectionAliasTarget -> Bool
isStructuralProjection StructuralProjectionAlias {} = True
isStructuralProjection NominalProjectionAlias {} = False
isGeneratedNominalProjection :: ProjectionAliasTarget -> Bool
isGeneratedNominalProjection (NominalProjectionAlias nominal _) = resolvedNominalOwnership nominal == GeneratedNominal
isGeneratedNominalProjection StructuralProjectionAlias {} = False
isConsumerNominalProjection :: ProjectionAliasTarget -> Bool
isConsumerNominalProjection (NominalProjectionAlias nominal _) = case resolvedNominalOwnership nominal of
ConsumerNominal {} -> True
GeneratedNominal -> False
isConsumerNominalProjection StructuralProjectionAlias {} = False
expressionOperatorOrder :: [Text]
expressionOperatorOrder = [".*", ".+", ".-", ".==", "./=", ".<", ".<=", ".>", ".>=", ".&&", ".||"]
generatedTransitionOperators :: ResolvedGeneratedTransition -> [Text]
generatedTransitionOperators resolved =
maybe [] predicateOperators (resolvedTransitionGuard resolved)
<> concatMap (termOperators . snd) (resolvedTransitionWrites resolved)
where
predicateOperators expression = case typedScalarNode expression of
TypedEqual left right -> ".==" : termOperators left <> termOperators right
TypedNotEqual left right -> "./=" : termOperators left <> termOperators right
TypedCompare operator left right -> renderComparisonOperator operator : termOperators left <> termOperators right
TypedAnd left right -> ".&&" : predicateOperators left <> predicateOperators right
TypedOr left right -> ".||" : predicateOperators left <> predicateOperators right
_ -> ".==" : termOperators expression
termOperators expression = case typedScalarNode expression of
TypedAdd _ left right -> ".+" : termOperators left <> termOperators right
TypedSubtract _ left right -> ".-" : termOperators left <> termOperators right
TypedMultiply _ left right -> ".*" : termOperators left <> termOperators right
_ -> concatMap termOperators (typedExpressionChildren expression)
anyHoleOwned :: Agg -> Bool
anyHoleOwned = any ((== HoleImplementation) . tImplementation) . aTransitions
transducerUsesHoles :: Agg -> Bool
transducerUsesHoles aggregate =
anyHoleOwned aggregate
|| any isHandOwned (Map.elems (aOutputMappings aggregate))
where
isHandOwned HandOwnedEventOutput {} = True
isHandOwned GeneratedCommandIdentity {} = False
renderVerificationList :: Agg -> [Text]
renderVerificationList aggregate =
[ (if listIndex == (0 :: Int) then " [ " else " , ")
<> "verifyTransition "
<> tshow (transitionStem transitionIndex transition)
<> " "
<> ownership
<> " "
<> vertexCtor aggregate source
<> " "
<> tshow' edgeIndex
| (listIndex, (source, edgeIndex, transitionIndex, transition)) <- zip [0 ..] entries,
let ownership = case tImplementation transition of
GeneratedImplementation -> "GeneratedOwned"
HoleImplementation -> "HoleOwned"
LegacyHoleImplementation -> error "legacy transition reached version-2 verification generation"
]
<> [" ]"]
where
entries =
[ (source, edgeIndex, transitionIndex, transition)
| (source, transitions) <- groupTransitionEntriesBySource aggregate,
(edgeIndex, (transitionIndex, transition)) <- zip [0 ..] transitions
]
foldFingerprintExpression :: Agg -> Text
foldFingerprintExpression aggregate = case holeVersions of
[] -> tshow (aFoldFingerprint aggregate)
_ ->
"T.intercalate \"|\" ("
<> tshow (aFoldFingerprint aggregate)
<> " : [foldToken "
<> T.intercalate ", foldToken " holeVersions
<> "] ) where foldToken (FoldVersion token) = T.pack (show (T.length token)) <> \":\" <> token"
where
holeVersions =
[ "Holes." <> holeFoldVersionName index transition
| (index, transition) <- transitionEntries aggregate,
tImplementation transition == HoleImplementation
]
groupTransitionEntriesBySource :: Agg -> [(Text, [(Int, Transition)])]
groupTransitionEntriesBySource aggregate = go [] (transitionEntries aggregate)
where
go accumulated [] = reverse accumulated
go accumulated (entry@(_, transition) : remaining) =
let source = tSource transition
(same, rest) = span ((== source) . tSource . snd) remaining
in go ((source, entry : same) : accumulated) rest
generatedFromBlock :: Agg -> [ResolvedGeneratedTransition] -> (Text, [(Int, Transition)]) -> [Text]
generatedFromBlock aggregate resolvedTransitions (source, transitions) =
[" B.from " <> vertexCtor aggregate source <> " do"]
++ concatMap (uncurry (generatedOnCmdBlock aggregate resolvedTransitions)) transitions
generatedOnCmdBlock :: Agg -> [ResolvedGeneratedTransition] -> Int -> Transition -> [Text]
generatedOnCmdBlock aggregate resolvedTransitions index transition =
[" B.onCmd inCtor" <> tCommand transition <> " $ \\" <> payloadBinder <> " -> B.do"]
++ projectionBindingLines
++ [" B.replayOnly" | tMode transition == TmReplayOnly]
++ generatedBehavior
++ outputLines
++ [" B.noEmit" | null (tEmits transition)]
++ [" B.goto " <> vertexCtor aggregate (tGoto transition)]
where
generatedBehavior = case tImplementation transition of
GeneratedImplementation ->
maybe [] (renderGuardLines aliases aggregate transition) (resolvedTransitionGuard resolved)
++ [ " B.slot @" <> tshow registerName <> " =: " <> renderAssignmentOperand (renderKeikiTerm aliases aggregate transition expression)
| (registerName, expression) <- resolvedTransitionWrites resolved
]
HoleImplementation -> [" Holes." <> holeFunctionName index transition <> " d"]
LegacyHoleImplementation -> error "legacy transition reached version-2 transducer generation"
resolved =
fromMaybe
(error ("resolved generated transition disappeared: " <> show index))
(find ((== index) . resolvedTransitionIndex) resolvedTransitions)
aliases
| tImplementation transition == GeneratedImplementation = projectionAliasesForTransition resolved
| otherwise = []
projectionBindingLines = case aliases of
[] -> []
firstAlias : remainingAliases ->
[" let " <> renderProjectionAliasBinding aggregate transition firstAlias]
<> [" " <> renderProjectionAliasBinding aggregate transition alias | alias <- remainingAliases]
outputLines =
concat
[ generatedOutputLines aggregate index transition emitIndex eventName
| (emitIndex, eventName) <- zip [1 ..] (tEmits transition)
]
payloadBinder
| payloadIsUsed = "d"
| otherwise = "_d"
payloadIsUsed = case tImplementation transition of
GeneratedImplementation ->
isJust (resolvedTransitionGuard resolved)
|| not (null (resolvedTransitionWrites resolved))
|| any outputUsesPayload (zip [1 ..] (tEmits transition))
HoleImplementation -> True
LegacyHoleImplementation -> True
outputUsesPayload (emitIndex, _) = case outputMappingFor aggregate index emitIndex of
GeneratedCommandIdentity _ fields -> not (null fields)
HandOwnedEventOutput {} -> True
renderProjectionAliasBinding :: Agg -> Transition -> ProjectionAlias -> Text
renderProjectionAliasBinding aggregate transition alias =
projectionAliasName alias <> " = " <> case projectionAliasTarget alias of
StructuralProjectionAlias provenance projection -> renderStructuralProjectionTerm aggregate transition provenance projection
NominalProjectionAlias nominal provenance -> renderNominalProjectionTerm aggregate transition nominal provenance
renderGuardLines :: [ProjectionAlias] -> Agg -> Transition -> TypedScalarExpr -> [Text]
renderGuardLines aliases aggregate transition expression =
[" B.requireGuard $"]
<> [" " <> line | line <- T.lines readable]
where
readable =
T.replace " .|| " "\n.|| "
. T.replace " .&& " "\n.&& "
$ renderKeikiPredicate aliases aggregate transition expression
renderAssignmentOperand :: RenderedKeikiExpr -> Text
renderAssignmentOperand expression
| renderedKeikiPrecedence expression <= 6 = "(" <> renderedKeikiText expression <> ")"
| otherwise = renderedKeikiText expression
generatedOutputLines :: Agg -> Int -> Transition -> Int -> Name -> [Text]
generatedOutputLines aggregate transitionIndex transition emitIndex eventName =
case outputMappingFor aggregate transitionIndex emitIndex of
GeneratedCommandIdentity _ fields -> case fields of
[] -> [" B.emit wire" <> eventName <> " B.oNil"]
_ ->
[ " B.emit wire" <> eventName <> " (" <> eventName <> "TermFields"
]
<> [ lead fieldIndex
<> outputSelector field
<> " = d."
<> outputSelector field
| (fieldIndex, field) <- zip [0 :: Int ..] fields
]
<> [" })"]
HandOwnedEventOutput {} ->
[ " B.emit wire"
<> eventName
<> " (Holes."
<> outputFunctionName transitionIndex transition emitIndex eventName
<> " d)"
]
where
lead 0 = " { "
lead _ = " , "
outputMappingFor :: Agg -> Int -> Int -> EventOutputMapping
outputMappingFor aggregate transitionIndex emitIndex =
fromMaybe
(error ("missing checked event-output mapping for transition " <> show transitionIndex <> ", emit " <> show emitIndex))
(Map.lookup (transitionIndex, emitIndex) (aOutputMappings aggregate))
--------------------------------------------------------------------------------
-- EventStream module
--------------------------------------------------------------------------------
emitEventStream :: Agg -> Text
emitEventStream a =
nl $
[ generatedBanner,
"module " <> aGenPrefix a <> ".EventStream",
" ( " <> lowerFirst (aName a) <> "Category",
" , " <> lowerFirst (aName a) <> "CommandCategory",
" , " <> lowerFirst (aName a) <> "EventStream",
" , " <> lowerFirst (aName a) <> "EventStreamDef",
" , " <> aName a <> "EventStream",
" , " <> aName a <> "EventStreamDef"
]
++ [" , " <> lowerFirst (aName a) <> "SnapshotFixture" | hasSnapshot a]
++ [ " ) where",
"",
"import " <> aGenPrefix a <> ".Domain",
"import " <> aGenPrefix a <> ".Codec (" <> lowerFirst (aName a) <> "Codec)",
transducerImport a,
"import Keiki.Core (HsPred)",
"import Keiro.EventStream (EventStream (..), SnapshotPolicy (..))",
"import Keiro.EventStream.Validate (ValidatedEventStream, mkEventStreamOrThrow)"
]
++ ["import Data.Text (Text)" | hasSnapshot a]
++ ["import Keiro.Snapshot.Codec (defaultStateCodec, withFoldFingerprint)" | hasSnapshot a]
++ [ "import Keiro.Stream qualified as Stream",
"",
"-- The validated aggregate stream category (hole-kind 5: referenced, never retyped).",
"-- Entity streams are '<category>-<id>' via Keiro.Stream.entityStream.",
"-- categoryUnsafe is safe here because this generated literal passed the DSL category proof.",
lowerFirst (aName a) <> "Category :: Stream.StreamCategory " <> aName a <> "EventStreamDef",
lowerFirst (aName a) <> "Category = Stream.categoryUnsafe " <> tshow categoryName,
"",
"-- The same category text, typed for command envelopes such as PMCommand.",
lowerFirst (aName a) <> "CommandCategory :: Stream.StreamCategory " <> aName a <> "Command",
lowerFirst (aName a) <> "CommandCategory = Stream.categoryUnsafe " <> tshow categoryName,
"",
"type " <> aName a <> "EventStreamDef =",
" EventStream (HsPred " <> aName a <> "Regs " <> aName a <> "Command) " <> aName a <> "Regs " <> aVertexType a <> " " <> aName a <> "Command " <> aName a <> "Event",
"",
"type " <> aName a <> "EventStream =",
" ValidatedEventStream (HsPred " <> aName a <> "Regs " <> aName a <> "Command) " <> aName a <> "Regs " <> aVertexType a <> " " <> aName a <> "Command " <> aName a <> "Event",
"",
lowerFirst (aName a) <> "EventStreamDef :: " <> aName a <> "EventStreamDef",
lowerFirst (aName a) <> "EventStreamDef =",
" EventStream",
" { transducer = " <> lowerFirst (aName a) <> "Transducer,",
" initialState = " <> initialVertex a <> ",",
" initialRegisters = initial" <> aName a <> "Regs,",
" eventCodec = " <> lowerFirst (aName a) <> "Codec,",
" resolveStreamName = Stream.streamName,",
" snapshotPolicy = " <> snapshotPolicyExpr a <> ","
]
++ stateCodecFieldLines a
++ [ " }",
""
]
++ snapshotFixtureLines a
++ [ lowerFirst (aName a) <> "EventStream :: " <> aName a <> "EventStream",
lowerFirst (aName a) <> "EventStream =",
" mkEventStreamOrThrow " <> tshow (aName a) <> " " <> lowerFirst (aName a) <> "EventStreamDef"
]
where
categoryName = staticCategory ("aggregate " <> aName a) (lowerFirst (aName a))
snapshotPolicyExpr :: Agg -> Text
snapshotPolicyExpr aggregate = case aSnapshot aggregate of
Nothing -> "Never"
Just snapshot -> case snapPolicy snapshot of
SnapEvery interval -> "Every " <> tshow' interval
SnapOnTerminal -> "OnTerminal"
stateCodecExpr :: Agg -> Text
stateCodecExpr aggregate = case aSnapshot aggregate of
Nothing -> "Nothing"
Just snapshot ->
"Just (withFoldFingerprint "
<> foldFingerprintValue aggregate
<> " (defaultStateCodec "
<> tshow' (snapCodecVersion snapshot)
<> "))"
transducerImport :: Agg -> Text
transducerImport aggregate
| hasVersion2Ownership aggregate =
"import "
<> aGenPrefix aggregate
<> ".Transducer ("
<> lowerFirst (aName aggregate)
<> "FoldFingerprint, "
<> lowerFirst (aName aggregate)
<> "Transducer)"
| otherwise =
"import "
<> aHolePrefix aggregate
<> ".Holes ("
<> lowerFirst (aName aggregate)
<> "Transducer)"
foldFingerprintValue :: Agg -> Text
foldFingerprintValue aggregate
| hasVersion2Ownership aggregate = lowerFirst (aName aggregate) <> "FoldFingerprint"
| otherwise = tshow (aFoldFingerprint aggregate)
stateCodecFieldLines :: Agg -> [Text]
stateCodecFieldLines aggregate = case aSnapshot aggregate of
Nothing -> [" stateCodec = Nothing"]
Just _
| hasVersion2Ownership aggregate ->
[ " -- The snapshot discriminator composes: the spec's state-codec version (bump it",
" -- in the spec's `state-codec version=` clause), keiki's register and",
" -- control-state shape hashes, and this fold fingerprint derived from the",
" -- spec's transition surface (guards, writes, emits, states, register",
" -- initials, referenced rules). Spec-visible fold changes invalidate old",
" -- snapshots automatically. Version-2 Hole-owned transitions additionally",
" -- compose their explicit hand-owned FoldVersion tokens here; bump the",
" -- corresponding token whenever that Hole behavior changes.",
" stateCodec = " <> stateCodecExpr aggregate
]
| otherwise ->
[ " -- The snapshot discriminator composes: the spec's state-codec version (bump it",
" -- in the spec's `state-codec version=` clause), keiki's register and",
" -- control-state shape hashes, and this fold fingerprint derived from the",
" -- spec's transition surface (guards, writes, emits, states, register",
" -- initials, referenced rules). Spec-visible fold changes invalidate old",
" -- snapshots automatically. Fold changes made ONLY in the hand-owned Holes",
" -- module are invisible here: bump `state-codec version=` manually or old",
" -- snapshots will be served stale.",
" stateCodec = " <> stateCodecExpr aggregate
]
snapshotFixtureLines :: Agg -> [Text]
snapshotFixtureLines aggregate = case aSnapshot aggregate of
Nothing -> []
Just snapshot ->
[ lowerFirst (aName aggregate) <> "SnapshotFixture :: (Int, Text)",
lowerFirst (aName aggregate) <> "SnapshotFixture = (" <> tshow' (snapCodecVersion snapshot) <> ", " <> tshow (snapShapeHash snapshot) <> ")",
""
]
--------------------------------------------------------------------------------
-- Projection module
--------------------------------------------------------------------------------
emitProjection :: Agg -> Text
emitProjection a = case aProjection a of
Nothing -> nl [generatedBanner, "module " <> aGenPrefix a <> ".Projection () where"]
Just p ->
nl
[ "{-# LANGUAGE OverloadedRecordDot #-}",
generatedBanner,
"module " <> aGenPrefix a <> ".Projection",
" ( " <> lowerFirst (projTable p) <> "Projection",
" , " <> lowerFirst (projTable p) <> "StatusFor",
" ) where",
"",
"import " <> aGenPrefix a <> ".Domain",
"import " <> aHolePrefix a <> ".Holes (apply" <> pascal (projTable p) <> ")",
"import Data.Text (Text)",
"import Keiro.Projection (InlineProjection (..))",
"",
"-- The deterministic event->status mapping (hole-kind 3, /mapping/), derived",
"-- from the spec's status-map. The read-model SQL that consumes it lives in",
"-- the hand-owned Holes module (a DB-coupled hole, delegated to codd).",
projectionTableComment a p,
lowerFirst (projTable p) <> "StatusFor :: " <> aName a <> "Event -> Maybe Text",
lowerFirst (projTable p) <> "StatusFor = \\case",
nl (statusArms a p),
"",
lowerFirst (projTable p) <> "Projection :: InlineProjection " <> aName a <> "Event",
lowerFirst (projTable p) <> "Projection =",
" InlineProjection",
" { name = " <> tshow (contextNameToProjName a p),
" , apply = apply" <> pascal (projTable p),
" }"
]
statusArms :: Agg -> ProjectionSpec -> [Text]
statusArms a p =
[ " " <> rcName e <> " {} -> " <> statusFor e
| e <- aEvents a
]
++ [" _ -> Nothing" | hasWildcard]
where
pairs = maybe [] mapPairs (projStatusMap p)
statusFor e = case lookup (rcName e) pairs of
Just value -> "Just " <> tshow value
Nothing -> "Nothing"
-- A wildcard is only needed if some event is uncovered; otherwise every arm
-- is explicit and a wildcard would be redundant (and -Wall would warn).
hasWildcard = False
contextNameToProjName :: Agg -> ProjectionSpec -> Text
contextNameToProjName a p = contextKebab a <> "-" <> projTable p <> "-inline"
contextKebab :: Agg -> Text
contextKebab = kebabFromPascal . aCtxPascal
projectionReadModel :: Agg -> Maybe ReadModelNode
projectionReadModel aggregate = do
projection <- aProjection aggregate
find ((== projTable projection) . rmName) (aReadModels aggregate)
projectionTableComment :: Agg -> ProjectionSpec -> Text
projectionTableComment aggregate projection = case projectionReadModel aggregate of
Nothing ->
"-- WARNING: no readmodel node declares '"
<> projTable projection
<> "'; unqualified SQL depends on search_path."
Just readModel ->
"-- Qualified table "
<> qualifiedTableLiteral readModel
<> "; use "
<> genPrefixFor (aContext aggregate) (pascal (rmName readModel))
<> ".ReadModelTable."
<> readModelStem readModel
<> "QualifiedTable."
--------------------------------------------------------------------------------
-- Holes module (create-if-absent)
--------------------------------------------------------------------------------
emitHoles :: Agg -> Text
emitHoles aggregate
| hasVersion2Ownership aggregate = emitVersion2Holes aggregate
| otherwise = emitLegacyHoles aggregate
emitLegacyHoles :: Agg -> Text
emitLegacyHoles a =
nl
[ "{-# LANGUAGE BlockArguments #-}",
"{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE OverloadedRecordDot #-}",
"{-# LANGUAGE QualifiedDo #-}",
"{-# LANGUAGE TypeApplications #-}",
"-- This is a HAND-OWNED hole module. keiro-dsl creates it once and never",
"-- overwrites it. Fill the transducer body (and any other holes) against the",
"-- generated signatures, then run the harness to confirm behaviour.",
"module " <> aHolePrefix a <> ".Holes",
" ( " <> lowerFirst (aName a) <> "Transducer",
holeProjectionExport a,
holeUpcasterExports a,
" ) where",
"",
"import " <> aGenPrefix a <> ".Domain",
"import Keiki.Builder ((=:))",
"import qualified Keiki.Builder as B",
"import Keiki.Core (HsPred, RegFile, SymTransducer, lit, (.==), (./=), (.||))",
holeUpcasterImports a,
holeProjectionImports a,
"",
"-- HOLE: the transducer body. Reproduce the structure below, replacing each",
"-- `-- HOLE` line with the keiki symbolic operators it describes.",
lowerFirst (aName a) <> "Transducer",
" :: SymTransducer",
" (HsPred " <> aName a <> "Regs " <> aName a <> "Command)",
" " <> aName a <> "Regs",
" " <> aVertexType a,
" " <> aName a <> "Command",
" " <> aName a <> "Event",
lowerFirst (aName a) <> "Transducer =",
" B.buildTransducer " <> initialVertex a <> " initial" <> aName a <> "Regs isTerminal do",
nl (concatMap (fromBlock a) (groupBySource a)),
" where",
" isTerminal = \\case",
nl [" " <> vertexCtor a (stName s) <> " -> True" | s <- aStates a, stTerminal s],
" _ -> False",
holeProjectionStub a,
holeUpcasterStubs a
]
emitVersion2Holes :: Agg -> Text
emitVersion2Holes aggregate =
nl $
[ "{-# LANGUAGE BlockArguments #-}",
"{-# LANGUAGE DataKinds #-}",
"{-# LANGUAGE DuplicateRecordFields #-}",
"{-# LANGUAGE OverloadedRecordDot #-}",
"{-# LANGUAGE QualifiedDo #-}",
"{-# LANGUAGE TypeApplications #-}",
"-- This is a HAND-OWNED version-2 hook module. keiro-dsl creates it once",
"-- and never overwrites it. Generated code owns every transition envelope",
"-- and every declared guard/write. This module supplies explicit event-field",
"-- mappings and explicitly selected Hole behavior only; fields(Command)",
"-- identity mappings are generated directly and have no hook."
]
++ version2HoleModuleDeclaration aggregate
++ [ "",
"import " <> aGenPrefix aggregate <> ".Domain",
"import Keiki.Builder qualified as B",
"import Keiki.Generics (RegFieldsOf)",
holeUpcasterImports aggregate,
holeProjectionImports aggregate
]
++ ["import Keiki.Core qualified as K" | anyHoleOwned aggregate || anyZeroFieldOutput aggregate]
++ ["import Keiro.Snapshot.Codec (FoldVersion (..))" | anyHoleOwned aggregate]
++ concatMap (uncurry (emitOutputHooks aggregate)) (transitionEntries aggregate)
++ concatMap (uncurry (emitHoleImplementation aggregate)) (transitionEntries aggregate)
++ [holeProjectionStub aggregate, holeUpcasterStubs aggregate]
anyZeroFieldOutput :: Agg -> Bool
anyZeroFieldOutput aggregate =
or
[ isHandOwned (outputMappingFor aggregate transitionIndex emitIndex)
&& null (rcFields (eventForName aggregate eventName))
| (transitionIndex, transition) <- transitionEntries aggregate,
(emitIndex, eventName) <- zip [1 ..] (tEmits transition)
]
where
isHandOwned HandOwnedEventOutput {} = True
isHandOwned GeneratedCommandIdentity {} = False
version2HoleModuleDeclaration :: Agg -> [Text]
version2HoleModuleDeclaration aggregate = case version2HoleExports aggregate of
[] -> ["module " <> aHolePrefix aggregate <> ".Holes () where"]
firstExport : rest ->
[ "module " <> aHolePrefix aggregate <> ".Holes",
" ( " <> firstExport
]
++ [" , " <> value | value <- rest]
++ [" ) where"]
version2HoleExports :: Agg -> [Text]
version2HoleExports aggregate =
outputExports
<> holeExports
<> projectionExports
<> [functionName | (_, _, functionName) <- upcasterEntries aggregate]
where
outputExports =
[ outputFunctionName transitionIndex transition emitIndex eventName
| (transitionIndex, transition) <- transitionEntries aggregate,
(emitIndex, eventName) <- zip [1 ..] (tEmits transition),
HandOwnedEventOutput {} <- [outputMappingFor aggregate transitionIndex emitIndex]
]
holeExports =
concat
[ [holeFunctionName index transition, holeFoldVersionName index transition]
| (index, transition) <- transitionEntries aggregate,
tImplementation transition == HoleImplementation
]
projectionExports = case aProjection aggregate of
Nothing -> []
Just projection -> ["apply" <> pascal (projTable projection)]
emitOutputHooks :: Agg -> Int -> Transition -> [Text]
emitOutputHooks aggregate transitionIndex transition =
concat
[ emitOutputHook aggregate transitionIndex transition emitIndex (eventForName aggregate eventName)
| (emitIndex, eventName) <- zip [1 ..] (tEmits transition),
HandOwnedEventOutput {} <- [outputMappingFor aggregate transitionIndex emitIndex]
]
emitOutputHook :: Agg -> Int -> Transition -> Int -> ResolvedCtor -> [Text]
emitOutputHook aggregate transitionIndex transition emitIndex event =
[ "",
"-- Hand-owned event-field hook inside the generated transition envelope.",
functionName
<> " :: "
<> payloadProjectionType aggregate transition
<> " -> "
<> outputType,
functionName <> " d = " <> outputValue
]
where
functionName = outputFunctionName transitionIndex transition emitIndex (rcName event)
inputFields = "(" <> commandFieldsType transition <> ")"
outputType
| null (rcFields event) =
"K.OutFields "
<> aName aggregate
<> "Regs "
<> aName aggregate
<> "Command "
<> inputFields
<> " ()"
| otherwise =
rcName event
<> "TermFields "
<> aName aggregate
<> "Regs "
<> aName aggregate
<> "Command "
<> inputFields
outputValue
| null (rcFields event) = "B.oNil"
| otherwise =
rcName event
<> "TermFields\n"
<> nl (valueRecord [(fieldName, outputFieldValue fieldName fieldType) | (fieldName, fieldType) <- rcFields event])
command = commandForTransition aggregate transition
outputFieldValue fieldName fieldType
| Just commandType <- lookup fieldName (rcFields command),
commandType == fieldType =
"d." <> fieldName
| Just register <- find ((== fieldName) . rrName) (aRegs aggregate),
rrType register == fieldType =
"B.reg @" <> tshow fieldName
| otherwise = "error " <> tshow ("HOLE: fill output field " <> rcName event <> "." <> fieldName)
valueRecord fields =
[ lead fieldIndex <> fieldName <> " = " <> fieldValue
| (fieldIndex, (fieldName, fieldValue)) <- zip [0 :: Int ..] fields
]
++ [" }"]
lead 0 = " { "
lead _ = " , "
emitHoleImplementation :: Agg -> Int -> Transition -> [Text]
emitHoleImplementation _ index transition
| tImplementation transition /= HoleImplementation = []
| otherwise =
[ "",
"-- HOLE: add the predicate and ordered register updates for this transition.",
"-- The generated transducer still owns command matching, mode, emits, and goto.",
holeFunctionName index transition <> " _d = B.requireGuard K.PTop",
"",
"-- Bump this token whenever the Hole predicate or updates change.",
holeFoldVersionName index transition <> " :: FoldVersion",
holeFoldVersionName index transition <> " = FoldVersion " <> tshow (transitionStem index transition <> "-fold-v1")
]
-- | Export, import, and stub the per-event upcaster holes (EP-2 evolution).
holeUpcasterExports :: Agg -> Text
holeUpcasterExports a = case upcasterEntries a of
[] -> ""
es -> nl [" , " <> fn | (_, _, fn) <- es]
holeUpcasterImports :: Agg -> Text
holeUpcasterImports a = case upcasterEntries a of
[] -> ""
_ -> nl ["import Data.Aeson (Value)", "import Data.Text (Text)"]
holeUpcasterStubs :: Agg -> Text
holeUpcasterStubs a = case upcasterEntries a of
[] -> ""
es ->
nl $
concat
[ [ "",
"-- HOLE upcaster: this hole receives ONLY " <> eventName <> " payloads stored at",
"-- aggregate schema version " <> tshow' source <> "; other event kinds pass through the",
"-- generated rung dispatch automatically. Bring this payload up one version and decide",
"-- the default/derivation for any field added at the new version here.",
fn <> " :: Value -> Either Text Value",
fn <> " _ = Left \"HOLE: upcaster not implemented\""
]
| (source, eventName, fn) <- es
]
holeProjectionExport :: Agg -> Text
holeProjectionExport a = case aProjection a of
Nothing -> " -- (no projection)"
Just p -> " , apply" <> pascal (projTable p)
holeProjectionImports :: Agg -> Text
holeProjectionImports aggregate = case projectionReadModel aggregate of
Nothing -> ""
Just readModel ->
"import "
<> genPrefixFor (aContext aggregate) (pascal (rmName readModel))
<> ".ReadModelTable ("
<> readModelStem readModel
<> "QualifiedTable)"
holeProjectionStub :: Agg -> Text
holeProjectionStub a = case aProjection a of
Nothing -> ""
Just p ->
nl
( [ "",
"-- HOLE: the read-model SQL for the projection (a DB-coupled hole; the",
"-- pure event->status mapping is generated as " <> lowerFirst (projTable p) <> "StatusFor)."
]
++ projectionGuidance
++ [ "apply" <> pascal (projTable p) <> " :: " <> aName a <> "Event -> recorded -> txn ()",
"apply" <> pascal (projTable p) <> " _event _recorded = " <> projectionTableUse <> "error \"HOLE: fill " <> projTable p <> " projection apply\""
]
)
where
projectionGuidance = case projectionReadModel a of
Nothing ->
["-- WARNING: no readmodel node declares this table's schema; unqualified SQL depends on search_path."]
Just readModel ->
[ "-- Table: " <> qualifiedTableLiteral readModel <> ". Use " <> readModelStem readModel <> "QualifiedTable; never rely on search_path.",
"-- Declared columns:"
]
++ map (("-- " <>) . readModelColumnDoc) (rmColumns readModel)
projectionTableUse = case projectionReadModel a of
Nothing -> ""
Just readModel -> readModelStem readModel <> "QualifiedTable `seq` "
-- Group transitions by source state, preserving order, for the B.from blocks.
groupBySource :: Agg -> [(Text, [Transition])]
groupBySource a = go [] (transitionsOf a)
where
go acc [] = reverse acc
go acc (t : ts) =
let src = tSource t
(same, rest) = span ((== src) . tSource) ts
in go ((src, t : same) : acc) rest
-- We don't keep the original Aggregate around in Agg, so reconstruct
-- transitions from a stored field. (Filled in resolveAgg via aTransitions.)
transitionsOf :: Agg -> [Transition]
transitionsOf = aTransitions
fromBlock :: Agg -> (Text, [Transition]) -> [Text]
fromBlock a (src, ts) =
[ " B.from " <> vertexCtor a src <> " do"
]
++ concatMap (onCmdBlock a) ts
onCmdBlock :: Agg -> Transition -> [Text]
onCmdBlock a t =
[ " B.onCmd inCtor" <> tCommand t <> " $ \\d -> B.do"
]
-- Plan 143: the mode is structural, not hole-owned — a replay-only
-- transition lowers to B.replayOnly (keiki ReplayOnly edge).
++ [" B.replayOnly" | tMode t == TmReplayOnly]
++ maybe [] (\g -> [" -- HOLE guard: " <> renderGuard g]) (tGuard t)
++ [" -- HOLE write " <> r <> " := " <> renderGuard e | (r, e) <- tWrites t]
++ [" -- HOLE emit " <> ev <> " (B.emit wire" <> ev <> " ...)" | ev <- tEmits t]
++ [" B.goto " <> vertexCtor a (tGoto t)]
--------------------------------------------------------------------------------
-- Field categories and shared helpers
--------------------------------------------------------------------------------
data FieldCat
= IdCat
| EnumCat
| MappedStructuralCat !StructuralDecl !ResolvedMappedShape
| MappedOpaqueCat !OpaqueDecl
| OtherCat
deriving stock (Eq, Show)
fieldCat :: Agg -> ResolvedAggregateType -> FieldCat
fieldCat a ty
| AggregateNominal nominal <- ty,
IdRepresentation {} <- resolvedNominalRepresentation nominal =
IdCat
| AggregateNominal nominal <- ty,
EnumRepresentation {} <- resolvedNominalRepresentation nominal =
EnumCat
| Just (ResolvedStructural declaration shape) <- mappedDeclFor a ty = MappedStructuralCat declaration shape
| Just (ResolvedOpaque declaration) <- mappedDeclFor a ty = MappedOpaqueCat declaration
| otherwise = OtherCat
-- | The first constructor of a declared enum, used to build sample values.
firstEnumCtor :: Agg -> Text -> Maybe Text
firstEnumCtor a ty =
case [c | e <- aEnums a, enumName e == ty, (c, _) <- take 1 (enumCtors e)] of
(c : _) -> Just c
[] -> Nothing
vertexCtor :: Agg -> Text -> Text
vertexCtor a s = aName a <> s
initialVertex :: Agg -> Text
initialVertex a = case aStates a of
(s : _) -> vertexCtor a (stName s)
[] -> aName a <> "Init"
generatedBanner :: Text
generatedBanner = "-- @generated by keiro-dsl; do not edit. Regenerated from the .keiro spec."
-- | The provenance line written by a concrete scaffold plan. The package
-- version comes from Cabal's build metadata, while the language and origin come
-- from the checked semantic input and the emitted module respectively.
generatedBannerFor :: EffectiveLanguageContract -> Text -> Text
generatedBannerFor languageContract sourceOrigin =
"-- @generated by keiro-dsl "
<> T.pack (showVersion Package.version)
<> " (language keiro-dsl "
<> languageVersionText (effectiveContractLanguageVersion languageContract)
<> ") from "
<> stableBannerOrigin sourceOrigin
<> "; do not edit."
-- Source line numbers are useful refusal metadata but are not stable ownership:
-- moving an unchanged node within or between workspace members must not rewrite
-- every Generated file. The node kind and name remain the banner authority.
stableBannerOrigin :: Text -> Text
stableBannerOrigin sourceOrigin =
case T.breakOnEnd " (line " withoutMemberPath of
(prefixWithMarker, lineWithClose)
| not (T.null prefixWithMarker),
Just lineNumber <- T.stripSuffix ")" lineWithClose,
not (T.null lineNumber),
T.all isDigit lineNumber ->
T.dropEnd (T.length " (line ") prefixWithMarker
_ -> withoutMemberPath
where
withoutMemberPath = case T.breakOn ": " sourceOrigin of
(memberPath, attributedOrigin)
| ".keiro" `T.isSuffixOf` memberPath,
not (T.null attributedOrigin) ->
T.drop 2 attributedOrigin
_ -> sourceOrigin
-- | Recognize the exact historical banner or the frozen stamped format. This
-- intentionally rejects arbitrary comments that merely start with
-- @-- \@generated@.
isGeneratedBannerLine :: Text -> Bool
isGeneratedBannerLine line =
line == generatedBanner
|| ( stampedPrefix `T.isPrefixOf` line
&& " (language keiro-dsl " `T.isInfixOf` line
&& ") from " `T.isInfixOf` line
&& "; do not edit." `T.isSuffixOf` line
)
where
stampedPrefix = "-- @generated by keiro-dsl "
-- | Replace an emitter's legacy placeholder (or an earlier stamp) with the
-- provenance for this plan. A Generated module with a specialized banner gets
-- the standard stamp prepended, so every planned Generated file is covered.
stampGeneratedModule :: EffectiveLanguageContract -> ScaffoldModule -> ScaffoldModule
stampGeneratedModule languageContract moduleValue
| kind moduleValue == HoleStub = moduleValue
| otherwise = moduleValue {moduleText = stampedText}
where
banner = generatedBannerFor languageContract (origin moduleValue)
sourceLines = T.splitOn "\n" (moduleText moduleValue)
stampedText = case replaceFirstGeneratedBanner banner sourceLines of
Nothing -> banner <> "\n" <> moduleText moduleValue
Just linesWithStamp -> T.intercalate "\n" linesWithStamp
stampGeneratedModules :: EffectiveLanguageContract -> [ScaffoldModule] -> [ScaffoldModule]
stampGeneratedModules languageContract = map (stampGeneratedModule languageContract)
replaceFirstGeneratedBanner :: Text -> [Text] -> Maybe [Text]
replaceFirstGeneratedBanner _ [] = Nothing
replaceFirstGeneratedBanner replacement (line : rest)
| isGeneratedBannerLine line = Just (replacement : rest)
| otherwise = (line :) <$> replaceFirstGeneratedBanner replacement rest
nodeOrigin :: Text -> Text -> Loc -> Text
nodeOrigin nodeKind nodeName loc =
nodeKind <> " " <> nodeName <> case unLoc loc of
0 -> ""
line -> " (line " <> tshow' line <> ")"
-- | Conditions that the deterministic emitters cannot lower faithfully. The
-- pre-write scaffold pipeline treats each returned message as a refusal. The
-- list is extended alongside the policy and type lowering milestones.
scaffoldRefusals :: Spec -> [Text]
scaffoldRefusals spec =
concatMap aggregateRefusals aggregates
<> concatMap contractRefusals contracts
<> concatMap publisherRefusals publishers
where
aggregates = [aggregate | NAggregate aggregate <- specNodes spec]
contracts = [contract | NContract contract <- specNodes spec]
publishers = [publisher | NPublisher publisher <- specNodes spec]
symbols = aggregateSymbols spec
aggregateRefusals aggregate =
[ "AggregateEmpty: aggregate '" <> aggName aggregate <> "' must declare at least one command, event, and transition"
| null (aggCommands aggregate) || null (aggEvents aggregate) || null (aggTransitions aggregate)
]
<> concatMap (registerRefusals aggregate) (aggRegs aggregate)
<> concatMap (fieldRefusals aggregate CommandFieldUse) (concatMap cmdFields (aggCommands aggregate))
<> concatMap (fieldRefusals aggregate EventFieldUse) [field | event <- aggEvents aggregate, EventFields fields <- [evBody event], field <- fields]
fieldRefusals aggregate useSite field = case inferAggregateFieldType symbols aggregate useSite field of
Right _ -> []
Left _ ->
[ "FieldTypeUnrepresentable: aggregate '"
<> aggName aggregate
<> "' field '"
<> aggregateFieldName field
<> "' has unsupported explicit type '"
<> maybe "(inferred)" typeExprCanonicalName (aggregateFieldType field)
<> "'"
]
registerRefusals aggregate register =
case resolveAggregateType symbols (regLoc register) RegisterUse (regType register) of
Left _ ->
[ "RegTypeUnsupported: aggregate '"
<> aggName aggregate
<> "' register '"
<> regName register
<> "' has unsupported type '"
<> typeExprCanonicalName (regType register)
<> "'"
]
Right resolved -> case resolveRegisterInitial symbols (regLoc register) resolved (regInitial register) of
Right _ -> []
Left _ -> [initialRefusal aggregate register resolved]
initialRefusal aggregate register resolved = case resolved of
AggregateText -> label "RegTextInitialNotQuoted" "must use a quoted Text initial"
AggregateNominal nominal
| EnumRepresentation {} <- resolvedNominalRepresentation nominal ->
label "RegInitialNotEnumCtor" ("must start at the declaration-owned initial for enum '" <> resolvedNominalName nominal <> "'")
AggregateMapped {} -> label "MappedRegisterInitialMissing" "requires the mapped declaration's initial symbol"
_ -> label "RegInitialInvalidLiteral" ("has an invalid " <> aggregateCanonicalName resolved <> " initial")
where
label codeName detail = codeName <> ": aggregate '" <> aggName aggregate <> "' register '" <> regName register <> "' " <> detail
contractRefusals contract =
[ "ContractEmpty: contract '" <> ctrName contract <> "' must declare at least one event"
| null (ctrEvents contract)
]
publisherRefusals publisher =
let backoff = pubBackoff publisher
label message = message <> ": publisher '" <> pubName publisher <> "'"
in case boKind backoff of
"constant" -> []
"exponential" -> case (boMax backoff, boMultiplier backoff) of
(Just maximumWindow, Just multiplierText) ->
case (windowSeconds (boWindow backoff), windowSeconds maximumWindow, readMaybe (T.unpack multiplierText) :: Maybe Double) of
(Right initialSeconds, Right maximumSeconds, Just multiplier)
| initialSeconds > 0 && maximumSeconds >= initialSeconds && multiplier >= 1 -> []
_ -> [label "BackoffInvalidExponential"]
_ -> [label "BackoffExponentialIncomplete"]
other -> [label ("BackoffUnknownKind '" <> other <> "'")]
windowSeconds :: Text -> Either Text Int
windowSeconds window = case T.unsnoc window of
Just (digits, unit)
| not (T.null digits),
Just amount <- readMaybe (T.unpack digits) -> case unit of
's' -> Right amount
'm' -> Right (amount * 60)
'h' -> Right (amount * 3600)
_ -> Left invalid
_ -> Left invalid
where
invalid = "invalid window '" <> window <> "' (expected digits followed by s, m, or h)"
windowText :: Text -> Text
windowText = either (const "0") tshow' . windowSeconds
-- | Render an Expr back to source-ish text for a hole annotation.
renderGuard :: Expr -> Text
renderGuard = renderExpr
--------------------------------------------------------------------------------
-- Text helpers
--------------------------------------------------------------------------------
nl :: [Text] -> Text
nl = T.intercalate "\n"
-- | Join groups of declarations, blank-line-separated, dropping empties.
sectionsOf :: [[Text]] -> Text
sectionsOf = T.intercalate "\n\n" . filter (not . T.null) . map (T.intercalate "\n\n")
lowerFirst :: Text -> Text
lowerFirst t = case T.uncons t of
Just (c, rest) -> T.cons (toLower c) rest
Nothing -> t
-- | Assert the shared category proof at emission time as a belt-and-braces
-- guard for callers that bypass the CLI's normal validate-before-scaffold path.
staticCategory :: Text -> Text -> Text
staticCategory owner value = case sagaCategoryError value of
Nothing -> value
Just reason -> error (T.unpack ("keiro-dsl scaffold: illegal " <> owner <> " category " <> tshow value <> " " <> reason))
pascal :: Text -> Text
pascal t = case T.uncons t of
Just (c, rest) -> T.cons (toUpper c) rest
Nothing -> t
pascalFromKebab :: Text -> Text
pascalFromKebab = T.concat . map pascal . T.splitOn "-"
kebabFromPascal :: Text -> Text
kebabFromPascal = T.intercalate "-" . map T.toLower . splitCamel
-- | Split CamelCase into its words (best-effort, for the projection name).
splitCamel :: Text -> [Text]
splitCamel = go . T.unpack
where
go [] = []
go (c : cs) =
let (rest, more) = break' cs
in T.pack (c : rest) : go more
break' [] = ([], [])
break' (x : xs)
| x `elem` ['A' .. 'Z'] = ([], x : xs)
| otherwise = let (r, m) = break' xs in (x : r, m)
tshow :: Text -> Text
tshow t = T.pack (show t)
tshow' :: Int -> Text
tshow' = T.pack . show