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 - Xeda112358
Pages: 1 ... 157 158 [159] 160 161 ... 317
2371
« on: February 02, 2012, 08:23:02 pm »
Nice! And it also seems that there has been a small boost in 68K activity recently 
2372
« on: February 02, 2012, 07:35:44 pm »
Oh my word  Three more things I want to note: 1) I found some optimisations to make it faster 2) That is 6MHz ?!!? Wow! 3) I just made a version that also lets you add more to the ring and it is smaller and faster. I also think I have a bug in one specific part of my code to compute sine and cosine, so hopefully I can have that fixed  3→N
256/N→I
0→A →B →C ;need spaces here!
1→F
9→G
Repeat getKey(15
ClrDraw
A→Z
For(H,1,N
128+cos(Z
10+D+Ans/G→B
128+sin(Z
10+E+Ans/G→C
Circle(C,B,3,1
Circle(C,B,5,1
Z+I→Z
End
DispGraph
A+F→A
G+getKey(53
-getKey(52→G
F+getKey(54
-getKey(48→F
D+getkey(3
-getKey(2→D
E+getkey(1
-getKey(4→E
getKey(10
-getKey(11
If +N
+N→N 256/N→I
End
Stop
2373
« on: February 02, 2012, 06:13:29 pm »
Holy crap, that is really cool! Like, wow
2374
« on: February 01, 2012, 09:49:03 pm »
Here is a small routine for adding a 16-bit number to a 32-bit number (that does not exceed maximum or minimum value):
To add GG'+B (does not exceed FFFFFFFF):
G'+B→G'
G+Ɵ'
If Ɵ' ;this means 32-bits were exceeded D:
-1→G' ;This is negative 1, not minus 1
→G
To subtract without going below zero:
G'-B→G'
G--Ɵ' ;this is minus negative Ɵ'
If Ɵ' ;this means 32-bits were exceeded D:
0→G'
→G
2375
« on: February 01, 2012, 09:36:23 pm »
Since it is a pronoun, I believe the G needs to be capitalised  (sorry, I had to) I really hope Yeong can finish it this year o.o It would be a big deal O:
2376
« on: February 01, 2012, 08:46:29 pm »
I would like to mention that Burr over on TIBD has made a start on this. He has a list of people and teams and he is asking the folks there for the kind of questions we should ask and if we should continue this venture. Here is the topic: http://tibasicdev.wikidot.com/forum/t-438087/ti-basic-legends
2377
« on: February 01, 2012, 10:56:50 am »
Wow, I hope I can someday understand how to create a fast raycasting engine o.o This just amazing !
2378
« on: February 01, 2012, 10:24:04 am »
ROL3, specifically (Reign of Legends). It was a fairly well respected RPG DJ_O made back when he programmed a lot o.o
2379
« on: January 31, 2012, 09:40:49 pm »
1)How do I copy picture to memory address? (I'm pretty sure it can be done with Fill( command but just making sure.)
2)I think I read something about 32 bit number stuff. Are you still planning to implement it?
1) You have a few options. If you have the data in RAM, you can use the Fill( commands. However, since that copies 768 bytes and the OS stores 756 bytes, you might want to do something like this: solve(0,"GPic1","Vt→A
solve(1,A,pi9340,756 ;copies the 756 bytes to the graph screen.
2) Well, I do have some 32-bit stuff in the App, but not fully available in Grammer. However, there is support for multiplication, addition, and subtraction. For example, you can take advantage of Ɵ' in a lot of cases. I know in IRC you wanted to do 32-bit addition and subtraction for things like money in a game: To perform GG'+B where G is the upper 16-bits and G' is the lower 16-bits: G'+B→G'
G+Ɵ'
If Ɵ' ;this means 32-bits were exceeded D:
-1→G' ;This is negative 1, not minus 1
→G
And similarly for subtraction: G'-B→G'
G--Ɵ' ;this is minus negative Ɵ'
If Ɵ' ;this means 32-bits were exceeded D:
0→G'
→G
2380
« on: January 31, 2012, 04:40:42 pm »
Awesome :] I am still around throughout the day and I check in often, but even if I am not here to answer a question, there are some folks that can (like Sorunome or Yeong).
2381
« on: January 31, 2012, 08:56:42 am »
To make Serpinski's triangle, I am not sure if this is proper Axe code, but it is essentially how I do it in other languages where I have such fun screen access (and it does not use another buffer): 0→A
ClrDraw
Repeat getKey(15
If A≤95
A++
Pxl-On(A,0 ;Axe use (X,Y), right?
End
DispGraph
L6+767→C-12→D
For(756)
{C--} xor {D--}→{C}
End
End
That isn't nearly as fast as it could be, but I'm not too good with Axe  EDIT: THe screenie isn't the above Axe program (it is in another language) EDIT2: calc84maniac gave some optimisation tricks (using For(756) and {C--} for example)
2382
« on: January 31, 2012, 08:38:43 am »
Yes, I have now downloaded GCC4TI Thanks!
2383
« on: January 31, 2012, 08:31:55 am »
Windows 7 (64-bit)
2384
« on: January 31, 2012, 08:25:46 am »
I have TI-Emu and TIGCC, but they seemed to cause some conflicts with a few other programs (Wabbit seemed to get buggy, but that may have been fixed). TIGCC has an issue where if I get any warnings or errors, it uses up all of my system resources available (so it makes my computer lag), and I have to press F10 about 5 times and click okay for each pop up error  And if I click outside the IDE, it does this too.
2385
« on: January 30, 2012, 09:12:32 pm »
Yes That is why all the other pointers are updated at the end of .M19 It is when augmenting or deleting any data.
Pages: 1 ... 157 158 [159] 160 161 ... 317
|
Show Posts
