SaveInteger(hash, GetHandleId(GetTriggerUnit()), GetHandleId(GetSpellTargetUnit()), 'T')
LoadInteger(hash, GetHandleId(GetAttacker()), GetHandleId(GetTriggerUnit()))function Save takes agent a, agent b, integer value returns nothing
SaveInteger(hash, GetHandleId(a), GetHandleId(b), value)
endfunction
function Load takes agent a, agent b, returns integer
return LoadInteger(hash, GetHandleId(a), GetHandleId(b))
endfunction
//
//
call Save(GetTriggerUnit(), GetSpellTargetUnit(), 'T')
set i = Load(GetAttacker(), GetTriggerUnit())
//! Note: Comment serves no purpose.
function OnEvent takes nothing returns nothing
local Table t=Table.create()
call Save(GetTriggerUnit(),GetFilterUnit())
set t[Load()]=234
endfunctionn * 3 + 0
n * 3 + 1
n * 3 + 2
What?
TOTAL_NUM_OF_COLUMNS * PLAYER + CELL12 * 3 + 4 = 40// If we display it as [x][y]
Array[3][2] = Array[5 * 3 + 2] = Array[17]
/*
Double Array by kingking
Usage :
//! runtextmacro DoubleArray ("<public/private/none>","<Name>","<Type of variables>","<Default value/null value>")
set <Name>[parent][child] = data
<Name>[parent][child] = data
RemoveSavedData :
<Name>[parent].remove(child)
(Always do this, if you are attaching random index to it. It is used to maintain the speed.)
HaveSavedData :
<Name>[parent].have(child)
FlushChildTable :
<Name>[parent].clear()
Pros :
Delimited array index.
Cons :
O(n) search, low speed.
Can only handle 8190 data, for maximum.
(Decreases when more parent array index is used.)
Concept :
This library is based on linked list.
2D doubly linked list is used. =D
this.prev.prev.up this.prev.up this.up this.next.up this.next.next.up
$ $ $ $ $
this.prev.prev # this.prev # this # this.next # this.next.next
$ $ $ $ $
this.prev.prev.down this.prev.down this.down this.next.down this.next.next.down
# -> Horizontal list
$ -> Vertical list
*/
library DoubleArray
//! textmacro DoubleArray takes SCOPE, NAME, TYPE, DEFAULT
$SCOPE$ struct $NAME$ extends array
private static integer array arrayStack
private static integer arrayStackLevel = 0
private static integer arrayRead = 0
private static method getIndex takes nothing returns thistype
if arrayStackLevel == 0 then
set arrayRead = arrayRead + 1
set arrayStack[0] = arrayRead
else
set arrayStack[0] = arrayStack[arrayStackLevel]
set arrayStackLevel = arrayStackLevel - 1
endif
debug if arrayStack[0] > 8191 then
debug call BJDebugMsg("DoubleArray error! No more data can be stored. Please use .remove(index) to clean up some spaces.")
debug endif
return arrayStack[0]
endmethod
private integer index
private thistype prev
private thistype next
private thistype down
private thistype up
//2D linked list, vertical and horizontal.
static method operator [] takes integer index returns thistype
local thistype this = thistype(0).next
loop
exitwhen this == 0
if .index == index then
return this
endif
set this = this.next
//Search in horizontal list.
endloop
//Not found?
set this = thistype.getIndex()
//Create a new node for index
set this.index = index
set thistype(0).prev.next = this
set this.next = thistype(0)
set this.prev = thistype(0).prev
set thistype(0).prev = this
//Link node to horizontal list.
set this.down = this
set this.up = this
//Head as vertical list.
return this
endmethod
private $TYPE$ data
private method releaseIndex takes nothing returns nothing
set arrayStackLevel = arrayStackLevel + 1
set arrayStack[arrayStackLevel] = this
set this.index = 0x28829022
set this.down.up = this.up
set this.up.down = this.down
//Unlink from vertical list.
set this.data = $DEFAULT$
endmethod
method operator [] takes integer index returns $TYPE$
local thistype new
local thistype ori = this
set this = this.down
loop
exitwhen this == ori
if this.index == index then
return this.data
endif
set this = this.down
//Search in vertical list.
endloop
//Not found?
return $DEFAULT$
endmethod
method operator []= takes integer index, $TYPE$ data returns nothing
local thistype new
local thistype ori = this
set this = this.down
loop
exitwhen this == ori
if this.index == index then
set this.data = data
return
endif
set this = this.down
//Search in vertical list.
endloop
//Not found?
set this = thistype.getIndex()
set this.index = index
set ori.up.down = this
set this.down = ori
set this.up = ori.up
set ori.up = this
set this.data = data
endmethod
method remove takes integer index returns nothing
local thistype ori = this
set this = this.down
loop
exitwhen this == ori or this.index == index
set this = this.down
//Search in vertical list.
endloop
if this.index == index then
call this.releaseIndex()
//Remove node from vertical list.
endif
endmethod
method have takes integer index returns boolean
local thistype ori = this
set this = this.down
loop
exitwhen this == ori or this.index == index
set this = this.down
//Search in vertical list.
endloop
return this.index == index
endmethod
method clear takes nothing returns nothing
local thistype ori = this
set this = this.down
loop
exitwhen this == ori
call this.releaseIndex()
//Iterate through whole list and remove all nodes in list.
endloop
endmethod
private static method onInit takes nothing returns nothing
set thistype(0).index = 0x28829022
endmethod
endstruct
//! endtextmacro
endlibrarylibrary Table
//***************************************************************
//* Table ???
//* ------------
//*
//* set t=Table.create() - instanceates a new table object
//* call t.destroy() - destroys it
//* t[1234567] - Get value for key 1234567
//* (zero if not assigned previously)
//* set t[12341]=32 - Assigning it.
//* call t.flush(12341) - Flushes the stored value, so it
//* doesn't use any more memory
//* t.exists(32) - Was key 32 assigned? Notice
//* that flush() unassigns values.
//* call t.reset() - Flushes the whole contents of the
//* Table.
//*
//* call t.destroy() - Does reset() and also recycles the id.
//*
//* If you use HandleTable instead of Table, it is the same
//* but it uses handles as keys, the same with StringTable.
//*
//* You can use Table on structs' onInit if the struct is
//* placed in a library that requires Table or outside a library.
//*
//* You can also do 2D array syntax if you want to touch
//* mission keys directly, however, since this is shared space
//* you may want to prefix your mission keys accordingly:
//*
//* set Table["thisstring"][ 7 ] = 2
//* set Table["thisstring"][ 5 ] = Table["thisstring"][7]
//*
//***************************************************************
//! runtextmacro DoubleArray ("private","Hashtable","integer","0")
private struct GTable
method reset takes nothing returns nothing
call Hashtable[this].clear()
endmethod
private method onDestroy takes nothing returns nothing
call this.reset()
endmethod
endstruct
//! textmacro Table__make takes name, type, key
struct $name$ extends GTable
method operator [] takes $type$ key returns integer
return Hashtable[this][$key$]
endmethod
method operator []= takes $type$ key, integer value returns nothing
set Hashtable[this][$key$] = value
endmethod
method flush takes $type$ key returns nothing
call Hashtable[this].remove($key$)
endmethod
method exists takes $type$ key returns boolean
return Hashtable[this].have($key$)
endmethod
static method flush2D takes string firstkey returns nothing
call $name$(- StringHash(firstkey)).reset()
endmethod
static method operator [] takes string firstkey returns $name$
return $name$(- StringHash(firstkey) )
endmethod
endstruct
//! endtextmacro
//! runtextmacro Table__make("Table","integer","key" )
//! runtextmacro Table__make("StringTable","string", "StringHash(key)" )
//! runtextmacro Table__make("HandleTable","handle","GetHandleId(key)" )
endlibrary
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
The Helper:
