Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Trying to define integer division but it takes so long to run #81

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 8 commits into
base: master
Choose a base branch
from
Open

Trying to define integer division but it takes so long to run #81

Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
8e8bd9f
Trying to define integer division but it takes so long to run
Charles-Johnson May 17, 2024
554959e
Set limit of 25 seconds for each tutorial step to complete
Charles-Johnson Jun 2, 2024
45706e4
Resolve fmt issues
Charles-Johnson Jun 2, 2024
29491c3
Lazily compute examples of generalisations
Charles-Johnson Jun 6, 2024
1cfe609
Merge branch 'master' into arrays
Charles-Johnson Jun 9, 2024
3ce2220
Merge branch 'master' into arrays
Charles-Johnson Jul 6, 2024
0505367
Merge branch 'master' into arrays
Charles-Johnson Oct 10, 2025
99844c4
Uncomment out tutorial steps
Charles-Johnson Oct 10, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
110 changes: 109 additions & 1 deletion zia-lang.org/crate/src/page/home/tutorials.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
#[cfg(test)]
use std::time::{Duration, Instant};

pub const TUTORIALS: (Tutorial<18>, Tutorial<9>, Tutorial<12>) = (
pub const TUTORIALS: (Tutorial<18>, Tutorial<9>, Tutorial<30>) = (
Tutorial {
title: "Factorial",
steps: [
Expand Down Expand Up @@ -249,6 +249,114 @@ pub const TUTORIALS: (Tutorial<18>, Tutorial<9>, Tutorial<12>) = (
expected_evaluation: "[ 5 , 3 , 1 ]",
explanation: "We can now push to arrays with multiple elements"
},
TutorialStep {
command: "let (_x_ +1) > _x_",
#[cfg(test)]
expected_evaluation: "",
explanation: "The successor is always greater"
},
TutorialStep {
command: "let 2 := 1 +1",
#[cfg(test)]
expected_evaluation: "",
explanation: "Let's define two to test this"
},
TutorialStep {
command: "2 > 1",
#[cfg(test)]
expected_evaluation: "true",
explanation: ""
},
TutorialStep {
command: "let _x_ - 0 -> _x_",
#[cfg(test)]
expected_evaluation: "",
explanation: "Define the base case for subtraction"
},
TutorialStep {
command: "let (_x_ > _y_) => ((_x_ +1) - (_y_ +1) -> _x_ - _y_)",
#[cfg(test)]
expected_evaluation: "",
explanation: "This is how to simplify a subtraction expression"
},
TutorialStep {
command: "2 - 1",
#[cfg(test)]
expected_evaluation: "1",
explanation: ""
},
TutorialStep {
command: "let (_x_ > _y_) => (_x_ / _y_ -> ((_x_ - _y_) / _y_) +1)",
#[cfg(test)]
expected_evaluation: "",
explanation: "This is how to simplify a division expression"
},
TutorialStep {
command: "let 3 := 2 +1",
#[cfg(test)]
expected_evaluation: "",
explanation: "Define three to test"
},
TutorialStep {
command: "3 / 2",
#[cfg(test)]
expected_evaluation: "1",
explanation: "Let's test evaluating an integer division expression"
},
TutorialStep {
command: "let _y_ / _y_ -> 1",
#[cfg(test)]
expected_evaluation: "",
explanation: "A number divided by itself is always one"
},
TutorialStep {
command: "let (_y_ > _x_) => (_x_ / _y_ -> 0)",
#[cfg(test)]
expected_evaluation: "",
explanation: "Integer by a larger number is zero"
},
TutorialStep {
command: "let _y_ % _y_ -> 0",
#[cfg(test)]
expected_evaluation: "",
explanation: "There's no remainder when dividing something by itself"
},
TutorialStep {
command: "let (_x_ > _y_) => (_x_ % _y_ -> (_x_ - _y_) % _y_)",
#[cfg(test)]
expected_evaluation: "",
explanation: "This is how to simplify a modulo expression"
},
TutorialStep {
command: "let (_y_ > _x_) => (_x_ % _y_ -> _x_)",
#[cfg(test)]
expected_evaluation: "",
explanation: "This is how to simplify another modulo expression"
},
TutorialStep {
command: "let bits_of 0 -> [ 0 ]",
#[cfg(test)]
expected_evaluation: "",
explanation: "Zero can be represented in binary as a single zero"
},
TutorialStep {
command: "let bits_of 1 -> [ 1 ]",
#[cfg(test)]
expected_evaluation: "",
explanation: "One can be represented in binary as a single one"
},
TutorialStep {
command: "let (_x_ > 1) => (bits_of _x_ -> (bits_of (_x_ / 2)) push _x_ % 2)",
#[cfg(test)]
expected_evaluation: "",
explanation: "Binary representations of larger numbers can be defined recursively using integer substraction and modulo"
},
TutorialStep {
command: "bits_of 2",
#[cfg(test)]
expected_evaluation: "[ 1 , 0 ]",
explanation: "Two represented in binary is 10"
},
]
}
);
Expand Down
Loading