chore: migrate task tracking from nbd to beans
Replace all .nbd/ ticket stores with .beans/ directories across the mono-repo (root, edu, nbd, quotesdb). Field mappings: status todo→todo, in_progress→in-progress, done→completed, closed→scrapped, archived→completed, backlog→draft; priority numeric→label; type project→epic. All dependency relationships preserved via --blocked-by. Add scripts/migrate-nbd-to-beans.sh for reproducible future migrations. Update CLAUDE.md task-tracking sections (root, edu, nbd, quotesdb) to reference beans commands instead of nbd commands. Counts: root 2, edu 48, nbd 38, quotesdb 121 beans created; 0 failures. Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>main
parent
01d30b45c2
commit
2dd808cdd3
@ -0,0 +1,6 @@
|
|||||||
|
beans:
|
||||||
|
path: .beans
|
||||||
|
prefix: vibed-
|
||||||
|
id_length: 4
|
||||||
|
default_status: todo
|
||||||
|
default_type: task
|
||||||
@ -0,0 +1,6 @@
|
|||||||
|
beans:
|
||||||
|
path: .beans
|
||||||
|
prefix: edu-
|
||||||
|
id_length: 4
|
||||||
|
default_status: todo
|
||||||
|
default_type: task
|
||||||
@ -1,8 +1,11 @@
|
|||||||
+++
|
---
|
||||||
title = "Markov exercise: Simulating a Random Walk (Rust)"
|
# edu-0w1v
|
||||||
priority = 7
|
title: 'Markov exercise: Simulating a Random Walk (Rust)'
|
||||||
status = "archived"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: high
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
Write Section 5 of edu/markov.md: Exercise 2 — Simulating a Random Walk\n\nLearning objectives:\n- Model a countably-finite state space (bounded integers) in Rust\n- Implement reflecting boundary conditions\n- Aggregate results from many trials into a histogram\n\nContent to produce:\n- Setup instructions (reuse or extend Exercise 1 project)\n- Step-by-step hints:\n 1. Define RandomWalk with min, max, prob_right fields\n 2. Implement step with boundary reflection (clamp or reverse)\n 3. Implement histogram by running simulate() many times\n 4. Print histogram as ASCII bar chart\n 5. Observe convergence toward uniform (symmetric walk) or skewed (asymmetric)\n- Full reference solution\n\nTarget: replace the stub in edu/markov.md §5
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
|
Write Section 5 of edu/markov.md: Exercise 2 — Simulating a Random Walk\n\nLearning objectives:\n- Model a countably-finite state space (bounded integers) in Rust\n- Implement reflecting boundary conditions\n- Aggregate results from many trials into a histogram\n\nContent to produce:\n- Setup instructions (reuse or extend Exercise 1 project)\n- Step-by-step hints:\n 1. Define RandomWalk with min, max, prob_right fields\n 2. Implement step with boundary reflection (clamp or reverse)\n 3. Implement histogram by running simulate() many times\n 4. Print histogram as ASCII bar chart\n 5. Observe convergence toward uniform (symmetric walk) or skewed (asymmetric)\n- Full reference solution\n\nTarget: replace the stub in edu/markov.md §5
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§6 Recognizing Atoms: Integers, Booleans, Strings, Symbols"
|
# edu-16fy
|
||||||
priority = 5
|
title: '§6 Recognizing Atoms: Integers, Booleans, Strings, Symbols'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
## §6 Recognizing Atoms: Integers, Booleans, Strings, Symbols — Stub to fill
|
## §6 Recognizing Atoms: Integers, Booleans, Strings, Symbols — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§11 Checking Special Forms"
|
# edu-3sww
|
||||||
priority = 5
|
title: §11 Checking Special Forms
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
## §11 Checking Special Forms — Stub to fill
|
## §11 Checking Special Forms — Stub to fill
|
||||||
|
|
||||||
@ -1,8 +1,11 @@
|
|||||||
+++
|
---
|
||||||
title = "Markov exercise: N-gram Generalization (Rust)"
|
# edu-4gok
|
||||||
priority = 7
|
title: 'Markov exercise: N-gram Generalization (Rust)'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: high
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
Write Section 8 of edu/markov.md: Exercise 4 — N-gram Generalization\n\nLearning objectives:\n- Generalize from bigrams to arbitrary-order n-gram chains\n- Use Vec<String> as a HashMap key (or a joined string)\n- Empirically compare output quality for n = 1, 2, 3, 4\n\nContent to produce:\n- Setup instructions (extend Exercise 3 project)\n- Step-by-step hints:\n 1. Modify train to use a sliding window of n words as the key\n 2. Modify generate to maintain a deque/window of the last n words\n 3. Run on the same corpus with n = 1, 2, 3, 4 and print 50 words each\n 4. Discuss observations: when does it start memorising the corpus?\n- Full reference solution\n- Stretch goal: implement character-level n-grams instead of word-level\n\nTarget: replace the stub in edu/markov.md §8
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
|
Write Section 8 of edu/markov.md: Exercise 4 — N-gram Generalization\n\nLearning objectives:\n- Generalize from bigrams to arbitrary-order n-gram chains\n- Use Vec<String> as a HashMap key (or a joined string)\n- Empirically compare output quality for n = 1, 2, 3, 4\n\nContent to produce:\n- Setup instructions (extend Exercise 3 project)\n- Step-by-step hints:\n 1. Modify train to use a sliding window of n words as the key\n 2. Modify generate to maintain a deque/window of the last n words\n 3. Run on the same corpus with n = 1, 2, 3, 4 and print 50 words each\n 4. Discuss observations: when does it start memorising the corpus?\n- Full reference solution\n- Stretch goal: implement character-level n-grams instead of word-level\n\nTarget: replace the stub in edu/markov.md §8
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§12 The C Runtime Preamble"
|
# edu-4kkb
|
||||||
priority = 5
|
title: §12 The C Runtime Preamble
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §12 The C Runtime Preamble — Stub to fill
|
## §12 The C Runtime Preamble — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§13 Generating C: Atoms and Expressions"
|
# edu-63ze
|
||||||
priority = 5
|
title: '§13 Generating C: Atoms and Expressions'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §13 Generating C: Atoms and Expressions — Stub to fill
|
## §13 Generating C: Atoms and Expressions — Stub to fill
|
||||||
|
|
||||||
@ -1,8 +1,11 @@
|
|||||||
+++
|
---
|
||||||
title = "Markov exercise: Bigram Text Generator (Rust)"
|
# edu-6r70
|
||||||
priority = 7
|
title: 'Markov exercise: Bigram Text Generator (Rust)'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: high
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
Write Section 7 of edu/markov.md: Exercise 3 — Bigram Text Generator\n\nLearning objectives:\n- Build a HashMap-based transition table from a text corpus\n- Implement weighted random sampling over successor words\n- Generate and print novel word sequences from a seed\n\nContent to produce:\n- Setup instructions (new Cargo project or extend previous, add rand crate)\n- Step-by-step hints:\n 1. Tokenize corpus into words (split_whitespace)\n 2. Build BigramModel::train by iterating consecutive word pairs\n 3. Implement weighted sampling in generate (accumulate weights, compare to rng draw)\n 4. Handle end-of-chain gracefully (seed word not in model)\n 5. Try with a public-domain text (e.g., Project Gutenberg excerpt)\n- Full reference solution\n\nTarget: replace the stub in edu/markov.md §7
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
|
Write Section 7 of edu/markov.md: Exercise 3 — Bigram Text Generator\n\nLearning objectives:\n- Build a HashMap-based transition table from a text corpus\n- Implement weighted random sampling over successor words\n- Generate and print novel word sequences from a seed\n\nContent to produce:\n- Setup instructions (new Cargo project or extend previous, add rand crate)\n- Step-by-step hints:\n 1. Tokenize corpus into words (split_whitespace)\n 2. Build BigramModel::train by iterating consecutive word pairs\n 3. Implement weighted sampling in generate (accumulate weights, compare to rng draw)\n 4. Handle end-of-chain gracefully (seed word not in model)\n 5. Try with a public-domain text (e.g., Project Gutenberg excerpt)\n- Full reference solution\n\nTarget: replace the stub in edu/markov.md §7
|
||||||
@ -1,8 +1,11 @@
|
|||||||
+++
|
---
|
||||||
title = "Markov exercise: Weather Model (Rust)"
|
# edu-7cp2
|
||||||
priority = 7
|
title: 'Markov exercise: Weather Model (Rust)'
|
||||||
status = "archived"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: high
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
Write Section 4 of edu/markov.md: Exercise 1 — Weather Model\n\nLearning objectives:\n- Translate a transition matrix into a Rust struct\n- Use a weighted random draw to implement a single Markov step\n- Run a simulation and print or collect the resulting sequence\n\nContent to produce:\n- Setup instructions (new Cargo project, add rand crate)\n- Step-by-step hints:\n 1. Define the Weather enum and index conversion\n 2. Implement WeatherChain::step using rand::Rng::gen::<f64>()\n 3. Implement WeatherChain::simulate as a loop collecting states\n 4. Run with transition matrix [[0.8, 0.2], [0.4, 0.6]] from Sunny\n 5. Count sunny vs rainy days and compare to stationary distribution\n- Full reference solution (collapsed or at end)\n\nTarget: replace the stub in edu/markov.md §4
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
|
Write Section 4 of edu/markov.md: Exercise 1 — Weather Model\n\nLearning objectives:\n- Translate a transition matrix into a Rust struct\n- Use a weighted random draw to implement a single Markov step\n- Run a simulation and print or collect the resulting sequence\n\nContent to produce:\n- Setup instructions (new Cargo project, add rand crate)\n- Step-by-step hints:\n 1. Define the Weather enum and index conversion\n 2. Implement WeatherChain::step using rand::Rng::gen::<f64>()\n 3. Implement WeatherChain::simulate as a loop collecting states\n 4. Run with transition matrix [[0.8, 0.2], [0.4, 0.6]] from Sunny\n 5. Count sunny vs rainy days and compare to stationary distribution\n- Full reference solution (collapsed or at end)\n\nTarget: replace the stub in edu/markov.md §4
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§2 MiniLisp Language Specification"
|
# edu-azf5
|
||||||
priority = 5
|
title: §2 MiniLisp Language Specification
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §2 MiniLisp Language Specification — Stub to fill
|
## §2 MiniLisp Language Specification — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,31 @@
|
|||||||
+++
|
---
|
||||||
title = "Course: Writing a Lisp-to-C Compiler in Rust"
|
# edu-b73b
|
||||||
priority = 5
|
title: 'Course: Writing a Lisp-to-C Compiler in Rust'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "project"
|
type: epic
|
||||||
dependencies = ["e8da8b", "a93829", "3aeb62", "5835e9", "3dc36b", "685f5e", "a1a827", "b6c9ad", "a4c9f8", "d0b9f8", "6d40a7", "3e1250", "1eb794", "cbc6e3", "de82f1", "58b37a", "8fa47a", "1d16da"]
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
|
updated_at: 2026-03-10T23:30:03Z
|
||||||
|
blocked_by:
|
||||||
|
- edu-ylb8
|
||||||
|
- edu-azf5
|
||||||
|
- edu-n9ap
|
||||||
|
- edu-jzvr
|
||||||
|
- edu-g1r5
|
||||||
|
- edu-16fy
|
||||||
|
- edu-n7zb
|
||||||
|
- edu-mmbr
|
||||||
|
- edu-tzzh
|
||||||
|
- edu-h3yx
|
||||||
|
- edu-3sww
|
||||||
|
- edu-4kkb
|
||||||
|
- edu-63ze
|
||||||
|
- edu-pyue
|
||||||
|
- edu-unus
|
||||||
|
- edu-nc61
|
||||||
|
- edu-v0ud
|
||||||
|
- edu-y4e6
|
||||||
|
---
|
||||||
|
|
||||||
## Course: Writing a Lisp-to-C Compiler in Rust
|
## Course: Writing a Lisp-to-C Compiler in Rust
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§5 Setting Up the Project"
|
# edu-g1r5
|
||||||
priority = 5
|
title: §5 Setting Up the Project
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §5 Setting Up the Project — Stub to fill
|
## §5 Setting Up the Project — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§10 Symbol Tables and Scope"
|
# edu-h3yx
|
||||||
priority = 5
|
title: §10 Symbol Tables and Scope
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §10 Symbol Tables and Scope — Stub to fill
|
## §10 Symbol Tables and Scope — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§4 Introduction to nom: Parser Combinators"
|
# edu-jzvr
|
||||||
priority = 5
|
title: '§4 Introduction to nom: Parser Combinators'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §4 Introduction to nom: Parser Combinators — Stub to fill
|
## §4 Introduction to nom: Parser Combinators — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§8 Parsing Atoms with nom"
|
# edu-mmbr
|
||||||
priority = 5
|
title: §8 Parsing Atoms with nom
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §8 Parsing Atoms with nom — Stub to fill
|
## §8 Parsing Atoms with nom — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§7 The Abstract Syntax Tree"
|
# edu-n7zb
|
||||||
priority = 5
|
title: §7 The Abstract Syntax Tree
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §7 The Abstract Syntax Tree — Stub to fill
|
## §7 The Abstract Syntax Tree — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§3 Compiler Architecture: The Pipeline"
|
# edu-n9ap
|
||||||
priority = 5
|
title: '§3 Compiler Architecture: The Pipeline'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §3 Compiler Architecture: The Pipeline — Stub to fill
|
## §3 Compiler Architecture: The Pipeline — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§16 The Compilation Pipeline"
|
# edu-nc61
|
||||||
priority = 5
|
title: §16 The Compilation Pipeline
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
## §16 The Compilation Pipeline — Stub to fill
|
## §16 The Compilation Pipeline — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§14 Generating C: Definitions and Functions"
|
# edu-pyue
|
||||||
priority = 5
|
title: '§14 Generating C: Definitions and Functions'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §14 Generating C: Definitions and Functions — Stub to fill
|
## §14 Generating C: Definitions and Functions — Stub to fill
|
||||||
|
|
||||||
@ -1,8 +1,22 @@
|
|||||||
+++
|
---
|
||||||
title = "markov"
|
# edu-svom
|
||||||
priority = 7
|
title: markov
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "project"
|
type: epic
|
||||||
dependencies = ["fbf323", "738be2", "44ebe7", "257a2a", "64826a", "92a829", "74be50", "1f995a", "68ee16", "5994a6"]
|
priority: high
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
Self-guided Markov chain course in edu/markov.md.\n\nThe course outline lives in edu/markov.md. Each of the 10 section tickets must be completed to flesh out all stubs before this project is done.\n\nSections:\n1. fbf323 — What Is a Markov Chain?\n2. 738be2 — States and Transitions\n3. 44ebe7 — Transition Probabilities and Matrices\n4. 257a2a — Exercise 1: Weather Model (Rust)\n5. 64826a — Exercise 2: Random Walk (Rust)\n6. 92a829 — Text Generation with Markov Chains\n7. 74be50 — Exercise 3: Bigram Text Generator (Rust)\n8. 1f995a — Exercise 4: N-gram Generalization (Rust)\n9. 68ee16 — Stationary Distributions\n10. 5994a6 — Applications and Further Reading
|
updated_at: 2026-03-10T23:30:04Z
|
||||||
|
blocked_by:
|
||||||
|
- edu-18qe
|
||||||
|
- edu-zjy1
|
||||||
|
- edu-a1al
|
||||||
|
- edu-7cp2
|
||||||
|
- edu-0w1v
|
||||||
|
- edu-9kuk
|
||||||
|
- edu-6r70
|
||||||
|
- edu-4gok
|
||||||
|
- edu-urpp
|
||||||
|
- edu-34co
|
||||||
|
---
|
||||||
|
|
||||||
|
Self-guided Markov chain course in edu/markov.md.\n\nThe course outline lives in edu/markov.md. Each of the 10 section tickets must be completed to flesh out all stubs before this project is done.\n\nSections:\n1. fbf323 — What Is a Markov Chain?\n2. 738be2 — States and Transitions\n3. 44ebe7 — Transition Probabilities and Matrices\n4. 257a2a — Exercise 1: Weather Model (Rust)\n5. 64826a — Exercise 2: Random Walk (Rust)\n6. 92a829 — Text Generation with Markov Chains\n7. 74be50 — Exercise 3: Bigram Text Generator (Rust)\n8. 1f995a — Exercise 4: N-gram Generalization (Rust)\n9. 68ee16 — Stationary Distributions\n10. 5994a6 — Applications and Further Reading
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§9 Parsing S-Expressions and Special Forms"
|
# edu-tzzh
|
||||||
priority = 5
|
title: §9 Parsing S-Expressions and Special Forms
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §9 Parsing S-Expressions and Special Forms — Stub to fill
|
## §9 Parsing S-Expressions and Special Forms — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§15 Generating C: Control Flow and Sequencing"
|
# edu-unus
|
||||||
priority = 5
|
title: '§15 Generating C: Control Flow and Sequencing'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §15 Generating C: Control Flow and Sequencing — Stub to fill
|
## §15 Generating C: Control Flow and Sequencing — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§17 Testing the Compiler"
|
# edu-v0ud
|
||||||
priority = 5
|
title: §17 Testing the Compiler
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:01Z
|
||||||
|
updated_at: 2026-03-10T23:30:01Z
|
||||||
|
---
|
||||||
|
|
||||||
## §17 Testing the Compiler — Stub to fill
|
## §17 Testing the Compiler — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§18 What's Next: Extensions and Further Reading"
|
# edu-y4e6
|
||||||
priority = 5
|
title: '§18 What''s Next: Extensions and Further Reading'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:00Z
|
||||||
|
updated_at: 2026-03-10T23:30:00Z
|
||||||
|
---
|
||||||
|
|
||||||
## §18 What's Next: Extensions and Further Reading — Stub to fill
|
## §18 What's Next: Extensions and Further Reading — Stub to fill
|
||||||
|
|
||||||
@ -1,10 +1,12 @@
|
|||||||
+++
|
---
|
||||||
title = "§1 Introduction: What We're Building"
|
# edu-ylb8
|
||||||
priority = 5
|
title: '§1 Introduction: What We''re Building'
|
||||||
status = "done"
|
status: completed
|
||||||
ticket_type = "task"
|
type: task
|
||||||
dependencies = []
|
priority: normal
|
||||||
+++
|
created_at: 2026-03-10T23:30:02Z
|
||||||
|
updated_at: 2026-03-10T23:30:02Z
|
||||||
|
---
|
||||||
|
|
||||||
## §1 Introduction: What We're Building — Stub to fill
|
## §1 Introduction: What We're Building — Stub to fill
|
||||||
|
|
||||||
@ -1 +0,0 @@
|
|||||||
cache.db
|
|
||||||
@ -0,0 +1,6 @@
|
|||||||
|
beans:
|
||||||
|
path: .beans
|
||||||
|
prefix: nbd-
|
||||||
|
id_length: 4
|
||||||
|
default_status: todo
|
||||||
|
default_type: task
|
||||||
@ -1 +0,0 @@
|
|||||||
cache.db
|
|
||||||
@ -1,8 +0,0 @@
|
|||||||
{
|
|
||||||
"title": "Test archive",
|
|
||||||
"body": "",
|
|
||||||
"priority": 5,
|
|
||||||
"status": "archived",
|
|
||||||
"dependencies": [],
|
|
||||||
"ticket_type": "task"
|
|
||||||
}
|
|
||||||
@ -1,8 +0,0 @@
|
|||||||
{
|
|
||||||
"title": "Test ticket",
|
|
||||||
"body": "Some body text",
|
|
||||||
"priority": 7,
|
|
||||||
"status": "done",
|
|
||||||
"dependencies": [],
|
|
||||||
"ticket_type": "bug"
|
|
||||||
}
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue