Organize related declarations with domain — Boundary detective

PART I

Warm-up

Reconnect with a useful idea before starting organize related declarations with domain. In one or two sentences, describe the input, output or host boundary from the previous exercise that this lesson builds on. If you are arriving directly, skim the worked example first; there is no locked prerequisite.

A rough note is enough. You can revise it after the example.

PART II

Instruction & guided example

Find a cycle between domain responsibilities

A domain groups related declarations under a meaningful boundary. The shared domain vocabulary expresses organization. Group declarations because they share a coherent responsibility and contract, not because they happen to be called from the same screen. A namespace is not automatically a resource permission boundary, an ownership transfer or a runtime isolation guarantee.

Pricing asks Screen for a selected discount. Screen asks Pricing for the final total. The desired pure rule should accept discount explicitly. Supplied input is subtotal=50, fee=5, discount=10.

Draw the declarations and their dependencies. Follow one call across a domain boundary and write the input and result contract on that edge. If two domains depend on each other, inspect whether a shared rule or an explicit orchestration layer would make the direction understandable. Worked case: Make selected discount an input at the orchestration boundary. Pricing then predicts 50+5−10=45 without asking Screen anything; Screen receives 45. This removes the rule’s reverse dependency on presentation.

Compare the tempting alternative: Renaming Screen to Context leaves the dependency cycle intact. Hiding the lookup in a helper also preserves the hidden input.

Worked reasoning and supplied artifact

// Paper trace / supplied exercise-host contract; no execution claimed.
// Pricing asks Screen for a selected discount. Screen asks Pricing for the final total. The desired pure rule should accept discount explicitly. Supplied input is subtotal=50, fee=5, discount=10.
// Make selected discount an input at the orchestration boundary. Pricing then predicts 50+5−10=45 without asking Screen anything; Screen receives 45. This removes the rule’s reverse dependency on presentation.

Illustrative example from the proposed WillowScript design. The language and WUIX/WMATH/WDB/WAUDIO/WTMP services are not implemented in the supplied source. This site has no interpreter, VM or native host and does not execute or certify the snippet.

Try the guided change

Reconstruct the supplied worked case first: list its inputs, intermediate decisions and final artifact. Compare each row with the explanation and identify exactly where the rejected alternative fails. Then use the changed inputs in Part IV for independent work.

• Write the supplied inputs and initial state before following the example.
• Reconstruct each intermediate calculation or host decision, then compare with the worked artifact.
• Explain why the contrasting alternative fails before attempting the changed inputs in Part IV.

PART III

Take a breather

Step back after the guided example. Look away from the screen, stretch, or reread your prediction. This is an optional learning pause, not a timer or an assessment gate.

When you return, try to name the lesson’s key idea without copying its wording. If that feels difficult, return to Part II and trace one line rather than restarting the entire lesson.

PART IV

Independent practice

Project context: Shared pricing rules. Build a small, understandable change around organize related declarations with domain.

Draw the original cycle, then replace it with a caller that gathers inputs and calls Pricing. Trace a second caller with discount=0.

What to produce

A cycle repair diagram and two explicit-input calculations.

• State the intended behavior in a sentence before editing.
• Use only source-backed syntax and the host services whose contract you have been given.
• Record a normal case and a boundary or unavailable-resource case.
• Label hand predictions separately from anything actually measured in a supplied toolchain.

Syntax colors are a reading aid, not a compiler. The line you are editing stays uncolored until you move to a different line; capitalization is never changed. Drafts stay on this browser and code is not executed.

fnc add(a: i32, b: i32) -> i32 {
    return a + b;
}
fnc main() -> i32 {
    return add(2, 3);
}

PART V

Self-check

Use this check to notice what to revisit. It does not award a private course grade, block another page or claim to verify compiled code. Every answer has a learning explanation.

You may keep exploring even if you are unsure. Use the hint, compare the trace, and revise your explanation.

PART VI

Recap & small task

Bring the idea back to the mod feature you are building. A useful recap connects the mechanism to a decision you can make in your own code.

• Find a cycle between domain responsibilities
• Draw the original cycle, then replace it with a caller that gathers inputs and calls Pricing. Trace a second caller with discount=0.
• Separate source-backed behavior, host requirements and untested predictions.

One small recap task

Circle the formerly hidden input.

This marks your personal practice record only. It is not a certification or an official workspace assessment.