Module:TableTools - Revision history

Skritzer: 1 revision imported

2024-01-19T00:36:59Z

1 revision imported

w>MSGJ: updates/fixes requested by User:Uzume

2022-01-31T13:08:18Z

updates/fixes requested by User:Uzume

Skritzer: 1 revision imported

2021-12-04T01:05:12Z

1 revision imported

wikipedia>MSGJ: improved module formatting; improved isArray; added isArrayLike; fixed _deepCopy; and improved defaultKeySort, code by User:Alexiscoutinho

2021-10-04T10:40:18Z

improved module formatting; improved isArray; added isArrayLike; fixed _deepCopy; and improved defaultKeySort, code by User:Alexiscoutinho

Show changes

Skritzer: 1 revision imported

2020-11-10T04:57:29Z

1 revision imported

wikipedia>GorillaWarfare: Changed protection level for "Module:TableTools": High-risk Lua module: bumping protection level due to high usage, plus the stability of the module. See https://en.wikipedia.org/w/index.php?title=Wikipedia:Requests_for_page_protection&oldid=983044034#Module:TableTools ([Edit=Require administrator access] (indefinite) [Move=Require administrator access] (indefinite))

2020-10-11T22:22:43Z

Changed protection level for "Module:TableTools": High-risk Lua module: bumping protection level due to high usage, plus the stability of the module. See https://en.wikipedia.org/w/index.php?title=Wikipedia:Requests_for_page_protection&oldid=983044034#Module:TableTools ([Edit=Require administrator access] (indefinite) [Move=Require administrator access] (indefinite))

Skritzer: 1 revision imported

2020-05-29T18:10:04Z

1 revision imported

wikipedia>Dinoguy1000: from sandbox: another slight code simplification and a couple comment fixes

2020-05-23T15:51:01Z

from sandbox: another slight code simplification and a couple comment fixes

Skritzer: 1 revision imported

2019-12-22T17:27:57Z

1 revision imported

Skritzer: 1 revision imported

2019-12-22T16:30:52Z

1 revision imported

@@ Line 38: / Line 38: @@
 ------------------------------------------------------------------------------------
 function p.isNan(v)
-	return type(v) == 'number' and tostring(v) == '-nan'
+	return type(v) == 'number' and v ~= v
 end
@@ Line 64: / Line 64: @@
 -- removed, but otherwise the array order is unchanged.
 ------------------------------------------------------------------------------------
-function p.removeDuplicates(t)
+function p.removeDuplicates(arr)
-	checkType('removeDuplicates', 1, t, 'table')
+	checkType('removeDuplicates', 1, arr, 'table')
 	local isNan = p.isNan
 	local ret, exists = {}, {}
-	for _, v in ipairs(t) do
+	for _, v in ipairs(arr) do
 		if isNan(v) then
 			-- NaNs can't be table keys, and they are also unique, so we don't need to check existence.
@@ Line 337: / Line 337: @@
 --
 -- Transposes the keys and values in an array. For example, {"a", "b", "c"} ->
--- {a = 1, b = 2, c = 3}.
+-- {a = 1, b = 2, c = 3}. Duplicates are not supported (result values refer to
 ------------------------------------------------------------------------------------
 function p.invert(arr)
 	checkType("invert", 1, arr, "table")
+	local isNan = p.isNan
 	local map = {}
 	for i, v in ipairs(arr) do
-		map[v] = i
+		if not isNan(v) then
 	end
@@ Line 355: / Line 358: @@
 -- Creates a set from the array part of the table. Indexing the set by any of the
 -- values of the array returns true. For example, {"a", "b", "c"} ->
--- {a = true, b = true, c = true}.
+-- {a = true, b = true, c = true}. NaN values are ignored as Lua considers them
 ------------------------------------------------------------------------------------
-function p.listToSet(t)
+function p.listToSet(arr)
-	checkType("listToSet", 1, t, "table")
+	checkType("listToSet", 1, arr, "table")
+	local isNan = p.isNan
 	local set = {}
-	for _, item in ipairs(t) do
+	for _, v in ipairs(arr) do
-		set[item] = true
+		if not isNan(v) then
 	end

@@ Line 129: / Line 129: @@
 	local function cleanPattern(s)
 		-- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally.
-		s = s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
+		return s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
 	end
@@ Line 415: / Line 414: @@
 --[[
 -- Finds the length of an array, or of a quasi-array with keys such
--- as "data1", "data2", etc., using an exponental search algorithm.
+-- 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.
@@ Line 425: / Line 424: @@
 function p.length(t, prefix)
-	-- requiring module inline so that [[Module:Exponental search]]
+	-- requiring module inline so that [[Module:Exponential search]]
 	-- which is only needed by this one function
 	-- doesn't get millions of transclusions