hecks 1.3.0 → 1.5.0

data/lib/hecks/runtime/value/entity_list_coercion.rb

@@ -5,7 +5,7 @@ require_relative "../../rendering"
 module Hecks
   module Runtime
     class Value
-      # HOW A `list_of` ATTRIBUTE'S OWN ELEMENTS GET HYDRATED — entity-typed
+      # How a `list_of` attribute's own elements GET hydrated — entity-typed
       # and value-object-typed alike — split out of `Coercion` (this file's
       # sibling, extended into `Value` alongside it exactly the way
       # `Admission` already is) once `Coercion` itself grew past
@@ -15,22 +15,28 @@ module Hecks
       # own header, and this repo's `.rubocop_todo.yml` for the merge that
       # made the split necessary). Cross-calls into `Coercion`'s own
       # `for_attribute`/`build`/`fields_for`/`value_object_for`/
-      # `trusting_stored_state?` work unqualified here exactly as they did
-      # before the split, because both modules land on the SAME `Value`
-      # singleton class once extended — `self` never has to know which file
-      # a sibling method actually lives in.
+      # `trusting_stored_state?` work unqualified here, exactly as they do
+      # within `Coercion` itself, because both modules land on the same
+      # `Value` singleton class once extended — `self` never has to know
+      # which file a sibling method actually lives in.
       module EntityListCoercion
-        # S17, ADR 0026 — SEARCHES THE WHOLE ENTITY TREE, not only the
+        # S17, ADR 0026 — searches the whole entity tree, not only the
         # root's own direct children. `aggregate` here is always the
-        # ROOT aggregate — `for_attribute`'s own `aggregate` argument is
+        # root aggregate — `for_attribute`'s own `aggregate` argument is
         # never reassigned as hydration recurses into a nested element,
         # because coercion has to resolve value objects, and only the
         # root answers `.value_object` at all (Entity's own header
-        # comment: an entity must NOT answer to it, or `Value.
+        # comment: an entity must not answer to it, or `Value.
         # for_attribute` could no longer tell a piece from a head). So
-        # a NESTED entity — Dispatch, inside Handler — is not a direct
+        # a nested entity — Dispatch, inside Handler — is not a direct
         # child of the root the way Handler itself is, and a plain
         # `aggregate.entities.find` stops one level short of it.
+        #
+        # @param construct [Bluebook::Aggregate, Bluebook::Entity] the construct to
+        #   search, and every entity nested under it
+        # @param name [String] the entity's declared `hecks_name` to find
+        # @return [Bluebook::Entity, nil] the matching entity anywhere in the tree, or
+        #   nil if none matches
         def find_entity(construct, name)
           construct.entities.each do |candidate|
             return candidate if candidate.hecks_name == name
@@ -41,39 +47,54 @@ module Hecks
           nil
         end
 
+        # Hydrates a `list_of` attribute's offered value — each element of a
+        # whole-list offering, or a single remove-target value, depending on
+        # `attribute.type` and `value`'s own shape.
+        #
         # Frozen through: a list read back out of the store is an answer,
         # not a handle on what is stored.
         #
-        # ADR 0047 — this used to bail (`return value unless entity`) the
-        # moment `attribute.type` named a value object rather than an
-        # entity, handing back the raw, un-hydrated argument untouched.
-        # A `sets :field` mutation sourced from a whole-array argument (as
-        # opposed to element-by-element `append:`) went straight through
+        # ADR 0047 — bailing (`return value unless entity`) the moment
+        # `attribute.type` names a value object rather than an entity would
+        # hand back the raw, un-hydrated argument untouched. A `sets :field`
+        # mutation sourced from a whole-array argument (as opposed to
+        # element-by-element `append:`) goes straight through
         # `for_attribute`'s `:list` branch, so `Banking::CardPayment.
-        # Authorize`'s own `sets :tags` (`list_of(Tag)`) stored plain
+        # Authorize`'s own `sets :tags` (`list_of(Tag)`) would store plain
         # Ruby Hashes as its `tags` elements forever — never a real
         # `Value`, never through `Tag`'s own `pattern:`/`invariant`
         # checks. `remove:`'s `==` comparison (a real `Value` against a
-        # raw `Hash`) then always failed, since `Hash#==` refuses anything
-        # that isn't itself a compatible Hash — the bug ADR 0047 traces in
-        # full. Delegating to `hydrate_value_object_list` below closes
-        # that gap the same way the ENTITY branch already worked: build a
-        # real, validated `Value` per element, reusing `for_attribute`'s
-        # own composite-construction path rather than inventing a second
-        # one.
-        # BUG#32 (QualityControl ledger) — `remove:`'s own single-target
-        # value used to fall straight into `Array(value).map { ... }`
-        # below UNGUARDED, unlike this method's own delegated
-        # `hydrate_value_object_list` sibling, whose `value.is_a?(Array)`
-        # check exists for exactly this shape (see that method's own
-        # comment). For an ENTITY-typed list, `remove:`'s scalar target
-        # (`Ledger.Void`'s `sequence: EntrySequence`) is never a Hash, so
-        # `Array(2)` merely wrapped it as `[2]` rather than shredding it —
-        # but the wrapping itself was still wrong: `MutationApplier#
-        # removed`'s `element == value` then compared a stored `Entry`
-        # Hash against a one-element Array, which can never be `==` a
-        # Hash, so nothing was ever removed and nothing ever refused
-        # either. Routed to `hydrate_entity_identity` instead, below.
+        # raw `Hash`) would then always fail, since `Hash#==` refuses
+        # anything that isn't itself a compatible Hash — the bug ADR 0047
+        # traces in full. Delegating to `hydrate_value_object_list` below
+        # closes that gap the same way the entity branch already works:
+        # build a real, validated `Value` per element, reusing
+        # `for_attribute`'s own composite-construction path rather than
+        # inventing a second one.
+        # BUG#32 (QualityControl ledger) — without this, `remove:`'s own
+        # single-target value would fall straight into
+        # `Array(value).map { ... }` below unguarded, unlike this method's
+        # own delegated `hydrate_value_object_list` sibling, whose
+        # `value.is_a?(Array)` check exists for exactly this shape (see
+        # that method's own comment). For an entity-typed list, `remove:`'s
+        # scalar target (`Ledger.Void`'s `sequence: EntrySequence`) is
+        # never a Hash, so `Array(2)` would merely wrap it as `[2]` rather
+        # than shredding it — but the wrapping itself would still be wrong:
+        # `MutationApplier#removed`'s `element == value` would then compare
+        # a stored `Entry` Hash against a one-element Array, which can
+        # never be `==` a Hash, so nothing would ever be removed and
+        # nothing would ever refuse either. Routed to `hydrate_entity_identity`
+        # instead, below.
+        #
+        # @param aggregate [Bluebook::Aggregate] the root aggregate `attribute` is
+        #   declared on
+        # @param attribute [Bluebook::Attribute] the `list_of` attribute being hydrated
+        # @param value [Array<Hash, Object>, Object] the offered value: a whole-list
+        #   Array (a `sets`/hydrate load) or a single remove-target value
+        # @return [Object] a frozen Array of hydrated elements when `value` is a
+        #   whole-list Array and `attribute.type` names an entity; otherwise whatever
+        #   `hydrate_entity_identity` (a non-Array value naming an entity) or
+        #   `hydrate_value_object_list` (`attribute.type` naming no entity) returns
         def hydrate_entity_list(aggregate, attribute, value)
           entity = find_entity(aggregate, attribute.type.to_s)
           return hydrate_value_object_list(aggregate, attribute, value) unless entity
@@ -89,7 +110,7 @@ module Hecks
               acc[key] = field ? for_attribute(aggregate, field, field_value) : field_value
             end
           end
-          # BUG#33 — only a genuine WHOLE-LIST offering (`value.is_a?(Array)`)
+          # BUG#33 — only a genuine whole-list offering (`value.is_a?(Array)`)
           # is a caller naming every element's own identity at once; the
           # single-target shape this same method also hydrates (a `remove:`
           # target, wrapped one level up by `Array()`) never reaches this
@@ -101,16 +122,16 @@ module Hecks
 
         # `MutationApplier#check_entity_collision`'s own guard
         # (mutation_applier.rb), extended from a single caller-supplied
-        # APPEND (BUG#13) to a whole-list REPLACE — `sets :entries` bare
+        # append (BUG#13) to a whole-list replace — `sets :entries` bare
         # (`Ledger.ReplaceEntries`, the corpus's first `list_of(ENTITY)`
         # command argument/mutation, qa/stress_domains/corrections). The
         # array branch above rebuilds each offered element's own declared
-        # fields but never checked the OFFERED LIST ITSELF for either way
+        # fields but never checked the offered list itself for either way
         # it can misname its own entities:
         #
         #   - two elements sharing one identity — the same silent-duplicate
         #     hazard BUG#13's own comment describes: `EntityInterpreter#
-        #     element_of`'s own `find_index` always matches the FIRST
+        #     element_of`'s own `find_index` always matches the first
         #     match, so the second becomes permanently unaddressable by any
         #     later command.
         #   - an element missing its identity altogether — there is no
@@ -120,17 +141,30 @@ module Hecks
         #     whole state, offered at once), so an absent identity is
         #     refused rather than guessed.
         #
-        # NON-COMPOSITE identities only, exactly BUG#13's own scope
+        # Non-composite identities only, exactly BUG#13's own scope
         # (`entity.identified_by` answers a single Symbol only when
         # `identity_heads.size == 1`, `Behaviour::Traits#derive_identity`) —
         # a composite identity's own duplicate/missing question is the
         # same pre-existing, narrower gap BUG#13 documented and left open,
         # not widened here.
         #
-        # SKIPPED under `trusting_stored_state?`, the same guard `validate!`
+        # Refuses a whole-list offering that misnames its own entities' identities —
+        # a duplicate identity across two elements, or an element missing one.
+        #
+        # Skipped under `trusting_stored_state?`, the same guard `validate!`
         # already gives every value object (C6.3): a record already
         # written is trusted as it was, so tightening this check can never
         # make an old, already-persisted record unreadable.
+        #
+        # @param aggregate [Bluebook::Aggregate] the aggregate `entity` belongs to,
+        #   named in a refusal
+        # @param entity [Bluebook::Entity] the entity type `elements` are shaped as
+        # @param elements [Array<Hash, Object>] the hydrated whole-list offering; a
+        #   non-Hash element is skipped, not checked
+        # @return [void]
+        # @raise [Runtime::TypeMismatch] if `entity` declares a single-field identity
+        #   and an element offers no value for it
+        # @raise [Runtime::AlreadyExists] if two elements offer the same identity value
         def check_entity_list_identities(aggregate, entity, elements)
           identity = entity.identified_by
           return unless identity
@@ -144,32 +178,32 @@ module Hecks
             offered = fields[identity]
             if offered.nil?
               raise TypeMismatch,
-                    RefusalWording.render("TypeMismatch", "numeric_field",
-                                          type: entity.hecks_name, field: identity,
-                                          expected: field&.type, offered: "nil")
+                    RefusalWording.render_site("TypeMismatch", "numeric_field",
+                                               type: entity.hecks_name, field: identity,
+                                               expected: field&.type, offered: "nil")
             end
 
             if seen.include?(offered)
               raise AlreadyExists,
-                    RefusalWording.render("AlreadyExists", "entity_duplicate",
-                                          entity: entity.hecks_name, aggregate: aggregate.hecks_name,
-                                          identity: entity.identity_paths.join(", "),
-                                          offered: Rendering.describe(offered))
+                    RefusalWording.render_site("AlreadyExists", "entity_duplicate",
+                                               entity: entity.hecks_name, aggregate: aggregate.hecks_name,
+                                               identity: entity.identity_paths.join(", "),
+                                               offered: [Rendering.describe(offered)])
             end
             seen << offered
           end
         end
 
         # BUG#32 — `remove:`'s own single-target value against an
-        # ENTITY-typed list. An entity is never offered to `remove:`
-        # WHOLE the way a value object is (`hydrate_value_object_list`'s
+        # entity-typed list. An entity is never offered to `remove:`
+        # whole the way a value object is (`hydrate_value_object_list`'s
         # own `element == value` full-value-equality shape) — an entity
         # must never answer `.value_object` at all (`Entity`'s own header
         # comment), so there is no whole-value shape here to rebuild in
-        # the first place, only the ONE field a caller would otherwise
-        # have to NAME to address that element any other way
+        # the first place, only the one field a caller would otherwise
+        # have to name to address that element any other way
         # (`EntityElement#element_of`'s own `wants`). So this coerces the
-        # offered scalar against the entity's OWN identity field's
+        # offered scalar against the entity's own identity field's
         # declared type — not the entity's full shape — and hands back a
         # real, correctly-typed `Value` ready to compare against each
         # stored element's own identity field
@@ -177,15 +211,26 @@ module Hecks
         # `MutationApplier#removed` and `EntityElement#
         # removed_from_element` match against).
         #
-        # A COMPOSITE identity (more than one head) has no single field a
+        # A composite identity (more than one head) has no single field a
         # bare `remove:` target could mean, so this passes the value
-        # through UNCOERCED rather than guessing which head — the same
+        # through uncoerced rather than guessing which head — the same
         # "nothing in this corpus needs it yet" boundary
         # `MutationApplier#check_entity_collision`'s own header already
         # draws for entity identity elsewhere in this runtime.
+        # Coerces a `remove:` target against an entity's own single-field
+        # identity type, rather than the entity's full shape.
+        #
         # `list_element_match?` treats an uncoerced value the same way
         # it always treated the pre-fix wrapped Array: never a match, a
         # documented no-op rather than a crash.
+        #
+        # @param aggregate [Bluebook::Aggregate] the aggregate `entity` belongs to
+        # @param entity [Bluebook::Entity] the entity type `value` addresses
+        # @param value [Object] the offered remove-target value
+        # @return [Runtime::Value, Object] `value` already coerced (returned unchanged);
+        #   the value coerced against the identity field's declared type when `entity`
+        #   has a single identity head and a matching attribute; `value` unchanged
+        #   otherwise (no identity head, a composite identity, or no matching attribute)
         def hydrate_entity_identity(aggregate, entity, value)
           return value if value.is_a?(self)
 
@@ -198,9 +243,12 @@ module Hecks
           for_attribute(aggregate, field, value)
         end
 
+        # Hydrates a `list_of` attribute's offered value when `attribute.type`
+        # names a value object rather than an entity.
+        #
         # The value-object sibling of the entity branch above: an element
         # already shaped like the target `Value` (or a `Hash`/scalar that
-        # `fields_for` can still open) is rebuilt through the SAME `build`
+        # `fields_for` can still open) is rebuilt through the same `build`
         # a scalar composite attribute already uses (`for_attribute`'s own
         # `coerced = ... build(value_object, fields_for(...), aggregate)`
         # line) — same defaults, same `pattern:`/`admits:`/invariant
@@ -210,21 +258,32 @@ module Hecks
         # element passes through unchanged, exactly as the entity branch's
         # own non-Hash elements do.
         #
-        # NOT `Array(value).map` (unlike the entity branch above) — `value`
+        # Not `Array(value).map` (unlike the entity branch above) — `value`
         # here is not always genuinely list-shaped. `MutationApplier#
         # removed`'s own `Value.for_attribute(aggregate, attribute, value)`
-        # call (`attribute` = the LIST attribute, `mutation.target`; `value`
-        # = the single REMOVE-target argument, already a real `Value` by
+        # call (`attribute` = the list attribute, `mutation.target`; `value`
+        # = the single remove-target argument, already a real `Value` by
         # the time it gets here) reuses this exact branch — for `remove:`,
         # not for a whole-list `sets`. `Array(a_real_Value)` alone would be
         # harmless (`Value` defines neither `to_a` nor `to_ary`, so Kernel
-        # wraps it `[value]`), but `Array(a_Hash)` is NOT harmless: Ruby's
+        # wraps it `[value]`), but `Array(a_Hash)` is not harmless: Ruby's
         # `Array()` opens a bare Hash into its own `[[k, v], ...]` pairs,
         # not `[hash]` — silently shredding a single-element Hash-shaped
         # target into garbage instead of hydrating it. Branching on
         # `value.is_a?(Array)` up front (true only for a genuine whole-list
         # `sets`/hydrate load) keeps the single-target shape a single
         # target, hydrated the same way, never listified.
+        #
+        # @param aggregate [Bluebook::Aggregate] the aggregate `attribute` is declared
+        #   on, or a construct that does not respond to `value_object` (an entity), in
+        #   which case `value` passes through unchanged
+        # @param attribute [Bluebook::Attribute] the `list_of` attribute being hydrated
+        # @param value [Array<Hash, Object>, Object] the offered value: a whole-list
+        #   Array, or a single remove-target value
+        # @return [Object] `value` unchanged when `aggregate` does not respond to
+        #   `value_object`, or `attribute.type` names no value object; otherwise a
+        #   frozen Array of built `Value`s for a whole-list Array, or a single built
+        #   `Value` (via `hydrate_value_object_element`) otherwise
         def hydrate_value_object_list(aggregate, attribute, value)
           return value unless aggregate.respond_to?(:value_object)
 
@@ -237,6 +296,19 @@ module Hecks
           Freezer.deep(hydrated)
         end
 
+        # Rebuilds one `list_of` element into a real, validated `Value`, unless it
+        # already is one of `value_object`'s own type.
+        #
+        # @param aggregate [Bluebook::Aggregate] the aggregate `value_object` is
+        #   resolved against
+        # @param attribute [Bluebook::Attribute] the `list_of` attribute `element`
+        #   belongs to
+        # @param value_object [Class] the `Bluebook::ValueObject` subclass `element`
+        #   is built as
+        # @param element [Object] the raw element to build: a Hash of fields, a scalar
+        #   `fields_for` can still open, or an already-built `Value`
+        # @return [Runtime::Value] `element` unchanged if it is already a `Value` of
+        #   `value_object`'s own type; otherwise a freshly built one
         def hydrate_value_object_element(aggregate, attribute, value_object, element)
           return element if element.is_a?(self) && element.type_name == value_object.hecks_name
 

data/lib/hecks/runtime/value.rb

@@ -8,7 +8,7 @@ require_relative "value/admission"
 module Hecks
   module Runtime
     # A typed value object in hand: frozen fields, read by name. How one is
-    # MADE — coerced from a raw argument, checked against its declared
+    # made — coerced from a raw argument, checked against its declared
     # numeric types, patterns and closed sets — is the class-side engine in
     # value/coercion.rb, value/entity_list_coercion.rb (a `list_of`
     # attribute's own elements — split out once growing Coercion tripped
@@ -22,10 +22,10 @@ module Hecks
 
       attr_reader :value_object
 
-      # FROZEN THROUGH, not just on top.
+      # Frozen through, not just on top.
       #
       # `@fields.freeze` alone stops a key being added or removed and
-      # nothing else: the String, Array or Hash a field HOLDS stays
+      # nothing else: the String, Array or Hash a field holds stays
       # mutable, so `vo[:value] << "!"` edits a value object in place —
       # demonstrated on a real dispatch before this was written, not
       # supposed. Same shape as the three freezing bugs already fixed
@@ -33,29 +33,67 @@ module Hecks
       # was frozen and the contents were not.
       #
       # A value object is the one thing in the domain that has no
-      # identity to change over — `with` already answers a NEW one rather
+      # identity to change over — `with` already answers a new one rather
       # than mutating — so freezing it through is what it always claimed
       # to be.
+      #
+      # @param value_object [Bluebook::ValueObject] the declared type this instance is one of
+      # @param fields [Hash] the type's fields, keyed by name (String or Symbol); deep-frozen
+      #   and stored with Symbol keys
       def initialize(value_object, fields)
         @value_object = value_object
         @fields       = Freezer.deep(fields.transform_keys(&:to_sym))
         freeze
       end
 
+      # Reads the declared type's own name.
+      #
+      # @return [String] the value object's `hecks_name`
       def type_name = @value_object.hecks_name
+
+      # Reads one field.
+      #
+      # @param field [String, Symbol] the field name; `:value` reads the sole field of a
+      #   single-attribute value object, whatever it is actually named
+      # @return [Object, nil] the field's coerced value; nil if the field is not held
       def [](field) = @fields[resolve_field(field)]
+
+      # Answers whether this value object holds the named field.
+      #
+      # @param field [String, Symbol] the field name; `:value` resolves the same way `[]` does
+      # @return [Boolean] true when the field is held
       def key?(field) = @fields.key?(resolve_field(field))
       def to_h = @fields.transform_values { |value| self.class.materialize(value) }
+
+      # Renders this value object as JSON, through the same shape `to_h` builds.
+      #
+      # @return [String] a JSON object of the materialized fields
       def to_json(*) = JSON.generate(to_h)
 
       def ==(other)
         other.is_a?(self.class) && other.type_name == type_name && other.to_h == to_h
       end
 
+      # Builds a new value object of the same type with one field replaced, re-validated.
+      #
+      # @param field [String, Symbol] the field to replace; `:value` resolves the same way
+      #   `[]` does
+      # @param value [Object] the field's new, uncoerced value
+      # @return [Runtime::Value] a new instance of the same type, with `field` replaced
+      # @raise [Runtime::TypeMismatch] if the new fields do not satisfy the type's declared
+      #   shape (an unknown field, a missing required one, a wrong numeric type, …)
+      # @raise [Runtime::InvariantViolation] if the new fields violate one of the type's own
+      #   invariants, or are not a member of its closed set
       def with(field, value)
         self.class.build(@value_object, @fields.merge(resolve_field(field) => value))
       end
 
+      # Recursively converts a `Runtime::Value` (and any nested inside a Hash or Array) to
+      # plain data.
+      #
+      # @param value [Object] the value to materialize; anything that is not a `Runtime::Value`,
+      #   Array or Hash passes through unchanged
+      # @return [Object] `value` with every nested `Runtime::Value` replaced by its own `to_h`
       def self.materialize(value)
         case value
         when self then value.to_h
@@ -68,27 +106,33 @@ module Hecks
       # `materialize`, but a single-attribute value object (`sole_attribute`
       # — [[feedback_name_the_scalar_field]]) recurses into its own bare
       # field instead of building `{field: ...}` — a Board's own `label`
-      # unwraps to `"Kanban"`, not `{value: "Kanban"}`. NOT a replacement
+      # unwraps to `"Kanban"`, not `{value: "Kanban"}`. Not a replacement
       # for `materialize` itself: every existing report/query/command
       # caller keeps the wrapped shape it already depends on (Banking's
       # own `CustomerPortfolio` reads `payment[:amount][:cents]`, and
       # changing that out from under it would be a real breaking change,
       # not a bug fix). This is read_model_interpreter.rb's own opt-in,
-      # used ONLY for a `group_by`-declared head's own rows — grouping
+      # used only for a `group_by`-declared head's own rows — grouping
       # needs a real scalar to key by regardless, so a report already
       # asking for that gets the unwrap for free.
+      #
+      # @param value [Object] the value to materialize; anything that is not a `Runtime::Value`,
+      #   Array or Hash passes through unchanged
+      # @return [Object] `value` with every nested `Runtime::Value` replaced by its own sole
+      #   field's value (recursively unwrapped), or by its own `Hash` of fields when it has
+      #   more than one
       def self.materialize_unwrapped(value)
         case value
         when self
           sole = value.value_object.sole_attribute
           return materialize_unwrapped(value[sole.name]) if sole
 
-          # NOT `value.to_h` — `Value#to_h` materializes each field through
+          # Not `value.to_h` — `Value#to_h` materializes each field through
           # plain `materialize`, so a VO nested inside a multi-attribute VO
           # would already be a plain Hash by the time this method ever saw
           # it, and never reach the `when self` branch above. Read each
           # field straight off `value` instead, so recursion actually
-          # happens through THIS method the whole way down.
+          # happens through this method the whole way down.
           value.value_object.attributes.to_h { |attr| [attr.name, materialize_unwrapped(value[attr.name])] }
         when Array then value.map { |item| materialize_unwrapped(item) }
         when Hash then value.transform_values { |item| materialize_unwrapped(item) }
@@ -96,22 +140,28 @@ module Hecks
         end
       end
 
-      # REDUCES AN APPEND-ONLY SUB-LOG TO ITS CURRENT STATE — the same
+      # Reduces an append-only sub-log to its current state — the same
       # "a later fact supersedes an earlier one" reduction this runtime
-      # already performs replaying an AGGREGATE's own command history
+      # already performs replaying an aggregate's own command history
       # into its current attributes, applied here to a single `list_of`
-      # FIELD acting as its own miniature append-only log (a placement
+      # field acting as its own miniature append-only log (a placement
       # history, a tombstone-style soft-delete list, a versioned
       # setting). `rows` is what a `list_of` attribute hands back — an
       # Array of `Value`, in append order — and `key` names the field
       # that identifies "the same logical thing" across entries.
       #
-      # GROUPING ONLY, NEVER INTERPRETATION. What counts as "removed,"
+      # **Grouping only, never interpretation**. What counts as "removed,"
       # how to order what survives — that meaning belongs to whichever
       # domain declared the field, never here: a generic reduction that
       # started guessing domain semantics would need to keep guessing
       # forever, once per shape of "gone" any caller ever invents. The
       # caller filters and sorts the result; this only groups it.
+      #
+      # @param rows [Array<Runtime::Value>] a `list_of` attribute's own elements, in append order
+      # @param key [Symbol] the method to call on each row to find "the same logical thing"
+      #   across entries (typically a field reader)
+      # @return [Array<Runtime::Value>] one row per distinct `key` value, each the latest row
+      #   that had it
       def self.latest_by(rows, key)
         rows.to_h { |row| [row.public_send(key), row] }.values
       end
@@ -119,17 +169,17 @@ module Hecks
       def method_missing(name, *args)
         return @fields[name] if @fields.key?(name)
 
-        # THE LANGUAGE RULE, not a convenience: ANY value object with
+        # The language rule, not a convenience: any value object with
         # exactly one declared attribute answers `.value`, whatever that
         # attribute is actually named — a single-attribute value object
-        # is a NAME for a scalar, not a genuine group
+        # is a name for a scalar, not a genuine group
         # ([[feedback_name_the_scalar_field]], `Behaviour::ValueObject#
         # sole_attribute`), so `money.value` reads `Money`'s own `amount`
         # exactly as `label.value` reads a shorthand-declared `value`.
-        # AFTER the real-field lookup above, on purpose: a field
-        # literally named `value` is already answered there (and IS the
+        # After the real-field lookup above, on purpose: a field
+        # literally named `value` is already answered there (and is the
         # sole attribute whenever the count is one), so this branch only
-        # ever aliases, never shadows. A MULTI-attribute value object
+        # ever aliases, never shadows. A multi-attribute value object
         # keeps its NoMethodError — `sole_attribute` answers nil for it,
         # and falling through to `super` is exactly the refusal it
         # always gave: with two or more fields there is no single value
@@ -151,15 +201,15 @@ module Hecks
 
       private
 
-      # THE `.value` ALIAS FOR INDEXED ACCESS — the same language rule
+      # **The `.value` alias for indexed access** — the same language rule
       # `method_missing` above enforces for method reads, applied to
       # `[]`/`key?`/`with`: `:value` names a single-attribute value
       # object's sole field whatever that field is actually called. A
-      # REAL key always wins first (a field literally named `value` is
+      # real key always wins first (a field literally named `value` is
       # its own answer, and is the sole attribute anyway whenever the
       # count is one), so this only ever resolves a `:value` that would
-      # otherwise MISS — it can never redirect a genuine field read.
-      # `with(:value, x)` in particular NEEDS this: merging a literal
+      # otherwise miss — it can never redirect a genuine field read.
+      # `with(:value, x)` in particular needs this: merging a literal
       # `:value` key beside a sole field named `amount` would build a
       # two-key hash for a one-field shape and be refused (or worse,
       # stored) downstream — aliasing at the merge is what keeps the

data/lib/hecks/runtime.rb

@@ -6,24 +6,24 @@
 # declaration is being collected into — sat on the top-level Hecks module
 # beside the DSL words.
 #
-# What lives here is what RUNS a domain :
+# What lives here is what runs a domain :
 #
 #   Runtime.boot(path)          load a directory and return its Dispatcher
 #   Runtime.with_registry(r)    bind the ambient registry for the duration of a load
 #   Runtime.current_registry    the registry a declaration is landing in, or nil
 #
-# What does NOT live here is what DECLARES one — `Hecks.bluebook`,
+# What does not live here is what declares one — `Hecks.bluebook`,
 # `.hecksagon`, `.port`, `.adapter`, `.world` are loading words and stay on the
 # top-level module, which now reads as a facade over this.
 #
 #   runtime = Hecks::Runtime.boot("examples/pizzas/bluebook")
 #   runtime.dispatch("Pizzas::Pizza.CreatePizza", name: "Margherita")
 #
-# NOTE, and it is the reason this file exists : `current_registry` is still
+# Note, and it is the reason this file exists : `current_registry` is still
 # process-global. Each boot builds a fresh Registry, and `Loader.bind_runtime`
-# installs a fresh facade door whose modules close over THAT boot's dispatcher
+# installs a fresh facade door whose modules close over that boot's dispatcher
 # — no class-level runtime binding remains, so two boots in one process no
-# longer share dispatch state, only the top-level NAME (the last-bound door
+# longer share dispatch state, only the top-level name (the last-bound door
 # wins the constant, which is what per-boot install means). Owning the state
 # here was the first move ; the dispatcher reachable per-runtime rather than
 # through a constant was the second, and it is done — the door is the only
@@ -68,17 +68,40 @@ module Hecks
 
       # Load a bluebook directory and return the Dispatcher bound to it.
       # `install_facade:`, `environment:` — see Loader.boot.
+      #
+      # @param path [String] path to a domain directory, or a file inside one
+      # @param shared [String, nil] a shared-root override; see `Loader.boot`
+      # @param install_facade [Boolean] whether to install the `Widget::Item.Add`-style
+      #   Ruby facade constants for this boot
+      # @param environment [String, nil] the environment name passed through to
+      #   `Adapters::Folder#load_domain`
+      # @return [Runtime::Dispatcher, Runtime::RemoteDispatcher] the dispatcher bound
+      #   to the booted domain
       def boot(path, shared: nil, install_facade: true, environment: nil)
         Loader.boot(path, shared: shared, install_facade: install_facade, environment: environment)
       end
 
       # `paths` form — see Loader.boot_files.
+      #
+      # @param paths [String, Array<String>] one or more file paths within the domain
+      #   to load, instead of the whole directory
+      # @param shared [String, nil] a shared-root override; see `Loader.boot_files`
+      # @param install_facade [Boolean] whether to install the `Widget::Item.Add`-style
+      #   Ruby facade constants for this boot
+      # @param environment [String, nil] the environment name passed through to the
+      #   selected-file loader
+      # @return [Runtime::Dispatcher, Runtime::RemoteDispatcher] the dispatcher bound
+      #   to the booted domain
       def boot_files(paths, shared: nil, install_facade: true, environment: nil)
         Loader.boot_files(paths, shared: shared, install_facade: install_facade, environment: environment)
       end
 
       # Bind the ambient registry for the duration of the block, restoring
       # whatever was there before. Nesting is safe ; a raise still restores.
+      #
+      # @param registry [Runtime::Registry] the registry to make current for the block
+      # @yield the code that should see `registry` as `current_registry`
+      # @return [Object] the block's result
       def with_registry(registry)
         previous          = @current_registry
         @current_registry = registry
@@ -91,7 +114,7 @@ module Hecks
       # the block — who a command's declared `role`, if any, is checked
       # against.
       #
-      # `as_of:` is OPTIONAL, same opt-in shape as `actor_id:` — a caller
+      # `as_of:` is optional, same opt-in shape as `actor_id:` — a caller
       # that wants a Governance `RoleAssignment`'s `starts_at` enforced
       # passes `as_of: Ports::Clock.now(registry)` here, at the door,
       # exactly where `cli_runner.rb` already merges `Clock.now` into a
@@ -99,11 +122,20 @@ module Hecks
       # itself — see `Ports::Clock`'s own header for why — so an unbound
       # `as_of` leaves `starts_at` unchecked, exactly as before.
       #
-      # `scope:` is OPTIONAL too — a caller that states which scope it is
+      # `scope:` is optional too — a caller that states which scope it is
       # acting in gets that scope checked against the matching
       # `RoleAssignment`'s own `scope`, not just its `role_name`. See
       # `Runtime::Caller::Current`'s own header for why this lives here
       # rather than as a command-level DSL construct.
+      # @param role [String, Symbol] the role to check the caller against
+      # @param actor_id [String, nil] who is calling, checked against a real Governance
+      #   `RoleAssignment` when given; string-equality only against `role` when nil
+      # @param as_of [Integer, nil] Unix epoch seconds to check a matching `RoleAssignment`'s
+      #   own `starts_at` against; unchecked when nil
+      # @param scope [String, nil] the scope to check a matching `RoleAssignment`'s own
+      #   `scope` against; unchecked when nil
+      # @yield the code to run with this caller bound
+      # @return [Object] the block's result
       def as_caller(role:, actor_id: nil, as_of: nil, scope: nil, &)
         Caller.as(role: role, actor_id: actor_id, as_of: as_of, scope: scope, &)
       end