Module:TableTools - Revision history

Marie: 1 revision imported

2024-10-31T06:03:31Z

1 revision imported

← Older revision	Revision as of 01:03, 31 October 2024
(No difference)

sahar>Arryog: 1 revision imported

2024-09-18T00:48:47Z

1 revision imported

← Older revision	Revision as of 19:48, 17 September 2024
(No difference)

Rox: 1 revision imported

2024-08-23T18:30:52Z

1 revision imported

← Older revision	Revision as of 13:30, 23 August 2024
(No difference)

Wikipedia>Pppery: Update from sandbox per request

2024-08-18T04:19:07Z

Update from sandbox per request

← Older revision		Revision as of 23:19, 17 August 2024
Line 460:		Line 460:
	-- inArray		-- inArray
	--		--
−	-- Returns true if ~~valueToFind~~ is a member of the array, and false otherwise.	+	-- Returns true if searchElement is a member of the array, and false otherwise.
		+	-- Equivalent to JavaScript array.includes(searchElement) or
		+	-- array.includes(searchElement, fromIndex), except fromIndex is 1 indexed
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
−	function p.inArray(~~arr~~, ~~valueToFind~~)	+	function p.inArray(array, searchElement, fromIndex)
−	checkType("inArray", 1, ~~arr~~, "table")	+	checkType("inArray", 1, array, "table")
−	-- if ~~valueToFind~~ is nil, error?	+	-- if searchElement is nil, error?

		+	fromIndex = tonumber(fromIndex)
⚫	for _, v in ~~ipairs~~(~~arr~~) do
−	if ~~v == valueToFind~~ then	+	if fromIndex then
		+	if (fromIndex < 0) then
⚫	return true
		+	fromIndex = #array + fromIndex + 1
		+	end
		+	if fromIndex < 1 then fromIndex = 1 end
		+	for _, v in ipairs({unpack(array, fromIndex)}) do
		+	if v == searchElement then
		⚫	return true
		+	end
		+	end
		+	else
		⚫	for _, v in pairs(array) do
		+	if v == searchElement then
		+	return true
		+	end
	end		end
	end		end

Marie: 1 revision imported

2024-07-21T01:32:39Z

1 revision imported

← Older revision	Revision as of 20:32, 20 July 2024
(No difference)

wikipedia>Pppery: Update from sandbox per request

2024-04-27T01:49:03Z

Update from sandbox per request

@@ Line 72: / Line 72: @@
 			-- NaNs can't be table keys, and they are also unique, so we don't need to check existence.
 			ret[#ret + 1] = v
-			if not exists[v] then
+			ret[#ret + 1] = v
-				ret[#ret + 1] = v
+			exists[v] = true
 		end
 	end
@@ Line 380: / Line 378: @@
 ------------------------------------------------------------------------------------
 local function _deepCopy(orig, includeMetatable, already_seen)
 	local copy = already_seen[orig]
 	if copy ~= nil then
 		return copy
 	end
-		for orig_key, orig_value in pairs(orig) do
+	for orig_key, orig_value in pairs(orig) do
-			copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)
+		copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)
-		if includeMetatable then
+	if includeMetatable then
-			local mt = getmetatable(orig)
+		local mt = getmetatable(orig)
-			if mt ~= nil then
+		if mt ~= nil then
-				local mt_copy = _deepCopy(mt, includeMetatable, already_seen)
+			setmetatable(copy, _deepCopy(mt, true, already_seen))
 		end
 	end
 	return copy
 end
@@ Line 411: / Line 407: @@
 function p.deepCopy(orig, noMetatable, already_seen)
 	checkType("deepCopy", 3, already_seen, "table", true)
-	return _deepCopy(orig, not noMetatable, already_seen)
+	return _deepCopy(orig, not noMetatable, already_seen or {})
 end
@@ Line 476: / Line 472: @@
 	end
 	return false
 end

imported>Rox: 1 revision imported

2022-04-01T10:54:42Z

1 revision imported

← Older revision	Revision as of 05:54, 1 April 2022
(No difference)

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

2022-01-31T13:08:18Z

updates/fixes requested by User:Uzume

← Older revision		Revision as of 08:08, 31 January 2022
Line 38:		Line 38:
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
	function p.isNan(v)		function p.isNan(v)
−	return type(v) == 'number' and ~~tostring(~~v) == ~~'-nan'~~	+	return type(v) == 'number' and v ~= v
	end		end

Line 64:		Line 64:
	-- removed, but otherwise the array order is unchanged.		-- 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 isNan = p.isNan
	local ret, exists = {}, {}		local ret, exists = {}, {}
−	for _, v in ipairs(t) do	+	for _, v in ipairs(arr) do
	if isNan(v) then		if isNan(v) then
	-- NaNs can't be table keys, and they are also unique, so we don't need to check existence.		-- 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"} ->		-- 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
		+	-- the index of the last duplicate) and NaN values are ignored.
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
	function p.invert(arr)		function p.invert(arr)
	checkType("invert", 1, arr, "table")		checkType("invert", 1, arr, "table")
		+	local isNan = p.isNan
−
	local map = {}		local map = {}
	for i, v in ipairs(arr) do		for i, v in ipairs(arr) do
		+	if not isNan(v) then
−	map[v] = i	+	map[v] = i
		+	end
	end		end

Line 355:		Line 358:
	-- Creates a set from the array part of the table. Indexing the set by any of the		-- 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"} ->		-- 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
		+	-- never equal to any value (including other NaNs or even themselves).
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
−	function p.listToSet(t)	+	function p.listToSet(arr)
−	checkType("listToSet", 1, t, "table")	+	checkType("listToSet", 1, arr, "table")
		+	local isNan = p.isNan
−
	local set = {}		local set = {}
−	for _, ~~item~~ in ipairs(t) do	+	for _, v in ipairs(arr) do
		+	if not isNan(v) then
−	set[~~item~~] = true	+	set[v] = true
		+	end
	end		end

imported>Rox: 1 revision imported

2021-11-18T12:38:40Z

1 revision imported

← Older revision	Revision as of 07:38, 18 November 2021
(No difference)

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