Module:TableTools - Revision history

2b2twiki>Tigran07 at 08:38, 13 August 2021

2021-08-13T08:38:05Z

← Older revision		Revision as of 08:38, 13 August 2021
Line 129:		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 415:		Line 414:
	--[[		--[[
	-- Finds the length of an array, or of a quasi-array with keys such		-- 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		-- 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.
Line 425:		Line 424:

	function p.length(t, prefix)		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		-- which is only needed by this one function
	-- doesn't get millions of transclusions		-- doesn't get millions of transclusions

2b2twiki>Henry: 1 revision imported from :templatewiki:Module:TableTools

2020-10-16T15:35:36Z

1 revision imported from templatewiki:Module:TableTools

← Older revision	Revision as of 15:35, 16 October 2020
(No difference)

2b2twiki>Henry: 1 revision imported

2020-08-24T21:01:32Z

1 revision imported

← Older revision		Revision as of 21:01, 24 August 2020
Line 129:		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.
	~~return~~ s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')		s = s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
			return s
	end		end

Line 414:		Line 415:
	--[[		--[[
	-- Finds the length of an array, or of a quasi-array with keys such		-- Finds the length of an array, or of a quasi-array with keys such
	-- as "data1", "data2", etc., using an ~~exponential~~ search algorithm.		-- as "data1", "data2", etc., using an exponental search algorithm.
	-- It is similar to the operator #, but may return		-- 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.
Line 424:		Line 425:

	function p.length(t, prefix)		function p.length(t, prefix)
	-- requiring module inline so that [[Module:~~Exponential~~ search]]		-- requiring module inline so that [[Module:Exponental search]]
	-- which is only needed by this one function		-- which is only needed by this one function
	-- doesn't get millions of transclusions		-- doesn't get millions of transclusions

templatewiki>Rob Kam: 1 revision imported

2020-07-05T13:26:49Z

1 revision imported

← Older revision		Revision as of 13:26, 5 July 2020
Line 129:		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 415:		Line 414:
	--[[		--[[
	-- Finds the length of an array, or of a quasi-array with keys such		-- 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		-- 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.
Line 425:		Line 424:

	function p.length(t, prefix)		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		-- which is only needed by this one function
	-- doesn't get millions of transclusions		-- doesn't get millions of transclusions

2b2twiki>Henry: 49 revisions imported from :templatewiki:Module:TableTools

2020-06-27T16:02:56Z

49 revisions imported from templatewiki:Module:TableTools

← Older revision		Revision as of 16:02, 27 June 2020
Line 129:		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.
	~~return~~ s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')		s = s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
			return s
	end		end

Line 414:		Line 415:
	--[[		--[[
	-- Finds the length of an array, or of a quasi-array with keys such		-- Finds the length of an array, or of a quasi-array with keys such
	-- as "data1", "data2", etc., using an ~~exponential~~ search algorithm.		-- as "data1", "data2", etc., using an exponental search algorithm.
	-- It is similar to the operator #, but may return		-- 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.
Line 424:		Line 425:

	function p.length(t, prefix)		function p.length(t, prefix)
	-- requiring module inline so that [[Module:~~Exponential~~ search]]		-- requiring module inline so that [[Module:Exponental search]]
	-- which is only needed by this one function		-- which is only needed by this one function
	-- doesn't get millions of transclusions		-- doesn't get millions of transclusions

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

← Older revision		Revision as of 15:51, 23 May 2020
Line 129:		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 415:		Line 414:
	--[[		--[[
	-- Finds the length of an array, or of a quasi-array with keys such		-- 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		-- 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.
Line 425:		Line 424:

	function p.length(t, prefix)		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		-- which is only needed by this one function
	-- doesn't get millions of transclusions		-- doesn't get millions of transclusions

templatewiki>Rob Kam: 1 revision imported

2020-01-14T13:29:27Z

1 revision imported

← Older revision	Revision as of 13:29, 14 January 2020
(No difference)

en>Pppery: Finally getting around to merging in Module:Array length (originally written by Mr. Stradivarius) over six months after writing the merged code, also minor code simplify per Dinoguy1000 on talk page

2019-12-21T03:39:49Z

Finally getting around to merging in Module:Array length (originally written by Mr. Stradivarius) over six months after writing the merged code, also minor code simplify per Dinoguy1000 on talk page

← Older revision		Revision as of 03:39, 21 December 2019
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 422:		Line 414:

	--[[		--[[
	-- ~~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 exponental 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 423:
	-- 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:Exponental 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")

imported>Alex 21: Implementing talk page edit requested

2019-03-12T13:06:11Z

Implementing talk page edit requested

← Older revision		Revision as of 13:06, 12 March 2019
Line 426:		Line 426:
	-- 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 #.
			-- Note: #frame.args in frame object always be set to 0, regardless of
			-- the number of unnamed template parameters, so use this function for
			-- frame.args.
	--]]		--]]
	function p.length(t)		function p.length(t)
	local i = 0		local i = 1
	~~repeat~~		while t[i] ~= nil do
	i = i + 1		i = i + 1
	~~until t[i] == nil~~		end
	return i - 1		return i - 1
	end		end

imported>Pppery at 21:35, 19 February 2019

2019-02-19T21:35:25Z

← Older revision		Revision as of 21:35, 19 February 2019
Line 304:		Line 304:
	]]		]]
	function p.sortedPairs(t, keySort)		function p.sortedPairs(t, keySort)
	~~local check = _check('keysToList')~~
	checkType('sortedPairs', 1, t, 'table')		checkType('sortedPairs', 1, t, 'table')
	checkType('sortedPairs', 2, keySort, 'function', true)		checkType('sortedPairs', 2, keySort, 'function', true)