Module:TableTools/doc: Difference between revisions
+internal links |
m 1 revision imported |
(No difference)
| |
Latest revision as of 19:26, 28 August 2025
| Warning | This Lua module is used {{#if:|{{{1}}}|in system messages}}, and on approximately 8,920,000 pages, or roughly 5039548% of all pages. Changes to it can cause immediate changes to the Wikipedia user interface. To avoid major disruption and server load, any changes should be tested in the module's /sandbox or /testcases subpages, or in your own module sandbox. The tested changes can be added to this page in a single edit. Please discuss changes on the talk page before implementing them. |
{{safesubst:#if:{{safesubst:#ifeq:doc|sandbox|1}}{{safesubst:#ifeq:doc|doc|1}}||{{#switch:Lua error: First parameter must be one of edit, move, create, upload, undelete, autoreview.|sysop|templateeditor|interfaceadmin=|#default=}}}}
{{#ifeq:doc|doc|{{#if:|Template:Pp}}|{{safesubst:#switch:
{{safesubst:#if:
|
| {{safesubst:#ifeq:Module|Module
| module
| other
}}
}}
| module =
{{#switch: p
| pre-alpha | prealpha | pa | experimental = Pre-alpha | alpha | a = Alpha | beta | b = Beta | release | r | general | g | stable | protected | protect | p | semiprotected | semiprotect | semi = Ready for use | broken | br | unstable = Unstable}} | {{#switch: p
| pre-alpha | prealpha | pa | experimental = This module is rated as pre-alpha. It is unfinished, and may or may not be in active development. It should not be used from article namespace pages. Modules remain pre-alpha until the original editor (or someone who takes one over if it is abandoned for some time) is satisfied with the basic structure. | alpha | a = This module is rated as alpha. It is ready for third-party input, and may be used on a few pages to see if problems arise, but should be watched. Suggestions for new features or changes in their input and output mechanisms are welcome. | beta | b = This module is rated as beta, and is ready for widespread use. It is still new and should be used with some caution to ensure the results are as expected. | release | r | general | g | stable | protected | protect | p | semiprotected | semiprotect | semi = This module is rated as ready for general use. It has reached a mature form and is thought to be relatively bug-free and ready for use wherever appropriate. It is ready to mention on help pages and other Wikipedia resources as an option for new users to learn. To reduce server load and bad output, it should be improved by sandbox testing rather than repeated trial-and-error editing. | broken | br | unstable = This module is rated as unstable. It contains either missing dependencies, compatibility errors, or output errors that make it unusable. Please help improve compatibility of this module, or nominate this module for deletion if it is unfixable. | #default = Template:Error}} |
{{#if:||
{{#ifeq: Module:TableTools/doc | Sandbox
|
| {{#switch: doc
| doc | sandbox =
| {{#ifeq: | true
|
| {{#switch: p
| pre-alpha | prealpha | pa | experimental =
| alpha | a =
| beta | b =
| release | r | general | g | stable =
| broken | br | unstable =
}}
}}
}}
}}
}}{{#switch: |t
|m = {{#switch:Lua error in Module:Effective_protection_level at line 14: attempt to index local 'title' (a nil value).|*|user=|#default=
| [[File:{{#switch:Lua error in Module:Effective_protection_level at line 14: attempt to index local 'title' (a nil value).|autoconfirmed=Semi|extendedconfirmed=Extended|accountcreator|templateeditor=Template|sysop=Full}}-protection-shackle.svg|40x40px|link=|alt=Protected]] | This is subject to page protection{{#if:|Template:Space|. It is a highly visible in use by a very large number of pages, or is substituted very frequently. Because vandalism or mistakes would affect many pages, and even trivial editing might cause substantial load on the servers, it is protected from editing.}} |
}} |#default= }} | other | #default = Template:Error }}}}
| File:Cascade-protection-shackle.svg | This module can only be edited by administrators because it is transcluded onto one or more cascade-protected pages. |
| File:Lua-Logo.svg | This module depends on the following other modules: |
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.
Loading the module
[edit]To use any of the functions, first you must load the module.
<syntaxhighlight lang="lua"> local TableTools = require('Module:TableTools') </syntaxhighlight>
isPositiveInteger
[edit]<syntaxhighlight lang="lua"> TableTools.isPositiveInteger(value) </syntaxhighlight>
Returns true if 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.
isNan
[edit]<syntaxhighlight lang="lua"> TableTools.isNan(value) </syntaxhighlight>
Returns true if value 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 value is used as a table key.)
shallowClone
[edit]<syntaxhighlight lang="lua"> TableTools.shallowClone(t) </syntaxhighlight>
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. If you want to make a new table with no shared subtables and with metatables transferred, you can use mw.clone instead. If you want to make a new table with no shared subtables and without metatables transferred, use deepCopy with the noMetatable option.
removeDuplicates
[edit]<syntaxhighlight lang="lua"> TableTools.removeDuplicates(t) </syntaxhighlight>
Removes duplicate values from an array. This function is only designed to work with standard arrays: keys that are not positive integers are ignored, as are all values after the first nil value. (For arrays containing nil values, you can use compressSparseArray first.) The function tries to preserve the order of the array: the earliest non-unique value is kept, and all subsequent duplicate values are removed. For example, for the table <syntaxhighlight lang="lua" class="" style="" inline="1">{5, 4, 4, 3, 4, 2, 2, 1}</syntaxhighlight> removeDuplicates will return <syntaxhighlight lang="lua" class="" style="" inline="1">{5, 4, 3, 2, 1}</syntaxhighlight>.
numKeys
[edit]<syntaxhighlight lang="lua"> TableTools.numKeys(t) </syntaxhighlight>
Takes a table t and returns an array containing the numbers of any positive integer keys that have non-nil values, sorted in numerical order. For example, for the table <syntaxhighlight lang="lua" class="" style="" inline="1">{'foo', nil, 'bar', 'baz', a = 'b'}</syntaxhighlight>, numKeys will return <syntaxhighlight lang="lua" class="" style="" inline="1">{1, 3, 4}</syntaxhighlight>.
affixNums
[edit]<syntaxhighlight lang="lua"> TableTools.affixNums(t, prefix, suffix) </syntaxhighlight>
Takes a table t and returns an array containing the numbers of keys with the optional prefix prefix and the optional suffix suffix. For example, for the table <syntaxhighlight lang="lua" class="" style="" inline="1">{a1 = 'foo', a3 = 'bar', a6 = 'baz'}</syntaxhighlight> and the prefix 'a', affixNums will return <syntaxhighlight lang="lua" class="" style="" inline="1">{1, 3, 6}</syntaxhighlight>. All characters in prefix and suffix are interpreted literally.
See {{safesubst:#if:params |{{#invoke:params|{{safesubst:#if:call_for_each_group |{{safesubst:#if:call_for_each_group|call_for_each_group}} |function }}}} |Script error: No such module "Error". }} and {{safesubst:#if:params |{{#invoke:params|{{safesubst:#if:grouping_by_calling |{{safesubst:#if:grouping_by_calling|grouping_by_calling}} |function }}}} |Script error: No such module "Error". }} for doing something similar from a wiki template.
numData
[edit]<syntaxhighlight lang="lua"> TableTools.numData(t, compress) </syntaxhighlight>
Given a table with keys like "foo1", "bar1", "foo2", and "baz2", returns a table of subtables in the format <syntaxhighlight lang="lua" class="" style="" inline="1">{ [1] = {foo = 'text', bar = 'text'}, [2] = {foo = 'text', baz = 'text'} }</syntaxhighlight>. 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.
compressSparseArray
[edit]<syntaxhighlight lang="lua"> TableTools.compressSparseArray(t) </syntaxhighlight>
Takes an array t 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. Any keys that are not positive integers are removed. For example, for the table <syntaxhighlight lang="lua" class="" style="" inline="1">{1, nil, foo = 'bar', 3, 2}</syntaxhighlight>, compressSparseArray will return <syntaxhighlight lang="lua" class="" style="" inline="1">{1, 3, 2}</syntaxhighlight>.
See {{safesubst:#if:params |{{#invoke:params|{{safesubst:#if:squeezing |{{safesubst:#if:squeezing|squeezing}} |function }}}} |Script error: No such module "Error". }} for doing something similar from a wiki template.
sparseIpairs
[edit]<syntaxhighlight lang="lua"> TableTools.sparseIpairs(t) </syntaxhighlight>
This is an iterator function for traversing a sparse array t. It is similar to ipairs, but will continue to iterate until the highest numerical key, whereas ipairs may stop after the first nil value. Any keys that are not positive integers are ignored.
Usually sparseIpairs is used in a generic for loop.
<syntaxhighlight lang="lua"> for i, v in TableTools.sparseIpairs(t) do
-- code block
end </syntaxhighlight>
Note that sparseIpairs uses the pairs function in its implementation. Although some table keys appear to be ignored, all table keys are accessed when it is run.
size
[edit]<syntaxhighlight lang="lua"> TableTools.size(t) </syntaxhighlight>
Finds the size of a key/value pair table (associative array). For example, for <syntaxhighlight lang="lua" class="" style="" inline="1">{foo = 'foo', bar = 'bar'}</syntaxhighlight>, size will return 2. The function will also work on arrays, but for arrays it is more efficient to use the # operator. Note that to find the size, this function uses the pairs function to iterate through all of the keys.
keysToList
[edit]<syntaxhighlight lang="lua"> TableTools.keysToList(t, keySort, checked) </syntaxhighlight>
Returns a list of the keys in a table, sorted using either a default comparison function or a custom keySort function, which follows the same rules as the comp function supplied to table.sort. If keySort is false, no sorting is done. Set checked to true to skip the internal type checking.
sortedPairs
[edit]<syntaxhighlight lang="lua"> TableTools.sortedPairs(t, keySort) </syntaxhighlight>
Iterates through a table, with the keys sorted using the keysToList function. If there are only numerical keys, sparseIpairs is probably more efficient.
isArray
[edit]<syntaxhighlight lang="lua"> TableTools.isArray(value) </syntaxhighlight>
Returns true if value is a table and all keys are consecutive integers starting at 1.
isArrayLike
[edit]<syntaxhighlight lang="lua"> TableTools.isArrayLike(value) </syntaxhighlight>
Returns true if value is iterable and all keys are consecutive integers starting at 1.
invert
[edit]<syntaxhighlight lang="lua"> TableTools.invert(arr) </syntaxhighlight>
Transposes the keys and values in an array. For example, <syntaxhighlight lang="lua" class="" style="" inline="1">invert{ "a", "b", "c" }</syntaxhighlight> yields <syntaxhighlight lang="lua" class="" style="" inline="1">{ a=1, b=2, c=3 }</syntaxhighlight>.
listToSet
[edit]<syntaxhighlight lang="lua"> TableTools.listToSet(arr) </syntaxhighlight>
Creates a set from the array part of the table arr. Indexing the set by any of the values of the array returns true. For example, <syntaxhighlight lang="lua" class="" style="" inline="1">listToSet{ "a", "b", "c" }</syntaxhighlight> yields <syntaxhighlight lang="lua" class="" style="" inline="1">{ a=true, b=true, c=true }</syntaxhighlight>.
deepCopy
[edit]<syntaxhighlight lang="lua"> TableTools.deepCopy(orig, noMetatable, alreadySeen) </syntaxhighlight>
Creates a copy of the table orig. As with mw.clone, all values that are not functions are duplicated and the identity of tables is preserved. If noMetatable is true, then the metatable (if any) is not copied. Can copy tables loaded with mw.loadData.
Similar to mw.clone, but mw.clone cannot copy tables loaded with mw.loadData and does not allow metatables not to be copied.
sparseConcat
[edit]<syntaxhighlight lang="lua"> TableTools.sparseConcat(t, sep, i, j) </syntaxhighlight>
Concatenates all values in the table that are indexed by a positive integer, in order. For example, <syntaxhighlight lang="lua" class="" style="" inline="1">sparseConcat{ "a", nil, "c", "d" }</syntaxhighlight> yields <syntaxhighlight lang="lua" class="" style="" inline="1">"acd"</syntaxhighlight> and <syntaxhighlight lang="lua" class="" style="" inline="1">sparseConcat{ nil, "b", "c", "d" }</syntaxhighlight> yields <syntaxhighlight lang="lua" class="" style="" inline="1">"bcd"</syntaxhighlight>.
length
[edit]<syntaxhighlight lang="lua"> TableTools.length(t, prefix) </syntaxhighlight>
Finds the length of an array or of a quasi-array with keys with an optional prefix such as "data1", "data2", etc. It uses an exponential search algorithm to find the length, so as to use as few table lookups as possible.
This algorithm is useful for arrays that use metatables (e.g. frame.args) and for quasi-arrays. For normal arrays, just use the # operator, as it is implemented in C and will be quicker.
inArray
[edit]<syntaxhighlight lang="lua">TableTools.inArray(array, searchElement) TableTools.inArray(array, searchElement, fromIndex)</syntaxhighlight>
Returns true if searchElement is a member of the array array, and false otherwise. Equivalent to the javascript Array.prototype.includes() function, except fromIndex is 1-indexed instead of zero-indexed.
fromIndex
[edit]fromIndex is the optional 1-based index at which to start searching. If fromIndex is not present, all values in the array will be searched and the array will be treated as a table/associative array (it will be iterated over using <syntaxhighlight lang="lua" inline>pairs()</syntaxhighlight>).
If fromIndex is present and an integer, the array is assumed to be a conventional array/sequence/list (indexed with consecutive integer keys starting at 1, and interated over using <syntaxhighlight lang="lua" inline>ipairs()</syntaxhighlight>). Only the values whose index is fromIndex or higher will be searched.
In the following examples, #array represents the length of the integer-keyed portion of the array.
- If
fromIndex < 0it will count back from the end of the array, e.g. a value of-1will only search the last integer-keyed element in the array. IffromIndex <= (-1 * #array), the entire integer-keyed portion of the array will be searched. - If
fromIndex = 0it will be treated as a1and the entire integer-keyed portion of the array will be searched. - If
fromIndex > #array, the array is not searched andfalseis returned.
merge
[edit]<syntaxhighlight lang="lua"> TableTools.merge(...) </syntaxhighlight>
Given the arrays, returns an array containing the elements of each input array in sequence.
extend
[edit]<syntaxhighlight lang="lua"> TableTools.extend(arr1, arr2) </syntaxhighlight>
Extends the first array in place by appending all elements from the second array.
See also
[edit]- {{#invoke:params}}