Module:Table/documentation: Difference between revisions
Jump to navigation
Jump to search
Djpwikiadmin (talk | contribs) m (Djpwikiadmin moved page Module:Table/doc to Module:Table/documentation) |
Djpwikiadmin (talk | contribs) No edit summary |
||
Line 5: | Line 5: | ||
Functions by what they do: | Functions by what they do: | ||
* Create a new table: | * Create a new table: | ||
** | ** {{#invoke:string|gsub|shallowClone, shallowcopy, deepcopy, removeDuplicates, numKeys, affixNums, numData, compressSparseArray, keysToList, reverse, invert, listToSet|%a+|3=<code class="n">%1</code>}} | ||
* Create an array: | * Create an array: | ||
** | ** {{#invoke:string|gsub|removeDuplicates, numKeys, affixNums, compressSparseArray, keysToList, reverse|%a+|3=<code class="n">%1</code>}} | ||
* Return information about the table: | * Return information about the table: | ||
** | ** {{#invoke:string|gsub|size, length, contains, keyFor, isArray, deepEquals, deepEqualsList|%a+|3=<code class="n">%1</code>}} | ||
* Treat the table as an array (that is, operate on the values in the array portion of the table: values indexed by consecutive integers starting at {{code|lua|1}}): | * Treat the table as an array (that is, operate on the values in the array portion of the table: values indexed by consecutive integers starting at {{code|lua|1}}): | ||
** | ** {{#invoke:string|gsub|removeDuplicates, length, contains, serialCommaJoin, reverseIpairs, reverse, invert, listToSet, isArray, deepEqualsList|%a+|3=<code class="n">%1</code>}} | ||
* Treat a table as a sparse array (that is, operate on values indexed by non-consecutive integers): | * Treat a table as a sparse array (that is, operate on values indexed by non-consecutive integers): | ||
** | ** {{#invoke:string|gsub|numKeys, maxIndex, compressSparseArray, sparseConcat, sparseIpairs|%a+|3=<code class="n">%1</code>}} | ||
* Generate an iterator: | * Generate an iterator: | ||
** | ** {{#invoke:string|gsub|sparseIpairs, sortedPairs, reverseIpairs|%a+|3=<code class="n">%1</code>}} | ||
* Other: | * Other: | ||
** | ** {{#invoke:string|gsub|sparseConcat, serialCommaJoin, reverseConcat|%a+|3=<code class="n">%1</code>}} | ||
The original version was a copy of {{w|Module:TableTools}} on Wikipedia via [[c:Module:TableTools|Module:TableTools]] on Commons, but new functions have been added since then. | The original version was a copy of {{w|Module:TableTools}} on Wikipedia via [[c:Module:TableTools|Module:TableTools]] on Commons, but new functions have been added since then. | ||
Line 23: | Line 23: | ||
<includeonly> | <includeonly> | ||
[[Category:Lua metamodules]] | [[Category:Lua metamodules]] | ||
[[Category:Wiktionary modules]] | |||
</includeonly> | </includeonly> |
Latest revision as of 21:01, 18 September 2023
This module provides functions for dealing with Lua tables. All of them, except for two helper functions, take a table as their first argument.
Some functions are available as methods in the arrays created by Module:array.
Functions by what they do:
- Create a new table:
shallowClone
,shallowcopy
,deepcopy
,removeDuplicates
,numKeys
,affixNums
,numData
,compressSparseArray
,keysToList
,reverse
,invert
,listToSet
- Create an array:
removeDuplicates
,numKeys
,affixNums
,compressSparseArray
,keysToList
,reverse
- Return information about the table:
size
,length
,contains
,keyFor
,isArray
,deepEquals
,deepEqualsList
- Treat the table as an array (that is, operate on the values in the array portion of the table: values indexed by consecutive integers starting at
1
):removeDuplicates
,length
,contains
,serialCommaJoin
,reverseIpairs
,reverse
,invert
,listToSet
,isArray
,deepEqualsList
- Treat a table as a sparse array (that is, operate on values indexed by non-consecutive integers):
numKeys
,maxIndex
,compressSparseArray
,sparseConcat
,sparseIpairs
- Generate an iterator:
sparseIpairs
,sortedPairs
,reverseIpairs
- Other:
sparseConcat
,serialCommaJoin
,reverseConcat
The original version was a copy of Module:TableTools on Wikipedia via Module:TableTools on Commons, but new functions have been added since then.