[vJASS] Loop through Array vs. Hashtable Lookup

[Pyrogasm]

I've got to check the spell being cast is in a list of spells (spells can't be removed from the list once added) and if so do yadda yadda. Since this search will run every time any spell is cast I want the check to be as lightweight as possible. Which is the better option? (or neither?)

struct Abils extends array
    integer a
    static integer NUM_SPELLS //set elsewhere

    static method Find takes integer aid returns thistype
        local integer i = 0
        loop
            exitwhen i >= NUM_SPELLS
            if Abils[i].a == aid then
                return Abils[i]
            endif
            set i = i+1
        loop
    endmethod
endstruct

function OnSpell takes nothing returns nothing
    local Abils a = Abils.Find(GetSpellAbilityId())
    if a.a != 0 then
        call Whatever()
    endif
endfunction

or

globals
    constant integer Spell_List
    hashtable ht = InitHashTable()
    //When spell is added to list the appropraite hashtable entry is created
ednglobals

function OnSpell takes nothing returns nothing
    if ht.LoadBoolean(ht, Spell_List, GetSpellAbilityId() then
        call Whatever()
    endif
endfunction

 

[Flux]

Using a hashtables will be better for consistency and hashtables are ~O(1) anyway.

 

[TriggerHappy]

I would use a Hashtable since it's likely to be faster, and creates less code. If it's a public resource at least use Table.

 

[Pyrogasm]

Hashtable it is, then.

If it's a public resource at least use Table.

I fail to see why that's relevant here. Table is literally hashtables and I'm not doing anything complicated with them that Table would make easier.

 

[TriggerHappy]

Table is literally hashtables and I'm not doing anything complicated with them that Table would make easier.

There's a limit of 255 hashtables, so for public resources Table is better.