| |
Slammer
Registered: Feb 2004
Posts: 416 |
Kick Assembler Thread 2
The previous thread took a little long to load, so this is a new fresh one.. |
|
... 592 posts hidden. Click here to view all posts....
|
| |
TWW
Registered: Jul 2009
Posts: 541 |
Awesome.
Seriously, Thanx for such a cool tool!
TWW/Creators |
| |
Mace
Registered: May 2002
Posts: 1799 |
Hmm, 'nested' macros... interesting and simple, yet I never thought of it :-) |
| |
Pantaloon
Registered: Aug 2003
Posts: 124 |
i found a bug:
.const LINK = false
begin:
.if (LINK == false)
{
.import c64 "\datapata\myfile.prg"
}
end:
.print end - begin
the print won't work, it will output the address at begin:
if i remove .if () it works.
-P |
| |
Slammer
Registered: Feb 2004
Posts: 416 |
I will have a look at it.. Right now im on vacation in Austria - will be home on monday. |
| |
Pantaloon
Registered: Aug 2003
Posts: 124 |
Feature request:
a method to generate a random unique list, ie:
.var randomNumbers = randomUniqueList(numberOfElements)
the randomUniqueList would give you back a list of values
between 0 and numberOfElements, no number should me mapped twice in the list.
Generating this kind of list using the built in Hashtable takes forever today.
Edit:
i found out doing this,
.var random_table = Hashtable()
.for (var i = 0; i < 12*40; i++ )
{
.eval random_table.put(i,i)
}
would generate a somewhat unique list because of the nature of the hashtable, but still its not random.
|
| |
Slammer
Registered: Feb 2004
Posts: 416 |
Why dont you use the random function? Quick Pseudocode:
for (;hashtable.getKeys().getsize()< noOfDesiredElements;) {
.var randomNo = random()
.eval hashtable.put(randomNo, randomNo)
}
Nb. Since we dont have a while statement (yet) I use the for statement as a while |
| |
Pantaloon
Registered: Aug 2003
Posts: 124 |
i found a better way,
shuffle() that can be done on lists :)
|
| |
JackAsser
Registered: Jun 2002
Posts: 1995 |
Quote: i found a better way,
shuffle() that can be done on lists :)
@Slammer: Collections.shuffle(List<?> list); *hint* *hint* and while you're at it, Collections.sort(List<?> list); :D Heck, .reverse is useful too!
|
| |
Slammer
Registered: Feb 2004
Posts: 416 |
JackAsser: Shuffle is already implemented. Sort and Reverse are, as you said, pretty easy to implement so they will be in the next release.. (reverse is implemented by just one extra line of code *S*) |
| |
Slammer
Registered: Feb 2004
Posts: 416 |
I posted some examples of pseudo commands on codebase64.
|
| Previous - 1 | ... | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | ... | 61 - Next |
