-- Path of Building -- -- Module: Common -- Libraries, functions and classes used by various modules. -- local pairs = pairs local ipairs = ipairs local type = type local t_insert = table.insert local t_remove = table.remove local m_abs = math.abs local m_floor = math.floor local m_min = math.min local m_max = math.max local s_format = string.format local s_char = string.char local b_rshift = bit.rshift local b_and = bit.band local b_xor = bit.bxor common = { } -- External libraries common.curl = require("lcurl.safe") common.xml = require("xml") common.base64 = require("base64") common.sha1 = require("sha1") -- Uncomment if you need to perform in-depth profiling --profiler = LoadModule("Modules/Profiler") -- Class library common.classes = { } local function addSuperParents(class, parent) for _, superParent in pairs(parent._parents) do class._superParents[superParent] = true if superParent._parents then addSuperParents(class, superParent) end end end local function getClass(className) local class = common.classes[className] if not class then LoadModule("Classes/"..className) class = common.classes[className] assert(class, "Class '"..className.."' not defined in class file") end return class end -- newClass(""[, ""[, "" ...]], constructorFunc) function newClass(className, ...) local class = { } common.classes[className] = class class.__index = class class.__call = function(obj, mix) for k, v in pairs(mix) do obj[k] = v end return obj end class._className = className local numVarArg = select("#", ...) class._constructor = select(numVarArg, ...) if numVarArg > 1 then -- Build list of parent classes class._parents = { } for i = 1, numVarArg - 1 do class._parents[i] = getClass(select(i, ...)) end -- Build list of all classes directly or indirectly inherited by this class class._superParents = { } addSuperParents(class, class) -- Set up inheritance setmetatable(class, { __index = function(self, key) for _, parent in ipairs(class._parents) do local val = parent[key] if val ~= nil then self[key] = val return val end end end }) end return class end function new(className, ...) local class = getClass(className) local object = setmetatable({ }, class) object.Object = object if class._parents then -- Add parent and superparent class proxies object._parentInit = { } for parent in pairs(class._superParents) do local proxyMeta = { __index = function(self, key) local v = rawget(object, key) if v ~= nil then return v else return parent[key] end end, __newindex = object, __call = function(...) if not parent._constructor then error("Parent class '"..parent._className.."' of class '"..class._className.."' has no constructor") end if object._parentInit[parent] then error("Parent class '"..parent._className.."' of class '"..class._className.."' has already been initialised") end parent._constructor(...) object._parentInit[parent] = true end, } object[parent._className] = setmetatable(proxyMeta, proxyMeta) end end if class._constructor then class._constructor(object, ...) end if class._parents then -- Check that the constructors for all parent and superparent classes have been called for parent in pairs(class._superParents) do if parent._constructor and not object._parentInit[parent] then error("Parent class '"..parent._className.."' of class '"..className.."' must be initialised") end end end return object end function codePointToUTF8(codePoint) if codePoint >= 0xD800 and codePoint <= 0xDFFF then return "?" elseif codePoint <= 0x7F then return s_char(codePoint) elseif codePoint <= 0x07FF then return s_char(0xC0 + b_rshift(codePoint, 6), 0x80 + b_and(codePoint, 0x3F)) elseif codePoint <= 0xFFFF then return s_char(0xE0 + b_rshift(codePoint, 12), 0x80 + b_and(b_rshift(codePoint, 6), 0x3F), 0x80 + b_and(codePoint, 0x3F)) elseif codePoint <= 0x10FFFF then return s_char(0xF0 + b_rshift(codePoint, 18), 0x80 + b_and(b_rshift(codePoint, 12), 0x3F), 0x80 + b_and(b_rshift(codePoint, 6), 0x3F), 0x80 + b_and(codePoint, 0x3F)) else return "?" end end function convertUTF16to8(text, offset) offset = offset or 1 local out = { } local highSurr for i = offset, #text - 1, 2 do local codeUnit = text:byte(i) + text:byte(i+1) * 256 if codeUnit == 0 then break elseif codeUnit >= 0xD800 and codeUnit <= 0xDBFF then highSurr = codeUnit - 0xD800 elseif codeUnit >= 0xDC00 and codeUnit <= 0xDFFF then if highSurr then t_insert(out, codePointToUTF8(highSurr * 1024 + codeUnit - 0xDC00 + 0x010000)) highSurr = nil end else t_insert(out, codePointToUTF8(codeUnit)) end end return table.concat(out) end function codePointToUTF16(codePoint) if codePoint >= 0xD800 and codePoint <= 0xDFFF then return "?\z" elseif codePoint <= 0xFFFF then return s_char(b_and(codePoint, 0xFF), b_rshift(codePoint, 8)) elseif codePoint <= 0x10FFFF then local highSurr = 0xD800 + b_rshift(codePoint - 0x10000, 10) local lowSurr = 0xDC00 + b_and(codePoint - 0x10000, 0x2FF) return s_char(b_and(highSurr, 0xFF), b_rshift(highSurr, 8), b_and(lowSurr, 0xFF), b_rshift(lowSurr, 8)) else return "?\z" end end function convertUTF8to16(text, offset) offset = offset or 1 local out = { } local codePoint = 0 local codeUnitRemaining for i = offset, #text do local codeUnit = text:byte(i) if codeUnit == 0 then break elseif codeUnit <= 0x7F then table.insert(out, s_char(codeUnit, 0)) elseif codeUnit >= 0xC2 and codeUnit <= 0xDF then codeUnitRemaining = 1 codePoint = b_and(codeUnit, 0x1F) elseif codeUnit >= 0xE0 and codeUnit <= 0xEF then codeUnitRemaining = 2 codePoint = b_and(codeUnit, 0x0F) elseif codeUnit >= 0xF0 and codeUnit <= 0xF4 then codeUnitRemaining = 3 codePoint = b_and(codeUnit, 0x03) elseif codeUnit >= 0x80 and codeUnit <= 0xBF then if codeUnitRemaining then codePoint = bit.lshift(codePoint, 6) + b_and(codeUnit, 0x3F) codeUnitRemaining = codeUnitRemaining - 1 if codeUnitRemaining == 0 then t_insert(out, codePointToUTF16(codePoint)) codeUnitRemaining = nil end else t_insert(out, "?\z") end else t_insert(out, "?\z") end end return table.concat(out) end do local function toUnsigned(val) return val < 0 and val + 0x100000000 or val end local function murmurMix(val) val = toUnsigned(val) return bit.tobit(val * 0xE995 + b_and(val * 0x5BD1, 0xFFFF) * 0x10000) end function murmurHash2(key, seed) local len = #key local h = b_xor(seed or 0, len) local o = 1 while len >= 4 do local k = bytesToInt(key, o) k = murmurMix(k) k = b_xor(k, b_rshift(k, 24)) k = murmurMix(k) h = murmurMix(h) h = b_xor(h, k) o = o + 4 len = len - 4 end if len > 0 then h = b_xor(h, bytesToInt(key, o)) h = murmurMix(h) end h = b_xor(h, b_rshift(h, 13)) h = murmurMix(h) h = b_xor(h, b_rshift(h, 15)) return toUnsigned(h) end end local function bits(int, s, e) return b_and(b_rshift(int, s), 2 ^ (e - s + 1) - 1) end function bytesToInt(b, o) return bit.tobit(bytesToUInt(b, o)) end function bytesToUInt(b, o) o = o or 1 return (b:byte(o + 0) or 0) + (b:byte(o + 1) or 0) * 256 + (b:byte(o + 2) or 0) * 65536 + (b:byte(o + 3) or 0) * 16777216 end function bytesToULong(b, o) o = o or 1 return bytesToUInt(b, o) + bytesToUInt(b, o + 4) * 4294967296 end function bytesToFloat(b, o) local int = bytesToInt(b, o) local s = (-1) ^ bits(int, 31, 31) local e = bits(int, 23, 30) - 127 if e == -127 then return 0 * s end local m = 1 for i = 0, 22 do m = m + bits(int, i, i) * 2 ^ (i - 23) end return s * m * 2 ^ e end -- Quick hack to convert JSON to valid lua function jsonToLua(json) return json:gsub("%[","{"):gsub("%]","}"):gsub('"(%d[%d%.]*)":','[%1]='):gsub('"([^"]+)":','["%1"]='):gsub("\\/","/"):gsub("{(%w+)}","{[0]=%1}") :gsub("\\u(%x%x%x%x)",function(hex) return codePointToUTF8(tonumber(hex,16)) end) end -- Check if mouse is currently inside area defined by region.x, region.y, region.width, region.height function isMouseInRegion(region) local cursorX, cursorY = GetCursorPos() return cursorX >= region.x and cursorX < region.x + region.width and cursorY >= region.y and cursorY < region.y + region.height end -- Write a Lua table to file local function qFmt(s) return '"'..s:gsub("\n","\\n"):gsub("\"","\\\"")..'"' end function writeLuaTable(out, t, indent) out:write('{') if indent then out:write('\n') end local keyList = { } for k, v in pairs(t) do t_insert(keyList, k) end table.sort(keyList, function(a,b) if type(a) == type(b) then return a < b else return type(a) < type(b) end end) for i, k in ipairs(keyList) do local v = t[k] if indent then out:write(string.rep("\t", indent)) end if type(k) == "string" and k:match("^%a[%a%d]*$") and k ~= "hexproof" then out:write(k, '=') else out:write('[') if type(k) == "number" then out:write(k) else out:write(qFmt(k)) end out:write(']=') end if type(v) == "table" then writeLuaTable(out, v, indent and indent + 1) elseif type(v) == "string" then out:write(qFmt(v)) else out:write(tostring(v)) end if i < #keyList then out:write(',') end if indent then out:write('\n') end end if indent then out:write(string.rep("\t", indent-1)) end out:write('}') end -- Make a copy of a table and all subtables function copyTable(tbl, noRecurse) local out = {} for k, v in pairs(tbl) do if not noRecurse and type(v) == "table" then out[k] = copyTable(v) else out[k] = v end end return out end do local subTableMap = { } function copyTableSafe(tbl, noRecurse, preserveMeta, isSubTable) local out = {} if not noRecurse then subTableMap[tbl] = out end if preserveMeta then setmetatable(out, getmetatable(tbl)) end for k, v in pairs(tbl) do if not noRecurse and type(v) == "table" then out[k] = subTableMap[v] or copyTableSafe(v, false, preserveMeta, true) else out[k] = v end end if not noRecurse and not isSubTable then wipeTable(subTableMap) end return out end end function mergeDB(srcDB, modDB) if modDB then srcDB:AddDB(modDB) for k,v in pairs(modDB.conditions) do srcDB.conditions[k] = v end for k,v in pairs(modDB.multipliers) do srcDB.multipliers[k] = v end end end function specCopy(env) local modDB = new("ModDB") modDB:AddDB(env.modDB) modDB.conditions = copyTable(env.modDB.conditions) modDB.multipliers = copyTable(env.modDB.multipliers) local enemyDB = new("ModDB") if env.enemyDB then enemyDB:AddDB(env.enemyDB) enemyDB.conditions = copyTable(env.enemyDB.conditions) enemyDB.multipliers = copyTable(env.enemyDB.multipliers) end local minionDB = nil if env.minion then minionDB = new("ModDB") minionDB:AddDB(env.minion.modDB) minionDB.conditions = copyTable(env.minion.modDB.conditions) minionDB.multipliers = copyTable(env.minion.modDB.multipliers) end return modDB, enemyDB, minionDB end -- Wipe all keys from the table and return it, or return a new table if no table provided function wipeTable(tbl) if not tbl then return { } end for k in pairs(tbl) do tbl[k] = nil end return tbl end -- Search a table for a value, and return the corresponding key function isValueInTable(tbl, val) for k, v in pairs(tbl) do if val == v then return k end end end -- Search an array for a value, and return the corresponding array index function isValueInArray(tbl, val) for i, v in ipairs(tbl) do if val == v then return i end end end -- Pretty-prints a table function prettyPrintTable(tbl, pre) pre = pre or "" local outNames = { } for name in pairs(tbl) do t_insert(outNames, name) end table.sort(outNames) for _, name in ipairs(outNames) do if type(tbl[name]) == "table" then prettyPrintTable(tbl[name], pre .. name .. ".") else ConPrintf("%s%s = %s", pre, name, tostring(tbl[name])) end end end function tableConcat(t1,t2) local t3 = {} for i=1,#t1 do t3[#t3+1] = t1[i] end for i=1,#t2 do t3[#t3+1] = t2[i] end return t3 end -- Natural sort comparator function naturalSortCompare(a, b) local aIndex, bIndex = 1, 1 while true do local aStr, aNum, aEnd = a:match("(.-)(%d+)()", aIndex) local bStr, bNum, bEnd = b:match("(.-)(%d+)()", bIndex) if not aStr or not bStr then aStr = a:sub(aIndex) bStr = b:sub(bIndex) end local al = aStr:upper() local bl = bStr:upper() if al ~= bl then return al < bl end if aStr ~= bStr then return aStr < bStr end if not aNum then return a < b end local an = tonumber(aNum) local bn = tonumber(bNum) if an ~= bn then return an < bn end if aNum ~= bNum then return aNum < bNum end aIndex = aEnd bIndex = bEnd end end -- Rounds a number to the nearest decimal places function round(val, dec) if dec then return m_floor(val * 10 ^ dec + 0.5) / 10 ^ dec else return m_floor(val + 0.5) end end ---@param n number ---@return number function triangular(n) --- Returns the n-th triangular number --- See https://en.wikipedia.org/wiki/Triangular_number return n * (n + 1) / 2 end -- Formats "1234.56" -> "1,234.5" function formatNumSep(str) return string.gsub(str, "(-?%d+%.?%d+)", function(m) local x, y, minus, integer, fraction = m:find("(-?)(%d+)(%.?%d*)") if main.showThousandsSeparators then integer = integer:reverse():gsub("(%d%d%d)", "%1"..main.thousandsSeparator):reverse() -- There will be leading separators if the number of digits are divisible by 3 -- This checks for their presence and removes them -- Don't use patterns here because thousandsSeparator can be a pattern control character, and will crash if used if main.thousandsSeparator ~= "" then local thousandsSeparator = string.find(integer, main.thousandsSeparator, 1, 2) if thousandsSeparator and thousandsSeparator == 1 then integer = integer:sub(2) end end else integer = integer:reverse():gsub("(%d%d%d)", "%1"):reverse() end return minus..integer..fraction:gsub("%.", main.decimalSeparator) end) end function getFormatNumSep(dec) return function(val) return formatNumSep(val, dec) end end -- Formats 1234.56 -> "1234.6" [dec=1] function formatRound(val, dec) dec = dec or 0 return m_floor(val * 10 ^ dec + 0.5) / 10 ^ dec end function getFormatRound(dec) return function(val) return formatRound(val, dec) end end -- Formats 12.3456 -> "1234.6%" [dec=1] function formatPercent(val, dec) dec = dec or 0 return m_floor((val or 0) * 100 * 10 ^ dec + 0.5) / 10 ^ dec .. "%" end function getFormatPercent(dec) return function(val) return formatPercent(val, dec) end end -- Formats 1234.56 -> "1234.5s" [dec=1] function formatSec(val, dec) dec = dec or 0 if val == 0 then return "0s" else return s_format("%."..dec.."fs", val) end end function getFormatSec(dec) return function(val) return formatSec(val, dec) end end function copyFile(srcName, dstName) local inFile, msg = io.open(srcName, "r") if not inFile then return nil, "Couldn't open '"..srcName.."': "..msg end local outFile, msg = io.open(dstName, "w") if not outFile then return nil, "Couldn't create '"..dstName.."': "..msg end outFile:write(inFile:read("*a")) inFile:close() outFile:close() return true end function zip(a, b) local zipped = { } for i, _ in pairs(a) do table.insert(zipped, { a[i], b[i] }) end return zipped end -- Generate a UUID for a skill function cacheSkillUUID(skill) local strName = skill.activeEffect.grantedEffect.name:gsub("%s+", "") -- strip spaces local strSlotName = (skill.slotName or "NO_SLOT"):gsub("%s+", "") -- strip spaces local indx = 1 if skill.socketGroup and skill.socketGroup.gemList and skill.activeEffect.gemData then for idx, gem in ipairs(skill.socketGroup.gemList) do -- we compare table addresses rather than names since two of the same gem -- can be socketed in the same slot if gem.gemData == skill.activeEffect.gemData then indx = idx break end end end return strName.."_"..strSlotName.."_"..tostring(indx) end -- Global Cache related function cacheData(uuid, env) if GlobalCache.dontUseCache then return end local mode = env.mode if not GlobalCache.cachedData[mode][uuid] or mode == "MAIN" or mode == "CALCS" then -- If we previously had global data, we are about to over-ride it, set tables to `nil` for Lua Garbage Collection if GlobalCache.cachedData[mode][uuid] then GlobalCache.cachedData[mode][uuid].ActiveSkill = nil GlobalCache.cachedData[mode][uuid].Env = nil end GlobalCache.cachedData[mode][uuid] = { Name = env.player.mainSkill.activeEffect.grantedEffect.name, Speed = env.player.output.Speed, ManaCost = env.player.output.ManaCost, HitChance = env.player.output.HitChance, PreEffectiveCritChance = env.player.output.PreEffectiveCritChance, CritChance = env.player.output.CritChance, TotalDPS = env.player.output.TotalDPS, ActiveSkill = env.player.mainSkill, Env = env, } end end -- Obtian a stored cached processed skill identified by -- its UUID and pulled from an appropriate env mode (e.g., MAIN) function getCachedData(skill, mode) local uuid = cacheSkillUUID(skill) return GlobalCache.cachedData[mode][uuid] end -- Add an entry for a fabricated skill (e.g., Mirage Archers) -- to be deleted if it's not longer needed function addDeleteGroupEntry(name) if not GlobalCache.deleteGroup[name] then GlobalCache.deleteGroup[name] = true end end -- Remove an entry from the "to be deleted" list -- because it is still needed function removeDeleteGroupEntry(name) if GlobalCache.deleteGroup[name] then GlobalCache.deleteGroup[name] = nil end end -- Delete a skill-group entry from the skill list if it has -- been marked for deletion and nothing over-wrote that function deleteFabricatedGroup(skillsTab) for index, socketGroup in ipairs(skillsTab.controls.groupList.list) do if GlobalCache.deleteGroup[socketGroup.label] then t_remove(skillsTab.controls.groupList.list, index) if skillsTab.displayGroup == socketGroup then skillsTab:SetDisplayGroup() end skillsTab:AddUndoState() skillsTab.build.buildFlag = true skillsTab.controls.groupList.selValue = nil wipeTable(GlobalCache.deleteGroup) break end end end -- Wipe all the tables associated with Global Cache function wipeGlobalCache() --ConPrintf("WIPING GlobalCache.cacheData") wipeTable(GlobalCache.cachedData.MAIN) wipeTable(GlobalCache.cachedData.CALCS) wipeTable(GlobalCache.cachedData.CALCULATOR) wipeTable(GlobalCache.cachedData.CACHE) wipeTable(GlobalCache.excludeFullDpsList) wipeTable(GlobalCache.deleteGroup) GlobalCache.dontUseCache = nil end -- Full DPS related: add to roll-up exclusion list -- this is for skills that are used by Mirage Warriors for example function addToFullDpsExclusionList(skill) GlobalCache.excludeFullDpsList[cacheSkillUUID(skill)] = true end -- Full DPS related: check if skill is in roll-up exclusion list function isExcludedFromFullDps(skill) return GlobalCache.excludeFullDpsList[cacheSkillUUID(skill)] end -- Check if a specific named gem is enabled in a socket group belonging to a skill function supportEnabled(skillName, activeSkill) for _, gemInstance in ipairs(activeSkill.socketGroup.gemList) do if gemInstance.skillId == skillName then return gemInstance.enabled end end return true end