Mutable and stable bindings — Alternative solution challenge

PART I

Warm-up

Reconnect with a useful idea before starting mutable and stable bindings. 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.

Recall note

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

PART II

Instruction & guided example

Compare a local update with a direct expression

A short arithmetic helper may express the same intended result through a local mutable binding or through a direct return expression. Compare their data flow and readability, keeping the claim to ordinary integer inputs where this paper arithmetic is meaningful.

adjustA copies starting 8 to count, adds delta 3 and returns 11. adjustB directly returns starting + delta, also 11. For delta zero both give 8; for delta -2 both give 6. The mutable version exposes a transition, while the direct expression is shorter when there is only one change.

Equivalent output in these examples does not mean local state is persistent or that mutation is always preferable. If later requirements need a sequence of intermediate updates, the ledger may help. For one pure calculation, the direct expression can be easier to audit.

Worked reasoning and supplied artifact

fnc adjustA(starting: i32, delta: i32) -> i32 {
    vary count: i32 = starting;
    count += delta;
    return count;
}
fnc adjustB(starting: i32, delta: i32) -> i32 {
    return starting + delta;
}

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.

Walk through the example, one line at a time

fnc adjustA(starting: i32, delta: i32) -> i32 {
Read the function name, its parameter names/types and the result type after ->. This is the contract the body must satisfy.
vary count: i32 = starting;
Introduce a binding intended to change. Identify its initial value now so later updates can be traced rather than guessed.
count += delta;
Read the current value, add the right-hand amount and store the new value. A before/after trace makes the state change visible.
return count;
Evaluate the following expression using the current values, then send its result to the caller. Explain the value; do not confuse it with printed output.
}
Close the nested block or value begun earlier. Match it to its opening boundary to keep the structure readable.
fnc adjustB(starting: i32, delta: i32) -> i32 {
Read the function name, its parameter names/types and the result type after ->. This is the contract the body must satisfy.
return starting + delta;
Evaluate the following expression using the current values, then send its result to the caller. Explain the value; do not confuse it with printed output.
}
Close the nested block or value begun earlier. Match it to its opening boundary to keep the structure readable.

Try the guided change

Trace both versions for (8,3), (8,0) and (8,-2), including the extra local-state row only where it exists.

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.

Prediction or guided notes

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.

Your drafts remain here. Continue whenever you are ready.

PART IV

Independent practice

Project context: Workshop stock counter. Build a small, understandable change around mutable and stable bindings.

Write two versions of a one-delivery stock helper, one with vary and one with direct arithmetic. Compare them with two deliveries applied in sequence and explain when you would prefer each representation.

What to produce

Two source alternatives, three paired predictions and a reasoned readability choice.

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.

Your .ws practice draft

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.

Need a hint?

Original learning-path task and reference

In a museum exhibit console, demonstrate mutable and stable bindings. Produce an equivalent approach and justify why both implementations satisfy the same contract. Include .ws source and a host-resource contract; compare at least one normal case and one edge case.

fnc total() -> i32 {
    vary count: i32 = 1;
    const bonus: i32 = 2;
    count += bonus;
    return count;
}

Where the original task needs a host API that is not supplied here, write the contract and predictions. Do not invent a runtime result.

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.

What does the local mutable version add to the explanation?An explicit before/after state transitionAutomatic persistent storageA requirement that every arithmetic helper mutate

Explain a normal or boundary case

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.

Compare a local update with a direct expression
A short arithmetic helper may express the same intended result through a local mutable binding or through a direct return expression. Compare their data flow and readability, keeping the claim to ordinary integer inputs where this paper arithmetic is meaningful.
Separate source-backed behavior, host requirements and untested predictions.

One small recap task

Rewrite a one-update helper as one return expression without changing its intended arithmetic.

Your recap

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