From 7f575be0919c4fd4d1d9f204b83f823bba4cc751 Mon Sep 17 00:00:00 2001 From: "M. Pabiszczak" <2+mpabi@noreply.zsl-gitea.mpabi.pl> Date: Mon, 20 Jul 2026 08:36:32 +0200 Subject: [PATCH] meta: add interactive draft URL --- json/card_source.json | 303 ++++++++++++++++++++++++++++++++++++------ 1 file changed, 261 insertions(+), 42 deletions(-) diff --git a/json/card_source.json b/json/card_source.json index e9da81a..79a0ac0 100644 --- a/json/card_source.json +++ b/json/card_source.json @@ -2,64 +2,283 @@ "$schema": "../../../tools/card-layouts/schemas/card-source.schema.json", "schema": "esc-card-source.v1", "card": { - "id": "mpabi-freertos-cpp-10-queue", "series": "freertos-cpp", "series_title": "FreeRTOS C++", - "number": "10", "count": "16", "slug": "queue", "title": "Queue and StaticQueue", - "topic": "Typed send/receive, byte-copy semantics, timeout and static storage", "project": "Freestanding C++ nad FreeRTOS", "subject": "Informatyka", - "level": "Rok 2 · L09 · RV32I/Hazard3", "revision_date": "2026-07-19T00:00:00+02:00", "status": "Gotowa", - "version": "v00.01", "uuid": "66967c2d-bb34-4344-8064-f54d06cce47a", "author": "M. Pabiszczak", "year": "2026" + "id": "mpabi-freertos-cpp-10-queue", + "series": "freertos-cpp", + "series_title": "FreeRTOS C++", + "number": "10", + "count": "16", + "slug": "queue", + "title": "Queue and StaticQueue", + "topic": "Typed send/receive, byte-copy semantics, timeout and static storage", + "project": "Freestanding C++ nad FreeRTOS", + "subject": "Informatyka", + "level": "Rok 2 · L09 · RV32I/Hazard3", + "revision_date": "2026-07-19T00:00:00+02:00", + "status": "Gotowa", + "version": "v00.01", + "uuid": "66967c2d-bb34-4344-8064-f54d06cce47a", + "author": "M. Pabiszczak", + "year": "2026" + }, + "generated": { + "tex": "doc/generated/main.tex", + "html": "web/index.html", + "html_css": "web/style.css", + "html_tree_inspector": false, + "react_app": true }, - "generated": {"tex": "doc/generated/main.tex", "html": "web/index.html", "html_css": "web/style.css", "html_tree_inspector": false, "react_app": true}, "template": "templates/karta-klasyczna.json", "title_block": { - "category": "KARTA PRACY · INFORMATYKA", "prepared_by": "M. Pabiszczak", "prepared_on": "2026-07-19T00:00:00+02:00", - "title": "Queue and StaticQueue", "repository_url": "https://zsl-gitea.mpabi.pl/edu-freertos-cpp/lab-rv32i-freertos-queue", - "revision": "v00.01", "issued_on": "2026-07-19T00:00:00+02:00", "series": "FREERTOS-CPP-10", "document_type": "karta pracy", "tool": "card-layouts", - "show_qr": false, "show_repository_qr": false, "height_cm": 2.6, "repeat_on_every_page": true, "replace_front_matter": true + "category": "KARTA PRACY · INFORMATYKA", + "prepared_by": "M. Pabiszczak", + "prepared_on": "2026-07-19T00:00:00+02:00", + "title": "Queue and StaticQueue", + "repository_url": "https://zsl-gitea.mpabi.pl/edu-freertos-cpp/lab-rv32i-freertos-queue", + "revision": "v00.01", + "issued_on": "2026-07-19T00:00:00+02:00", + "series": "FREERTOS-CPP-10", + "document_type": "karta pracy", + "tool": "card-layouts", + "show_qr": false, + "show_repository_qr": false, + "height_cm": 2.6, + "repeat_on_every_page": true, + "replace_front_matter": true, + "url": "https://dce7fb9d-7b2f-5d49-96a2-3a30d3070b84.mpabi.pl/66967c2d-bb34-4344-8064-f54d06cce47a" }, "front_page_scope": { - "title": "Cel karty", "content_tex": "Uczeń projektuje trivial message, dowodzi snapshotowej semantyki byte copy, porównuje dynamiczne i caller-owned static storage oraz obsługuje full, timeout, FIFO i empty.", - "scope_title": "Zakres karty", "scope_content_tex": "Queue nie zarządza lifetime obiektu C++. Owning typ by value jest odrzucony; wskaźnik wymaga osobnego kontraktu ownership. Timeout pozostaje jawny." + "title": "Cel karty", + "content_tex": "Uczeń projektuje trivial message, dowodzi snapshotowej semantyki byte copy, porównuje dynamiczne i caller-owned static storage oraz obsługuje full, timeout, FIFO i empty.", + "scope_title": "Zakres karty", + "scope_content_tex": "Queue nie zarządza lifetime obiektu C++. Owning typ by value jest odrzucony; wskaźnik wymaga osobnego kontraktu ownership. Timeout pozostaje jawny." + }, + "side_margin_tree_layout": { + "columns": [ + { + "id": "zawodowe", + "label": "TECH", + "side": "left", + "tree": "WE -> EK -> KW", + "description": "Item bytes, heap, storage i timeout." + }, + { + "id": "ogolne", + "label": "OG", + "side": "right", + "tree": "WE -> EN -> KW", + "description": "Type gate, ownership i copy contract." + } + ] }, - "side_margin_tree_layout": {"columns": [ - {"id": "zawodowe", "label": "TECH", "side": "left", "tree": "WE -> EK -> KW", "description": "Item bytes, heap, storage i timeout."}, - {"id": "ogolne", "label": "OG", "side": "right", "tree": "WE -> EN -> KW", "description": "Type gate, ownership i copy contract."} - ]}, "learning_effects": { - "K10.EN01": {"bloom_level": "Analiza", "label": "Byte-copy ownership", "text": "Uczeń uzasadnia trivially-copyable gate i rozróżnia kopię wartości od lifetime wskaźnika lub owning object.", "assessment_criteria": ["K10.KW01"]}, - "K10.EK01": {"bloom_level": "Zastosowanie", "label": "Typed queue evidence", "text": "Uczeń mierzy item size, heap/static storage, snapshot, full timeout, FIFO i empty.", "assessment_criteria": ["K10.KW01"]} + "K10.EN01": { + "bloom_level": "Analiza", + "label": "Byte-copy ownership", + "text": "Uczeń uzasadnia trivially-copyable gate i rozróżnia kopię wartości od lifetime wskaźnika lub owning object.", + "assessment_criteria": [ + "K10.KW01" + ] + }, + "K10.EK01": { + "bloom_level": "Zastosowanie", + "label": "Typed queue evidence", + "text": "Uczeń mierzy item size, heap/static storage, snapshot, full timeout, FIFO i empty.", + "assessment_criteria": [ + "K10.KW01" + ] + } }, "assessment_criteria": { - "K10.KW01": {"text": "Program kończy się PASS; item ma 12 B, dynamic cost 128 B, static delta 0 B, copy zachowuje 0x1111, full send odmawia po 2 tickach, FIFO daje 0x2222/0x3333, a VectorV1 nie kompiluje się przez type gate.", "learning_effects": ["K10.EN01", "K10.EK01"]} + "K10.KW01": { + "text": "Program kończy się PASS; item ma 12 B, dynamic cost 128 B, static delta 0 B, copy zachowuje 0x1111, full send odmawia po 2 tickach, FIFO daje 0x2222/0x3333, a VectorV1 nie kompiluje się przez type gate.", + "learning_effects": [ + "K10.EN01", + "K10.EK01" + ] + } }, "educational_requirements": { "K10.WE01": { - "text": "Bezpieczna typowana granica nad byte-copy kolejką FreeRTOS z jawnym storage i timeoutem.", "label": "Typed queues", "learning_effects": ["K10.EN01", "K10.EK01"], + "text": "Bezpieczna typowana granica nad byte-copy kolejką FreeRTOS z jawnym storage i timeoutem.", + "label": "Typed queues", + "learning_effects": [ + "K10.EN01", + "K10.EK01" + ], "learning_tree": { - "schema": "we-learning-tree.v1", "policy": "Każda wiadomość ma compile-time type gate, a każde twierdzenie o copy/storage ma pomiar targetu.", - "ogolne": [{"effect_ref": "K10.EN01", "display": "EN LOCAL OOP.OWN.04", "source": "LOCAL", "official": "OOP.OWN", "local": "04", "kind": "EN", "tree_id": "K10.WE01.OG.LOCAL.OOP.OWN.04", "text": "Analizuje byte representation, ownership i lifetime wiadomości.", "kw": [{"criterion_ref": "K10.KW01", "display": "KW LOCAL OOP.OWN.04", "source": "LOCAL", "kind": "KW", "official": "OOP.OWN", "local": "04", "text": "Uzasadnia gate i poprawną semantykę wartości lub wskaźnika."}]}], - "zawodowe": [{"effect_ref": "K10.EK01", "display": "EK LOCAL RTOS.QUEUE.01", "source": "LOCAL", "official": "RTOS.QUEUE", "local": "01", "kind": "EK", "tree_id": "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01", "text": "Mierzy queue storage, copy, full timeout i FIFO.", "kw": [{"criterion_ref": "K10.KW01", "display": "KW LOCAL RTOS.QUEUE.01", "source": "LOCAL", "kind": "KW", "official": "RTOS.QUEUE", "local": "01", "text": "Pokazuje wszystkie relacje liczbowe oraz końcowy PASS."}]}] + "schema": "we-learning-tree.v1", + "policy": "Każda wiadomość ma compile-time type gate, a każde twierdzenie o copy/storage ma pomiar targetu.", + "ogolne": [ + { + "effect_ref": "K10.EN01", + "display": "EN LOCAL OOP.OWN.04", + "source": "LOCAL", + "official": "OOP.OWN", + "local": "04", + "kind": "EN", + "tree_id": "K10.WE01.OG.LOCAL.OOP.OWN.04", + "text": "Analizuje byte representation, ownership i lifetime wiadomości.", + "kw": [ + { + "criterion_ref": "K10.KW01", + "display": "KW LOCAL OOP.OWN.04", + "source": "LOCAL", + "kind": "KW", + "official": "OOP.OWN", + "local": "04", + "text": "Uzasadnia gate i poprawną semantykę wartości lub wskaźnika." + } + ] + } + ], + "zawodowe": [ + { + "effect_ref": "K10.EK01", + "display": "EK LOCAL RTOS.QUEUE.01", + "source": "LOCAL", + "official": "RTOS.QUEUE", + "local": "01", + "kind": "EK", + "tree_id": "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01", + "text": "Mierzy queue storage, copy, full timeout i FIFO.", + "kw": [ + { + "criterion_ref": "K10.KW01", + "display": "KW LOCAL RTOS.QUEUE.01", + "source": "LOCAL", + "kind": "KW", + "official": "RTOS.QUEUE", + "local": "01", + "text": "Pokazuje wszystkie relacje liczbowe oraz końcowy PASS." + } + ] + } + ] } } }, "sections": [ - {"title": "Type gate i byte copy", "content_kind": "prose", "content_tex": "Wykaż, że Sample jest trivially copyable, a owning VectorV1 kończy negatywny test właściwym static assert.", "educational_requirement_refs": ["K10.WE01"], "learning_effect_refs": ["K10.EN01"], "assessment_criterion_refs": ["K10.KW01"], "area_tree_refs": ["K10.WE01.OG.LOCAL.OOP.OWN.04"], "steps": [ - {"id": "S01", "title": "Powiąż sizeof(T) z item size i reprezentacją 12 B.", "tree_refs": ["K10.WE01.OG.LOCAL.OOP.OWN.04"]}, - {"id": "S02", "title": "Wyjaśnij granicę ownership dla owning type i pointera.", "tree_refs": ["K10.WE01.OG.LOCAL.OOP.OWN.04"]} - ]}, - {"title": "Dynamic i static storage", "content_kind": "prose", "content_tex": "Zmierz 128 B dynamic cost, zerowy static delta, caller addresses w .bss i pełne odzyskanie baseline przez destruktor.", "educational_requirement_refs": ["K10.WE01"], "learning_effect_refs": ["K10.EK01"], "assessment_criterion_refs": ["K10.KW01"], "area_tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"], "steps": [ - {"id": "S03", "title": "Porównaj control i item bytes obu polityk.", "tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"]}, - {"id": "S04", "title": "Zrób byte snapshot pierwszego elementu.", "tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"]} - ]}, - {"title": "Copy, full, timeout i FIFO", "content_kind": "prose", "content_tex": "Wyślij, zmień źródło i odbierz snapshot; następnie wypełnij capacity 2, odmów trzeciego send po 2 tickach i opróżnij FIFO.", "educational_requirement_refs": ["K10.WE01"], "learning_effect_refs": ["K10.EK01"], "assessment_criterion_refs": ["K10.KW01"], "area_tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"], "steps": [ - {"id": "S05", "title": "Udowodnij 0x1111 mimo mutate do 0xDEAD.", "tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"]}, - {"id": "S06", "title": "Potwierdź timeout, FIFO i empty non-blocking.", "tree_refs": ["K10.WE01.TECH.LOCAL.RTOS.QUEUE.01"]} - ]} + { + "title": "Type gate i byte copy", + "content_kind": "prose", + "content_tex": "Wykaż, że Sample jest trivially copyable, a owning VectorV1 kończy negatywny test właściwym static assert.", + "educational_requirement_refs": [ + "K10.WE01" + ], + "learning_effect_refs": [ + "K10.EN01" + ], + "assessment_criterion_refs": [ + "K10.KW01" + ], + "area_tree_refs": [ + "K10.WE01.OG.LOCAL.OOP.OWN.04" + ], + "steps": [ + { + "id": "S01", + "title": "Powiąż sizeof(T) z item size i reprezentacją 12 B.", + "tree_refs": [ + "K10.WE01.OG.LOCAL.OOP.OWN.04" + ] + }, + { + "id": "S02", + "title": "Wyjaśnij granicę ownership dla owning type i pointera.", + "tree_refs": [ + "K10.WE01.OG.LOCAL.OOP.OWN.04" + ] + } + ] + }, + { + "title": "Dynamic i static storage", + "content_kind": "prose", + "content_tex": "Zmierz 128 B dynamic cost, zerowy static delta, caller addresses w .bss i pełne odzyskanie baseline przez destruktor.", + "educational_requirement_refs": [ + "K10.WE01" + ], + "learning_effect_refs": [ + "K10.EK01" + ], + "assessment_criterion_refs": [ + "K10.KW01" + ], + "area_tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ], + "steps": [ + { + "id": "S03", + "title": "Porównaj control i item bytes obu polityk.", + "tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ] + }, + { + "id": "S04", + "title": "Zrób byte snapshot pierwszego elementu.", + "tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ] + } + ] + }, + { + "title": "Copy, full, timeout i FIFO", + "content_kind": "prose", + "content_tex": "Wyślij, zmień źródło i odbierz snapshot; następnie wypełnij capacity 2, odmów trzeciego send po 2 tickach i opróżnij FIFO.", + "educational_requirement_refs": [ + "K10.WE01" + ], + "learning_effect_refs": [ + "K10.EK01" + ], + "assessment_criterion_refs": [ + "K10.KW01" + ], + "area_tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ], + "steps": [ + { + "id": "S05", + "title": "Udowodnij 0x1111 mimo mutate do 0xDEAD.", + "tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ] + }, + { + "id": "S06", + "title": "Potwierdź timeout, FIFO i empty non-blocking.", + "tree_refs": [ + "K10.WE01.TECH.LOCAL.RTOS.QUEUE.01" + ] + } + ] + } ], - "tasks": {"task01": { - "title": "Typed byte-copy queue z dwiema politykami storage", "uuid": "66967c2d-bb34-4344-8064-f54d06cce47a", - "prompt_tex": "Zaprojektuj trivial Sample, porównaj dynamic i static queue, udowodnij snapshot byte copy oraz zbadaj full timeout, FIFO, empty i negatywny owning type.", - "criterion": "12 B; dynamic 128 B; static 0 B; copy 0x1111; timeout >=2; FIFO 0x2222/0x3333; empty false; VectorV1 rejected; pass=1.", - "educational_requirement_refs": ["K10.WE01"], "learning_effect_refs": ["K10.EN01", "K10.EK01"], "assessment_criterion_ref": "K10.KW01", "links": {"equations": [], "figures": []} - }}, - "tasks_order": ["task01"] + "tasks": { + "task01": { + "title": "Typed byte-copy queue z dwiema politykami storage", + "uuid": "66967c2d-bb34-4344-8064-f54d06cce47a", + "prompt_tex": "Zaprojektuj trivial Sample, porównaj dynamic i static queue, udowodnij snapshot byte copy oraz zbadaj full timeout, FIFO, empty i negatywny owning type.", + "criterion": "12 B; dynamic 128 B; static 0 B; copy 0x1111; timeout >=2; FIFO 0x2222/0x3333; empty false; VectorV1 rejected; pass=1.", + "educational_requirement_refs": [ + "K10.WE01" + ], + "learning_effect_refs": [ + "K10.EN01", + "K10.EK01" + ], + "assessment_criterion_ref": "K10.KW01", + "links": { + "equations": [], + "figures": [] + } + } + }, + "tasks_order": [ + "task01" + ] }