Trollvottel
never aging title
- Reaction score
- 262
Removed Handle list, added some debug things.
what do you want to say me with this? i dont get anything.I honestly think that the linked list should only deal with integers and let people use the integers retrieved from the list to access their own arrays or structs or w/e =p.
As for the actual code, it could be optimized a lot. I could give you a linked list that uses 0 structs and extraneous calls : P. It's about as optimized as it can be =).
I made it inside of Timed a long time ago, it was one of the many optimization thingies I put in there : |.
It pretty much does all the stuff yours does, but without the extra calls. It's as light and as bare as can be =P. Also, the code is very ugly because of how light it is ^_^. It's almost pure JASS : P.
Oh yea, and my stuff doesn't have any dummy slots... so it saves indexes... : P. All it has are the slots that are being used =). I might even submit it, it's very good code o-o.
I'll post here first and then we can decide =). The interface for it is a little ugly as it always requires the list =P.
like- List.add(list), lol.
Well, speed gain ~ 0.
Even if its a tiny bit smaller. this is not an attachement system or sth that needs to save every microoperation...Better have a nice looking code with a nice interface than having an ugly looking code with ugly interface.
add is 2.25x faster
next when with dynamic adding (no next) is 1.25x faster
Imma submit my code then...
You keep saying that, and I'll practise ignoring you.Like I keep saying, Linked lists or pretty much useless now o-o. Hashtables rape them : o.
Yup, I sorta noted that in the previous post of mine
Imma submit my code then