Modul:TableTools - Versionsgeschichte

Tobi am 23. Dezember 2017 um 18:49 Uhr

2017-12-23T18:49:27Z

← Nächstältere Version		Version vom 23. Dezember 2017, 20:49 Uhr
Zeile 304:		Zeile 304:
	ret = ret .. indent .. '\t' .. k .. ' = '		ret = ret .. indent .. '\t' .. k .. ' = '
	if type(v) == 'boolean' then		if type(v) == 'boolean' then
	ret = ret .. ( ~~ret~~ and 'true' or 'false' ) .. "\n"		ret = ret .. ( v and 'true' or 'false' ) .. "\n"
	elseif type(v) ~= 'table' then		elseif type(v) ~= 'table' then
	ret = ret .. "'" .. tostring(v) .. "'\n"		ret = ret .. "'" .. tostring(v) .. "'\n"

Tobi am 23. Dezember 2017 um 18:44 Uhr

2017-12-23T18:44:16Z

← Nächstältere Version		Version vom 23. Dezember 2017, 20:44 Uhr
Zeile 303:		Zeile 303:
	for k, v in pairs(t) do		for k, v in pairs(t) do
	ret = ret .. indent .. '\t' .. k .. ' = '		ret = ret .. indent .. '\t' .. k .. ' = '
	if type(v) ~= 'table' then		if type(v) == 'boolean' then
			ret = ret .. ( ret and 'true' or 'false' ) .. "\n"
			elseif type(v) ~= 'table' then
	ret = ret .. "'" .. tostring(v) .. "'\n"		ret = ret .. "'" .. tostring(v) .. "'\n"
	else		else

Tobi am 23. Dezember 2017 um 18:35 Uhr

2017-12-23T18:35:08Z

← Nächstältere Version		Version vom 23. Dezember 2017, 20:35 Uhr
Zeile 293:		Zeile 293:
	return t		return t
	end		end

	if not indent then		if not indent then
	indent = ''		indent = ''
	~~elseif indent ~= 'inline' then~~		else
	indent = indent .. '\t'		indent = indent .. '\t'
	end		end
	ret = '{~~' .. (indent == 'inline' and ' ' or '~~\n')
			ret = '{\n'
	for k, v in pairs(t) do		for k, v in pairs(t) do
	~~-- print key part~~		ret = ret .. indent .. '\t' .. k .. ' = '
	ret = ret .. ~~(indent ~= 'inline' and~~ indent .. '\t' ~~or '' )~~ ..		if type(v) ~= 'table' then
	~~(type(k) ~= 'number' and tostring(~~k) .. ' = ' ~~or '')~~		ret = ret .. "'" .. tostring(v) .. "'\n"
	~~-- print value part~~
	if ~~type(v) == 'boolean' then~~
	~~ret = ret .. (v and 'true' or 'false') .. ""~~
	~~elseif~~ type(v) ~= 'table' then
	~~if type(v) == 'function' then~~
	ret = ret .. "~~FUNCTION"~~
	~~elseif type(v) ==~~ '~~number' or mw.ustring.match(v, '^[0-9]+$') then~~
	~~ret = ret .. v .. "~~"
	~~else~~
	~~local valMangled = mw~~.~~text~~.~~trim~~(v)
	~~--- here see to it, that ' are escapged~~
	~~valMangled = mw.ustring~~.~~gsub(mw~~.~~ustring.gsub(valMangled, "\\'", "'"),~~ "'~~", "\\'")~~
	~~if indent ~= 'inline' then~~
	~~valMangled = mw.ustring.gsub(valMangled, '\n', '\~~\n~~\' ..\n' .. indent .. '\t\'')~~
	~~end~~
	~~ret = ret .. "'~~" ~~.. valMangled .. "'"~~
	~~end~~
	else		else
	ret = ret .. p.printTable(v, indent)		ret = ret .. p.printTable(v, indent)
	~~end~~
	~~if indent ~= 'inline' then~~
	~~ret = ret .. ',\n'~~
	~~else~~
	~~ret = ret .. ', '~~
	end		end
	end		end
	return ret .. (indent ~~~= 'inline' and indent or '')~~ .. '}'
			return ret .. indent .. '}\n'
	end		end


	return p		return p

imported>Oetterer am 11. Januar 2017 um 19:27 Uhr

2017-01-11T19:27:22Z

← Nächstältere Version		Version vom 11. Januar 2017, 21:27 Uhr
Zeile 293:		Zeile 293:
	return t		return t
	end		end

	if not indent then		if not indent then
	indent = ''		indent = ''
	~~else~~		elseif indent ~= 'inline' then
	indent = indent .. '\t'		indent = indent .. '\t'
	end		end
			ret = '{' .. (indent == 'inline' and ' ' or '\n')
	ret = '{\n'
	for k, v in pairs(t) do		for k, v in pairs(t) do
	ret = ret .. indent .. '\t' .. k .. ' = '		-- print key part
	if type(v) ~= 'table' then		ret = ret .. (indent ~= 'inline' and indent .. '\t' or '' ) ..
	ret = ret .. "'" .. v .. "'\n"		(type(k) ~= 'number' and tostring(k) .. ' = ' or '')
			-- print value part
			if type(v) == 'boolean' then
			ret = ret .. (v and 'true' or 'false') .. ""
			elseif type(v) ~= 'table' then
			if type(v) == 'function' then
			ret = ret .. "FUNCTION"
			elseif type(v) == 'number' or mw.ustring.match(v, '^[0-9]+$') then
			ret = ret .. v .. ""
			else
			local valMangled = mw.text.trim(v)
			--- here see to it, that ' are escapged
			valMangled = mw.ustring.gsub(mw.ustring.gsub(valMangled, "\\'", "'"), "'", "\\'")
			if indent ~= 'inline' then
			valMangled = mw.ustring.gsub(valMangled, '\n', '\\n\' ..\n' .. indent .. '\t\'')
			end
			ret = ret .. "'" .. valMangled .. "'"
			end
	else		else
	ret = ret .. p.printTable(v, indent)		ret = ret .. p.printTable(v, indent)
			end
			if indent ~= 'inline' then
			ret = ret .. ',\n'
			else
			ret = ret .. ', '
	end		end
	end		end
			return ret .. (indent ~= 'inline' and indent or '') .. '}'
	return ret .. indent .. '}\n'
	end		end


	return p		return p

Maintenance script: Schützte „Modul:TableTools“ ([Bearbeiten=Nur Administratoren erlauben] (unbeschränkt) [Verschieben=Nur Administratoren erlauben] (unbeschränkt))

2015-08-09T08:54:01Z

Schützte „Modul:TableTools“ ([Bearbeiten=Nur Administratoren erlauben] (unbeschränkt) [Verschieben=Nur Administratoren erlauben] (unbeschränkt))

← Nächstältere Version	Version vom 9. August 2015, 10:54 Uhr
(kein Unterschied)

mw>Totest01 am 2. März 2015 um 14:34 Uhr

2015-03-02T14:34:50Z

Neue Seite

--[[
------------------------------------------------------------------------------------
-- TableTools --
-- --
-- This module includes a number of functions for dealing with Lua tables. --
-- It is a meta-module, meant to be called from other Lua modules, and should --
-- not be called directly from #invoke. --
------------------------------------------------------------------------------------
--]]

local libraryUtil = require('libraryUtil')

local p = {}

-- Define often-used variables and functions.
local floor = math.floor
local infinity = math.huge
local checkType = libraryUtil.checkType

--[[
------------------------------------------------------------------------------------
-- isPositiveInteger
--
-- This function returns true if the given value is a positive integer, and false
-- if not. Although it doesn't operate on tables, it is included here as it is
-- useful for determining whether a given table key is in the array part or the
-- hash part of a table.
------------------------------------------------------------------------------------
--]]
function p.isPositiveInteger(v)
if type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity then
return true
else
return false
end
end

--[[
------------------------------------------------------------------------------------
-- isNan
--
-- This function returns true if the given number is a NaN value, and false
-- if not. Although it doesn't operate on tables, it is included here as it is
-- useful for determining whether a value can be a valid table key. Lua will
-- generate an error if a NaN is used as a table key.
------------------------------------------------------------------------------------
--]]
function p.isNan(v)
if type(v) == 'number' and tostring(v) == '-nan' then
return true
else
return false
end
end

--[[
------------------------------------------------------------------------------------
-- shallowClone
--
-- This returns a clone of a table. The value returned is a new table, but all
-- subtables and functions are shared. Metamethods are respected, but the returned
-- table will have no metatable of its own.
------------------------------------------------------------------------------------
--]]
function p.shallowClone(t)
local ret = {}
for k, v in pairs(t) do
ret[k] = v
end
return ret
end

--[[
------------------------------------------------------------------------------------
-- removeDuplicates
--
-- This removes duplicate values from an array. Non-positive-integer keys are
-- ignored. The earliest value is kept, and all subsequent duplicate values are
-- removed, but otherwise the array order is unchanged.
------------------------------------------------------------------------------------
--]]
function p.removeDuplicates(t)
checkType('removeDuplicates', 1, t, 'table')
local isNan = p.isNan
local ret, exists = {}, {}
for i, v in ipairs(t) do
if isNan(v) then
-- NaNs can't be table keys, and they are also unique, so we don't need to check existence.
ret[#ret + 1] = v
else
if not exists[v] then
ret[#ret + 1] = v
exists[v] = true
end
end
end
return ret
end

--[[
------------------------------------------------------------------------------------
-- numKeys
--
-- This takes a table and returns an array containing the numbers of any numerical
-- keys that have non-nil values, sorted in numerical order.
------------------------------------------------------------------------------------
--]]
function p.numKeys(t)
checkType('numKeys', 1, t, 'table')
local isPositiveInteger = p.isPositiveInteger
local nums = {}
for k, v in pairs(t) do
if isPositiveInteger(k) then
nums[#nums + 1] = k
end
end
table.sort(nums)
return nums
end

--[[
------------------------------------------------------------------------------------
-- affixNums
--
-- This takes a table and returns an array containing the numbers of keys with the
-- specified prefix and suffix. For example, for the table
-- {a1 = 'foo', a3 = 'bar', a6 = 'baz'} and the prefix "a", affixNums will
-- return {1, 3, 6}.
------------------------------------------------------------------------------------
--]]
function p.affixNums(t, prefix, suffix)
checkType('affixNums', 1, t, 'table')
checkType('affixNums', 2, prefix, 'string', true)
checkType('affixNums', 3, suffix, 'string', true)

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

prefix = prefix or ''
suffix = suffix or ''
prefix = cleanPattern(prefix)
suffix = cleanPattern(suffix)
local pattern = '^' .. prefix .. '([1-9]%d*)' .. suffix .. '$'

local nums = {}
for k, v in pairs(t) do
if type(k) == 'string' then
local num = mw.ustring.match(k, pattern)
if num then
nums[#nums + 1] = tonumber(num)
end
end
end
table.sort(nums)
return nums
end

--[[
------------------------------------------------------------------------------------
-- numData
--
-- Given a table with keys like ("foo1", "bar1", "foo2", "baz2"), returns a table
-- of subtables in the format
-- { [1] = {foo = 'text', bar = 'text'}, [2] = {foo = 'text', baz = 'text'} }
-- Keys that don't end with an integer are stored in a subtable named "other".
-- The compress option compresses the table so that it can be iterated over with
-- ipairs.
------------------------------------------------------------------------------------
--]]
function p.numData(t, compress)
checkType('numData', 1, t, 'table')
checkType('numData', 2, compress, 'boolean', true)
local ret = {}
for k, v in pairs(t) do
local prefix, num = mw.ustring.match(tostring(k), '^([^0-9]*)([1-9][0-9]*)$')
if num then
num = tonumber(num)
local subtable = ret[num] or {}
if prefix == '' then
-- Positional parameters match the blank string; put them at the start of the subtable instead.
prefix = 1
end
subtable[prefix] = v
ret[num] = subtable
else
local subtable = ret.other or {}
subtable[k] = v
ret.other = subtable
end
end
if compress then
local other = ret.other
ret = p.compressSparseArray(ret)
ret.other = other
end
return ret
end

--[[
------------------------------------------------------------------------------------
-- compressSparseArray
--
-- This takes an array with one or more nil values, and removes the nil values
-- while preserving the order, so that the array can be safely traversed with
-- ipairs.
------------------------------------------------------------------------------------
--]]
function p.compressSparseArray(t)
checkType('compressSparseArray', 1, t, 'table')
local ret = {}
local nums = p.numKeys(t)
for _, num in ipairs(nums) do
ret[#ret + 1] = t[num]
end
return ret
end

--[[
------------------------------------------------------------------------------------
-- sparseIpairs
--
-- This is an iterator for sparse arrays. It can be used like ipairs, but can
-- handle nil values.
------------------------------------------------------------------------------------
--]]
function p.sparseIpairs(t)
checkType('sparseIpairs', 1, t, 'table')
local nums = p.numKeys(t)
local i = 0
local lim = #nums
return function ()
i = i + 1
if i <= lim then
local key = nums[i]
return key, t[key]
else
return nil, nil
end
end
end

--[[
------------------------------------------------------------------------------------
-- size
--
-- This returns the size of a key/value pair table. It will also work on arrays,
-- but for arrays it is more efficient to use the # operator.
------------------------------------------------------------------------------------
--]]
function p.size(t)
checkType('size', 1, t, 'table')
local i = 0
for k in pairs(t) do
i = i + 1
end
return i
end

--[[
------------------------------------------------------------------------------------
-- inTable
--
-- This returns true (the key), if the value is found in the table, false otherwise
------------------------------------------------------------------------------------
--]]
function p.inTable(t, val)

for k, v in pairs(t) do
if val == v then
return k
end
end

return false
end

--[[
------------------------------------------------------------------------------------
-- printTable
--
-- This returns a string representation of a table, best printed within
-- <pre>..</pre> tags
-- Useful for debug purposes
------------------------------------------------------------------------------------
--]]
function p.printTable(t, indent)

local ret
if type(t) ~= 'table' then
return t
end

if not indent then
indent = ''
else
indent = indent .. '\t'
end

ret = '{\n'
for k, v in pairs(t) do
ret = ret .. indent .. '\t' .. k .. ' = '
if type(v) ~= 'table' then
ret = ret .. "'" .. v .. "'\n"
else
ret = ret .. p.printTable(v, indent)
end
end

return ret .. indent .. '}\n'
end

return p