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.
Messages - Quigibo
Pages: 1 ... 83 84 [85] 86 87 ... 135
1261
« on: June 18, 2010, 08:29:21 pm »
Not only can you use constants AND variables, you can us ANY expression including other subroutines and asm code. If you want, you can call something with sub(L,X+2,Str-X*2^5-A,sign{'A'+sub(B)-{L1}}). Go crazy.
And yes, you can have up to 6 arguments and as few as 0. Only the temporary variables than need to be passed actually get updated. You can have subroutines that take a variable number of arguments too. Like if you make the first parameter be "number of arguments" then you can have the same subroutine function multiple ways with different numbers of arguments.
1262
« on: June 18, 2010, 05:30:50 pm »
Neither of those are raycasters I think. They are just doing wireframe rendering. Only the 3d maze one was. I think calc84maniac made one, I've only seen screenshots so I don't know if he ever released it.
1263
« on: June 18, 2010, 05:22:04 pm »
I make about $300 dollars a year from ads on my YouTube channel, and I bet Omnimaga gets hits in a similar range. At least the way Google Ads work is they pay a certain amount per impression (page view) which is usually small fractions of cents. But then on top of that, there is another revenue they give per click which is a lot higher.
1264
« on: June 18, 2010, 05:12:14 pm »
I doubt you can shrink it that way because I think then the OS is unaware of the change and it will say you have less RAM available on your calculator than you really do and it will not correct itself until the next ram clear.
I hope to have the Parser itself optimize as much as possible. The reason you don't really see C or Java optimizers is that its really really hard to optimize code at the higher levels, even for a medium level like Axe.
1265
« on: June 18, 2010, 05:05:31 pm »
Darl, It won't let me run that on the emulator. It appears the group is corrupted and gives a "version" error. The program seems to no show up on the list either. Is this an Axe-Asm hybrid by the way? Galandros, if you know of any good open-source raycasters for z80, I can start working on those commands. Even closed source I can attempt to disassemble.
1266
« on: June 18, 2010, 05:00:42 pm »
Mine went from 700-ish to 100-ish. Thanks again for spending the time to fix it
1267
« on: June 18, 2010, 04:54:31 pm »
That would only be from unoptimized code by the programmer. Like this:
A+1->A Disp A>Dec
In the above example you first increment the value of A and then save it. Immediately after, the next instruction is to load A again to display it. Since you have just saved it and now are immediately loading it, that is obviously an inefficiency. You can optimize it like this:
Disp A+1->A>Dec
So that way, it doesn't need to load the value of A a second time. I might be able to have this be done automatically, I don't know how hard that would be though becasue that type of optimization is not dependent on the source, rather, it would need to make checks on the assembly code written. I haven't tried that yet, but it might be possible in the future.
1268
« on: June 18, 2010, 03:10:15 pm »
Actually, even though the bottom is cleaner and easier to read, the top is still more optimized I think. That's because he doesn't need to store to temporary variables to call the subroutine, the original subroutine was specifically made to only draw points from the X,Y variables which is fine for his use.
EDIT: And yes, r1-r6 work just like normal variables. Anywhere you can use a letter A-Theta you can also use r1-r6, including for loops and storing to them.
1269
« on: June 18, 2010, 03:21:17 am »
Wow, that's almost as much as it says Google is worth: "google.com" is worth $19,963 USD We should sell omnimaga and with a little extra change, buy google!
1270
« on: June 18, 2010, 12:21:49 am »
Personally, I am really against the censoring of syntax of older posts. I just don't like the idea becasue it seems like its losing a piece of Axe history. And I still hold the position that its not actually confusing since this is going to be gradual. But its not that big of a deal to me so I don't really care that much. You can still change them if you think its best.
1271
« on: June 17, 2010, 08:37:40 pm »
You do need it for getkey(_) itself, but you don't need to do this: (getkey(_)) is what I was referring to.
1272
« on: June 17, 2010, 08:34:41 pm »
The way proofs by induction work, is that you have to "pretend" that a function works and then if this assumption leads to a truth then you can conclude that you were right in assuming the original function. The dominoes example would be more like this:
1. The first domino has fallen over. 2. Suppose that Nth has fallen over 3. You can show that if that is the case, then the N+1th domino will fall over 4. Since if this is true for the Nth domino, then it is true for the N+1th domino, and it is true for the first domino, they you can say that all dominoes past the first position will fall over.
1273
« on: June 17, 2010, 08:14:04 pm »
You don't actually need parenthesis there since direct keys are binary functions that return 0 or 1 always. And it definately shouldn't throw an error.
1274
« on: June 17, 2010, 08:11:15 pm »
DJ, you cannot have an automatic bad-word-replace becasue then it makes it extremely confusing when talking about conversions. If somebody asks: "What is the corresponding token to "sign{"? And then you reply to their question only to have your response say "sign{" again, that could defiantly lead to more annoyances in my opinion then simply keeping the old spellings. Its impossible to tell if someone is using the token as part of Axe source code or maybe giving the token name as a suggestion, asking about the original tokens, or even giving some TI-BAISC code and asking how to convert it to Axe.
1275
« on: June 17, 2010, 08:03:01 pm »
There are places where you do +9 and +90 to initialize variables. Those are not optimizations! Its only an optimization if the number is between negative 2 and positive 2.
Also there are places of code that look like this: A+1→A:Text(82,0,A|>Dec)
They can be optimized like this: Text(82,0,A+1→A|>Dec)
Pages: 1 ... 83 84 [85] 86 87 ... 135
|