1981
News / Re: Axe Contest poll and judging starts
« on: October 02, 2010, 06:03:17 am »
Whoops lol, I knew impartial wasn't the right word, but I knew you guys would get the idea
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to. 1981
News / Re: Axe Contest poll and judging starts« on: October 02, 2010, 06:03:17 am »
Whoops lol, I knew impartial wasn't the right word, but I knew you guys would get the idea
1982
The Axe Parser Project / Re: Axe Parser« on: October 02, 2010, 05:46:44 am »Question: Axe can copy data from archived appvars? Answer: Yes. Example: Code: [Select] If GetCalc("appvDATA",Y₁)
1983
News / Re: Axe Contest poll and judging starts« on: October 01, 2010, 07:52:28 pm »
Just wondering, does anybody know any of the people who run ticalc.org? Because it seems like they're being a bit impartial lol
1984
The Axe Parser Project / Re: Axe Parser« on: October 01, 2010, 05:18:33 pm »
Why would you want inline basic? Axe can pretty much do everything basic can, and more, all faster and better. And what do you mean by "basic-asm conversion?" That's pretty much what Axe is already.
1985
Axe / Re: Holding variables in program data« on: October 01, 2010, 02:56:10 pm »
If you run the program in a shell, writeback should be automatic. Just store your data to a custom pointer, one whose data will be stored inside the program, and the data will be preserved between executions.
EDIT: By the way, I just noticed... when you say "application shell," do you mean that you'll run the program through a shell application like MirageOS? Or that you'll compile the program into an application? Because writeback is not possible for applications. 1986
The Axe Parser Project / Re: Funny program« on: October 01, 2010, 01:27:26 pm »Nice ^^ (how tou know 224? This. (224 = E0 in hex) Can the calculator even read 5 simultaneous keypresses? Like checking only 2 keys at once, it simply checks the keys is fast succession, not simultaneously. You should be able to check as many keys "simultaneously" as you want. 1987
TI Z80 / Re: My First Quantum Translocator« on: October 01, 2010, 11:13:20 am »Also, will doing /2/2/25 save speed compared to /100? Chain division or something...would love help on that Your best bet is to make it /128 or /256 instead or /100. 1988
Axe / Re: Realistic gravity help« on: October 01, 2010, 10:30:19 am »
You mean my code? I tested it on my calculator and it appears to work fine.
1989
Axe / Re: Realistic gravity help« on: October 01, 2010, 10:14:56 am »
Make a loop that constantly adds a velocity variable to the y-position variable, and if the object is not at rest, subtracts some value from the velocity variable every iteration. To jump, set the velocity variable to a positive value.
1990
TI Z80 / Re: My First Quantum Translocator« on: October 01, 2010, 09:58:44 am »
By the way, just to clarify something: a lot of the optimizations were just code order and logic optimizations, but a decently sized part of the optimization was that I changed how subroutine CY works. Instead of storing the result into r6, it now simply returns the value directly to where it was called. I adjusted all your existing calls to subroutine CY already, but in the future, instead of doing something like:
Code: [Select] sub(CY,3 Just do:Code: [Select] If sub(CY,3 And just a note, using sub() like this can sometimes cause an argument error when compiling if you leave out the closing parenthesis. If you get this error, just add the closing parenthesis. (Press PRGM when the error is displayed to go to the exact point in the code where you need to add the parenthesis) 1991
Axe / Re: Routines« on: October 01, 2010, 09:53:36 am »
Yes, and it doesn't appear to work correctly when trying to store it into a string. Perhaps this is something Quigibo should look into fixing?
1992
TI Z80 / Re: My First Quantum Translocator« on: October 01, 2010, 09:48:14 am »
Shaved 216 bytes off the executable Not bad, considering saving 216 bytes in a 1519-byte executable is 15% gone with just code optimizations.
1993
Axe / Re: Routines« on: October 01, 2010, 08:57:59 am »
I just helped someone out with a specific case of writing a value to an OS list, so I figured I'd post this generic routine for others to use while I'm at it.
A note about list names: for L1 through L6, you can just define the name with something like: Code: [Select] "L₁"→Str1 But for custom lists, you must do the following:Code: [Select] [015D]→Str1 And now the actual routine: Code: [Select] .Write a series of 2-byte values to an OS list (Pointer to name, number of elements, pointer to list of 2-byte values)
1994
Axe / Re: Custom lists« on: October 01, 2010, 08:37:56 am »
Enjoy
Code: [Select] Lbl RET
1995
Axe / Re: Finding / listing programs« on: September 27, 2010, 10:03:00 pm »i'm guessing there's an address in ram that begins where all the programs are stored, and then the first few bytes of the program indicate the size of said program, whether it's archived etc. then program name/data. so to get all the names, you would have a loop reading off the program name, copy it to a safe ram area, then skip ahead [size of program] bytes to the next program. I believe their programs may read from the VAT (Variable Allocation Table), which contains information about every data structure on the calculator, whether it's a variable, list, program, app, etc. |
|||
|