Module:TableTools/sandbox - Revision history

Ahecht: implement fromIndex in inArray

2024-08-14T20:03:06Z

implement fromIndex in inArray

← Previous revision		Revision as of 20:03, 14 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

Alexiscoutinho: Removed unnecessary varargs check in "merge"

2024-04-26T07:07:17Z

Removed unnecessary varargs check in "merge"

← Previous revision		Revision as of 07:07, 26 April 2024
Line 482:		Line 482:
	function p.merge(...)		function p.merge(...)
	local arrays = {...}		local arrays = {...}
	if #arrays < 2 then
	error("too few arguments to 'merge' (minimum is 2, received " .. #arrays .. ')', 2)
	end

	local ret = {}		local ret = {}
	for i, arr in ipairs(arrays) do		for i, arr in ipairs(arrays) do

Theknightwho: Various optimisations for deepCopy, including a bugfix that stops an infinite loop with recursively-nested tables.

2024-04-24T15:58:32Z

Various optimisations for deepCopy, including a bugfix that stops an infinite loop with recursively-nested tables.

← Previous revision		Revision as of 15:58, 24 April 2024
Line 378:		Line 378:
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
	local function _deepCopy(orig, includeMetatable, already_seen)		local function _deepCopy(orig, includeMetatable, already_seen)
		⚫	if type(orig) ~= "table" then
⚫	-- ~~Stores~~ copies of tables indexed by the original table.
		⚫	return orig
	already_seen = already_seen or {}
		⚫	end


		⚫	-- already_seen stores copies of tables indexed by the original table.
	local copy = already_seen[orig]		local copy = already_seen[orig]
	if copy ~= nil then		if copy ~= nil then
	return copy		return copy
	end		end


		⚫	copy = {}
⚫	if type(orig) == 'table' then
			already_seen[orig] = copy -- memoize before any recursion, to avoid infinite loops
⚫	copy = {}

	for orig_key, orig_value in pairs(orig) do
	copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)		for orig_key, orig_value in pairs(orig) do
			copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)
	end		end

	already_seen[orig] = copy
		⚫	if includeMetatable then

			local mt = getmetatable(orig)
⚫	if includeMetatable then
	~~local~~ mt = ~~getmetatable(orig)~~		if mt ~= nil then
		⚫	setmetatable(copy, _deepCopy(mt, true, already_seen))
	if mt ~= nil then
⚫	~~local mt_copy =~~ _deepCopy(mt, ~~includeMetatable~~, already_seen)
	setmetatable(copy, mt_copy)
	already_seen[mt] = mt_copy
⚫	end
	end		end
	else -- number, string, boolean, etc
⚫	~~copy =~~ orig
	end		end

	return copy		return copy
	end		end
Line 409:		Line 407:
	function p.deepCopy(orig, noMetatable, already_seen)		function p.deepCopy(orig, noMetatable, already_seen)
	checkType("deepCopy", 3, already_seen, "table", true)		checkType("deepCopy", 3, already_seen, "table", true)
	return _deepCopy(orig, not noMetatable, already_seen)		return _deepCopy(orig, not noMetatable, already_seen or {})
	end		end

Alexiscoutinho: Added "extend" method as function

2024-04-22T23:44:09Z

Added "extend" method as function

@@ Line 487: / Line 487: @@
 		error("too few arguments to 'merge' (minimum is 2, received " .. #arrays .. ')', 2)
 	end
 	local ret = {}
 	for i, arr in ipairs(arrays) do
@@ Line 496: / Line 496: @@
 	end
 	return ret
 end

Alexiscoutinho: Implemented "merge" function

2024-04-22T23:27:32Z

Implemented "merge" function

@@ Line 474: / Line 474: @@
 	end
 	return false
 end

Lemondoge: Slight simplification

2023-04-08T23:47:18Z

Slight simplification

← Previous revision		Revision as of 23:47, 8 April 2023
Line 72:		Line 72:
	-- 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.
	ret[#ret + 1] = v		ret[#ret + 1] = v
		⚫	elseif not exists[v] then
	else
	if ~~not~~ ~~exists[v~~] ~~then~~		ret[#ret + 1] = v
	~~ret~~[~~#ret + 1~~] = v		exists[v] = true
⚫	exists[v] ~~= true~~
	end
	end		end
	end		end

Uzume: fix checkType

2022-01-27T20:05:18Z

fix checkType

← Previous revision		Revision as of 20:05, 27 January 2022
Line 65:		Line 65:
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
	function p.removeDuplicates(arr)		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 = {}, {}

Uzume: align "listToSet", "invert" and "removeDuplicates"

2021-12-30T22:39:21Z

align "listToSet", "invert" and "removeDuplicates"

← Previous revision		Revision as of 22:39, 30 December 2021
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, t, '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 361:		Line 361:
	-- never equal to any value (including other NaNs or even themselves).		-- 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 isNan = p.isNan
	local set = {}		local set = {}
	for _, ~~item~~ in ipairs(t) do		for _, v in ipairs(arr) do
	if not isNan(~~item~~) then		if not isNan(v) then
	set[~~item~~] = true		set[v] = true
	end		end
	end		end

Uzume: fix mispaste

2021-12-30T22:31:19Z

fix mispaste

← Previous revision		Revision as of 22:31, 30 December 2021
Line 366:		Line 366:
	local set = {}		local set = {}
	for _, item in ipairs(t) do		for _, item in ipairs(t) do
	if not isNan(v) then		if not isNan(item) then
	set[item] = true		set[item] = true
	end		end

Uzume: fix NaN handling corrections

2021-12-17T19:12:16Z

fix NaN handling corrections

← Previous revision		Revision as of 19:12, 17 December 2021
Line 364:		Line 364:
	checkType("listToSet", 1, t, "table")		checkType("listToSet", 1, t, "table")
	local isNan = p.isNan		local isNan = p.isNan
	local set = ~~setmetatable(~~{}~~, nanmt)~~		local set = {}
	for _, item in ipairs(t) do		for _, item in ipairs(t) do
	if not isNan(v) then		if not isNan(v) then