Module:TableTools: Difference between revisions

Content deleted Content added
m 1 revision imported
No edit summary
 
(2 intermediate revisions by 2 users not shown)
Line 30:
--]]
function p.isPositiveInteger(v)
returnif type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity then
return t[key] ~= niltrue
else
return false
end
end
 
Line 44 ⟶ 48:
--]]
function p.isNan(v)
returnif type(v) == 'number' and tostring(v) == '-nan' then
return true
else
return false
end
end
 
Line 129 ⟶ 137:
local function cleanPattern(s)
-- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally.
returns = s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
return s
end
 
Line 413 ⟶ 422:
 
--[[
-- FindsThis returns the length of ana arraytable, or ofthe afirst integer quasi-arraykey withn keyscounting suchfrom
-- 1 such that t[n + 1] is nil. It is similar to the operator #, but may return
-- as "data1", "data2", etc., using an exponential search algorithm.
-- It is similar to the operator #, but may return
-- a different value when there are gaps in the array portion of the table.
-- Intended to be used on data loaded with mw.loadData. For other tables, use #.
Line 422 ⟶ 430:
-- frame.args.
--]]
function p.length(t, prefix)
 
local keyi = 1
function p.length(t, prefix)
while t[i] ~= nil do
-- requiring module inline so that [[Module:Exponential search]]
keyi = i + 1
-- which is only needed by this one function
end
-- doesn't get millions of transclusions
return i - 1
local expSearch = require("Module:Exponential search")
checkType('length', 1, t, 'table')
checkType('length', 2, prefix, 'string', true)
return expSearch(function(i)
local key
if prefix then
key = prefix .. tostring(i)
else
key = i
end
return t[key] ~= nil
end) or 0
end
 
function p.inArray(arr, valueToFind)
checkType("inArray", 1, arr, "table")