יחידה:TableTools - היסטוריית גרסאות

צפונות: 5 גרסאות של הדף :wikipedia:he:יחידה:TableTools יובאו

2022-11-15T11:50:33Z

5 גרסאות של הדף wikipedia:he:יחידה:TableTools יובאו

→ הגרסה הקודמת	גרסה מ־11:50, 15 בנובמבר 2022
(אין הבדלים)

wikipedia:he>יונה בנדלאק: 4 גרסאות של הדף :en:Module:TableTools יובאו: לפי הדיון בשיחת תבנית:כתב מונגולי

2022-06-07T08:07:43Z

4 גרסאות של הדף en:Module:TableTools יובאו: לפי הדיון בשיחת תבנית:כתב מונגולי

→ הגרסה הקודמת	גרסה מ־08:07, 7 ביוני 2022
(אין הבדלים)

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

2022-01-31T13:08:18Z

updates/fixes requested by User:Uzume

→ הגרסה הקודמת		גרסה מ־13:08, 31 בינואר 2022
שורה 38:		שורה 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

שורה 64:		שורה 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.
שורה 337:		שורה 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
	map[v] = i		if not isNan(v) then
			map[v] = i
			end
	end		end

שורה 355:		שורה 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
	set[~~item~~] = true		if not isNan(v) then
			set[v] = true
			end
	end		end

wikipedia:he>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

הצגת שינויים

צפונות: 48 גרסאות של הדף :wikipedia:he:יחידה:TableTools יובאו

2021-07-11T16:38:21Z

48 גרסאות של הדף wikipedia:he:יחידה:TableTools יובאו

→ הגרסה הקודמת	גרסה מ־16:38, 11 ביולי 2021
(אין הבדלים)

צפונות: יצירת דף עם התוכן "--[[ ------------------------------------------------------------------------------------ -- TableTools..."

2020-10-19T08:01:24Z

יצירת דף עם התוכן "--[[ ------------------------------------------------------------------------------------ -- TableTools..."

→ הגרסה הקודמת		גרסה מ־08:01, 19 באוקטובר 2020
שורה 129:		שורה 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

שורה 414:		שורה 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.
שורה 424:		שורה 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

wikipedia:he>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))

→ הגרסה הקודמת	גרסה מ־22:22, 11 באוקטובר 2020
(אין הבדלים)

wikipedia:he>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

→ הגרסה הקודמת		גרסה מ־15:51, 23 במאי 2020
שורה 129:		שורה 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

שורה 415:		שורה 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.
שורה 425:		שורה 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

wikipedia:he>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

→ הגרסה הקודמת		גרסה מ־03:39, 21 בדצמבר 2019
שורה 30:		שורה 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

שורה 48:		שורה 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

שורה 422:		שורה 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 #.
שורה 430:		שורה 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")

wikipedia:he>Alex 21: Implementing talk page edit requested

2019-03-12T13:06:11Z

Implementing talk page edit requested

→ הגרסה הקודמת		גרסה מ־13:06, 12 במרץ 2019
שורה 426:		שורה 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