Don't break if job isn't found

This commit is contained in:
jimathy
2022-04-25 10:04:56 +01:00
committed by GitHub
parent 2e4fcff333
commit 8af82e6d13

View File

@@ -71,22 +71,26 @@ CreateThread(function()
end end
if Config.useATM or Config.useBanks then if Config.useATM or Config.useBanks then
for k, v in pairs(QBCore.Shared.Jobs) do ---Grabs the list of jobs for k, v in pairs(QBCore.Shared.Jobs) do ---Grabs the list of jobs
for l, b in pairs(QBCore.Shared.Jobs[tostring(k)].grades) do -- Grabs the list of grades if QBCore.Shared.Jobs[tostring(k)] then
if QBCore.Shared.Jobs[tostring(k)].grades[l].isboss == true then -- Checks the grade if is boss for l, b in pairs(QBCore.Shared.Jobs[tostring(k)].grades) do -- Grabs the list of grades
if bossroles[tostring(k)] ~= nil then -- checks if the line exists if QBCore.Shared.Jobs[tostring(k)].grades[l].isboss == true then -- Checks the grade if is boss
if bossroles[tostring(k)] > tonumber(l) then bossroles[tostring(k)] = tonumber(l) end -- the if bossroles[tostring(k)] ~= nil then -- checks if the line exists
else bossroles[tostring(k)] = tonumber(l) if bossroles[tostring(k)] > tonumber(l) then bossroles[tostring(k)] = tonumber(l) end -- the
else bossroles[tostring(k)] = tonumber(l)
end
end end
end end
end end
end end
for k, v in pairs(QBCore.Shared.Gangs) do for k, v in pairs(QBCore.Shared.Gangs) do
for l, b in pairs(QBCore.Shared.Gangs[tostring(k)].grades) do if QBCore.Shared.Gangs[tostring(k)] then
if tostring(k) ~= "none" then for l, b in pairs(QBCore.Shared.Gangs[tostring(k)].grades) do
if QBCore.Shared.Gangs[tostring(k)].grades[l].isboss == true then if tostring(k) ~= "none" then
if gangroles[tostring(k)] ~= nil then if QBCore.Shared.Gangs[tostring(k)].grades[l].isboss == true then
if gangroles[tostring(k)] > tonumber(l) then gangroles[tostring(k)] = tonumber(l) end if gangroles[tostring(k)] ~= nil then
else gangroles[tostring(k)] = tonumber(l) if gangroles[tostring(k)] > tonumber(l) then gangroles[tostring(k)] = tonumber(l) end
else gangroles[tostring(k)] = tonumber(l)
end
end end
end end
end end