Adjusted timetable

This commit is contained in:
2025-02-18 08:34:29 +11:00
parent 639250f028
commit 3a82593e4d
8 changed files with 24 additions and 41 deletions

View File

@@ -83,15 +83,13 @@ Here's a flexible outline for the upcoming feature milestones. On each review da
| --- | :---: | :---: | | --- | :---: | :---: |
| [Arrays & Tables](https://github.com/Ratstail91/Toy/issues/155) | - | 1st Jan ✅ | | [Arrays & Tables](https://github.com/Ratstail91/Toy/issues/155) | - | 1st Jan ✅ |
| [Control Flow](https://github.com/Ratstail91/Toy/issues/152) | 2 weeks | 15th Jan ✅ | | [Control Flow](https://github.com/Ratstail91/Toy/issues/152) | 2 weeks | 15th Jan ✅ |
| Functions* | ~~2 weeks~~ | ~~29th Jan~~ | | [Functions](https://github.com/Ratstail91/Toy/issues/163) | 6 weeks* | 26th Feb |
| [Functions](https://github.com/Ratstail91/Toy/issues/163)** | 2 weeks | 12th Feb | | [Dot Operator & Slices](https://github.com/Ratstail91/Toy/issues/156) | 2 weeks | 12th Mar |
| [Dot Operator & Slices](https://github.com/Ratstail91/Toy/issues/156) | 2 weeks | 26th Feb | | [Native Libraries](https://github.com/Ratstail91/Toy/issues/165) | 2 weeks | 26th Mar |
| [Native Libraries](https://github.com/Ratstail91/Toy/issues/165) | 2 weeks | 12th Mar | | [Standard Libraries](https://github.com/Ratstail91/Toy/issues/164) | 2 weeks | 9th Apr |
| [Standard Libraries](https://github.com/Ratstail91/Toy/issues/164) | 2 weeks | 26th Mar |
| [Documentation](https://github.com/Ratstail91/Toy/issues/169) | - | - | | [Documentation](https://github.com/Ratstail91/Toy/issues/169) | - | - |
*Info about and strategies for missed milestones can be found on [my blog here](https://krgamestudios.com/posts/2025-01-29-missed-by-a-mile). *Info about and strategies for missed milestones can be found on [my blog here](https://krgamestudios.com/posts/2025-01-29-missed-by-a-mile).
**I'm late, I'm late, for a very important date!
# Building # Building
@@ -105,7 +103,7 @@ To build and run the test suites, run `make tests` (`make tests-gdb` and `make t
# Tools # Tools
*Coming Soon - I want the features mostly working first.* *Coming Soon - I want the main features mostly working first.*
# Documentation # Documentation

View File

@@ -1,3 +1,5 @@
//TODO: Not yet functional
//advent of code thingy //advent of code thingy
var arr = [ var arr = [
3, 4, 3, 4,
@@ -5,7 +7,7 @@ var arr = [
2, 5, 2, 5,
1, 3, 1, 3,
3, 9, 3, 9,
3 , 3 3, 3,
]; ];
var total = 0; var total = 0;

View File

@@ -1,11 +1,11 @@
//calculate the nth fibonacci number, and print it //calculate the nth fibonacci number, and print it
//can't use functions yet
var counter: int = 0; var counter: int = 0;
var first: int = 1; var first: int = 1;
var second: int = 0; var second: int = 0;
//This causes integer overflow, but that's fine for now
while (counter < 100_000) { while (counter < 100_000) {
var third: int = first + second; var third: int = first + second;
first = second; first = second;

View File

@@ -1,4 +1,4 @@
//TODO: functions don't work yet //TODO: Not yet functional
//example of the fibonacci sequence //example of the fibonacci sequence
fn fib(n: int) { fn fib(n: int) {
@@ -11,4 +11,5 @@ for (var i = 1; i <= 10; i++) {
print i .. ":" .. fib(i); print i .. ":" .. fib(i);
} }
//Note to self: yes, the base case in 'fib()' is 'n < 2', stop second guessing yourself! //Note to my future self: yes, the base case in 'fib()' is 'n < 2', stop second guessing yourself!
//Note to my past self: don't tell me what to do!

View File

@@ -24,6 +24,7 @@ output(name);
*/ */
//TODO: Not yet functional
fn makeCounter() { fn makeCounter() {
var counter: int = 0; var counter: int = 0;

View File

@@ -1,4 +1,4 @@
//TODO: functions don't work yet //TODO: Not yet functional
//find the leap years //find the leap years
fn isLeapYear(n: int) { fn isLeapYear(n: int) {

View File

@@ -1,8 +0,0 @@
var answer = 42;
var question: string = "How many roads must a man walk down?";
print question;

View File

@@ -1,11 +0,0 @@
var loops = 0;
while (true) {
if (++loops < 15532) {
continue;
}
break;
}
assert loops == 15532, "Yuki loop failed (break + continue)";