QueueTable v1.0

[Moderator]

14:49, 19th Jul 2013
PurgeandFire: Approved. Works.

 

[Almia]

~Reserved

 

[mckill2009]

what's so different about this?

function haha takes nothing returns nothing
    local integer i = 0
    loop
        set i = i+1
        call SaveInteger(udg_hash, 1, i, i)
        exitwhen i==4
    endloop
    
    set i = 0
    loop
        set i = i+1
        call BJDebugMsg(I2S(LoadInteger(udg_hash, 1, i)))        
        exitwhen i==4
    endloop
endfunction

also, the Queue function is not readable, set it to normal udg_Queue_Table

 

[Almia]

what's so different about this?

function haha takes nothing returns nothing
    local integer i = 0
    loop
        set i = i+1
        call SaveInteger(udg_hash, 1, i, i)
        exitwhen i==4
    endloop
    
    set i = 0
    loop
        set i = i+1
        call BJDebugMsg(I2S(LoadInteger(udg_hash, 1, i)))        
        exitwhen i==4
    endloop
endfunction

also, the Queue function is not readable, set it to normal udg_Queue_Table

I liked Queue function as its name,nobody will touch it.
And also, this is a QueueTable,you can make 2147483647 queues with it.(and it is much faster than what you shown.)

 

[maddeem]

Do you think you could explain what this does with a more indepth example for idiots like me? I seriously have no idea what this is or how to use it. :3
I'm sure if you were to explain it a bit more it'd benefit more people than just myself

 

[Almia]

Do you think you could explain what this does with a more indepth example for idiots like me? I seriously have no idea what this is or how to use it. :3
I'm sure if you were to explain it a bit more it'd benefit more people than just myself

Sorry for not answering this question properly.
What if you use Google to search "Queue" Data structure?

 

[maddeem]

I googled it. I tried. I failed lol.
Don't try to explain. This is one of those things I have to look at for an hour or two to understand lol

 

[mckill2009]

one usage of this is for keys for hashtable, like Table by Bribe, it uses data structure queue as a parent key, and childID is the handle of a unit/item, etc...thus you may do this:

call SaveStr(hash, queue, 1234, "I am saved")    
call BJDebugMsg(LoadStr(hash, queue, 1234))

In which 1234 is the childID and queue is the parent, so instead of having only 255 hashtable, you may have 1 hashtable with millions of instance...

But, this can be created manually by:

local integer hashtable1 = 1
local integer hashtable2 = 2
call SaveStr(hash, hashtable1, 1234, "I am hashtable 1")    
call BJDebugMsg(LoadStr(hash, hashtable1, 1234))
call SaveStr(hash, hashtable2, 1234, "I am hashtable 2")    
call BJDebugMsg(LoadStr(hash, hashtable2, 1234))

EDIT:

and it is much faster than what you shown.

there's nothing faster than direct to native calls

 

[maddeem]

But how do you get the queue you want?
This pretty much turns hashtables into a normal variable with an unlimited array, correct? How does the queue play into this.
Also a hashtable starts to slow down the more data you store to it. Especially if you plan on giving a single hashtable a million instances lol
Honestly doesn't seem too useful but I can easily be wrong.

 

[mckill2009]

But how do you get the queue you want?

you may track it via global integer, and no, not a million but almost unlimited instance , now who's gonna use even 500 instance?...

How does the queue play into this.

I already explained above...

 

[maddeem]

Oh I get it now. Oh my this is genious. Though you'd have to go out of your way to do this, and honestly it is slower than using pretty much any other method. Actually this seems like a hassle to use tbh. The user would have to remember the queue in which he saved stuff. I don't think I'd ever use this, but it is rather neat.
+Rep

 

[Almia]

@mckill2009
Thanks for explaining it to maddeem and rescuing my shitty brain. I was very busy these days.