Module:TableTools - Revision history

Richardpruen: 1 revision imported: template update

2024-12-10T13:36:39Z

1 revision imported: template update

← Older revision		Revision as of 14:36, 10 December 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 05:19, 18 August 2024
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
	~~else~~		elseif not exists[v] then
	if not exists[v] then		ret[#ret + 1] = v
	ret[#ret + 1] = v		exists[v] = true
	exists[v] = true
	~~end~~
	end		end
	end		end
Line 380:		Line 378:
	------------------------------------------------------------------------------------		------------------------------------------------------------------------------------
	local function _deepCopy(orig, includeMetatable, already_seen)		local function _deepCopy(orig, includeMetatable, already_seen)
	-- ~~Stores~~ copies of tables indexed by the original table.		if type(orig) ~= "table" then
	~~already_seen = already_seen or {}~~		return orig
			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

	~~if type(orig) == 'table' then~~		copy = {}
	copy = {}		already_seen[orig] = copy -- memoize before any recursion, to avoid infinite loops
	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
	end		copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)
	~~already_seen[orig] = copy~~		end

	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))
	~~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 411:		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

Line 464:		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?

	for _, v in ipairs(~~arr~~) do		fromIndex = tonumber(fromIndex)
	if v == ~~valueToFind~~ then		if fromIndex then
	return true		if (fromIndex < 0) then
			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
	return false		return false
			end

			------------------------------------------------------------------------------------
			-- merge
			--
			-- Given the arrays, returns an array containing the elements of each input array
			-- in sequence.
			------------------------------------------------------------------------------------
			function p.merge(...)
			local arrays = {...}
			local ret = {}
			for i, arr in ipairs(arrays) do
			checkType('merge', i, arr, 'table')
			for _, v in ipairs(arr) do
			ret[#ret + 1] = v
			end
			end
			return ret
			end

			------------------------------------------------------------------------------------
			-- extend
			--
			-- Extends the first array in place by appending all elements from the second
			-- array.
			------------------------------------------------------------------------------------
			function p.extend(arr1, arr2)
			checkType('extend', 1, arr1, 'table')
			checkType('extend', 2, arr2, 'table')

			for _, v in ipairs(arr2) do
			arr1[#arr1 + 1] = v
			end
	end		end

	return p		return p

Richardpruen: 1 revision imported: Templates and CSS files

2022-12-04T17:27:34Z

1 revision imported: Templates and CSS files

← Older revision		Revision as of 18:27, 4 December 2022
(No difference)

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

2022-01-31T13:08:18Z

updates/fixes requested by User:Uzume

Show changes

Richardpruen: 1 revision imported

2021-12-04T19:17:47Z

1 revision imported

Show changes

Richardpruen: 1 revision imported

2021-11-26T15:24:00Z

1 revision imported

Show changes

Richardpruen: 1 revision imported

2021-11-23T12:11:22Z

1 revision imported

Show changes

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

Richardpruen: 1 revision imported

2020-12-10T17:52:22Z

1 revision imported

← Older revision		Revision as of 18:52, 10 December 2020
(No difference)

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))

← Older revision		Revision as of 23:22, 11 October 2020
Line 30:		Line 30:
	--]]		--]]
	function p.isPositiveInteger(v)		function p.isPositiveInteger(v)
	if type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity ~~then~~		return type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity
	~~return true~~
	~~else~~
	~~return false~~
	~~end~~
	end		end

Line 48:		Line 44:
	--]]		--]]
	function p.isNan(v)		function p.isNan(v)
	if type(v) == 'number' and tostring(v) == '-nan' ~~then~~		return type(v) == 'number' and tostring(v) == '-nan'
	~~return true~~
	~~else~~
	~~return false~~
	~~end~~
	end		end

Line 137:		Line 129:
	local function cleanPattern(s)		local function cleanPattern(s)
	-- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally.		-- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally.
	~~s =~~ s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')		return s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
	~~return s~~
	end		end

Line 422:		Line 413:

	--[[		--[[
	-- ~~This returns~~ the length of ~~a table~~, or ~~the first integer key n counting from~~		-- Finds the length of an array, or of a quasi-array with keys such
	-- ~~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.		-- 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 #.		-- Intended to be used on data loaded with mw.loadData. For other tables, use #.
Line 430:		Line 422:
	-- frame.args.		-- frame.args.
	--]]		--]]
	function p.length(t)
	local i = 1		function p.length(t, prefix)
	~~while t[~~i~~] ~~~= ~~nil do~~		-- requiring module inline so that [[Module:Exponential search]]
	i = 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		end

	function p.inArray(arr, valueToFind)		function p.inArray(arr, valueToFind)
	checkType("inArray", 1, arr, "table")		checkType("inArray", 1, arr, "table")