view sort.lua @ 4:6ef021bd17b2 1.2.12.0

Attempt to fix Curse
author Adam tegen <adam.tegen@gmail.com>
date Tue, 20 May 2014 23:38:02 -0500
parents ec731d2fe6ba
children e77e01abce98
line wrap: on
line source
local _, AskMrRobot = ...

function AskMrRobot.spairs(t, order)
    -- collect the keys
    local keys = {}
    for k in pairs(t) do keys[#keys+1] = k end

    -- if order function given, sort by it by passing the table and keys a, b,
    -- otherwise just sort the keys 
    if order then
        table.sort(keys, function(a,b) return order(t, a, b) end)
    else
        table.sort(keys)
    end

    -- return the iterator function
    local i = 0
    return function()
        i = i + 1
        if keys[i] then
            return keys[i], t[keys[i]]
        end
    end
end

function AskMrRobot.sortSlots(t)
    return AskMrRobot.spairs(t, function(x, a, b)
        if a == nil and b == nil then return 0 end
        return AskMrRobot.sortedSlots[a] < AskMrRobot.sortedSlots[b]
    end)
end