ALL LESSONSWEEK 33TUESDAY

BUILD · TYPESCRIPT

Constraints

Generics express relationships30–60 MINUTESCORE + PRACTICAL
01

GROUND

Problem

What becomes confusing, fragile, or impossible without understanding constraints? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.

TypeScript added gradual static analysis to JavaScript without replacing its runtime, preserving ecosystem compatibility through erasure.
02

LEARN

Concept explanation

Constraints belongs to “Generics express relationships”. Generics express relationships among inputs and outputs; useful constraints preserve inference. This lesson turns constraints into a working part of weekly fixture.

For constraints, trace concrete input, state transition, output, and failure through a compile-time relationship that constrains JavaScript while leaving runtime values and external data untrusted.

Types constrain possible programs during analysis, then disappear. Runtime values remain JavaScript values and external data remains untrusted. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.

Observable

Evidence produced by the constraints experiment: output, state, trace, bytes, timing, or diagnostics.

Invariant

Condition that must remain true while inputs or implementation of constraints change.

Boundary

Point where constraints crosses ownership, representation, time, process, network, or trust.

Example bank

Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.

Baseline · one variable

SETUPBuild constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.

OBSERVEconstraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.

WHY IT MATTERSThis isolates the normal contract of constraints; preserve its raw evidence as the control for every later comparison.

Boundary · same contract, harder input

SETUPAdd constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.

OBSERVERecord what remains invariant and the first representation, owner, size, or timing value that changes in tsc · hx LSP · emitted JS · source maps.

WHY IT MATTERSA boundary example is useful only when one named dimension changes and everything else stays comparable.

Failure · evidence before repair

SETUPMake constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.

OBSERVECapture the first divergence from the baseline, including exact input, diagnostic, state, and recovery result. Expected recovery: constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.

WHY IT MATTERSThe diagnostic is part of the interface. Repair the proven cause, not the most visible symptom.

Cross-layer · follow ownership

SETUPTrace constraints one layer below its usual abstraction through a compile-time relationship that constrains JavaScript while leaving runtime values and external data untrusted.

OBSERVERead inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.

WHY IT MATTERSThe lower layer is earned when it explains evidence the current layer cannot. Otherwise keep constraints at the simpler boundary.

03

SEE

Worked example

Start from supplied lab.ts. Focus: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.

  1. Run: npx tsc --strict --noEmit lab.ts
  2. Save baseline evidence. Read inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.
  3. Boundary case: Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.
  4. Failure case: Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.
RESULT
constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship. Starter-level baseline: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
04

START HERE

Starter material

PREREQUISITESNode.js 22+ and npm. TypeScript is installed locally so compiler version is explicit.

ONE-TIME SETUPmkdir reforging-ts && cd reforging-ts && npm init -y && npm install --save-dev typescript

Create lab.ts, paste this exact content, then run the command below.

type Observation<T> = { topic: string; value: T; valid: boolean };

function observe<T>(topic: string, value: T): Observation<T> {
  return { topic, value, valid: value !== undefined };
}

const result = observe("constraints", 1);
console.log(result.value);
RUNnpx tsc --strict --noEmit lab.ts

STOP / CLEANUPCompiler exits by itself; no cleanup command required.

05

DO WITH GUIDANCE

Guided exercise

Complete one useful slice: constraints

  1. Normal case: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.
  2. Write predicted evidence from this named case before running starter.
  3. Implement smallest behavior that satisfies the checks.
  4. Run exact normal case. Save commands, inputs, outputs, and diagnostics in notebook.
  5. Explain changed evidence using lesson mental model in no more than five sentences.
Concrete guided solution
  1. Copy the supplied lab.ts unchanged and run: npx tsc --strict --noEmit lab.ts
  2. Write this prediction before inspecting output: constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
  3. Perform only the named normal case: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.
  4. Save the raw output, then annotate input → transition → evidence. Use tsc · hx LSP · emitted JS · source maps to confirm the transition rather than inferring it.
  5. Compare prediction with evidence; if they differ, keep both and write the rule that explains the difference. Reference baseline: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
06

DO ALONE

Independent exercise

Add one real case: constraints

  1. Create second case from blank file: Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.
  2. Then create controlled failure: Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.
  3. Use tsc · hx LSP · emitted JS · source maps to prove behavior, then repair controlled failure.
  4. Compare result against supplied acceptance checks and reference approach before marking complete.
Concrete independent solution
  1. Duplicate the starter into a clean comparison case; change only this boundary: Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.
  2. Save its evidence beside the baseline and identify the first changed value. Read inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.
  3. Create the exact controlled failure: Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.
  4. Create smallest file or component named for constraints; accept weekly fixture as input rather than embedding hidden state.
  5. Implement baseline path first: Implement typed groupBy/get/collection transform with keyof constraint.
  6. Add one explicit branch or state for: Compare inference with explicit and needless type parameters.
  7. Return, throw, display, or log actionable failure for: Permit unrelated output type and show unsound assertion, then remove it.
  8. Run both successful cases after failure repair; verify: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
  9. Rerun baseline, boundary, and repaired failure together. Accept only if all reproduce: constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
07

COMPARE

Expected result

  • constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
  • Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
  • Controlled constraints failure produces captured evidence; repair restores stated invariant without hiding error.
08

PROVE

Acceptance checks

Lesson is complete only when every check is true. Each check is stored locally and travels with your JSON backup.

0/5 complete · saved on this device

09

UNSTICK

Hints

Reveal hints
  1. Start with supplied normal case exactly as written: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.
  2. For boundary case, change only named dimension: Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.
  3. If result is confusing, diff raw inputs and evidence before editing implementation.
  4. If tool shows nothing useful, move observation one boundary lower: representation, runtime, OS, or network.
10

VERIFY

Solution

Attempt both exercises before opening reference approach.

Reveal reference solution
  1. Run unmodified starter and preserve baseline evidence: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
  2. Create smallest file or component named for constraints; accept weekly fixture as input rather than embedding hidden state.
  3. Implement baseline path first: Implement typed groupBy/get/collection transform with keyof constraint.
  4. Add one explicit branch or state for: Compare inference with explicit and needless type parameters.
  5. Return, throw, display, or log actionable failure for: Permit unrelated output type and show unsound assertion, then remove it.
  6. Run both successful cases after failure repair; verify: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
11

PREDICT · INSPECT · BREAK · DEBUG · MEASURE

Interrogate reality

Prediction: write expected output, state transition, ordering, and failure evidence before running either exercise.

Inspection: Read inferred types, compiler diagnostics, emitted JavaScript, declaration output, module traces, and source maps.

Measurement: Track compile time, declaration complexity, editor latency, escape hatches, and defects prevented.

INSPECT

Capture raw evidence before explaining.

BREAK

Change one assumption and force controlled failure.

DEBUG

Find cause with tsc · hx LSP · emitted JS · source maps before editing fix.

TOOL DRILL · keyboard only · record one retrievable command or shortcut
12

MASTERY + FRONTIER + BOUNDARY

Own the knowledge

TEACH

Explain constraints at beginner, intermediate, and senior depth.

REBUILD

Recreate smallest useful example from blank file without notes or AI.

RETRIEVE

Schedule recall for day 1, 7, 30, and 90.

Creative frontier lab

Try first without opening the solutions. The constraints invite invention; the reference gives one concrete direction, never the only valid answer.

Constraint inversion

Re-solve constraints by removing the most convenient abstraction. make invalid states unrepresentable without assertions or broad escape hatches.

CONSTRAINTKeep the same inputs, observable result, and failure evidence; change the means, not the contract.

ORIGINAL IDEATurn subtraction into a design tool: the missing abstraction should reveal which responsibility it used to hide.

Reveal frontier solution
  1. Freeze the contract as three fixtures: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint. / Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters. / Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.
  2. List every convenience used by the starter; remove the highest-level one while preserving npx tsc --strict --noEmit lab.ts.
  3. Implement the smallest replacement using make invalid states unrepresentable without assertions or broad escape hatches.
  4. Run all fixtures and compare raw evidence. Keep the simpler version unless the removed abstraction has a demonstrated benefit.
Representation x-ray

Build an explanation artifact for constraints: place inferred type, emitted JavaScript, runtime value, and boundary validation side by side.

CONSTRAINTA peer must be able to locate the first divergence without reading implementation code.

ORIGINAL IDEATreat the explanation itself as a product: make invisible transitions visible, replayable, and diffable.

Reveal frontier solution
  1. Create one row or timestamped event for each transition in: Build constraints around this exact fixture: Implement typed groupBy/get/collection transform with keyof constraint.
  2. For every row record input, representation, owner, operation, output, and tool evidence from tsc · hx LSP · emitted JS · source maps.
  3. Replay Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters.; highlight only changed rows.
  4. Replay Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.; stop at the first divergent row and attach its recovery action.
Adversarial remix

Combine the boundary and failure into a new user-visible scenario for constraints. generate an exhaustive table whose new row intentionally breaks compilation until handled.

CONSTRAINTDo not merely add more input. Invent a recovery interaction, alternate representation, or self-checking behavior.

ORIGINAL IDEAMake the system teach its own limits: the artifact should expose the invariant and offer a safe next action when it breaks.

Reveal frontier solution
  1. Combine these two pressures without changing them: Add constraints support for weekly boundary case: Compare inference with explicit and needless type parameters. AND Make constraints surface—not hide—this failure: Permit unrelated output type and show unsound assertion, then remove it.
  2. Name the invariant that must survive and the user-visible evidence when it cannot: constraints handles baseline and boundary while preserving this observable result: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
  3. Implement this original direction: generate an exhaustive table whose new row intentionally breaks compilation until handled.
  4. Demonstrate baseline, combined failure, recovery, then baseline again; save the sequence as a regression fixture.

Capability frontier

Push constraints until another layer becomes justified. Record one robust technique, one contextual trade-off, and one labeled hack or historical curiosity.

CORE · PRACTICAL · CONTEXTUAL · HACK · FRAGILE · HISTORICAL · GOLF

Boundary

A type proof cannot validate network data, permissions, temporal behavior, performance, or implementation honesty.

If this vanished tomorrow…

Use runtime validation, tests, contracts, documentation, and disciplined JavaScript data modeling.

Why next layer is earned

Node is earned when trusted server-side work, shared state, filesystem access, or remote coordination becomes necessary.