ooh hello valgo!
idrk because that was a long time
How can I make a match box with 1-10?
How can I make this work?
When o > 0 and o < 11
I dont know why you are using matches when you can use code
when o matches ^([1-9]|10)$
match is an extremely powerful code
What’s the ten for?
you said 1-10, so i included 10
Oh ok, let me test it out
It works, thank you so much tri:D
matches can only match 1 character in [ ] at a time. That’s why you have to OR it with
10 via bitwise OR |
This expression is used to make the project below work. The numbers is represented by the sum of the input(s). Look familiar? These are all Logic Gates.
1 = one ON
2 = both ON
0 = both OFF
@/Tri-Angle how do you like it?
me dum, thx for reminding me lol
homework is killing my brain so thats why
Does anyone have the problem of starting way to many projects to handle
Me, i used to have it but I can control it a bit
How’s does that work?
The inputs have a binary value: 0 or 1
The output takes the sum of the two inputs, and checks if that sum matches the number in the gate. For example, AND2 will only return true if both inputs are 1 (sum = 2).
The gate name is included, followed by the sum that’ll satisfy the conditions of that gate.
I just had the craziest idea:
What if I made a full project where you can connect many logic gates together to form a simple (or complex) computer circuit?
It’s not guaranteed that I will actually do this.