https://linguifex.com/w/index.php?action=history&feed=atom&title=Module%3Atable%2FisArrayModule:table/isArray - Revision history2026-04-22T04:30:57ZRevision history for this page on the wikiMediaWiki 1.43.6https://linguifex.com/w/index.php?title=Module:table/isArray&diff=494870&oldid=prevSware: 1 revision imported2026-04-21T11:22:48Z<p>1 revision imported</p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<tr class="diff-title" lang="en">
<td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 11:22, 21 April 2026</td>
</tr><tr><td colspan="2" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Swarehttps://linguifex.com/w/index.php?title=Module:table/isArray&diff=494869&oldid=prevwikt>Theknightwho at 19:10, 2 May 20252025-05-02T19:10:28Z<p></p>
<p><b>New page</b></p><div>local pairs = pairs<br />
<br />
--[==[<br />
Returns true if all keys in the table are consecutive integers starting from 1.]==]<br />
return function(t)<br />
-- pairs() is unordered, but can be assumed to return every key in `t`, so<br />
-- if every integer key from 1 to n (the number of keys in `t`) is in use,<br />
-- then all the keys in `t` form an integer range from 1 to n, making `t`<br />
-- a contiguous array.<br />
local i = 0<br />
for _ in pairs(t) do<br />
i = i + 1<br />
if t[i] == nil then<br />
return false<br />
end<br />
end<br />
return true<br />
end</div>wikt>Theknightwho