Choose a pressure eviction policy — Change one requirement

PART I

Warm-up

Reconnect with a useful idea before starting choose a pressure eviction policy. 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

Adapt the objective to rebuild cost

An eviction ranking applies only after eligibility is established. Least-recent-use, largest-first and expiry-first policies optimize different goals and can choose different victims. Make the objective explicit, calculate the effect and keep active or recovery-critical resources outside the candidate list.

Exercise cache ledger under a 100 MiB budget: A30 last used 1 minute ago, expires in 20; B20 last used 10 minutes ago, expires in 2; C25 last used 4 minutes ago, expires in 5; D15 active/retained. Usage 90. A/B/C are regenerable and eligible; D is never eligible while its owner is active. Rebuild costs are A60 s, B5 s, C20 s.

Supplied case: New request needs 25 MiB. Rebuild costs are A60 s, B5 s, C20 s; any of A/B/C alone can cover the 15 MiB deficit.

Worked reasoning: If the stated objective is minimum discarded rebuild work among single sufficient victims, B is cheapest at 5 s. The choice matches LRU here by coincidence, not because cost and recency mean the same thing.

Contrast and diagnosis: A policy name is not evidence of its optimization target; the same decision can arise for different reasons.

Worked reasoning and supplied artifact

// Disposable exercise fixture / host-contract notes; not executable API syntax.
// Supplied input: New request needs 25 MiB. Rebuild costs are A60 s, B5 s, C20 s; any of A/B/C alone can cover the 15 MiB deficit.
// Worked prediction: If the stated objective is minimum discarded rebuild work among single sufficient victims, B is cheapest at 5 s. The choice matches LRU here by coincidence, not because cost and recency mean the same thing.
// Rejected alternative: A policy name is not evidence of its optimization target; the same decision can arise for different reasons.

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: Resource budget dashboard. Build a small, understandable change around choose a pressure eviction policy.

Change B’s rebuild cost to 90 s while keeping sizes/ages. Choose the cheapest sufficient victim and contrast it with LRU.

What to produce

Change B’s rebuild cost to 90 s while keeping sizes/ages. Choose the cheapest sufficient victim and contrast it with LRU. Include input → intermediate decision/state → predicted outcome, with any required host rule stated explicitly.

• 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.

import tmp;
const cache = tmp.create({
    name: "report-cache",
    storage: "ssd",
    maxSize: "2GB",
    lifetime: { duration: "30m", refreshOnAccess: true },
    cleanup: { automatic: true, onCrashRecovery: true }
});

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.

• Adapt the objective to rebuild cost
• Explain the decision for the supplied case, then independently work the changed fixture.
• Separate source-backed behavior, host requirements and untested predictions.

One small recap task

In one or two sentences, name the decisive rule in “Adapt the objective to rebuild cost” and predict the outcome of one changed input from your independent fixture. State which host behavior still needs real verification.

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