PART I
Warm-up
Reconnect with a useful idea before starting use wtmp for bounded scratch data. 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
Account for scratch quota before admission
An exercise WTMP scratch area has quota 10 MiB and currently contains 6 MiB. A new indivisible export requires 3 MiB; a second requires 2 MiB. Quota arithmetic is a supplied host policy.
After admitting the first export, projected use is 9 MiB. The second would make 11 MiB, exceeding the limit. Decide before admission whether to reject or free eligible scratch data. A quota is an upper bound, not reserved free space, and partial work must not be called complete. Units must agree before comparison.
This is a supplied exercise-host design contract. WillowScript and these cross-library integrations remain proposed and unimplemented here. The trace is a hand prediction or supplied observation for analysis, never a claimed script run. No cancellation method, WDB transaction API, permission manifest or native lifetime mechanism is invented.
Worked reasoning and supplied artifact
// Design artifact; not executable WillowScript.
// An exercise WTMP scratch area has quota 10 MiB and currently contains 6 MiB. A new indivisible export requires 3 MiB; a second requires 2 MiB. Quota arithmetic is a supplied host policy.
// 1. Initial occupied6, free4.
// 2. Admit3 -> occupied9, free1.
// 3. Request2 -> projected11 >10 -> no admission under this policy.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
State 1Initial occupied6, free4.
State 2Admit3 -> occupied9, free1.
State 3Request2 -> projected11 >10 -> no admission under this policy.
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: Multimedia operations workstation. Build a small, understandable change around use wtmp for bounded scratch data.
Build an admission table for a 12 MiB quota, 7 MiB occupied and requests of4 then2 MiB, including the reason for each decision.
What to produce
Build an admission table for a 12 MiB quota, 7 MiB occupied and requests of4 then2 MiB, including the reason for each decision.
- 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.
Need a hint?
Admission compares total occupied plus new work, not the size of each request in isolation. Start with the supplied state and trace each boundary separately.
Yes: each request is below10 MiB fails because Admission compares total occupied plus new work, not the size of each request in isolation.
Original learning-path task and reference
In a racing checkpoint editor, demonstrate use wtmp for bounded scratch data. Read the source-grounded example and predict its observable behavior before making changes. Include .ws source and a host-resource contract; compare at least one normal case and one edge case.
import wuix.widget.button;
import wuix.layout;
domain Login {
const screen = {
layout: { type: "column", padding: [24, 32], gap: 16 },
components: [{ type: "text", value: "Welcome back" }]
};
fnc show() -> void {
wuix.mount("main", screen);
}
}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.
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.
- Account for scratch quota before admission
- An exercise WTMP scratch area has quota 10 MiB and currently contains 6 MiB. A new indivisible export requires 3 MiB; a second requires 2 MiB. Quota arithmetic is a supplied host policy.
- Separate source-backed behavior, host requirements and untested predictions.
One small recap task
Explain the decision in “Account for scratch quota before admission” using the supplied case, then state one input change that would invalidate your conclusion.
This marks your personal practice record only. It is not a certification or an official workspace assessment.