Given some text on the graphscreen of a TI-84+CSE, how can you simulate individual pixels/points starting from left to right of the text to fall down and hit the bottom of the screen?

Here is the code:

Code:


In other words, how can I get the text to dissolve by breaking apart form left to right? First the T, then the H, and so on.

Thanks in advance.

Here's some pseudocode for you to start thinking about the general concept:


Code:
Other people: Please correct me if I made a glaring mistake.

Alright. I figured this would involve some pxl-Test. I understand what most of the pseudocode means except for the Read_Y and Write_Y.

And is there a missing EndFor?

Here is what I have so far:

Code:


This entire program takes 12.5 minutes to just finish the "THANKS" and 39 minutes to finish the entire string.
Some letters and the spaces being different widths throws the spacing off and skips a few lines.
Would there be a faster way to do this program or should I rethink the animation?

Yes, there was a final EndFor missing indeed; I missed it because I forgot to indent the second-most-outer For( loop. I tested the code you pasted there in SourceCoder 3, and it did indeed run painfully slowly. Even changing the Pxl-On to use A+8 and the second-to-last line to A+8->A didn't really help, so no, I think you're going to either need to use hybrid BASIC to help you here or consider an alternative dissolve method. What about erasing it one line at a time using Line() commands?

Based on your suggestion, I think using Hybrid Basic may be the way to go unless this Line() method is speedier.
For this method, would you still use pxl-Test() to get the endpoints of the lines and just use those same x-coordinates the entire way down?

Oh, I was thinking something even simpler than that: Just draw 10 horizontal white lines, thus erasing the text bottom to top, and forget about having it fall down to the bottom.

That was much more simpler than what I intended. Here's the code for just erasing the text with lines from bottom to top.

Code:


This seems boring though. Is there a way I could learn some Hybrid Basic to do the previous way but faster?

Yup, that's what I was thinking. Does that look nifty enough, or no? If you want to slow it down, you could add some rand computations in that loop (ie, rand or rand(4) or rand(10)).

I have been working on a small program based on a request from one of my classmates. The code is here: http://pastebin.com/sjmARch9

I am sure that there are some optimizations that can be done with this as I made it in one night. Could anyone offer any suggestions/tips?

I believe that the pointer to the class is wrong.

*bump
I've started a new program to complement my math program but in a totally different format. Instead of using the Menu( command, I decided to try the graphscreen text menus.
I know this could use some serious optimization, though.

Code:


Thanks in advance for any help!

All of the values you have in the If statements that display Ans should be put in a list, and then do If sum(Ans=L1 or whatever.

Alright, thanks. I'll see if this method is still more practical than just Menu( commands.

You beat me to it. That Ans section can be extremely compressed; I think there's a formula that can even make it smaller. Something like:
Code:

Thanks! Sorry for the confusion but all of the Disp Ans will actually be Goto commands. I just like to know what the values are when I am testing the program. I am sure that this may change the above code above.
Here is the code so far:

Code:

Here is the code so far. I am starting to think that I should use the default menu command unless I can improve on the structure of this program. Are there any suggestions?


Code:

*bump

Given a predetermined equation, is there a way to solve for any one variable when the known values are in a list?

Example:
Equation: Potential Energy=(mass)(gravity)(height)
List: {150,0,9.8,40} This means that potential energy is 150, mass is unknown, gravity is 9.8, and height is 40.

I plan for this to work with any equation. This includes using almost or all of the operators.

I saw this code in the Code Fragments and Routines that solves the Pythagorean Theorem.

Code:

Your best bet is the solve() command, which will indeed work if you have your known variables in a list and a single unknown that is a real (letter) variable. You cannot have the unknown variable be a list element, unfortunately, so it's nontrivial to make a program that can solve a multi-variable equation where any single one of the variables is unknown.

Alright. I think I'll make the program jump to code that will be tailored to that equation. Here is what I have as of now:

Edit: I changed the code. I got equations to work in it. It can only support multiplication on either side of the equal sign (e.g. Q=MGH, D=RT, F=MA, etc.) The basic equation with an equal sign is stored into Str9. I have tested this on both TI-84+SE and CSE.


Code:


Are there any suggestions/optimizations for the code? Also, I am avoiding DelVar in this program. Thanks in advance for any help!

*bump

I'm running into a problem that I can't seem to tackle.

With this program, a quick letter wrap that is compatible on both monochrome and color calculators, I have an issue where the starting value (C) is advanced by one if the previous line was just filled. In other words, one character is skipped when wrapping.

Code:


Can anyone please help me fix this? Thanks!

*bump

After putting this off for a while, I have code that fixed my problem.

Code: