From 11b70aea9a59113ac0b89edff8a11681e2552048 Mon Sep 17 00:00:00 2001 From: Popa <115492561+Popa-42@users.noreply.github.com> Date: Fri, 11 Sep 2026 15:19:40 +0200 Subject: [PATCH] fix: update template to new API --- template/main.typ | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/template/main.typ b/template/main.typ index e2cd191..2c0fc4f 100644 --- a/template/main.typ +++ b/template/main.typ @@ -1,4 +1,4 @@ -#import "@preview/clean-sheets:0.3.0": base-template, ex_box, qed +#import "@preview/clean-sheets:0.3.0": base-template, exercise, qed #let logo = box( width: 2.4cm, @@ -17,14 +17,14 @@ ([Jane Doe], [John Doe]), [Taylor Tutor], logo: logo, - show-end-message: true, - end-message: [Typeset with #link("https://typst.app")[Typst].], + show-credits: true, + credits: [Typeset with #link("https://typst.app")[Typst].], body, ) = Exercise 1 -#ex_box( +#exercise( heading: [Warm-up], points: [10 points], )[ @@ -38,7 +38,7 @@ Proof by induction. #qed = Exercise 2 -#ex_box(points: [15 points])[ +#exercise(points: [15 points])[ Implement a function that returns the first $n$ Fibonacci numbers. ] @@ -57,6 +57,6 @@ def fibonacci(n: int) -> list[int]: = Exercise 3 -#ex_box(heading: [Discussion])[ +#exercise(heading: [Discussion])[ Compare the iterative and recursive solutions. ]