CINXE.COM

<!DOCTYPE html> <html class="client-nojs" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>Module:table: difference between revisions - Wiktionary, the free dictionary</title> <script>(function(){var className="client-js";var cookie=document.cookie.match(/(?:^|; )enwiktionarymwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy","wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"43cb44ae-9be1-4f70-a8aa-360616368a87","wgCanonicalNamespace":"Module","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":828,"wgPageName":"Module:table","wgTitle":"table","wgCurRevisionId":82752850,"wgRevisionId":82733053,"wgArticleId":5122966,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":[ "Templates and modules needing documentation","Collections modules"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"Scribunto","wgRelevantPageName":"Module:table","wgRelevantArticleId":5122966,"wgIsProbablyEditable":false,"wgRelevantPageIsProbablyEditable":false,"wgRestrictionEdit":["templateeditor"],"wgRestrictionMove":["templateeditor"],"wgNoticeProject":"wiktionary","wgCiteReferencePreviewsActive":true,"wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgVisualEditor":{"pageLanguageCode":"en","pageLanguageDir":"ltr","pageVariantFallbacks":"en"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":false,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":40000,"extRevisionSliderTimeOffset":0,"wgDiffOldId":82709639,"wgDiffNewId":82733053,"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":true, "wgVector2022LanguageInHeader":false,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q15727765","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"]};RLSTATE={"ext.gadget.LanguagesAndScripts":"ready","ext.gadget.Palette":"ready","ext.gadget.Site":"ready","ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.visualEditor.diffPage.init.styles":"ready","oojs-ui.styles.icons-accessibility":"ready","oojs-ui.styles.icons-editing-advanced":"ready","oojs-ui-core.styles":"ready","oojs-ui.styles.indicators":"ready","mediawiki.widgets.styles":"ready","oojs-ui-core.icons":"ready","ext.RevisionSlider.lazyCss":"ready","mediawiki.interface.helpers.styles":"ready","mediawiki.diff.styles":"ready","ext.pygments":"ready","mediawiki.helplink":"ready","skins.vector.styles.legacy":"ready", "ext.visualEditor.desktopArticleTarget.noscript":"ready","codex-search-styles":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.visualEditor.diffPage.init","ext.RevisionSlider.lazyJs","mediawiki.diff","ext.pygments.view","site","mediawiki.page.ready","mediawiki.toc","skins.vector.legacy.js","ext.centralNotice.geoIP","ext.gadget.LegacyScripts","ext.gadget.DocTabs","ext.gadget.RevdelInfo","ext.gadget.PagePreviews","ext.gadget.Edittools","ext.gadget.defaultVisibilityToggles","ext.gadget.UnsupportedTitles","ext.gadget.WiktGadgetPrefs","ext.urlShortener.toolbar","ext.centralauth.centralautologin","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.compactlinks","ext.uls.interface","ext.checkUser.clientHints","wikibase.sidebar.tracking"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&modules=codex-search-styles%7Cext.RevisionSlider.lazyCss%7Cext.pygments%2CwikimediaBadges%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.visualEditor.diffPage.init.styles%7Cmediawiki.diff.styles%7Cmediawiki.helplink%7Cmediawiki.interface.helpers.styles%7Cmediawiki.widgets.styles%7Coojs-ui-core.icons%2Cstyles%7Coojs-ui.styles.icons-accessibility%2Cicons-editing-advanced%2Cindicators%7Cskins.vector.styles.legacy%7Cwikibase.client.init&only=styles&skin=vector"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.gadget.LanguagesAndScripts%2CPalette%2CSite&only=styles&skin=vector"> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="noindex,nofollow,max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta name="viewport" content="width=1120"> <meta property="og:site_name" content="Wiktionary"> <meta property="og:title" content="Module:table: difference between revisions - Wiktionary, the free dictionary"> <meta property="og:type" content="website"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wiktionary.org/wiki/Module:table"> <link rel="apple-touch-icon" href="/static/apple-touch/wiktionary/en.png"> <link rel="icon" href="/static/favicon/wiktionary/en.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wiktionary (en)"> <link rel="EditURI" type="application/rsd+xml" href="//en.wiktionary.org/w/api.php?action=rsd"> <link rel="canonical" href="https://en.wiktionary.org/wiki/Module:table"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en"> <link rel="alternate" type="application/atom+xml" title="Wiktionary Atom feed" href="/w/index.php?title=Special:RecentChanges&feed=atom"> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="mw-article-diff skin-vector-legacy mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-828 ns-subject page-Module_table rootpage-Module_table skin-vector action-view"><div id="mw-page-base" class="noprint"></div> <div id="mw-head-base" class="noprint"></div> <div id="content" class="mw-body" role="main"> <a id="top"></a> <div id="siteNotice"></div> <div class="mw-indicators"> <div id="mw-indicator-mw-helplink" class="mw-indicator"><a href="https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Diff" target="_blank" class="mw-helplink">Help</a></div> </div> <h1 id="firstHeading" class="firstHeading mw-first-heading">Module:table: difference between revisions</h1> <div id="bodyContent" class="vector-body"> <div id="siteSub" class="noprint">From Wiktionary, the free dictionary</div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="contentSub2"></div> <div id="jump-to-nav"></div> <a class="mw-jump-link" href="#mw-head">Jump to navigation</a> <a class="mw-jump-link" href="#searchInput">Jump to search</a> <div id="mw-content-text" class="mw-body-content"><div class="mw-revslider-container"><span style='width: 100%; text-align: center;' id='ooui-php-1' class='mw-revslider-toggle-button oo-ui-widget oo-ui-widget-enabled oo-ui-buttonElement oo-ui-buttonElement-frameless oo-ui-indicatorElement oo-ui-labelElement oo-ui-buttonWidget' data-ooui='{"_":"OO.ui.ButtonWidget","rel":["nofollow"],"framed":false,"indicator":"down","label":"Browse history interactively","title":"Open revision slider","classes":["mw-revslider-toggle-button"]}'><a role='button' title='Open revision slider' tabindex='0' rel='nofollow' class='oo-ui-buttonElement-button'>Browse history interactively</a><div class="mw-revslider-slider-wrapper" style="display: none;"><div class="mw-revslider-placeholder"><div class="mw-revslider-spinner"><div class="mw-revslider-bounce"></div></div></div></div></div><div class="mw-diff-revision-history-links"><a href="/w/index.php?title=Module:table&diff=prev&oldid=82709639" class="mw-diff-revision-history-link-previous" title="Module:table">← Go to previous edit</a><a href="/w/index.php?title=Module:table&diff=next&oldid=82733053" class="mw-diff-revision-history-link-next" title="Module:table">Go to next edit →</a></div><div class="mw-diff-table-prefix" dir="ltr" lang="en"><div class="mw-diff-inline-legend oo-ui-element-hidden">Content deleted Content added</div><div class="mw-diffPage-inlineToggle-container"><div id='mw-diffPage-inline-toggle-switch-layout' class='oo-ui-layout oo-ui-labelElement oo-ui-fieldLayout oo-ui-fieldLayout-align-left' data-ooui='{"_":"OO.ui.FieldLayout","fieldWidget":{"tag":"mw-diffPage-inline-toggle-switch"},"$overlay":true,"label":"Inline","title":"Switches between inline format and two-column format"}'><div class='oo-ui-fieldLayout-body'><label title='Switches between inline format and two-column format' id='ooui-php-2' class='oo-ui-labelElement-label'>Inline</label><div class='oo-ui-fieldLayout-field'><div id='mw-diffPage-inline-toggle-switch' title='Switches between inline format and two-column format' aria-checked='false' tabindex='0' role='switch' aria-labelledby='ooui-php-2' class='oo-ui-widget oo-ui-widget-enabled oo-ui-toggleWidget oo-ui-toggleWidget-off oo-ui-toggleSwitchWidget' data-ooui='{"_":"OO.ui.ToggleSwitchWidget","href":"\/w\/index.php?title=Module:table&curid=5122966&diff=82733053&oldid=82709639&diff-type=inline","value":false,"title":"Switches between inline format and two-column format"}'><a href='/w/index.php?title=Module:table&curid=5122966&diff=82733053&oldid=82709639&diff-type=inline'></a></div></div></div></div></div></div><table class="diff diff-type-table diff-contentalign-left diff-editfont-monospace" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" class="diff-otitle diff-side-deleted"><div id="mw-diff-otitle1"><a href="/w/index.php?title=Module:table&oldid=82709639" title="Module:table">Revision as of 03:51, 21 November 2024</a> <a href="/w/index.php?title=Module:table&action=edit&oldid=82709639" title="Module:table">view source</a></div><div id="mw-diff-otitle2"><a href="/wiki/User:Theknightwho" class="mw-userlink" title="User:Theknightwho" data-mw-revid="82709639"><bdi>Theknightwho</bdi></a> (<a href="/wiki/User_talk:Theknightwho" class="mw-usertoollinks-talk" title="User talk:Theknightwho">talk</a> | <a href="/wiki/Special:Contributions/Theknightwho" class="mw-usertoollinks-contribs" title="Special:Contributions/Theknightwho">contribs</a>)<div class="mw-diff-usermetadata"><div class="mw-diff-userroles"><a href="/wiki/Wiktionary:Autopatrollers" title="Wiktionary:Autopatrollers">Autopatrollers</a>, <a href="/wiki/Wiktionary:Administrators" title="Wiktionary:Administrators">Administrators</a>, <a href="/wiki/Wiktionary:Template_editors" title="Wiktionary:Template editors">Template editors</a></div><div class="mw-diff-usereditcount">171,675 edits</div></div></div><div id="mw-diff-otitle3"> Various optimisations + add "raw" parameter to length(), which will ignore metamethods.</div><div id="mw-diff-otitle5"></div><div id="mw-diff-otitle4"><a href="/w/index.php?title=Module:table&diff=prev&oldid=82709639" title="Module:table" id="differences-prevlink">← Go to previous edit</a></div></td> <td colspan="2" class="diff-ntitle diff-side-added"><div id="mw-diff-ntitle1"><a href="/w/index.php?title=Module:table&oldid=82733053" title="Module:table">Revision as of 14:56, 22 November 2024</a> <a href="/w/index.php?title=Module:table&action=edit&oldid=82733053" title="Module:table">view source</a> </div><div id="mw-diff-ntitle2"><a href="/wiki/User:Theknightwho" class="mw-userlink" title="User:Theknightwho" data-mw-revid="82733053"><bdi>Theknightwho</bdi></a> (<a href="/wiki/User_talk:Theknightwho" class="mw-usertoollinks-talk" title="User talk:Theknightwho">talk</a> | <a href="/wiki/Special:Contributions/Theknightwho" class="mw-usertoollinks-contribs" title="Special:Contributions/Theknightwho">contribs</a>)<div class="mw-diff-usermetadata"><div class="mw-diff-userroles"><a href="/wiki/Wiktionary:Autopatrollers" title="Wiktionary:Autopatrollers">Autopatrollers</a>, <a href="/wiki/Wiktionary:Administrators" title="Wiktionary:Administrators">Administrators</a>, <a href="/wiki/Wiktionary:Template_editors" title="Wiktionary:Template editors">Template editors</a></div><div class="mw-diff-usereditcount">171,675 edits</div></div></div><div id="mw-diff-ntitle3"> Optimisation for deepEquals: if a key is a table but is actually present in both tables being checked, it can use the fast check instead of the laborious check. The laborious check should only be used if there's a reason to look for a structurally-equivalent key instead.</div><div id="mw-diff-ntitle5"></div><div id="mw-diff-ntitle4"><a href="/w/index.php?title=Module:table&diff=next&oldid=82733053" title="Module:table" id="differences-nextlink">Go to next edit →</a></div></td> </tr><tr> <td colspan="2" class="diff-lineno">Line 442:</td> <td colspan="2" class="diff-lineno">Line 442:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> -- If include_mt is set, check the metatables are equivalent.</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> -- If include_mt is set, check the metatables are equivalent.</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_3_1_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_1_0_rhs"></a> <ins class="diffchange diffchange-inline">if include_mt and </ins>not is_equivalent(getmetatable(a), getmetatable(b), memo, true)<ins class="diffchange diffchange-inline"> then</ins></div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> if (</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> include_mt and</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_1_0_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_3_1_lhs"></a> <del class="diffchange diffchange-inline"> </del>not is_equivalent(getmetatable(a), getmetatable(b), memo, true)</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> ) then</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Fast check: iterate over keys in a with `next` (which circumvents metamethods), checking if an equivalent value exists at the same key in b. Any tables-as-keys are set aside for the laborious check<del class="diffchange diffchange-inline"> instead</del>.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Fast check: iterate over<ins class="diffchange diffchange-inline"> the</ins> keys in <ins class="diffchange diffchange-inline">`</ins>a<ins class="diffchange diffchange-inline">`</ins> with `next` (which circumvents metamethods), checking if an equivalent value exists at the same key in <ins class="diffchange diffchange-inline">`</ins>b<ins class="diffchange diffchange-inline">`</ins>. Any tables-as-keys<ins class="diffchange diffchange-inline"> that aren't found in the other table</ins> are set aside for the laborious check.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> local tablekeys_a, tablekeys_b, kb</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> local tablekeys_a, tablekeys_b, kb</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> for ka, va in next, a do</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> for ka, va in next, a do</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> <del class="diffchange diffchange-inline">if</del> <del class="diffchange diffchange-inline">type(ka)</del> <del class="diffchange diffchange-inline">=</del>= <del class="diffchange diffchange-inline">"table"</del> <del class="diffchange diffchange-inline">then</del></div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> <ins class="diffchange diffchange-inline">local</ins> <ins class="diffchange diffchange-inline">vb</ins> = <ins class="diffchange diffchange-inline">rawget(b,</ins> <ins class="diffchange diffchange-inline">ka)</ins></div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div><del class="diffchange diffchange-inline"> </del> if <del class="diffchange diffchange-inline">not</del> <del class="diffchange diffchange-inline">tablekeys_a</del> then</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> if <ins class="diffchange diffchange-inline">vb</ins> <ins class="diffchange diffchange-inline">== nil</ins> then</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- If `ka` isn't in `b`, `a` and `b` can't be equivalent unless it's a table.</div></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_16_0_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_9_0_lhs"></a><del class="diffchange diffchange-inline"> </del> tablekeys_a<del class="diffchange diffchange-inline"> = {</del>[ka] = va<del class="diffchange diffchange-inline">}</del></div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_24_0_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_10_0_rhs"></a> <ins class="diffchange diffchange-inline"> if</ins> type(<ins class="diffchange diffchange-inline">ka</ins>) <ins class="diffchange diffchange-inline">~</ins>= "table" then</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> else</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_14_3_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_12_0_lhs"></a> tablekeys_a<del class="diffchange diffchange-inline">[ka]</del> = <del class="diffchange diffchange-inline">va</del></div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> end</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> else</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> local vb = rawget(b, ka)</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Faster to avoid recursion if possible, as we know va is not nil.</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_16_2_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_12_5_lhs"></a> <del class="diffchange diffchange-inline"> if vb == nil or</del> not is_equivalent(va, vb, memo, include_mt) then</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Otherwise, `a` and `b` can only be equivalent if `b` has a key that's not in `a` but is equivalent to `ka`.</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- This is found via the laborious check, so set `ka` aside for that. </div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> elseif not tablekeys_a then</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_12_0_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_14_3_rhs"></a> tablekeys_a = <ins class="diffchange diffchange-inline">{}</ins></div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_9_0_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_16_0_rhs"></a> tablekeys_a[ka] = va</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Otherwise, if `ka` exists in `a` and `b`, `va` and `vb` must be equivalent.</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_12_5_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_16_2_rhs"></a> <ins class="diffchange diffchange-inline">elseif</ins> not is_equivalent(va, vb, memo, include_mt) then</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> return false</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Iterate over b with `next` simultaneously, to check it's the same size and to <del class="diffchange diffchange-inline">grab</del> any tables-as-keys <del class="diffchange diffchange-inline">for</del> the laborious check<del class="diffchange diffchange-inline">, but also separately, since it might iterate in a different order, as this is unpredictable in Lua</del>.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Iterate over <ins class="diffchange diffchange-inline">`</ins>b<ins class="diffchange diffchange-inline">`</ins> with `next` simultaneously, to check it's the same size and to <ins class="diffchange diffchange-inline">find</ins> any tables-as-keys <ins class="diffchange diffchange-inline">that need</ins> the laborious check.</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> local vb</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> kb, vb = next(b, kb)</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> kb, vb = next(b, kb)</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Fail if b runs out of key/value pairs too early.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Fail if <ins class="diffchange diffchange-inline">`</ins>b<ins class="diffchange diffchange-inline">`</ins> runs out of key/value pairs too early.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> if kb == nil then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> if kb == nil then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- If `kb` is a table not found in `a`, set it aside for the laborious check.</div></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_10_0_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_24_0_lhs"></a> <del class="diffchange diffchange-inline">elseif</del> type(<del class="diffchange diffchange-inline">kb</del>) <del class="diffchange diffchange-inline">=</del>= "table" then</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Note: if it is in `a`, it doesn't need the laborious check, since the values will be compared during this loop.</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> elseif type(kb) == "table" and rawget(a, kb) == nil then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> if not tablekeys_b then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> if not tablekeys_b then</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> tablekeys_b = {<del class="diffchange diffchange-inline">[kb] = vb</del>}</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> tablekeys_b = {}</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> else</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_30_0_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_28_1_lhs"></a><del class="diffchange diffchange-inline"> </del> tablekeys_b[kb] = vb</div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_28_1_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_30_0_rhs"></a> tablekeys_b[kb] = vb</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Fail if there are too many key/value pairs in b.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Fail if there are too many key/value pairs in <ins class="diffchange diffchange-inline">`</ins>b<ins class="diffchange diffchange-inline">`</ins>.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> if next(b, kb) ~= nil then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> if next(b, kb) ~= nil then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- If tablekeys_a == tablekeys_b they must be both nil, meaning <del class="diffchange diffchange-inline">there</del> <del class="diffchange diffchange-inline">are</del> <del class="diffchange diffchange-inline">no</del> tables<del class="diffchange diffchange-inline">-</del>as<del class="diffchange diffchange-inline">-keys</del> <del class="diffchange diffchange-inline">to check</del>, so <del class="diffchange diffchange-inline">success</del>.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- If tablekeys_a == tablekeys_b they must be both nil, meaning <ins class="diffchange diffchange-inline">that</ins> <ins class="diffchange diffchange-inline">neither</ins> <ins class="diffchange diffchange-inline">had</ins> tables<ins class="diffchange diffchange-inline"> </ins>as <ins class="diffchange diffchange-inline">keys</ins>, so <ins class="diffchange diffchange-inline">there's nothing left to check</ins>.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> elseif tablekeys_a == tablekeys_b then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> elseif tablekeys_a == tablekeys_b then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return true</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return true</div></td> </tr> <tr> <td colspan="2" class="diff-lineno">Line 488:</td> <td colspan="2" class="diff-lineno">Line 487:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Laborious check: for each table-as-key in tablekeys_a, iterate over the pool in tablekeys_b looking for an equivalent key/value pair. If one if found, end the search and remove the match from tablekeys_b, to ensure one-to-one correspondence. If all keys in tablekeys_a match, tablekeys_b will be empty <del class="diffchange diffchange-inline">if</del> the two are equivalent.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Laborious check: for each table-as-key in <ins class="diffchange diffchange-inline">`</ins>tablekeys_a<ins class="diffchange diffchange-inline">`</ins>, iterate over the pool in <ins class="diffchange diffchange-inline">`</ins>tablekeys_b<ins class="diffchange diffchange-inline">`</ins> looking for an equivalent key/value pair. If one if found, end the search and remove the match from <ins class="diffchange diffchange-inline">`</ins>tablekeys_b<ins class="diffchange diffchange-inline">`</ins>, to ensure one-to-one correspondence. If all keys in <ins class="diffchange diffchange-inline">`</ins>tablekeys_a<ins class="diffchange diffchange-inline">`</ins> match, <ins class="diffchange diffchange-inline">`</ins>tablekeys_b<ins class="diffchange diffchange-inline">`</ins> will be empty <ins class="diffchange diffchange-inline">iff</ins> the two are equivalent.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> for ka, va in next, tablekeys_a do</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> for ka, va in next, tablekeys_a do</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> local kb</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> local kb</div></td> </tr> <tr> <td colspan="2" class="diff-lineno">Line 494:</td> <td colspan="2" class="diff-lineno">Line 493:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> local vb</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> local vb</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> kb, vb = next(tablekeys_b, kb)</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> kb, vb = next(tablekeys_b, kb)</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Fail if tablekeys_b runs out of keys, as ka still hasn't matched.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Fail if <ins class="diffchange diffchange-inline">`</ins>tablekeys_b<ins class="diffchange diffchange-inline">`</ins> runs out of keys, as <ins class="diffchange diffchange-inline">`</ins>ka<ins class="diffchange diffchange-inline">`</ins> still hasn't matched.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> if kb == nil then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> if kb == nil then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return false</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return false</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Keys <del class="diffchange diffchange-inline">and values</del> must<del class="diffchange diffchange-inline"> both</del> be equivalent.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Keys<ins class="diffchange diffchange-inline">/value</ins> <ins class="diffchange diffchange-inline">pairs</ins> must be equivalent<ins class="diffchange diffchange-inline"> in order to match</ins>.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> elseif (</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> elseif (</div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Check values first for speed, since they might not be tables.</div></td> </tr> <tr> <td class="diff-marker"><a class="mw-diff-movedpara-left" title="Paragraph was moved. Click to jump to new location." href="#movedpara_45_0_rhs">⚫</a></td> <td class="diff-deletedline diff-side-deleted"><div><a name="movedpara_43_0_lhs"></a> is_equivalent(ka, kb, memo, include_mt)<del class="diffchange diffchange-inline"> and</del></div></td> <td colspan="2" class="diff-empty diff-side-added"></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> is_equivalent(va, vb, memo, include_mt)</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> is_equivalent(va, vb, memo, include_mt)<ins class="diffchange diffchange-inline"> and</ins></div></td> </tr> <tr> <td colspan="2" class="diff-empty diff-side-deleted"></td> <td class="diff-marker"><a class="mw-diff-movedpara-right" title="Paragraph was moved. Click to jump to old location." href="#movedpara_43_0_lhs">⚫</a></td> <td class="diff-addedline diff-side-added"><div><a name="movedpara_45_0_rhs"></a> is_equivalent(ka, kb, memo, include_mt)</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> ) then</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> ) then</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Remove matched key from the pool.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Remove matched key from the pool<ins class="diffchange diffchange-inline">, and break the inner loop</ins>.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> tablekeys_b[kb] = nil</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> tablekeys_b[kb] = nil</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> break</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> break</div></td> </tr> <tr> <td colspan="2" class="diff-lineno">Line 508:</td> <td colspan="2" class="diff-lineno">Line 508:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> -- Success iff tablekeys_b is now empty.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> -- Success iff <ins class="diffchange diffchange-inline">`</ins>tablekeys_b<ins class="diffchange diffchange-inline">`</ins> is now empty.</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> return next(tablekeys_b) == nil</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> return next(tablekeys_b) == nil</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> end</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> end</div></td> </tr>  </table><hr class='diff-hr' id='mw-oldid' /> <h2 class='diff-currentversion-title'>Revision as of 14:56, 22 November 2024</h2> <div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><div class="documentation" style="display:block; clear:both"> <hr /> <dl class="plainlinks" style="font-size: smaller;"><dd>The following <a href="/wiki/Help:Documenting_templates_and_modules" title="Help:Documenting templates and modules">documentation</a> is located at <a href="/wiki/Module:table/documentation" title="Module:table/documentation">Module:table/documentation</a>. [<a class="external text" href="https://en.wiktionary.org/w/index.php?title=Module:table/documentation&action=edit">edit</a>]</dd><dd> Useful links: <a href="/wiki/Special:PrefixIndex/Module:table/" title="Special:PrefixIndex/Module:table/">subpage list</a> • <a class="external text" href="https://en.wiktionary.org/w/index.php?title=Special%3AWhatLinksHere%2FModule%3Atable&hideredirs=1&hidetrans=1">links</a> • <a class="external text" href="https://en.wiktionary.org/w/index.php?title=Special%3AWhatLinksHere%2FModule%3Atable&hidelinks=1&hideredirs=1">transclusions</a> • <a href="/w/index.php?title=Module:table/testcases&action=edit&redlink=1" class="new" title="Module:table/testcases (page does not exist)">testcases</a> • <a href="/wiki/Module:table/sandbox" title="Module:table/sandbox">sandbox</a> (<a class="external text" href="https://en.wiktionary.org/w/index.php?title=Special%3AComparePages&page1=Module%3Atable&page2=Module%3Atable%2Fsandbox">diff</a>)</dd></dl> 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 <a href="/wiki/Module:array" title="Module:array">Module:array</a>. Functions by what they do: <ul><li>Create a new table: <ul><li><code class="n">shallowcopy</code>, <code class="n">deepcopy</code>, <code class="n">removeDuplicates</code>, <code class="n">numKeys</code>, <code class="n">compressSparseArray</code>, <code class="n">keysToList</code>, <code class="n">reverse</code>, <code class="n">invert</code>, <code class="n">listToSet</code></li></ul></li> <li>Create an array: <ul><li><code class="n">removeDuplicates</code>, <code class="n">numKeys</code>, <code class="n">compressSparseArray</code>, <code class="n">keysToList</code>, <code class="n">reverse</code></li></ul></li> <li>Return information about the table: <ul><li><code class="n">size</code>, <code class="n">length</code>, <code class="n">contains</code>, <code class="n">keyFor</code>, <code class="n">isArray</code>, <code class="n">deepEquals</code></li></ul></li> <li>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 style="white-space:pre-wrap;" class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">1</code>): <ul><li><code class="n">removeDuplicates</code>, <code class="n">length</code>, <code class="n">contains</code>, <code class="n">serialCommaJoin</code>, <code class="n">reverseIpairs</code>, <code class="n">reverse</code>, <code class="n">invert</code>, <code class="n">listToSet</code>, <code class="n">isArray</code></li></ul></li> <li>Treat a table as a sparse array (that is, operate on values indexed by non-consecutive integers): <ul><li><code class="n">numKeys</code>, <code class="n">maxIndex</code>, <code class="n">compressSparseArray</code>, <code class="n">sparseConcat</code>, <code class="n">sparseIpairs</code></li></ul></li> <li>Generate an iterator: <ul><li><code class="n">sparseIpairs</code>, <code class="n">sortedPairs</code>, <code class="n">reverseIpairs</code></li></ul></li> <li>Other: <ul><li><code class="n">sparseConcat</code>, <code class="n">serialCommaJoin</code>, <code class="n">reverseConcat</code></li></ul></li></ul> The original version was a copy of <a href="https://en.wikipedia.org/wiki/Module:TableTools" class="extiw" title="w:Module:TableTools">Module:TableTools</a> on Wikipedia via <a href="https://commons.wikimedia.org/wiki/Module:TableTools" class="extiw" title="c:Module:TableTools">Module:TableTools</a> on Commons, but new functions have been added since then. <div id="toc" class="toc" role="navigation" aria-labelledby="mw-toc-heading"><input type="checkbox" role="button" id="toctogglecheckbox" class="toctogglecheckbox" style="display:none" /><div class="toctitle" lang="en" dir="ltr"><h2 id="mw-toc-heading">Contents</h2><label class="toctogglelabel" for="toctogglecheckbox"></label></div> <ul> <li class="toclevel-1"><a href="#Detailed_documentation">1 Detailed documentation</a> <ul> <li class="toclevel-2"><a href="#export.isPositiveInteger">1.1 export.isPositiveInteger</a></li> <li class="toclevel-2"><a href="#export.shallowcopy">1.2 export.shallowcopy</a></li> <li class="toclevel-2"><a href="#export.deepcopy">1.3 export.deepcopy</a></li> <li class="toclevel-2"><a href="#export.append">1.4 export.append</a></li> <li class="toclevel-2"><a href="#export.extendList">1.5 export.extendList</a></li> <li class="toclevel-2"><a href="#export.removeDuplicates">1.6 export.removeDuplicates</a></li> <li class="toclevel-2"><a href="#export.numKeys">1.7 export.numKeys</a></li> <li class="toclevel-2"><a href="#export.maxIndex">1.8 export.maxIndex</a></li> <li class="toclevel-2"><a href="#export.compressSparseArray">1.9 export.compressSparseArray</a></li> <li class="toclevel-2"><a href="#export.indexPairs">1.10 export.indexPairs</a></li> <li class="toclevel-2"><a href="#export.indexIpairs">1.11 export.indexIpairs</a></li> <li class="toclevel-2"><a href="#export.sparseIpairs">1.12 export.sparseIpairs</a></li> <li class="toclevel-2"><a href="#export.size">1.13 export.size</a></li> <li class="toclevel-2"><a href="#export.length">1.14 export.length</a></li> <li class="toclevel-2"><a href="#export.deepEquals">1.15 export.deepEquals</a></li> <li class="toclevel-2"><a href="#export.getNested">1.16 export.getNested</a></li> <li class="toclevel-2"><a href="#export.setNested">1.17 export.setNested</a></li> <li class="toclevel-2"><a href="#export.contains">1.18 export.contains</a></li> <li class="toclevel-2"><a href="#export.tableContains">1.19 export.tableContains</a></li> <li class="toclevel-2"><a href="#export.insertIfNot">1.20 export.insertIfNot</a></li> <li class="toclevel-2"><a href="#export.keyFor">1.21 export.keyFor</a></li> <li class="toclevel-2"><a href="#export.keysToList">1.22 export.keysToList</a></li> <li class="toclevel-2"><a href="#export.sortedPairs">1.23 export.sortedPairs</a></li> <li class="toclevel-2"><a href="#export.reverseIpairs">1.24 export.reverseIpairs</a></li> <li class="toclevel-2"><a href="#export.reduce">1.25 export.reduce</a></li> <li class="toclevel-2"><a href="#export.apply">1.26 export.apply</a></li> <li class="toclevel-2"><a href="#export.all">1.27 export.all</a></li> <li class="toclevel-2"><a href="#export.any">1.28 export.any</a></li> <li class="toclevel-2"><a href="#export.serialCommaJoin">1.29 export.serialCommaJoin</a></li> <li class="toclevel-2"><a href="#export.sparseConcat">1.30 export.sparseConcat</a></li> <li class="toclevel-2"><a href="#export.reverse">1.31 export.reverse</a></li> <li class="toclevel-2"><a href="#export.reverseConcat">1.32 export.reverseConcat</a></li> <li class="toclevel-2"><a href="#export.invert">1.33 export.invert</a></li> <li class="toclevel-2"><a href="#export.listToSet">1.34 export.listToSet</a></li> <li class="toclevel-2"><a href="#export.isArray">1.35 export.isArray</a></li> <li class="toclevel-2"><a href="#export.alias">1.36 export.alias</a></li> </ul> </li> </ul> </div> <div class="mw-heading mw-heading2"><h2 id="Detailed_documentation">Detailed documentation</h2></div> <div class="mw-heading mw-heading3"><h3 id="export.isPositiveInteger">export.isPositiveInteger</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.isPositiveInteger(v)</code> Return 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. <div class="mw-heading mw-heading3"><h3 id="export.shallowcopy">export.shallowcopy</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.shallowcopy(orig)</code> Return a clone of an object. If the object is 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. <div class="mw-heading mw-heading3"><h3 id="export.deepcopy">export.deepcopy</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.deepcopy(orig, metatableFlag, keepLoadedData)</code> Recursive deep copy function. Preserves copied identities of subtables. A more powerful version of <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">mw.clone</code>, with customizable options. <ul><li>By default, metatables are copied, except for data loaded via mw.loadData (see below). If <code>metatableFlag</code> is set to "none", the copy will not have any metatables at all. Conversely, if <code>metatableFlag</code> is set to "keep", then the cloned table (and all its members) will have the exact same metatable as their original version.</li> <li>If <code>keepLoadedData</code> is true, then any data loaded via <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">mw.loadData</code> will not be copied, and the original will be used instead. This is useful in iterative contexts where it is necessary to copy data being destructively modified, because objects loaded via mw.loadData are immutable.</li> <li><code>Notes</code>: <ol><li>Protected metatables will not be copied (i.e. those hidden behind a metatable metamethod), as they are not accessible by Lua's design. Instead, the output of the metatable method will be used instead.</li> <li>When iterating over the table, the pairs metamethod is ignored, since this can prevent the table from being properly cloned.</li> <li>Data loaded via mw.loadData is a special case in two ways: the metatable is stripped, because otherwise the cloned table throws errors when accessed; in addition, the pairs metamethod is used, since otherwise the cloned table would be empty.</li></ol></li></ul> <div class="mw-heading mw-heading3"><h3 id="export.append">export.append</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.append(...)</code> Append any number of tables together and returns the result. Compare the Lisp expression <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">(append list1 list2 ...)</code>. <div class="mw-heading mw-heading3"><h3 id="export.extendList">export.extendList</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.extendList(list, new_items, options)</code> Extend an existing list by a new list, modifying the existing list in-place. Compare the Python expression <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">list.extend(new_items)</code>. <code>options</code> is an optional table of additional options to control the behavior of the operation. The following options are recognized: <ul><li><code>insertIfNot</code>: Use <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">export.insertIfNot()</code> instead of <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">table.insert()</code>, which ensures that duplicate items do not get inserted (at the cost of an O((M+N)*N) operation, where M = #list and N = #new_items).</li> <li><code>key</code>: As in <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">insertIfNot()</code>. Ignored otherwise.</li> <li><code>pos</code>: As in <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">insertIfNot()</code>. Ignored otherwise.</li></ul> <div class="mw-heading mw-heading3"><h3 id="export.removeDuplicates">export.removeDuplicates</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.removeDuplicates(t)</code> Remove 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. <div class="mw-heading mw-heading3"><h3 id="export.numKeys">export.numKeys</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.numKeys(t)</code> Given a table, return an array containing all positive integer keys, sorted in numerical order. <div class="mw-heading mw-heading3"><h3 id="export.maxIndex">export.maxIndex</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.maxIndex(t)</code> Return the highest positive integer index of a table or array that possibly has holes in it, or otherwise 0 if no positive integer keys are found. Note that this differs from <code>table.maxn</code>, which returns the highest positive numerical index, even if it is not an integer. <div class="mw-heading mw-heading3"><h3 id="export.compressSparseArray">export.compressSparseArray</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.compressSparseArray(t)</code> This takes a list with one or more nil values, and removes the nil values while preserving the order, so that the list can be safely traversed with ipairs. <div class="mw-heading mw-heading3"><h3 id="export.indexPairs">export.indexPairs</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.indexPairs(t, raw)</code> An iterator which works like <code>pairs</code>, except that it also respects the <code>index</code> metamethod. This works by iterating over the input table with <code>pairs</code>, followed by the table at its <code></code><code>index</code> metamethod (if any). This is then repeated for that table's <code>index</code> table and so on, with any repeated keys being skipped over, until there are no more tables, or a table repeats (so as to prevent an infinite loop). If <code></code><code>index</code> is a function, however, then it is ignored, since there is no way to iterate over its return values. A <code>pairs</code> metamethod will be respected for any given table instead of iterating over it directly, but these will be ignored if the <code>raw</code> flag is set. Note: this function can be used as a <code></code><code>pairs</code> metamethod. In such cases, it does not call itself, since this would cause an infinite loop, so it treats the relevant table as having no <code>pairs</code> metamethod. Other <code></code><code>pairs</code> metamethods on subsequent tables will still be respected. <div class="mw-heading mw-heading3"><h3 id="export.indexIpairs">export.indexIpairs</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.indexIpairs(t, raw)</code> An iterator which works like <code>ipairs</code>, except that it also respects the <code>index</code> metamethod. This works by looking up values in the table, iterating integers from key <code>1</code> until no value is found. An <code></code><code>ipairs</code> metamethod for the input table will be respected, but it will be ignored if the <code>raw</code> flag is set. Note: this function can be used as an <code>ipairs</code> metamethod. In such cases, it does not call itself, since this would cause an infinite loop, so it treats the input table as having no <code></code><code>ipairs</code> metamethod. <div class="mw-heading mw-heading3"><h3 id="export.sparseIpairs">export.sparseIpairs</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.sparseIpairs(t)</code> This is an iterator for sparse arrays. It can be used like ipairs, but can handle nil values. <div class="mw-heading mw-heading3"><h3 id="export.size">export.size</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.size(t)</code> This returns the size of a key/value pair table. For arrays, it is more efficient to use <code>export.length</code>. <div class="mw-heading mw-heading3"><h3 id="export.length">export.length</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.length(t, raw)</code> This returns the length of a table, or the first integer key n counting from 1 such that t[n + 1] is nil. It is a more reliable form of the operator #, which can become unpredictable under certain circumstances, and therefore should not be used when dealing with arbitrary inputs. This mainly occurs when metamethods are involved (e.g. with data loaded via mw.loadData); however, it can occur in other circumstances too, due to how Lua's implementation of tables works under the hood, so this function should always be used instead of the length operator <code>#</code> when dealing with arbitrary tables (e.g. from inputs). If <code>raw</code> is set, then metamethods will be ignored, giving the true table length. <div class="mw-heading mw-heading3"><h3 id="export.deepEquals">export.deepEquals</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.deepEquals(a, b, include_mt)</code> Recursively compare two values that may be tables, and returns true if all key-value pairs are structurally equivalent. Note that this handles arbitrary nesting of subtables (including recursive nesting) to any depth, for keys as well as values. If <code>include_mt</code> is true, then metatables are also compared. <div class="mw-heading mw-heading3"><h3 id="export.getNested">export.getNested</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.getNested(t, ...)</code> Given a table and an arbitrary number of keys, will successively access subtables using each key in turn, returning the value at the final key. For example, if <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">t</code> is <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{[1] = {[2] = {[3] = "foo"}}}</code>, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">export.getNested(t, 1, 2, 3)</code> will return <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"foo"</code>. If no subtable exists for a given key value, returns nil, but will throw an error if a non-table is found at an intermediary key. <div class="mw-heading mw-heading3"><h3 id="export.setNested">export.setNested</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.setNested(t, ...)</code> Given a table, value and an arbitrary number of keys, will successively access subtables using each key in turn, and sets the value at the final key. For example, if <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">t</code> is <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{}</code>, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">export.setNested(t, "foo", 1, 2, 3)</code> will modify <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">t</code> to <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{[1] = {[2] = {[3] = "foo"} } }</code>. If no subtable exists for a given key value, one will be created, but the function will throw an error if a non-table value is found at an intermediary key. Note: the parameter order (table, value, keys) differs from functions like rawset, because the number of keys can be arbitrary. This is to avoid situations where an additional argument must be appended to arbitrary lists of variables, which can be awkward and error-prone: for example, when handling variable arguments (<code style="white-space:pre-wrap;" class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">...</code>) or function return values. <div class="mw-heading mw-heading3"><h3 id="export.contains">export.contains</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.contains(list, x, options)</code> Given a list and a value to be found, return true if the value is in the array portion of the list. Comparison is by value, using <code>deepEquals</code>. <div class="mw-heading mw-heading3"><h3 id="export.tableContains">export.tableContains</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.tableContains(tbl, x)</code> Given a general table and a value to be found, return true if the value is in either the array or hashmap portion of the table. Comparison is by value, using <code>deepEquals</code>. <code>NOTE</code>: This used to do shallow comparison by default and accepted a third "deepCompare" param to do deep comparison. This param is still accepted but now ignored. <div class="mw-heading mw-heading3"><h3 id="export.insertIfNot">export.insertIfNot</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.insertIfNot(list, new_item, options)</code> Given a <code>list</code> and a <code>new_item</code> to be inserted, append the value to the end of the list if not already present (or insert at an arbitrary position, if <code>options.pos</code> is given; see below). Comparison is by value, using <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">deepEquals</code>. <code>options</code> is an optional table of additional options to control the behavior of the operation. The following options are recognized: <ul><li><code>pos</code>: Position at which insertion happens (i.e. before the existing item at position <code>pos</code>).</li> <li><code>key</code>: Function of one argument to return a comparison key, as with <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">deepEquals</code>. The key function is applied to both <code>item</code> and the existing item in <code>list</code> to compare against, and the comparison is done against the results. This is useful when inserting a complex structure into an existing list while avoiding duplicates.</li> <li><code>combine</code>: Function of three arguments (the existing item, the new item and the position, respectively) to combine an existing item with <code>new_item</code>, when <code>new_item</code> is found in <code>list</code>. If unspecified, the existing item is left alone.</li></ul> Return <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">false</code> if entry already found, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">true</code> if inserted. For compatibility, <code>pos</code> can be specified directly as the third argument in place of <code>options</code>, but this is not recommended for new code. <code>NOTE</code>: This function is O(N) in the size of the existing list. If you use this function in a loop to insert several items, you will get O(M*(M+N)) behavior, effectively O((M+N)^2). Thus it is not recommended to use this unless you are sure the total number of items will be small. (An alternative for large lists is to insert all the items without checking for duplicates, and use <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">removeDuplicates()</code> at the end.) <div class="mw-heading mw-heading3"><h3 id="export.keyFor">export.keyFor</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.keyFor(t, valueToFind)</code> Finds key for specified value in a given table. Roughly equivalent to reversing the key-value pairs in the table: <ul><li><code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">reversed_table = { [value1] = key1, [value2] = key2, ... }</code> and then returning <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">reversed_table[valueToFind]</code>.</li></ul> The value can only be a string or a number (not nil, a boolean, a table, or a function). Only reliable if there is just one key with the specified value. Otherwise, the function returns the first key found, and the output is unpredictable. <div class="mw-heading mw-heading3"><h3 id="export.keysToList">export.keysToList</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.keysToList(t, keySort)</code> Return a list of the keys in a table, sorted using either the default table.sort function or a custom keySort function. If there are only numerical keys, numKeys is probably more efficient. <div class="mw-heading mw-heading3"><h3 id="export.sortedPairs">export.sortedPairs</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.sortedPairs(t, keySort)</code> Iterates through a table, with the keys sorted using the keysToList function. If there are only numerical keys, sparseIpairs is probably more efficient. <div class="mw-heading mw-heading3"><h3 id="export.reverseIpairs">export.reverseIpairs</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.reverseIpairs(t)</code> This function lacks documentation. Please add a description of its usages, inputs and outputs, or its difference from similar functions, or make it local to remove it from the function list. <div class="mw-heading mw-heading3"><h3 id="export.reduce">export.reduce</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.reduce(t, func, i, j, step)</code> Given an array <code>list</code> and function <code>func</code>, iterate through the array applying <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">func(r, k, v)</code>, and returning the result, where <code>r</code> is the value calculated so far, <code>k</code> is an index, and <code>v</code> is the value at index <code>k</code>. For example, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">reduce(array, function(a, b) return a + b end)</code> will return the sum of <code>array</code>. Optional arguments: <ul><li><code>i</code>: start index; negative values count from the end of the array</li> <li><code>j</code>: end index; negative values count from the end of the array</li> <li><code>step</code>: step increment These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or backwards and by how much, based on these inputs (see examples below for default behaviours).</li></ul> <code>Examples</code>: <ol><li>No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default).</li> <li>step=-1 results in backward iteration from the end to the start in steps of 1.</li> <li>i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1).</li> <li>j=-3 results in forward iteration from the start to the 3rd last index.</li> <li>j=-3, step=-1 results in backward iteration from the end to the 3rd last index. Note: directionality generally only matters for <code>reduce</code>, but values of step > 1 (or step < -1) still affect the return value of <code>apply</code>.</li></ol> <div class="mw-heading mw-heading3"><h3 id="export.apply">export.apply</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.apply(t, func, i, j, step)</code> Given an array <code>list</code> and function <code>func</code>, iterate through the array applying <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">func(k, v)</code> (where <code>k</code> is an index, and <code>v</code> is the value at index <code>k</code>), and return an array of the resulting values. For example, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">apply(array, function(a) return 2*a end)</code> will return an array where each member of <code>array</code> has been doubled. Optional arguments: <ul><li><code>i</code>: start index; negative values count from the end of the array</li> <li><code>j</code>: end index; negative values count from the end of the array</li> <li><code>step</code>: step increment These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or backwards and by how much, based on these inputs (see examples below for default behaviours).</li></ul> <code>Examples</code>: <ol><li>No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default).</li> <li>step=-1 results in backward iteration from the end to the start in steps of 1.</li> <li>i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1).</li> <li>j=-3 results in forward iteration from the start to the 3rd last index.</li> <li>j=-3, step=-1 results in backward iteration from the end to the 3rd last index. Note: directionality makes the most difference for <code>reduce</code>, but values of step > 1 (or step < -1) still affect the return value of <code>apply</code>.</li></ol> <div class="mw-heading mw-heading3"><h3 id="export.all">export.all</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.all(t, func, i, j, step)</code> Given an array <code>list</code> and function <code>func</code>, iterate through the array applying <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">func(k, v)</code> (where <code>k</code> is an index, and <code>v</code> is the value at index <code>k</code>), and returning whether the function is true for all iterations. Optional arguments: <ul><li><code>i</code>: start index; negative values count from the end of the array</li> <li><code>j</code>: end index; negative values count from the end of the array</li> <li><code>step</code>: step increment These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or backwards and by how much, based on these inputs (see examples below for default behaviours).</li></ul> <code>Examples</code>: <ol><li>No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default).</li> <li>step=-1 results in backward iteration from the end to the start in steps of 1.</li> <li>i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1).</li> <li>j=-3 results in forward iteration from the start to the 3rd last index.</li> <li>j=-3, step=-1 results in backward iteration from the end to the 3rd last index.</li></ol> <div class="mw-heading mw-heading3"><h3 id="export.any">export.any</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.any(t, func, i, j, step)</code> Given an array <code>list</code> and function <code>func</code>, iterate through the array applying <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">func(k, v)</code> (where <code>k</code> is an index, and <code>v</code> is the value at index <code>k</code>), and returning whether the function is true for at least one iteration. Optional arguments: <ul><li><code>i</code>: start index; negative values count from the end of the array</li> <li><code>j</code>: end index; negative values count from the end of the array</li> <li><code>step</code>: step increment These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or backwards and by how much, based on these inputs (see examples below for default behaviours).</li></ul> <code>Examples</code>: <ol><li>No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default).</li> <li>step=-1 results in backward iteration from the end to the start in steps of 1.</li> <li>i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1).</li> <li>j=-3 results in forward iteration from the start to the 3rd last index.</li> <li>j=-3, step=-1 results in backward iteration from the end to the 3rd last index.</li></ol> <div class="mw-heading mw-heading3"><h3 id="export.serialCommaJoin">export.serialCommaJoin</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.serialCommaJoin(seq, options)</code> Joins an array with serial comma and serial conjunction, normally <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"and"</code>. An improvement on <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">mw.text.listToText</code>, which doesn't properly handle serial commas. <code>Options</code>: <ul><li><code>conj</code>: Conjunction to use; defaults to <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"and"</code>.</li> <li><code>punc</code>: Punctuation to use; default to <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">","</code>.</li> <li><code>dontTag</code>: Don't tag the serial comma and serial <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"and"</code>. For error messages, in which HTML cannot be used.</li></ul> <div class="mw-heading mw-heading3"><h3 id="export.sparseConcat">export.sparseConcat</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.sparseConcat(t, sep, i, j)</code> Concatenate all values in the table that are indexed by a number, in order. <ul><li><code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">sparseConcat{ a, nil, c, d }</code> => <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"acd"</code></li> <li><code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">sparseConcat{ nil, b, c, d }</code> => <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">"bcd"</code></li></ul> <div class="mw-heading mw-heading3"><h3 id="export.reverse">export.reverse</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.reverse(t)</code> Values of numeric keys in array portion of table are reversed: <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{ "a", "b", "c" }</code> -> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{ "c", "b", "a" }</code> <div class="mw-heading mw-heading3"><h3 id="export.reverseConcat">export.reverseConcat</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.reverseConcat(t, sep, i, j)</code> This function lacks documentation. Please add a description of its usages, inputs and outputs, or its difference from similar functions, or make it local to remove it from the function list. <div class="mw-heading mw-heading3"><h3 id="export.invert">export.invert</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.invert(list)</code> Invert a list. For example, <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">invert({ "a", "b", "c" })</code> -> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">{ a = 1, b = 2, c = 3 }</code> <div class="mw-heading mw-heading3"><h3 id="export.listToSet">export.listToSet</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.listToSet(list, value, ...)</code> Convert <code>list</code> (a table with a list of values) into a set (a table where those values are keys instead). This is a useful way to create a fast lookup table, since looking up a table key is much, much faster than iterating over the whole list to see if it contains a given value. By default, each item is given the value true. If the optional parameter <code>value</code> is a function or functor, then the value for each item is determined by calling it with the item key as the first parameter, plus any additional arguments passed to <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">listToSet</code>; if value is anything else, then it is used as the fixed value for every item. <div class="mw-heading mw-heading3"><h3 id="export.isArray">export.isArray</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.isArray(t)</code> Return true if all keys in the table are consecutive integers starting at 1. <div class="mw-heading mw-heading3"><h3 id="export.alias">export.alias</h3></div> <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">function export.alias(t, k, aliases)</code> Add a list of aliases for a given key to a table. The aliases must be given as a table. </div> <div class="mw-highlight mw-highlight-lang-lua mw-content-ltr mw-highlight-lines" dir="ltr"><pre><a href="#L-1"></a>--[[ <a href="#L-2"></a>------------------------------------------------------------------------------------ <a href="#L-3"></a>-- table (formerly TableTools) -- <a href="#L-4"></a>-- -- <a href="#L-5"></a>-- This module includes a number of functions for dealing with Lua tables. -- <a href="#L-6"></a>-- It is a meta-module, meant to be called from other Lua modules, and should -- <a href="#L-7"></a>-- not be called directly from #invoke. -- <a href="#L-8"></a>------------------------------------------------------------------------------------ <a href="#L-9"></a>--]] <a href="#L-10"></a> <a href="#L-11"></a>--[[ <a href="#L-12"></a> Inserting new values into a table using a local "index" variable, which is <a href="#L-13"></a> incremented each time, is faster than using "table.insert(t, x)" or <a href="#L-14"></a> "t[#t + 1] = x". See the talk page. <a href="#L-15"></a>]] <a href="#L-16"></a> <a href="#L-17"></a>local export = {} <a href="#L-18"></a> <a href="#L-19"></a>local collation_module = "Module:collation" <a href="#L-20"></a>local function_module = "Module:fun" <a href="#L-21"></a> <a href="#L-22"></a>local table = table <a href="#L-23"></a> <a href="#L-24"></a>local concat = table.concat <a href="#L-25"></a>local contains -- defined as export.contains <a href="#L-26"></a>local deep_copy -- defined as export.deepcopy <a href="#L-27"></a>local deep_equals -- defined as export.deepEquals <a href="#L-28"></a>local format = string.format <a href="#L-29"></a>local getmetatable = getmetatable <a href="#L-30"></a>local index_pairs -- defined as export.indexPairs <a href="#L-31"></a>local insert = table.insert <a href="#L-32"></a>local insert_if_not -- defined as export.insertIfNot <a href="#L-33"></a>local ipairs = ipairs <a href="#L-34"></a>local ipairs_default_iter = ipairs{export} <a href="#L-35"></a>local is_positive_integer -- defined as export.isPositiveInteger <a href="#L-36"></a>local keys_to_list -- defined as export.keysToList <a href="#L-37"></a>local next = next <a href="#L-38"></a>local num_keys -- defined as export.numKeys <a href="#L-39"></a>local pairs = pairs <a href="#L-40"></a>local pcall = pcall <a href="#L-41"></a>local rawequal = rawequal <a href="#L-42"></a>local rawget = rawget <a href="#L-43"></a>local require = require <a href="#L-44"></a>local select = select <a href="#L-45"></a>local setmetatable = setmetatable <a href="#L-46"></a>local sort = table.sort <a href="#L-47"></a>local sparse_ipairs -- defined as export.sparseIpairs <a href="#L-48"></a>local table_len -- defined as export.length <a href="#L-49"></a>local table_reverse -- defined as export.reverse <a href="#L-50"></a>local type = type <a href="#L-51"></a> <a href="#L-52"></a>local infinity = math.huge <a href="#L-53"></a> <a href="#L-54"></a>--[==[ <a href="#L-55"></a>Loaders for functions in other modules, which overwrite themselves with the target function when called. This ensures modules are only loaded when needed, retains the speed/convenience of locally-declared pre-loaded functions, and has no overhead after the first call, since the target functions are called directly in any subsequent calls.]==] <a href="#L-56"></a> local function is_callable(...) <a href="#L-57"></a> is_callable = require(function_module).is_callable <a href="#L-58"></a> return is_callable(...) <a href="#L-59"></a> end <a href="#L-60"></a> <a href="#L-61"></a> local function string_sort(...) <a href="#L-62"></a> string_sort = require(collation_module).string_sort <a href="#L-63"></a> return string_sort(...) <a href="#L-64"></a> end <a href="#L-65"></a> <a href="#L-66"></a>--[==[ <a href="#L-67"></a>Return true if the given value is a positive integer, and false if not. Although it doesn't operate on tables, it is <a href="#L-68"></a>included here as it is useful for determining whether a given table key is in the array part or the hash part of a <a href="#L-69"></a>table.]==] <a href="#L-70"></a>function export.isPositiveInteger(v) <a href="#L-71"></a> return type(v) == "number" and v >= 1 and v % 1 == 0 and v < infinity <a href="#L-72"></a>end <a href="#L-73"></a>is_positive_integer = export.isPositiveInteger <a href="#L-74"></a> <a href="#L-75"></a>--[==[ <a href="#L-76"></a>Return a clone of an object. If the object is 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.]==] <a href="#L-77"></a>function export.shallowcopy(orig) <a href="#L-78"></a> if type(orig) ~= "table" then <a href="#L-79"></a> return orig <a href="#L-80"></a> end <a href="#L-81"></a> local copy = {} <a href="#L-82"></a> for k, v in index_pairs(orig) do <a href="#L-83"></a> copy[k] = v <a href="#L-84"></a> end <a href="#L-85"></a> return copy <a href="#L-86"></a>end <a href="#L-87"></a> <a href="#L-88"></a>do <a href="#L-89"></a> local function rawpairs(t) <a href="#L-90"></a> return next, t <a href="#L-91"></a> end <a href="#L-92"></a> <a href="#L-93"></a> local function make_copy(orig, memo, mt_flag, keep_loaded_data) <a href="#L-94"></a> if type(orig) ~= "table" then <a href="#L-95"></a> return orig <a href="#L-96"></a> end <a href="#L-97"></a> local memoized = memo[orig] <a href="#L-98"></a> if memoized ~= nil then <a href="#L-99"></a> return memoized <a href="#L-100"></a> end <a href="#L-101"></a> local mt = getmetatable(orig) <a href="#L-102"></a> local loaded_data = mt and mt.mw_loadData <a href="#L-103"></a> if loaded_data and keep_loaded_data then <a href="#L-104"></a> memo[orig] = orig <a href="#L-105"></a> return orig <a href="#L-106"></a> end <a href="#L-107"></a> local copy = {} <a href="#L-108"></a> memo[orig] = copy <a href="#L-109"></a> for k, v in (loaded_data and pairs or rawpairs)(orig) do <a href="#L-110"></a> copy[make_copy(k, memo, mt_flag, keep_loaded_data)] = make_copy(v, memo, mt_flag, keep_loaded_data) <a href="#L-111"></a> end <a href="#L-112"></a> if loaded_data then <a href="#L-113"></a> return copy <a href="#L-114"></a> elseif mt_flag == "keep" then <a href="#L-115"></a> setmetatable(copy, mt) <a href="#L-116"></a> elseif mt_flag ~= "none" then <a href="#L-117"></a> setmetatable(copy, make_copy(mt, memo, mt_flag, keep_loaded_data)) <a href="#L-118"></a> end <a href="#L-119"></a> return copy <a href="#L-120"></a> end <a href="#L-121"></a> <a href="#L-122"></a> --[==[ <a href="#L-123"></a> Recursive deep copy function. Preserves copied identities of subtables. <a href="#L-124"></a> A more powerful version of {mw.clone}, with customizable options. <a href="#L-125"></a> * By default, metatables are copied, except for data loaded via mw.loadData (see below). If `metatableFlag` is set to "none", the copy will not have any metatables at all. Conversely, if `metatableFlag` is set to "keep", then the cloned table (and all its members) will have the exact same metatable as their original version. <a href="#L-126"></a> * If `keepLoadedData` is true, then any data loaded via {mw.loadData} will not be copied, and the original will be used instead. This is useful in iterative contexts where it is necessary to copy data being destructively modified, because objects loaded via mw.loadData are immutable. <a href="#L-127"></a> * Notes: <a href="#L-128"></a> *# Protected metatables will not be copied (i.e. those hidden behind a __metatable metamethod), as they are not <a href="#L-129"></a> accessible by Lua's design. Instead, the output of the __metatable method will be used instead. <a href="#L-130"></a> *# When iterating over the table, the __pairs metamethod is ignored, since this can prevent the table from being properly cloned. <a href="#L-131"></a> *# Data loaded via mw.loadData is a special case in two ways: the metatable is stripped, because otherwise the cloned table throws errors when accessed; in addition, the __pairs metamethod is used, since otherwise the cloned table would be empty.]==] <a href="#L-132"></a> function export.deepcopy(orig, metatableFlag, keepLoadedData) <a href="#L-133"></a> return make_copy(orig, {}, metatableFlag, keepLoadedData) <a href="#L-134"></a> end <a href="#L-135"></a> deep_copy = export.deepcopy <a href="#L-136"></a>end <a href="#L-137"></a> <a href="#L-138"></a>--[==[ <a href="#L-139"></a>Append any number of tables together and returns the result. Compare the Lisp expression {(append list1 list2 ...)}.]==] <a href="#L-140"></a>function export.append(...) <a href="#L-141"></a> local args, list, n = {...}, {}, 0 <a href="#L-142"></a> for i = 1, select("#", ...) do <a href="#L-143"></a> local t, j = args[i], 0 <a href="#L-144"></a> while true do <a href="#L-145"></a> j = j + 1 <a href="#L-146"></a> local v = t[j] <a href="#L-147"></a> if v == nil then <a href="#L-148"></a> break <a href="#L-149"></a> end <a href="#L-150"></a> n = n + 1 <a href="#L-151"></a> list[n] = v <a href="#L-152"></a> end <a href="#L-153"></a> end <a href="#L-154"></a> return list <a href="#L-155"></a>end <a href="#L-156"></a> <a href="#L-157"></a>--[==[ <a href="#L-158"></a>Extend an existing list by a new list, modifying the existing list in-place. Compare the Python expression <a href="#L-159"></a>{list.extend(new_items)}. <a href="#L-160"></a> <a href="#L-161"></a>`options` is an optional table of additional options to control the behavior of the operation. The following options are <a href="#L-162"></a>recognized: <a href="#L-163"></a>* `insertIfNot`: Use {export.insertIfNot()} instead of {table.insert()}, which ensures that duplicate items do not get <a href="#L-164"></a> inserted (at the cost of an O((M+N)*N) operation, where M = #list and N = #new_items). <a href="#L-165"></a>* `key`: As in {insertIfNot()}. Ignored otherwise. <a href="#L-166"></a>* `pos`: As in {insertIfNot()}. Ignored otherwise.]==] <a href="#L-167"></a>function export.extendList(list, new_items, options) <a href="#L-168"></a> local i, insert_if_not_option = 0, options and options.insertIfNot <a href="#L-169"></a> while true do <a href="#L-170"></a> i = i + 1 <a href="#L-171"></a> local item = new_items[i] <a href="#L-172"></a> if item == nil then <a href="#L-173"></a> return <a href="#L-174"></a> elseif insert_if_not_option then <a href="#L-175"></a> insert_if_not(list, item, options) <a href="#L-176"></a> else <a href="#L-177"></a> insert(list, item) <a href="#L-178"></a> end <a href="#L-179"></a> end <a href="#L-180"></a>end <a href="#L-181"></a> <a href="#L-182"></a>do <a href="#L-183"></a> local pos_nan, neg_nan <a href="#L-184"></a> <a href="#L-185"></a> --[==[ <a href="#L-186"></a> Remove 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.]==] <a href="#L-187"></a> function export.removeDuplicates(t) <a href="#L-188"></a> local list, seen, i, n = {}, {}, 0, 0 <a href="#L-189"></a> while true do <a href="#L-190"></a> i = i + 1 <a href="#L-191"></a> local v = t[i] <a href="#L-192"></a> if v == nil then <a href="#L-193"></a> return list <a href="#L-194"></a> end <a href="#L-195"></a> local memo_key <a href="#L-196"></a> if v == v then <a href="#L-197"></a> memo_key = v <a href="#L-198"></a> -- NaN <a href="#L-199"></a> elseif format("%f", v) == "nan" then <a href="#L-200"></a> if not pos_nan then <a href="#L-201"></a> pos_nan = {} <a href="#L-202"></a> end <a href="#L-203"></a> memo_key = pos_nan <a href="#L-204"></a> -- -NaN <a href="#L-205"></a> else <a href="#L-206"></a> if not neg_nan then <a href="#L-207"></a> neg_nan = {} <a href="#L-208"></a> end <a href="#L-209"></a> memo_key = neg_nan <a href="#L-210"></a> end <a href="#L-211"></a> if not seen[memo_key] then <a href="#L-212"></a> n = n + 1 <a href="#L-213"></a> list[n], seen[memo_key] = v, true <a href="#L-214"></a> end <a href="#L-215"></a> end <a href="#L-216"></a> return list <a href="#L-217"></a> end <a href="#L-218"></a>end <a href="#L-219"></a> <a href="#L-220"></a>--[==[ <a href="#L-221"></a>Given a table, return an array containing all positive integer keys, sorted in numerical order.]==] <a href="#L-222"></a>function export.numKeys(t) <a href="#L-223"></a> local nums, i = {}, 0 <a href="#L-224"></a> for k in index_pairs(t) do <a href="#L-225"></a> if is_positive_integer(k) then <a href="#L-226"></a> i = i + 1 <a href="#L-227"></a> nums[i] = k <a href="#L-228"></a> end <a href="#L-229"></a> end <a href="#L-230"></a> sort(nums) <a href="#L-231"></a> return nums <a href="#L-232"></a>end <a href="#L-233"></a>num_keys = export.numKeys <a href="#L-234"></a> <a href="#L-235"></a>--[==[ <a href="#L-236"></a>Return the highest positive integer index of a table or array that possibly has holes in it, or otherwise 0 if no positive integer keys are found. Note that this differs from `table.maxn`, which returns the highest positive numerical index, even if it is not an integer.]==] <a href="#L-237"></a>function export.maxIndex(t) <a href="#L-238"></a> local max = 0 <a href="#L-239"></a> for k in index_pairs(t) do <a href="#L-240"></a> if k > max then <a href="#L-241"></a> max = k <a href="#L-242"></a> end <a href="#L-243"></a> end <a href="#L-244"></a> return is_positive_integer(max) and max or 0 <a href="#L-245"></a>end <a href="#L-246"></a> <a href="#L-247"></a>--[==[ <a href="#L-248"></a>This takes a list with one or more nil values, and removes the nil values while preserving the order, so that the list can be safely traversed with ipairs.]==] <a href="#L-249"></a>function export.compressSparseArray(t) <a href="#L-250"></a> local list, keys, i = {}, num_keys(t), 0 <a href="#L-251"></a> while true do <a href="#L-252"></a> i = i + 1 <a href="#L-253"></a> local k = keys[i] <a href="#L-254"></a> if k == nil then <a href="#L-255"></a> return list <a href="#L-256"></a> end <a href="#L-257"></a> list[i] = t[k] <a href="#L-258"></a> end <a href="#L-259"></a>end <a href="#L-260"></a> <a href="#L-261"></a>do <a href="#L-262"></a> local current <a href="#L-263"></a> --[==[ <a href="#L-264"></a> An iterator which works like `pairs`, except that it also respects the `__index` metamethod. This works by iterating over the input table with `pairs`, followed by the table at its `__index` metamethod (if any). This is then repeated for that table's `__index` table and so on, with any repeated keys being skipped over, until there are no more tables, or a table repeats (so as to prevent an infinite loop). If `__index` is a function, however, then it is ignored, since there is no way to iterate over its return values. <a href="#L-265"></a> <a href="#L-266"></a> A `__pairs` metamethod will be respected for any given table instead of iterating over it directly, but these will be ignored if the `raw` flag is set. <a href="#L-267"></a> <a href="#L-268"></a> Note: this function can be used as a `__pairs` metamethod. In such cases, it does not call itself, since this would cause an infinite loop, so it treats the relevant table as having no `__pairs` metamethod. Other `__pairs` metamethods on subsequent tables will still be respected.]==] <a href="#L-269"></a> function export.indexPairs(t, raw) <a href="#L-270"></a> -- If there's no metatable, result is identical to `pairs`. <a href="#L-271"></a> -- To prevent infinite loops, act like `pairs` if `current` is set with `t`, which means this function is being used as a __pairs metamethod. <a href="#L-272"></a> if current and current[t] or getmetatable(t) == nil then <a href="#L-273"></a> return next, t, nil <a href="#L-274"></a> end <a href="#L-275"></a> <a href="#L-276"></a> -- `seen_k` memoizes keys, as they should never repeat; `seen_t` memoizes tables iterated over. <a href="#L-277"></a> local seen_k, seen_t, iterate, iter, state = {}, {} <a href="#L-278"></a> <a href="#L-279"></a> local function catch_values(k, ...) <a href="#L-280"></a> if k ~= nil then <a href="#L-281"></a> -- If a repeated key is found, skip and iterate again. <a href="#L-282"></a> if seen_k[k] then <a href="#L-283"></a> return catch_values(iter(state, k)) <a href="#L-284"></a> end <a href="#L-285"></a> seen_k[k] = true <a href="#L-286"></a> return k, ... <a href="#L-287"></a> end <a href="#L-288"></a> -- If there's an __index metamethod, iterate over it iff it's a table not already seen before. Otherwise, return. <a href="#L-289"></a> local mt = getmetatable(t) <a href="#L-290"></a> -- `mt` might not be a table if __metatable is used. <a href="#L-291"></a> if mt == nil or type(mt) ~= "table" then <a href="#L-292"></a> return nil <a href="#L-293"></a> end <a href="#L-294"></a> t = rawget(mt, "__index") <a href="#L-295"></a> if t == nil or type(t) ~= "table" or seen_t[t] then <a href="#L-296"></a> return nil <a href="#L-297"></a> end <a href="#L-298"></a> seen_t[t], iter = true, nil <a href="#L-299"></a> return iterate() <a href="#L-300"></a> end <a href="#L-301"></a> <a href="#L-302"></a> function iterate(_, k) <a href="#L-303"></a> if iter ~= nil then <a href="#L-304"></a> -- Metamethods can return an arbitrary number of values, so catch them to avoid creating a table. <a href="#L-305"></a> return catch_values(iter(state, k)) <a href="#L-306"></a> end <a href="#L-307"></a> -- If `raw` is set, use `next`. <a href="#L-308"></a> if raw then <a href="#L-309"></a> iter, state, k = next, t, nil <a href="#L-310"></a> -- Otherwise, call `pairs`, setting `current` with `t` so that export.indexPairs knows to return `next` if it's being used as a metamethod, as this prevents infinite loops. `t` is then unset, so that `current` doesn't get polluted if the loop breaks early. <a href="#L-311"></a> else <a href="#L-312"></a> if not current then <a href="#L-313"></a> current = {} <a href="#L-314"></a> end <a href="#L-315"></a> current[t] = true <a href="#L-316"></a> -- Use `pcall`, so that `t` can always be unset from `current`. <a href="#L-317"></a> local success <a href="#L-318"></a> success, iter, state, k = pcall(pairs, t) <a href="#L-319"></a> current[t] = nil <a href="#L-320"></a> -- If there was an error, raise it. <a href="#L-321"></a> if not success then <a href="#L-322"></a> error(iter) <a href="#L-323"></a> end <a href="#L-324"></a> end <a href="#L-325"></a> return catch_values(iter(state, k)) <a href="#L-326"></a> end <a href="#L-327"></a> <a href="#L-328"></a> return iterate <a href="#L-329"></a> end <a href="#L-330"></a> index_pairs = export.indexPairs <a href="#L-331"></a>end <a href="#L-332"></a> <a href="#L-333"></a>do <a href="#L-334"></a> local current <a href="#L-335"></a> <a href="#L-336"></a> local function ipairs_func(t, i) <a href="#L-337"></a> i = i + 1 <a href="#L-338"></a> local v = t[i] <a href="#L-339"></a> if v ~= nil then <a href="#L-340"></a> return i, v <a href="#L-341"></a> end <a href="#L-342"></a> end <a href="#L-343"></a> <a href="#L-344"></a> --[==[ <a href="#L-345"></a> An iterator which works like `ipairs`, except that it also respects the `__index` metamethod. This works by looking up values in the table, iterating integers from key `1` until no value is found. <a href="#L-346"></a> <a href="#L-347"></a> An `__ipairs` metamethod for the input table will be respected, but it will be ignored if the `raw` flag is set. <a href="#L-348"></a> <a href="#L-349"></a> Note: this function can be used as an `__ipairs` metamethod. In such cases, it does not call itself, since this would cause an infinite loop, so it treats the input table as having no `__ipairs` metamethod.]==] <a href="#L-350"></a> function export.indexIpairs(t, raw) <a href="#L-351"></a> -- If there's no metatable, result is identical to `ipairs`. <a href="#L-352"></a> if getmetatable(t) == nil then <a href="#L-353"></a> if not current then <a href="#L-354"></a> current = {} <a href="#L-355"></a> end <a href="#L-356"></a> return ipairs_default_iter, t, 0 <a href="#L-357"></a> -- To prevent infinite loops, don't check for a metamethod if `current` is set with `t`, which means this function is being used as an __ipairs metamethod. Also if `raw` is set. <a href="#L-358"></a> elseif raw or current and current[t] then <a href="#L-359"></a> return ipairs_func, t, 0 <a href="#L-360"></a> elseif not current then <a href="#L-361"></a> current = {} <a href="#L-362"></a> end <a href="#L-363"></a> current[t] = true <a href="#L-364"></a> -- Use `pcall`, so that `t` can always be unset from `current`. <a href="#L-365"></a> local success, iter, state, k = pcall(ipairs, t) <a href="#L-366"></a> current[t] = nil <a href="#L-367"></a> -- If there was an error, raise it. <a href="#L-368"></a> if not success then <a href="#L-369"></a> error(iter) <a href="#L-370"></a> -- If `iter` is just the default `ipairs` iterator, then use `ipairs_func`. There could still be an __ipairs metamethod, but it's safe to use `ipairs_func` on whatever `state` and `k` values were returned. <a href="#L-371"></a> elseif iter == ipairs_default_iter then <a href="#L-372"></a> iter = ipairs_func <a href="#L-373"></a> end <a href="#L-374"></a> return iter, state, k <a href="#L-375"></a> end <a href="#L-376"></a>end <a href="#L-377"></a> <a href="#L-378"></a>--[==[ <a href="#L-379"></a>This is an iterator for sparse arrays. It can be used like ipairs, but can handle nil values.]==] <a href="#L-380"></a>function export.sparseIpairs(t) <a href="#L-381"></a> local keys, i = num_keys(t), 0 <a href="#L-382"></a> return function() <a href="#L-383"></a> i = i + 1 <a href="#L-384"></a> local k = keys[i] <a href="#L-385"></a> if k then <a href="#L-386"></a> return k, t[k] <a href="#L-387"></a> end <a href="#L-388"></a> end <a href="#L-389"></a>end <a href="#L-390"></a>sparse_ipairs = export.sparseIpairs <a href="#L-391"></a> <a href="#L-392"></a>--[==[ <a href="#L-393"></a>This returns the size of a key/value pair table. For arrays, it is more efficient to use `export.length`.]==] <a href="#L-394"></a>function export.size(t) <a href="#L-395"></a> local i = 0 <a href="#L-396"></a> for _ in index_pairs(t) do <a href="#L-397"></a> i = i + 1 <a href="#L-398"></a> end <a href="#L-399"></a> return i <a href="#L-400"></a>end <a href="#L-401"></a> <a href="#L-402"></a>--[==[ <a href="#L-403"></a>This returns the length of a table, or the first integer key n counting from 1 such that t[n + 1] is nil. It is a more reliable form of the operator #, which can become unpredictable under certain circumstances, and therefore should not be used when dealing with arbitrary inputs. This mainly occurs when metamethods are involved (e.g. with data loaded via mw.loadData); however, it can occur in other circumstances too, due to how Lua's implementation of tables works under the hood, so this function should always be used instead of the length operator `#` when dealing with arbitrary tables (e.g. from inputs). If `raw` is set, then metamethods will be ignored, giving the true table length.]==] <a href="#L-404"></a>function export.length(t, raw) <a href="#L-405"></a> local n = 0 <a href="#L-406"></a> if raw then <a href="#L-407"></a> for i in ipairs_default_iter, t, 0 do <a href="#L-408"></a> n = i <a href="#L-409"></a> end <a href="#L-410"></a> return n <a href="#L-411"></a> end <a href="#L-412"></a> repeat <a href="#L-413"></a> n = n + 1 <a href="#L-414"></a> until t[n] == nil <a href="#L-415"></a> return n - 1 <a href="#L-416"></a>end <a href="#L-417"></a>table_len = export.length <a href="#L-418"></a> <a href="#L-419"></a>do <a href="#L-420"></a> local function is_equivalent(a, b, memo, include_mt) <a href="#L-421"></a> -- Raw equality check. <a href="#L-422"></a> if rawequal(a, b) then <a href="#L-423"></a> return true <a href="#L-424"></a> -- If not equal, a and b can only be equivalent if they're both tables. <a href="#L-425"></a> elseif not (type(a) == "table" and type(b) == "table") then <a href="#L-426"></a> return false <a href="#L-427"></a> end <a href="#L-428"></a> -- If a and b have been compared before, they must be equivalent. <a href="#L-429"></a> local memo_a = memo[a] <a href="#L-430"></a> if not memo_a then <a href="#L-431"></a> memo[a] = {[b] = true} <a href="#L-432"></a> elseif memo_a[b] then <a href="#L-433"></a> return true <a href="#L-434"></a> else <a href="#L-435"></a> memo_a[b] = true <a href="#L-436"></a> end <a href="#L-437"></a> local memo_b = memo[b] <a href="#L-438"></a> if not memo_b then <a href="#L-439"></a> memo[b] = {[a] = true} <a href="#L-440"></a> else -- We know memo_b won't have a, since memo_a didn't have b. <a href="#L-441"></a> memo_b[a] = true <a href="#L-442"></a> end <a href="#L-443"></a> -- If include_mt is set, check the metatables are equivalent. <a href="#L-444"></a> if include_mt and not is_equivalent(getmetatable(a), getmetatable(b), memo, true) then <a href="#L-445"></a> return false <a href="#L-446"></a> end <a href="#L-447"></a> -- Fast check: iterate over the keys in `a` with `next` (which circumvents metamethods), checking if an equivalent value exists at the same key in `b`. Any tables-as-keys that aren't found in the other table are set aside for the laborious check. <a href="#L-448"></a> local tablekeys_a, tablekeys_b, kb <a href="#L-449"></a> for ka, va in next, a do <a href="#L-450"></a> local vb = rawget(b, ka) <a href="#L-451"></a> if vb == nil then <a href="#L-452"></a> -- If `ka` isn't in `b`, `a` and `b` can't be equivalent unless it's a table. <a href="#L-453"></a> if type(ka) ~= "table" then <a href="#L-454"></a> return false <a href="#L-455"></a> -- Otherwise, `a` and `b` can only be equivalent if `b` has a key that's not in `a` but is equivalent to `ka`. <a href="#L-456"></a> -- This is found via the laborious check, so set `ka` aside for that. <a href="#L-457"></a> elseif not tablekeys_a then <a href="#L-458"></a> tablekeys_a = {} <a href="#L-459"></a> end <a href="#L-460"></a> tablekeys_a[ka] = va <a href="#L-461"></a> -- Otherwise, if `ka` exists in `a` and `b`, `va` and `vb` must be equivalent. <a href="#L-462"></a> elseif not is_equivalent(va, vb, memo, include_mt) then <a href="#L-463"></a> return false <a href="#L-464"></a> end <a href="#L-465"></a> -- Iterate over `b` with `next` simultaneously, to check it's the same size and to find any tables-as-keys that need the laborious check. <a href="#L-466"></a> kb, vb = next(b, kb) <a href="#L-467"></a> -- Fail if `b` runs out of key/value pairs too early. <a href="#L-468"></a> if kb == nil then <a href="#L-469"></a> return false <a href="#L-470"></a> -- If `kb` is a table not found in `a`, set it aside for the laborious check. <a href="#L-471"></a> -- Note: if it is in `a`, it doesn't need the laborious check, since the values will be compared during this loop. <a href="#L-472"></a> elseif type(kb) == "table" and rawget(a, kb) == nil then <a href="#L-473"></a> if not tablekeys_b then <a href="#L-474"></a> tablekeys_b = {} <a href="#L-475"></a> end <a href="#L-476"></a> tablekeys_b[kb] = vb <a href="#L-477"></a> end <a href="#L-478"></a> end <a href="#L-479"></a> -- Fail if there are too many key/value pairs in `b`. <a href="#L-480"></a> if next(b, kb) ~= nil then <a href="#L-481"></a> return false <a href="#L-482"></a> -- If tablekeys_a == tablekeys_b they must be both nil, meaning that neither had tables as keys, so there's nothing left to check. <a href="#L-483"></a> elseif tablekeys_a == tablekeys_b then <a href="#L-484"></a> return true <a href="#L-485"></a> -- If only one them exists, then the tables can't be equivalent. <a href="#L-486"></a> elseif not (tablekeys_a and tablekeys_b) then <a href="#L-487"></a> return false <a href="#L-488"></a> end <a href="#L-489"></a> -- Laborious check: for each table-as-key in `tablekeys_a`, iterate over the pool in `tablekeys_b` looking for an equivalent key/value pair. If one if found, end the search and remove the match from `tablekeys_b`, to ensure one-to-one correspondence. If all keys in `tablekeys_a` match, `tablekeys_b` will be empty iff the two are equivalent. <a href="#L-490"></a> for ka, va in next, tablekeys_a do <a href="#L-491"></a> local kb <a href="#L-492"></a> while true do <a href="#L-493"></a> local vb <a href="#L-494"></a> kb, vb = next(tablekeys_b, kb) <a href="#L-495"></a> -- Fail if `tablekeys_b` runs out of keys, as `ka` still hasn't matched. <a href="#L-496"></a> if kb == nil then <a href="#L-497"></a> return false <a href="#L-498"></a> -- Keys/value pairs must be equivalent in order to match. <a href="#L-499"></a> elseif ( <a href="#L-500"></a> -- Check values first for speed, since they might not be tables. <a href="#L-501"></a> is_equivalent(va, vb, memo, include_mt) and <a href="#L-502"></a> is_equivalent(ka, kb, memo, include_mt) <a href="#L-503"></a> ) then <a href="#L-504"></a> -- Remove matched key from the pool, and break the inner loop. <a href="#L-505"></a> tablekeys_b[kb] = nil <a href="#L-506"></a> break <a href="#L-507"></a> end <a href="#L-508"></a> end <a href="#L-509"></a> end <a href="#L-510"></a> -- Success iff `tablekeys_b` is now empty. <a href="#L-511"></a> return next(tablekeys_b) == nil <a href="#L-512"></a> end <a href="#L-513"></a> <a href="#L-514"></a> --[==[ <a href="#L-515"></a> Recursively compare two values that may be tables, and returns true if all key-value pairs are structurally equivalent. Note that this handles arbitrary nesting of subtables (including recursive nesting) to any depth, for keys as well as values. <a href="#L-516"></a> <a href="#L-517"></a> If `include_mt` is true, then metatables are also compared.]==] <a href="#L-518"></a> function export.deepEquals(a, b, include_mt) <a href="#L-519"></a> return is_equivalent(a, b, {}, include_mt) <a href="#L-520"></a> end <a href="#L-521"></a> deep_equals = export.deepEquals <a href="#L-522"></a>end <a href="#L-523"></a> <a href="#L-524"></a>do <a href="#L-525"></a> local function get_nested(t, k, ...) <a href="#L-526"></a> if t == nil then <a href="#L-527"></a> return nil <a href="#L-528"></a> elseif select("#", ...) ~= 0 then <a href="#L-529"></a> return get_nested(t[k], ...) <a href="#L-530"></a> end <a href="#L-531"></a> return t[k] <a href="#L-532"></a> end <a href="#L-533"></a> <a href="#L-534"></a> --[==[ <a href="#L-535"></a> Given a table and an arbitrary number of keys, will successively access subtables using each key in turn, returning the value at the final key. For example, if {t} is { {[1] = {[2] = {[3] = "foo"}}}}, {export.getNested(t, 1, 2, 3)} will return {"foo"}. <a href="#L-536"></a> <a href="#L-537"></a> If no subtable exists for a given key value, returns nil, but will throw an error if a non-table is found at an intermediary key.]==] <a href="#L-538"></a> function export.getNested(t, ...) <a href="#L-539"></a> if t == nil or select("#", ...) == 0 then <a href="#L-540"></a> error("Must provide a table and at least one key.") <a href="#L-541"></a> end <a href="#L-542"></a> return get_nested(t, ...) <a href="#L-543"></a> end <a href="#L-544"></a>end <a href="#L-545"></a> <a href="#L-546"></a>do <a href="#L-547"></a> local function set_nested(t, v, k, ...) <a href="#L-548"></a> if select("#", ...) == 0 then <a href="#L-549"></a> t[k] = v <a href="#L-550"></a> return <a href="#L-551"></a> end <a href="#L-552"></a> local next_t = t[k] <a href="#L-553"></a> if next_t == nil then <a href="#L-554"></a> -- If there's no next table while setting nil, there's nothing more to do. <a href="#L-555"></a> if v == nil then <a href="#L-556"></a> return <a href="#L-557"></a> end <a href="#L-558"></a> next_t = {} <a href="#L-559"></a> t[k] = next_t <a href="#L-560"></a> end <a href="#L-561"></a> return set_nested(next_t, v, ...) <a href="#L-562"></a> end <a href="#L-563"></a> <a href="#L-564"></a> --[==[ <a href="#L-565"></a> Given a table, value and an arbitrary number of keys, will successively access subtables using each key in turn, and sets the value at the final key. For example, if {t} is { {} }, {export.setNested(t, "foo", 1, 2, 3)} will modify {t} to { {[1] = {[2] = {[3] = "foo"} } } }. <a href="#L-566"></a> <a href="#L-567"></a> If no subtable exists for a given key value, one will be created, but the function will throw an error if a non-table value is found at an intermediary key. <a href="#L-568"></a> <a href="#L-569"></a> Note: the parameter order (table, value, keys) differs from functions like rawset, because the number of keys can be arbitrary. This is to avoid situations where an additional argument must be appended to arbitrary lists of variables, which can be awkward and error-prone: for example, when handling variable arguments ({{lua|...}}) or function return values.]==] <a href="#L-570"></a> function export.setNested(t, ...) <a href="#L-571"></a> if t == nil or select("#", ...) < 2 then <a href="#L-572"></a> error("Must provide a table and at least one key.") <a href="#L-573"></a> end <a href="#L-574"></a> return set_nested(t, ...) <a href="#L-575"></a> end <a href="#L-576"></a>end <a href="#L-577"></a> <a href="#L-578"></a>--[==[ <a href="#L-579"></a>Given a list and a value to be found, return true if the value is in the array portion of the list. Comparison is by value, using `deepEquals`.]==] <a href="#L-580"></a>function export.contains(list, x, options) <a href="#L-581"></a> if options and options.key then <a href="#L-582"></a> x = options.key(x) <a href="#L-583"></a> end <a href="#L-584"></a> local i = 0 <a href="#L-585"></a> while true do <a href="#L-586"></a> i = i + 1 <a href="#L-587"></a> local v = list[i] <a href="#L-588"></a> if v == nil then <a href="#L-589"></a> return false <a href="#L-590"></a> elseif options and options.key then <a href="#L-591"></a> v = options.key(v) <a href="#L-592"></a> end <a href="#L-593"></a> if deep_equals(v, x) then <a href="#L-594"></a> return true <a href="#L-595"></a> end <a href="#L-596"></a> end <a href="#L-597"></a>end <a href="#L-598"></a>contains = export.contains <a href="#L-599"></a> <a href="#L-600"></a>--[==[ <a href="#L-601"></a>Given a general table and a value to be found, return true if the value is in <a href="#L-602"></a>either the array or hashmap portion of the table. Comparison is by value, using <a href="#L-603"></a>`deepEquals`. <a href="#L-604"></a> <a href="#L-605"></a>NOTE: This used to do shallow comparison by default and accepted a third <a href="#L-606"></a>"deepCompare" param to do deep comparison. This param is still accepted but now <a href="#L-607"></a>ignored.]==] <a href="#L-608"></a>function export.tableContains(tbl, x) <a href="#L-609"></a> for _, v in index_pairs(tbl) do <a href="#L-610"></a> if deep_equals(v, x) then <a href="#L-611"></a> return true <a href="#L-612"></a> end <a href="#L-613"></a> end <a href="#L-614"></a> return false <a href="#L-615"></a>end <a href="#L-616"></a> <a href="#L-617"></a>--[==[ <a href="#L-618"></a>Given a `list` and a `new_item` to be inserted, append the value to the end of the list if not already present <a href="#L-619"></a>(or insert at an arbitrary position, if `options.pos` is given; see below). Comparison is by value, using {deepEquals}. <a href="#L-620"></a> <a href="#L-621"></a>`options` is an optional table of additional options to control the behavior of the operation. The following options are <a href="#L-622"></a>recognized: <a href="#L-623"></a>* `pos`: Position at which insertion happens (i.e. before the existing item at position `pos`). <a href="#L-624"></a>* `key`: Function of one argument to return a comparison key, as with {deepEquals}. The key function is applied to both <a href="#L-625"></a> `item` and the existing item in `list` to compare against, and the comparison is done against the results. <a href="#L-626"></a> This is useful when inserting a complex structure into an existing list while avoiding duplicates. <a href="#L-627"></a>* `combine`: Function of three arguments (the existing item, the new item and the position, respectively) to combine an <a href="#L-628"></a> existing item with `new_item`, when `new_item` is found in `list`. If unspecified, the existing item is <a href="#L-629"></a> left alone. <a href="#L-630"></a> <a href="#L-631"></a>Return {false} if entry already found, {true} if inserted. <a href="#L-632"></a> <a href="#L-633"></a>For compatibility, `pos` can be specified directly as the third argument in place of `options`, but this is not <a href="#L-634"></a>recommended for new code. <a href="#L-635"></a> <a href="#L-636"></a>NOTE: This function is O(N) in the size of the existing list. If you use this function in a loop to insert several <a href="#L-637"></a>items, you will get O(M*(M+N)) behavior, effectively O((M+N)^2). Thus it is not recommended to use this unless you are <a href="#L-638"></a>sure the total number of items will be small. (An alternative for large lists is to insert all the items without <a href="#L-639"></a>checking for duplicates, and use {removeDuplicates()} at the end.)]==] <a href="#L-640"></a>function export.insertIfNot(list, new_item, options) <a href="#L-641"></a> if type(options) == "number" then <a href="#L-642"></a> options = {pos = options} <a href="#L-643"></a> end <a href="#L-644"></a> if options and options.combine then <a href="#L-645"></a> local new_key <a href="#L-646"></a> -- Don't use options.key and options.key(new_item) or new_item in case the key is legitimately false or nil. <a href="#L-647"></a> if options.key then <a href="#L-648"></a> new_key = options.key(new_item) <a href="#L-649"></a> else <a href="#L-650"></a> new_key = new_item <a href="#L-651"></a> end <a href="#L-652"></a> local i = 0 <a href="#L-653"></a> while true do <a href="#L-654"></a> i = i + 1 <a href="#L-655"></a> local item, key = list[i] <a href="#L-656"></a> if item == nil then <a href="#L-657"></a> break <a href="#L-658"></a> elseif options.key then <a href="#L-659"></a> key = options.key(item) <a href="#L-660"></a> else <a href="#L-661"></a> key = item <a href="#L-662"></a> end <a href="#L-663"></a> if deep_equals(key, new_key) then <a href="#L-664"></a> local retval = options.combine(item, new_item, i) <a href="#L-665"></a> if retval ~= nil then <a href="#L-666"></a> list[i] = retval <a href="#L-667"></a> end <a href="#L-668"></a> return false <a href="#L-669"></a> end <a href="#L-670"></a> end <a href="#L-671"></a> elseif contains(list, new_item, options) then <a href="#L-672"></a> return false <a href="#L-673"></a> end <a href="#L-674"></a> local pos = options and options.pos <a href="#L-675"></a> if pos then <a href="#L-676"></a> insert(list, pos, new_item) <a href="#L-677"></a> else <a href="#L-678"></a> insert(list, new_item) <a href="#L-679"></a> end <a href="#L-680"></a>end <a href="#L-681"></a>insert_if_not = export.insertIfNot <a href="#L-682"></a> <a href="#L-683"></a>--[==[ <a href="#L-684"></a>Finds key for specified value in a given table. Roughly equivalent to reversing the key-value pairs in the table: <a href="#L-685"></a>* {reversed_table = { [value1] = key1, [value2] = key2, ... }} <a href="#L-686"></a>and then returning {reversed_table[valueToFind]}. <a href="#L-687"></a> <a href="#L-688"></a>The value can only be a string or a number (not nil, a boolean, a table, or a function). <a href="#L-689"></a> <a href="#L-690"></a>Only reliable if there is just one key with the specified value. Otherwise, the function returns the first key found, <a href="#L-691"></a>and the output is unpredictable.]==] <a href="#L-692"></a>function export.keyFor(t, valueToFind) <a href="#L-693"></a> for key, value in index_pairs(t) do <a href="#L-694"></a> if value == valueToFind then <a href="#L-695"></a> return key <a href="#L-696"></a> end <a href="#L-697"></a> end <a href="#L-698"></a> return nil <a href="#L-699"></a>end <a href="#L-700"></a> <a href="#L-701"></a>do <a href="#L-702"></a> -- The default sorting function used in export.keysToList if no keySort is defined. <a href="#L-703"></a> local function default_sort(key1, key2) <a href="#L-704"></a> -- "number" < "string", so numbers will be sorted before strings. <a href="#L-705"></a> local type1, type2 = type(key1), type(key2) <a href="#L-706"></a> if type1 ~= type2 then <a href="#L-707"></a> return type1 < type2 <a href="#L-708"></a> end <a href="#L-709"></a> -- string_sort fixes a bug in < whereby all codepoints above U+FFFF are treated as equal. <a href="#L-710"></a> return string_sort(key1, key2) <a href="#L-711"></a> end <a href="#L-712"></a> <a href="#L-713"></a> --[==[ <a href="#L-714"></a> Return a list of the keys in a table, sorted using either the default table.sort function or a custom keySort function. <a href="#L-715"></a> If there are only numerical keys, numKeys is probably more efficient.]==] <a href="#L-716"></a> function export.keysToList(t, keySort) <a href="#L-717"></a> local list, i = {}, 0 <a href="#L-718"></a> for key in index_pairs(t) do <a href="#L-719"></a> i = i + 1 <a href="#L-720"></a> list[i] = key <a href="#L-721"></a> end <a href="#L-722"></a> -- Use specified sort function, or otherwise default_sort. <a href="#L-723"></a> sort(list, keySort or default_sort) <a href="#L-724"></a> return list <a href="#L-725"></a> end <a href="#L-726"></a> keys_to_list = export.keysToList <a href="#L-727"></a>end <a href="#L-728"></a> <a href="#L-729"></a>--[==[ <a href="#L-730"></a>Iterates through a table, with the keys sorted using the keysToList function. If there are only numerical keys, <a href="#L-731"></a>sparseIpairs is probably more efficient.]==] <a href="#L-732"></a>function export.sortedPairs(t, keySort) <a href="#L-733"></a> local list, i = keys_to_list(t, keySort, true), 0 <a href="#L-734"></a> return function() <a href="#L-735"></a> i = i + 1 <a href="#L-736"></a> local key = list[i] <a href="#L-737"></a> if key ~= nil then <a href="#L-738"></a> return key, t[key] <a href="#L-739"></a> end <a href="#L-740"></a> end <a href="#L-741"></a>end <a href="#L-742"></a> <a href="#L-743"></a>do <a href="#L-744"></a> -- Loader. <a href="#L-745"></a> local function really_reverse_ipairs(...) <a href="#L-746"></a> really_reverse_ipairs = require(function_module).reverseIter(ipairs) <a href="#L-747"></a> return really_reverse_ipairs(...) <a href="#L-748"></a> end <a href="#L-749"></a> <a href="#L-750"></a> local function reverse_ipairs_func(t, i) <a href="#L-751"></a> if i > 1 then <a href="#L-752"></a> i = i - 1 <a href="#L-753"></a> -- Use rawget and check `v` is not nil, in case `t` has been modified during the loop. <a href="#L-754"></a> local v = rawget(t, i) <a href="#L-755"></a> if v ~= nil then <a href="#L-756"></a> return i, v <a href="#L-757"></a> end <a href="#L-758"></a> end <a href="#L-759"></a> end <a href="#L-760"></a> <a href="#L-761"></a> function export.reverseIpairs(t) <a href="#L-762"></a> -- If there's no metatable, it's faster and cheaper to iterate backwards over the array part via direct table access. <a href="#L-763"></a> -- Note: not safe to use #t for the initial value of `i`, as it can be unpredictable if there's a hash part. <a href="#L-764"></a> if getmetatable(t) == nil then <a href="#L-765"></a> return reverse_ipairs_func, t, table_len(t, true) + 1 <a href="#L-766"></a> end <a href="#L-767"></a> -- Otherwise, there could be an __ipairs metamethod (which may be hidden if the real metatable uses __metatable), so we have to assume there is one. <a href="#L-768"></a> -- These can return arbitrary values (i.e. the first value might not be `i`), so use reverseIter in [[Module:fun]] to guarantee accuracy. <a href="#L-769"></a> return really_reverse_ipairs(t) <a href="#L-770"></a> end <a href="#L-771"></a>end <a href="#L-772"></a> <a href="#L-773"></a>local function getIteratorValues(i, j , step, t_len) <a href="#L-774"></a> i = (i and i < 0 and t_len - i + 1) or i or (step and step < 0 and t_len) or 1 <a href="#L-775"></a> j = (j and j < 0 and t_len - j + 1) or j or (step and step < 0 and 1) or t_len <a href="#L-776"></a> step = step or (j < i and -1) or 1 <a href="#L-777"></a> if ( <a href="#L-778"></a> i == 0 or i % 1 ~= 0 or <a href="#L-779"></a> j == 0 or j % 1 ~= 0 or <a href="#L-780"></a> step == 0 or step % 1 ~= 0 <a href="#L-781"></a> ) then <a href="#L-782"></a> error("Arguments i, j and step must be non-zero integers.") <a href="#L-783"></a> end <a href="#L-784"></a> return i, j, step <a href="#L-785"></a>end <a href="#L-786"></a> <a href="#L-787"></a>--[==[ <a href="#L-788"></a>Given an array `list` and function `func`, iterate through the array applying {func(r, k, v)}, and returning the result, <a href="#L-789"></a>where `r` is the value calculated so far, `k` is an index, and `v` is the value at index `k`. For example, <a href="#L-790"></a>{reduce(array, function(a, b) return a + b end)} will return the sum of `array`. <a href="#L-791"></a> <a href="#L-792"></a>Optional arguments: <a href="#L-793"></a>* `i`: start index; negative values count from the end of the array <a href="#L-794"></a>* `j`: end index; negative values count from the end of the array <a href="#L-795"></a>* `step`: step increment <a href="#L-796"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-797"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-798"></a> <a href="#L-799"></a>Examples: <a href="#L-800"></a># No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default). <a href="#L-801"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-802"></a># i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1). <a href="#L-803"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-804"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index. <a href="#L-805"></a>Note: directionality generally only matters for `reduce`, but values of step > 1 (or step < -1) still affect the return value <a href="#L-806"></a>of `apply`.]==] <a href="#L-807"></a>function export.reduce(t, func, i, j, step) <a href="#L-808"></a> local t_len = table_len(t) <a href="#L-809"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-810"></a> local ret = t[i] <a href="#L-811"></a> for k = i + step, j, step do <a href="#L-812"></a> ret = func(ret, k, t[k]) <a href="#L-813"></a> end <a href="#L-814"></a> return ret <a href="#L-815"></a>end <a href="#L-816"></a> <a href="#L-817"></a>--[==[ <a href="#L-818"></a>Given an array `list` and function `func`, iterate through the array applying {func(k, v)} (where `k` is an index, and <a href="#L-819"></a>`v` is the value at index `k`), and return an array of the resulting values. For example, <a href="#L-820"></a>{apply(array, function(a) return 2*a end)} will return an array where each member of `array` has been doubled. <a href="#L-821"></a> <a href="#L-822"></a>Optional arguments: <a href="#L-823"></a>* `i`: start index; negative values count from the end of the array <a href="#L-824"></a>* `j`: end index; negative values count from the end of the array <a href="#L-825"></a>* `step`: step increment <a href="#L-826"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-827"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-828"></a> <a href="#L-829"></a>Examples: <a href="#L-830"></a># No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default). <a href="#L-831"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-832"></a># i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1). <a href="#L-833"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-834"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index. <a href="#L-835"></a>Note: directionality makes the most difference for `reduce`, but values of step > 1 (or step < -1) still affect the return <a href="#L-836"></a>value of `apply`.]==] <a href="#L-837"></a>function export.apply(t, func, i, j, step) <a href="#L-838"></a> local t_new = deep_copy(t) <a href="#L-839"></a> local t_new_len = table_len(t_new) <a href="#L-840"></a> i, j, step = getIteratorValues(i, j , step, t_new_len) <a href="#L-841"></a> for k = i, j, step do <a href="#L-842"></a> t_new[k] = func(k, t_new[k]) <a href="#L-843"></a> end <a href="#L-844"></a> return t_new <a href="#L-845"></a>end <a href="#L-846"></a> <a href="#L-847"></a>--[==[ <a href="#L-848"></a>Given an array `list` and function `func`, iterate through the array applying {func(k, v)} (where `k` is an index, and <a href="#L-849"></a>`v` is the value at index `k`), and returning whether the function is true for all iterations. <a href="#L-850"></a> <a href="#L-851"></a>Optional arguments: <a href="#L-852"></a>* `i`: start index; negative values count from the end of the array <a href="#L-853"></a>* `j`: end index; negative values count from the end of the array <a href="#L-854"></a>* `step`: step increment <a href="#L-855"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-856"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-857"></a> <a href="#L-858"></a>Examples: <a href="#L-859"></a># No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default). <a href="#L-860"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-861"></a># i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1). <a href="#L-862"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-863"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index.]==] <a href="#L-864"></a>function export.all(t, func, i, j, step) <a href="#L-865"></a> local t_len = table_len(t) <a href="#L-866"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-867"></a> for k = i, j, step do <a href="#L-868"></a> if not func(k, t[k]) then <a href="#L-869"></a> return false <a href="#L-870"></a> end <a href="#L-871"></a> end <a href="#L-872"></a> return true <a href="#L-873"></a>end <a href="#L-874"></a> <a href="#L-875"></a>--[==[ <a href="#L-876"></a>Given an array `list` and function `func`, iterate through the array applying {func(k, v)} (where `k` is an index, and <a href="#L-877"></a>`v` is the value at index `k`), and returning whether the function is true for at least one iteration. <a href="#L-878"></a> <a href="#L-879"></a>Optional arguments: <a href="#L-880"></a>* `i`: start index; negative values count from the end of the array <a href="#L-881"></a>* `j`: end index; negative values count from the end of the array <a href="#L-882"></a>* `step`: step increment <a href="#L-883"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-884"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-885"></a> <a href="#L-886"></a>Examples: <a href="#L-887"></a># No values for i, j or step results in forward iteration from the start to the end in steps of 1 (the default). <a href="#L-888"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-889"></a># i=7, j=3 results in backward iteration from indices 7 to 3 in steps of 1 (i.e. step=-1). <a href="#L-890"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-891"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index.]==] <a href="#L-892"></a>function export.any(t, func, i, j, step) <a href="#L-893"></a> local t_len = table_len(t) <a href="#L-894"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-895"></a> for k = i, j, step do <a href="#L-896"></a> if not not (func(k, t[k])) then <a href="#L-897"></a> return true <a href="#L-898"></a> end <a href="#L-899"></a> end <a href="#L-900"></a> return false <a href="#L-901"></a>end <a href="#L-902"></a> <a href="#L-903"></a>--[==[ <a href="#L-904"></a>Joins an array with serial comma and serial conjunction, normally {"and"}. An improvement on {mw.text.listToText}, <a href="#L-905"></a>which doesn't properly handle serial commas. <a href="#L-906"></a> <a href="#L-907"></a>Options: <a href="#L-908"></a>* `conj`: Conjunction to use; defaults to {"and"}. <a href="#L-909"></a>* `punc`: Punctuation to use; default to {","}. <a href="#L-910"></a>* `dontTag`: Don't tag the serial comma and serial {"and"}. For error messages, in which HTML cannot be used.]==] <a href="#L-911"></a>function export.serialCommaJoin(seq, options) <a href="#L-912"></a> local length = table_len(seq) <a href="#L-913"></a> if length == 0 then <a href="#L-914"></a> return "" <a href="#L-915"></a> elseif length == 1 then <a href="#L-916"></a> return seq[1] <a href="#L-917"></a> end <a href="#L-918"></a> <a href="#L-919"></a> if length == 2 then <a href="#L-920"></a> return seq[1] .. " " .. (options and options.conj or "and") .. " " .. seq[2] <a href="#L-921"></a> end <a href="#L-922"></a> <a href="#L-923"></a> local conj, punc, dont_tag <a href="#L-924"></a> if options then <a href="#L-925"></a> conj = options.conj or "and" <a href="#L-926"></a> punc = options.punc or "," <a href="#L-927"></a> dont_tag = options.dontTag <a href="#L-928"></a> else <a href="#L-929"></a> conj, punc = "and", "," <a href="#L-930"></a> end <a href="#L-931"></a> <a href="#L-932"></a> local comma <a href="#L-933"></a> if dont_tag then <a href="#L-934"></a> comma = punc <a href="#L-935"></a> conj = " " .. conj .. " " <a href="#L-936"></a> else <a href="#L-937"></a> comma = "\"serial-comma\">" .. punc .. "" <a href="#L-938"></a> conj = "\"serial-and\"> " .. conj .. " " <a href="#L-939"></a> end <a href="#L-940"></a> <a href="#L-941"></a> return concat(seq, punc .. " ", 1, length - 1) .. comma .. conj .. seq[length] <a href="#L-942"></a>end <a href="#L-943"></a> <a href="#L-944"></a>--[==[ <a href="#L-945"></a>Concatenate all values in the table that are indexed by a number, in order. <a href="#L-946"></a>* {sparseConcat{ a, nil, c, d }} => {"acd"} <a href="#L-947"></a>* {sparseConcat{ nil, b, c, d }} => {"bcd"}]==] <a href="#L-948"></a>function export.sparseConcat(t, sep, i, j) <a href="#L-949"></a> local list, list_i = {}, 0 <a href="#L-950"></a> for _, v in sparse_ipairs(t) do <a href="#L-951"></a> list_i = list_i + 1 <a href="#L-952"></a> list[list_i] = v <a href="#L-953"></a> end <a href="#L-954"></a> return concat(list, sep, i, j) <a href="#L-955"></a>end <a href="#L-956"></a> <a href="#L-957"></a>--[==[ <a href="#L-958"></a>Values of numeric keys in array portion of table are reversed: { { "a", "b", "c" }} -> { { "c", "b", "a" }}]==] <a href="#L-959"></a>function export.reverse(t) <a href="#L-960"></a> local list, t_len = {}, table_len(t) <a href="#L-961"></a> for i = t_len, 1, -1 do <a href="#L-962"></a> list[t_len - i + 1] = t[i] <a href="#L-963"></a> end <a href="#L-964"></a> return list <a href="#L-965"></a>end <a href="#L-966"></a>table_reverse = export.reverse <a href="#L-967"></a> <a href="#L-968"></a>function export.reverseConcat(t, sep, i, j) <a href="#L-969"></a> return concat(table_reverse(t), sep, i, j) <a href="#L-970"></a>end <a href="#L-971"></a> <a href="#L-972"></a>--[==[ <a href="#L-973"></a>Invert a list. For example, {invert({ "a", "b", "c" })} -> { { a = 1, b = 2, c = 3 }}]==] <a href="#L-974"></a>function export.invert(list) <a href="#L-975"></a> local map, i = {}, 0 <a href="#L-976"></a> while true do <a href="#L-977"></a> i = i + 1 <a href="#L-978"></a> local v = list[i] <a href="#L-979"></a> if v == nil then <a href="#L-980"></a> return map <a href="#L-981"></a> end <a href="#L-982"></a> map[v] = i <a href="#L-983"></a> end <a href="#L-984"></a>end <a href="#L-985"></a> <a href="#L-986"></a>--[==[ <a href="#L-987"></a>Convert `list` (a table with a list of values) into a set (a table where those values are keys instead). This is a useful <a href="#L-988"></a>way to create a fast lookup table, since looking up a table key is much, much faster than iterating over the whole list <a href="#L-989"></a>to see if it contains a given value. <a href="#L-990"></a> <a href="#L-991"></a>By default, each item is given the value true. If the optional parameter `value` is a function or functor, then the value <a href="#L-992"></a>for each item is determined by calling it with the item key as the first parameter, plus any additional arguments passed <a href="#L-993"></a>to {listToSet}; if value is anything else, then it is used as the fixed value for every item.]==] <a href="#L-994"></a>function export.listToSet(list, value, ...) <a href="#L-995"></a> local set, i, callable = {}, 0 <a href="#L-996"></a> if value == nil then <a href="#L-997"></a> value = true <a href="#L-998"></a> else <a href="#L-999"></a> callable = is_callable(value) <a href="#L-1000"></a> end <a href="#L-1001"></a> while true do <a href="#L-1002"></a> i = i + 1 <a href="#L-1003"></a> local item = list[i] <a href="#L-1004"></a> if item == nil then <a href="#L-1005"></a> return set <a href="#L-1006"></a> end <a href="#L-1007"></a> if callable then <a href="#L-1008"></a> set[item] = value(item, ...) <a href="#L-1009"></a> else <a href="#L-1010"></a> set[item] = value <a href="#L-1011"></a> end <a href="#L-1012"></a> end <a href="#L-1013"></a>end <a href="#L-1014"></a> <a href="#L-1015"></a>--[==[ <a href="#L-1016"></a>Return true if all keys in the table are consecutive integers starting at 1.]==] <a href="#L-1017"></a>function export.isArray(t) <a href="#L-1018"></a> local i = 0 <a href="#L-1019"></a> for _ in index_pairs(t) do <a href="#L-1020"></a> i = i + 1 <a href="#L-1021"></a> if t[i] == nil then <a href="#L-1022"></a> return false <a href="#L-1023"></a> end <a href="#L-1024"></a> end <a href="#L-1025"></a> return true <a href="#L-1026"></a>end <a href="#L-1027"></a> <a href="#L-1028"></a>--[==[ <a href="#L-1029"></a>Add a list of aliases for a given key to a table. The aliases must be given as a table.]==] <a href="#L-1030"></a>function export.alias(t, k, aliases) <a href="#L-1031"></a> for _, alias in index_pairs(aliases) do <a href="#L-1032"></a> t[alias] = t[k] <a href="#L-1033"></a> end <a href="#L-1034"></a>end <a href="#L-1035"></a> <a href="#L-1036"></a>return export </pre></div></div><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://en.wiktionary.org/w/index.php?title=Module:table&oldid=82733053">https://en.wiktionary.org/w/index.php?title=Module:table&oldid=82733053</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Special:Categories" title="Special:Categories">Categories</a>: <ul><li><a href="/wiki/Category:Templates_and_modules_needing_documentation" title="Category:Templates and modules needing documentation">Templates and modules needing documentation</a></li><li><a href="/wiki/Category:Collections_modules" title="Category:Collections modules">Collections modules</a></li></ul></div></div> </div> </div> <div id="mw-navigation"> <h2>Navigation menu</h2> <div id="mw-head"> <nav id="p-personal" class="mw-portlet mw-portlet-personal vector-user-menu-legacy vector-menu" aria-labelledby="p-personal-label" > <h3 id="p-personal-label" class="vector-menu-heading " > Personal tools </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anonuserpage" class="mw-list-item">Not logged in</li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n">Talk</a></li><li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y">Contributions</a></li><li id="pt-createaccount" class="mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82733053%26oldid%3D82709639" title="You are encouraged to create an account and log in; however, it is not mandatory">Create account</a></li><li id="pt-login" class="mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82733053%26oldid%3D82709639" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o">Log in</a></li> </ul> </div> </nav> <div id="left-navigation"> <nav id="p-namespaces" class="mw-portlet mw-portlet-namespaces vector-menu-tabs vector-menu-tabs-legacy vector-menu" aria-labelledby="p-namespaces-label" > <h3 id="p-namespaces-label" class="vector-menu-heading " > Namespaces </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-module" class="selected mw-list-item"><a href="/wiki/Module:table" title="View the module page [c]" accesskey="c">Module</a></li><li id="ca-talk" class="mw-list-item"><a href="/wiki/Module_talk:table" rel="discussion" title="Discussion about the content page [t]" accesskey="t">Discussion</a></li> </ul> </div> </nav> <nav id="p-variants" class="mw-portlet mw-portlet-variants emptyPortlet vector-menu-dropdown vector-menu" aria-labelledby="p-variants-label" > <input type="checkbox" id="p-variants-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-variants" class="vector-menu-checkbox" aria-labelledby="p-variants-label" > <label id="p-variants-label" class="vector-menu-heading " > English </label> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </nav> </div> <div id="right-navigation"> <nav id="p-views" class="mw-portlet mw-portlet-views vector-menu-tabs vector-menu-tabs-legacy vector-menu" aria-labelledby="p-views-label" > <h3 id="p-views-label" class="vector-menu-heading " > Views </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected mw-list-item"><a href="/wiki/Module:table">Read</a></li><li id="ca-viewsource" class="mw-list-item"><a href="/w/index.php?title=Module:table&action=edit&oldid=82733053" title="This page is protected.
You can view its source [e]" accesskey="e">View source</a></li><li id="ca-history" class="mw-list-item"><a href="/w/index.php?title=Module:table&action=history" title="Past revisions of this page [h]" accesskey="h">History</a></li> </ul> </div> </nav> <nav id="p-cactions" class="mw-portlet mw-portlet-cactions emptyPortlet vector-menu-dropdown vector-menu" aria-labelledby="p-cactions-label" title="More options" > <input type="checkbox" id="p-cactions-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-cactions" class="vector-menu-checkbox" aria-labelledby="p-cactions-label" > <label id="p-cactions-label" class="vector-menu-heading " > More </label> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </nav> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <h3 >Search</h3> <form action="/w/index.php" id="searchform" class="vector-search-box-form"> <div id="simpleSearch" class="vector-search-box-inner" data-search-loc="header-navigation"> <input class="vector-search-box-input" type="search" name="search" placeholder="Search Wiktionary" aria-label="Search Wiktionary" autocapitalize="none" title="Search Wiktionary [f]" accesskey="f" id="searchInput" > <input type="hidden" name="title" value="Special:Search"> <input id="mw-searchButton" class="searchButton mw-fallbackSearchButton" type="submit" name="fulltext" title="Search the pages for this text" value="Search"> <input id="searchButton" class="searchButton" type="submit" name="go" title="Go to a page with this exact name if it exists" value="Go"> </div> </form> </div> </div> </div> <div id="mw-panel" class="vector-legacy-sidebar"> <div id="p-logo" role="banner"> <a class="mw-wiki-logo" href="/wiki/Wiktionary:Main_Page" title="Visit the main page"></a> </div> <nav id="p-navigation" class="mw-portlet mw-portlet-navigation vector-menu-portal portal vector-menu" aria-labelledby="p-navigation-label" > <h3 id="p-navigation-label" class="vector-menu-heading " > Navigation </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-text" class="mw-list-item"><a href="/wiki/Wiktionary:Main_Page">Main Page</a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wiktionary:Community_portal" title="About the project, what you can do, where to find things">Community portal</a></li><li id="n-requestedarticles" class="mw-list-item"><a href="/wiki/Wiktionary:Requested_entries">Requested entries</a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:RecentChanges" title="A list of recent changes in the wiki [r]" accesskey="r">Recent changes</a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Load a random page [x]" accesskey="x">Random entry</a></li><li id="n-help" class="mw-list-item"><a href="https://en.wiktionary.org/wiki/Help:Contents" title="The place to find out">Help</a></li><li id="n-Glossary" class="mw-list-item"><a href="/wiki/Appendix:Glossary">Glossary</a></li><li id="n-sitesupport" class="mw-list-item"><a href="//donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wiktionary.org&uselang=en" title="Support us">Donations</a></li><li id="n-contact" class="mw-list-item"><a href="/wiki/Wiktionary:Contact_us">Contact us</a></li> </ul> </div> </nav> <nav id="p-tb" class="mw-portlet mw-portlet-tb vector-menu-portal portal vector-menu" aria-labelledby="p-tb-label" > <h3 id="p-tb-label" class="vector-menu-heading " > Tools </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/Module:table" title="A list of all wiki pages that link here [j]" accesskey="j">What links here</a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Module:table" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k">Related changes</a></li><li id="t-upload" class="mw-list-item"><a href="//commons.wikimedia.org/wiki/Special:UploadWizard?uselang=en" title="Upload files [u]" accesskey="u">Upload file</a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q">Special pages</a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Module:table&oldid=82733053" title="Permanent link to this revision of this page">Permanent link</a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Module:table&action=info" title="More information about this page">Page information</a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wiktionary.org%2Fw%2Findex.php%3Ftitle%3DModule%3Atable%26curid%3D5122966%26diff%3D82733053%26oldid%3D82709639">Get shortened URL</a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wiktionary.org%2Fw%2Findex.php%3Ftitle%3DModule%3Atable%26curid%3D5122966%26diff%3D82733053%26oldid%3D82709639">Download QR code</a></li> </ul> </div> </nav> <nav id="p-electronpdfservice-sidebar-portlet-heading" class="mw-portlet mw-portlet-electronpdfservice-sidebar-portlet-heading vector-menu-portal portal vector-menu" aria-labelledby="p-electronpdfservice-sidebar-portlet-heading-label" > <h3 id="p-electronpdfservice-sidebar-portlet-heading-label" class="vector-menu-heading " > Print/export </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-print" class="mw-list-item"><a href="javascript:print();" rel="alternate" title="Printable version of this page [p]" accesskey="p">Printable version</a></li> </ul> </div> </nav> <nav id="p-wikibase-otherprojects" class="mw-portlet mw-portlet-wikibase-otherprojects vector-menu-portal portal vector-menu" aria-labelledby="p-wikibase-otherprojects-label" > <h3 id="p-wikibase-otherprojects-label" class="vector-menu-heading " > In other projects </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="wb-otherproject-link wb-otherproject-commons mw-list-item"><a href="https://commons.wikimedia.org/wiki/Module:Table" hreflang="en">Wikimedia Commons</a></li><li class="wb-otherproject-link wb-otherproject-sources mw-list-item"><a href="https://wikisource.org/wiki/Module:Table" hreflang="en">Multilingual Wikisource</a></li><li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q15727765" title="Link to connected data repository item [g]" accesskey="g">Wikidata item</a></li> </ul> </div> </nav> <nav id="p-lang" class="mw-portlet mw-portlet-lang vector-menu-portal portal vector-menu" aria-labelledby="p-lang-label" > <h3 id="p-lang-label" class="vector-menu-heading " > In other languages </h3> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-af mw-list-item"><a href="https://af.wiktionary.org/wiki/Module:table" title="Module:table – Afrikaans" lang="af" hreflang="af" data-title="Module:table" data-language-autonym="Afrikaans" data-language-local-name="Afrikaans" class="interlanguage-link-target">Afrikaans</a></li><li class="interlanguage-link interwiki-ang mw-list-item"><a href="https://ang.wiktionary.org/wiki/Module:table" title="Module:table – Old English" lang="ang" hreflang="ang" data-title="Module:table" data-language-autonym="Ænglisc" data-language-local-name="Old English" class="interlanguage-link-target">Ænglisc</a></li><li class="interlanguage-link interwiki-ar mw-list-item"><a href="https://ar.wiktionary.org/wiki/%D9%88%D8%AD%D8%AF%D8%A9:table" title="وحدة:table – Arabic" lang="ar" hreflang="ar" data-title="وحدة:table" data-language-autonym="العربية" data-language-local-name="Arabic" class="interlanguage-link-target">العربية</a></li><li class="interlanguage-link interwiki-az mw-list-item"><a href="https://az.wiktionary.org/wiki/Modul:table" title="Modul:table – Azerbaijani" lang="az" hreflang="az" data-title="Modul:table" data-language-autonym="Azərbaycanca" data-language-local-name="Azerbaijani" class="interlanguage-link-target">Azərbaycanca</a></li><li class="interlanguage-link interwiki-bn mw-list-item"><a href="https://bn.wiktionary.org/wiki/%E0%A6%AE%E0%A6%A1%E0%A6%BF%E0%A6%89%E0%A6%B2:table" title="মডিউল:table – Bangla" lang="bn" hreflang="bn" data-title="মডিউল:table" data-language-autonym="বাংলা" data-language-local-name="Bangla" class="interlanguage-link-target">বাংলা</a></li><li class="interlanguage-link interwiki-bjn mw-list-item"><a href="https://bjn.wiktionary.org/wiki/Modul:table" title="Modul:table – Banjar" lang="bjn" hreflang="bjn" data-title="Modul:table" data-language-autonym="Banjar" data-language-local-name="Banjar" class="interlanguage-link-target">Banjar</a></li><li class="interlanguage-link interwiki-zh-min-nan mw-list-item"><a href="https://zh-min-nan.wiktionary.org/wiki/%E6%A8%A1%E7%B5%84:table" title="模組:table – Minnan" lang="nan" hreflang="nan" data-title="模組:table" data-language-autonym="閩南語 / Bân-lâm-gú" data-language-local-name="Minnan" class="interlanguage-link-target">閩南語 / Bân-lâm-gú</a></li><li class="interlanguage-link interwiki-dv mw-list-item"><a href="https://dv.wiktionary.org/wiki/%DE%89%DE%AE%DE%91%DE%A8%DE%87%DE%AA%DE%8D%DE%B0:table" title="މޮޑިއުލް:table – Divehi" lang="dv" hreflang="dv" data-title="މޮޑިއުލް:table" data-language-autonym="ދިވެހިބަސް" data-language-local-name="Divehi" class="interlanguage-link-target">ދިވެހިބަސް</a></li><li class="interlanguage-link interwiki-et mw-list-item"><a href="https://et.wiktionary.org/wiki/Moodul:table" title="Moodul:table – Estonian" lang="et" hreflang="et" data-title="Moodul:table" data-language-autonym="Eesti" data-language-local-name="Estonian" class="interlanguage-link-target">Eesti</a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wiktionary.org/wiki/M%C3%B3dulo:tabla" title="Módulo:tabla – Spanish" lang="es" hreflang="es" data-title="Módulo:tabla" data-language-autonym="Español" data-language-local-name="Spanish" class="interlanguage-link-target">Español</a></li><li class="interlanguage-link interwiki-fy mw-list-item"><a href="https://fy.wiktionary.org/wiki/Module:table" title="Module:table – Western Frisian" lang="fy" hreflang="fy" data-title="Module:table" data-language-autonym="Frysk" data-language-local-name="Western Frisian" class="interlanguage-link-target">Frysk</a></li><li class="interlanguage-link interwiki-ko mw-list-item"><a href="https://ko.wiktionary.org/wiki/%EB%AA%A8%EB%93%88:table" title="모듈:table – Korean" lang="ko" hreflang="ko" data-title="모듈:table" data-language-autonym="한국어" data-language-local-name="Korean" class="interlanguage-link-target">한국어</a></li><li class="interlanguage-link interwiki-hi mw-list-item"><a href="https://hi.wiktionary.org/wiki/%E0%A4%85%E0%A4%A8%E0%A5%81%E0%A4%96%E0%A4%82%E0%A4%A1:table" title="अनुखंड:table – Hindi" lang="hi" hreflang="hi" data-title="अनुखंड:table" data-language-autonym="हिन्दी" data-language-local-name="Hindi" class="interlanguage-link-target">हिन्दी</a></li><li class="interlanguage-link interwiki-hsb mw-list-item"><a href="https://hsb.wiktionary.org/wiki/Modul:table" title="Modul:table – Upper Sorbian" lang="hsb" hreflang="hsb" data-title="Modul:table" data-language-autonym="Hornjoserbsce" data-language-local-name="Upper Sorbian" class="interlanguage-link-target">Hornjoserbsce</a></li><li class="interlanguage-link interwiki-id mw-list-item"><a href="https://id.wiktionary.org/wiki/Modul:table" title="Modul:table – Indonesian" lang="id" hreflang="id" data-title="Modul:table" data-language-autonym="Bahasa Indonesia" data-language-local-name="Indonesian" class="interlanguage-link-target">Bahasa Indonesia</a></li><li class="interlanguage-link interwiki-he mw-list-item"><a href="https://he.wiktionary.org/wiki/%D7%99%D7%97%D7%99%D7%93%D7%94:table" title="יחידה:table – Hebrew" lang="he" hreflang="he" data-title="יחידה:table" data-language-autonym="עברית" data-language-local-name="Hebrew" class="interlanguage-link-target">עברית</a></li><li class="interlanguage-link interwiki-jv mw-list-item"><a href="https://jv.wiktionary.org/wiki/Modhul:table" title="Modhul:table – Javanese" lang="jv" hreflang="jv" data-title="Modhul:table" data-language-autonym="Jawa" data-language-local-name="Javanese" class="interlanguage-link-target">Jawa</a></li><li class="interlanguage-link interwiki-ku mw-list-item"><a href="https://ku.wiktionary.org/wiki/Modul:table" title="Modul:table – Kurdish" lang="ku" hreflang="ku" data-title="Modul:table" data-language-autonym="Kurdî" data-language-local-name="Kurdish" class="interlanguage-link-target">Kurdî</a></li><li class="interlanguage-link interwiki-ky mw-list-item"><a href="https://ky.wiktionary.org/wiki/%D0%9C%D0%BE%D0%B4%D1%83%D0%BB%D1%8C:table" title="Модуль:table – Kyrgyz" lang="ky" hreflang="ky" data-title="Модуль:table" data-language-autonym="Кыргызча" data-language-local-name="Kyrgyz" class="interlanguage-link-target">Кыргызча</a></li><li class="interlanguage-link interwiki-lo mw-list-item"><a href="https://lo.wiktionary.org/wiki/Module:table" title="Module:table – Lao" lang="lo" hreflang="lo" data-title="Module:table" data-language-autonym="ລາວ" data-language-local-name="Lao" class="interlanguage-link-target">ລາວ</a></li><li class="interlanguage-link interwiki-hu mw-list-item"><a href="https://hu.wiktionary.org/wiki/Modul:table" title="Modul:table – Hungarian" lang="hu" hreflang="hu" data-title="Modul:table" data-language-autonym="Magyar" data-language-local-name="Hungarian" class="interlanguage-link-target">Magyar</a></li><li class="interlanguage-link interwiki-mg mw-list-item"><a href="https://mg.wiktionary.org/wiki/Module:table" title="Module:table – Malagasy" lang="mg" hreflang="mg" data-title="Module:table" data-language-autonym="Malagasy" data-language-local-name="Malagasy" class="interlanguage-link-target">Malagasy</a></li><li class="interlanguage-link interwiki-ml mw-list-item"><a href="https://ml.wiktionary.org/wiki/%E0%B4%98%E0%B4%9F%E0%B4%95%E0%B4%82:table" title="ഘടകം:table – Malayalam" lang="ml" hreflang="ml" data-title="ഘടകം:table" data-language-autonym="മലയാളം" data-language-local-name="Malayalam" class="interlanguage-link-target">മലയാളം</a></li><li class="interlanguage-link interwiki-mt mw-list-item"><a href="https://mt.wiktionary.org/wiki/Module:table" title="Module:table – Maltese" lang="mt" hreflang="mt" data-title="Module:table" data-language-autonym="Malti" data-language-local-name="Maltese" class="interlanguage-link-target">Malti</a></li><li class="interlanguage-link interwiki-mnw mw-list-item"><a href="https://mnw.wiktionary.org/wiki/%E1%80%99%E1%80%9D%E1%80%BA%E1%80%82%E1%80%BB%E1%80%B0:table" title="မဝ်ဂျူ:table – Mon" lang="mnw" hreflang="mnw" data-title="မဝ်ဂျူ:table" data-language-autonym="ဘာသာမန်" data-language-local-name="Mon" class="interlanguage-link-target">ဘာသာမန်</a></li><li class="interlanguage-link interwiki-ms mw-list-item"><a href="https://ms.wiktionary.org/wiki/Modul:table" title="Modul:table – Malay" lang="ms" hreflang="ms" data-title="Modul:table" data-language-autonym="Bahasa Melayu" data-language-local-name="Malay" class="interlanguage-link-target">Bahasa Melayu</a></li><li class="interlanguage-link interwiki-mni mw-list-item"><a href="https://mni.wiktionary.org/wiki/Module:table" title="Module:table – Manipuri" lang="mni" hreflang="mni" data-title="Module:table" data-language-autonym="ꯃꯤꯇꯩ ꯂꯣꯟ" data-language-local-name="Manipuri" class="interlanguage-link-target">ꯃꯤꯇꯩ ꯂꯣꯟ</a></li><li class="interlanguage-link interwiki-my mw-list-item"><a href="https://my.wiktionary.org/wiki/%E1%80%99%E1%80%B1%E1%80%AC%E1%80%BA%E1%80%82%E1%80%BB%E1%80%B0%E1%80%B8:table" title="မော်ဂျူး:table – Burmese" lang="my" hreflang="my" data-title="မော်ဂျူး:table" data-language-autonym="မြန်မာဘာသာ" data-language-local-name="Burmese" class="interlanguage-link-target">မြန်မာဘာသာ</a></li><li class="interlanguage-link interwiki-ja mw-list-item"><a href="https://ja.wiktionary.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:table" title="モジュール:table – Japanese" lang="ja" hreflang="ja" data-title="モジュール:table" data-language-autonym="日本語" data-language-local-name="Japanese" class="interlanguage-link-target">日本語</a></li><li class="interlanguage-link interwiki-uz mw-list-item"><a href="https://uz.wiktionary.org/wiki/Modul:Table" title="Modul:Table – Uzbek" lang="uz" hreflang="uz" data-title="Modul:Table" data-language-autonym="Oʻzbekcha / ўзбекча" data-language-local-name="Uzbek" class="interlanguage-link-target">Oʻzbekcha / ўзбекча</a></li><li class="interlanguage-link interwiki-pa mw-list-item"><a href="https://pa.wiktionary.org/wiki/%E0%A8%AE%E0%A9%8C%E0%A8%A1%E0%A8%BF%E0%A8%8A%E0%A8%B2:table" title="ਮੌਡਿਊਲ:table – Punjabi" lang="pa" hreflang="pa" data-title="ਮੌਡਿਊਲ:table" data-language-autonym="ਪੰਜਾਬੀ" data-language-local-name="Punjabi" class="interlanguage-link-target">ਪੰਜਾਬੀ</a></li><li class="interlanguage-link interwiki-blk mw-list-item"><a href="https://blk.wiktionary.org/wiki/%E1%80%99%E1%80%B1%E1%80%AC%E1%80%BA%E1%80%82%E1%80%BB%E1%80%B0%E1%80%B8:table" title="မော်ဂျူး:table – Pa'O" lang="blk" hreflang="blk" data-title="မော်ဂျူး:table" data-language-autonym="ပအိုဝ်ႏဘာႏသာႏ" data-language-local-name="Pa'O" class="interlanguage-link-target">ပအိုဝ်ႏဘာႏသာႏ</a></li><li class="interlanguage-link interwiki-km mw-list-item"><a href="https://km.wiktionary.org/wiki/Module:table" title="Module:table – Khmer" lang="km" hreflang="km" data-title="Module:table" data-language-autonym="ភាសាខ្មែរ" data-language-local-name="Khmer" class="interlanguage-link-target">ភាសាខ្មែរ</a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wiktionary.org/wiki/M%C3%B3dulo:table" title="Módulo:table – Portuguese" lang="pt" hreflang="pt" data-title="Módulo:table" data-language-autonym="Português" data-language-local-name="Portuguese" class="interlanguage-link-target">Português</a></li><li class="interlanguage-link interwiki-si mw-list-item"><a href="https://si.wiktionary.org/wiki/Module:table" title="Module:table – Sinhala" lang="si" hreflang="si" data-title="Module:table" data-language-autonym="සිංහල" data-language-local-name="Sinhala" class="interlanguage-link-target">සිංහල</a></li><li class="interlanguage-link interwiki-simple mw-list-item"><a href="https://simple.wiktionary.org/wiki/Module:table" title="Module:table – Simple English" lang="en-simple" hreflang="en-simple" data-title="Module:table" data-language-autonym="Simple English" data-language-local-name="Simple English" class="interlanguage-link-target">Simple English</a></li><li class="interlanguage-link interwiki-sk mw-list-item"><a href="https://sk.wiktionary.org/wiki/Modul:table" title="Modul:table – Slovak" lang="sk" hreflang="sk" data-title="Modul:table" data-language-autonym="Slovenčina" data-language-local-name="Slovak" class="interlanguage-link-target">Slovenčina</a></li><li class="interlanguage-link interwiki-ckb mw-list-item"><a href="https://ckb.wiktionary.org/wiki/%D9%85%DB%86%D8%AF%DB%8C%D9%88%D9%88%D9%84:table" title="مۆدیوول:table – Central Kurdish" lang="ckb" hreflang="ckb" data-title="مۆدیوول:table" data-language-autonym="کوردی" data-language-local-name="Central Kurdish" class="interlanguage-link-target">کوردی</a></li><li class="interlanguage-link interwiki-sr mw-list-item"><a href="https://sr.wiktionary.org/wiki/%D0%9C%D0%BE%D0%B4%D1%83%D0%BB:table" title="Модул:table – Serbian" lang="sr" hreflang="sr" data-title="Модул:table" data-language-autonym="Српски / srpski" data-language-local-name="Serbian" class="interlanguage-link-target">Српски / srpski</a></li><li class="interlanguage-link interwiki-ta mw-list-item"><a href="https://ta.wiktionary.org/wiki/Module:table" title="Module:table – Tamil" lang="ta" hreflang="ta" data-title="Module:table" data-language-autonym="தமிழ்" data-language-local-name="Tamil" class="interlanguage-link-target">தமிழ்</a></li><li class="interlanguage-link interwiki-shn mw-list-item"><a href="https://shn.wiktionary.org/wiki/%E1%80%99%E1%80%B1%E1%82%83%E1%82%87%E1%81%B5%E1%80%BB%E1%80%B0%E1%80%B8:table" title="မေႃႇၵျူး:table – Shan" lang="shn" hreflang="shn" data-title="မေႃႇၵျူး:table" data-language-autonym="ၽႃႇသႃႇတႆး " data-language-local-name="Shan" class="interlanguage-link-target">ၽႃႇသႃႇတႆး </a></li><li class="interlanguage-link interwiki-th mw-list-item"><a href="https://th.wiktionary.org/wiki/%E0%B8%A1%E0%B8%AD%E0%B8%94%E0%B8%B9%E0%B8%A5:table" title="มอดูล:table – Thai" lang="th" hreflang="th" data-title="มอดูล:table" data-language-autonym="ไทย" data-language-local-name="Thai" class="interlanguage-link-target">ไทย</a></li><li class="interlanguage-link interwiki-ti mw-list-item"><a href="https://ti.wiktionary.org/wiki/%E1%88%9E%E1%8B%B5%E1%8B%A9%E1%88%8D:table" title="ሞድዩል:table – Tigrinya" lang="ti" hreflang="ti" data-title="ሞድዩል:table" data-language-autonym="ትግርኛ" data-language-local-name="Tigrinya" class="interlanguage-link-target">ትግርኛ</a></li><li class="interlanguage-link interwiki-tg mw-list-item"><a href="https://tg.wiktionary.org/wiki/%D0%9C%D0%BE%D0%B4%D1%83%D0%BB:table" title="Модул:table – Tajik" lang="tg" hreflang="tg" data-title="Модул:table" data-language-autonym="Тоҷикӣ" data-language-local-name="Tajik" class="interlanguage-link-target">Тоҷикӣ</a></li><li class="interlanguage-link interwiki-tr mw-list-item"><a href="https://tr.wiktionary.org/wiki/Mod%C3%BCl:table" title="Modül:table – Turkish" lang="tr" hreflang="tr" data-title="Modül:table" data-language-autonym="Türkçe" data-language-local-name="Turkish" class="interlanguage-link-target">Türkçe</a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wiktionary.org/wiki/%D0%9C%D0%BE%D0%B4%D1%83%D0%BB%D1%8C:table" title="Модуль:table – Ukrainian" lang="uk" hreflang="uk" data-title="Модуль:table" data-language-autonym="Українська" data-language-local-name="Ukrainian" class="interlanguage-link-target">Українська</a></li><li class="interlanguage-link interwiki-vi mw-list-item"><a href="https://vi.wiktionary.org/wiki/M%C3%B4_%C4%91un:table" title="Mô đun:table – Vietnamese" lang="vi" hreflang="vi" data-title="Mô đun:table" data-language-autonym="Tiếng Việt" data-language-local-name="Vietnamese" class="interlanguage-link-target">Tiếng Việt</a></li><li class="interlanguage-link interwiki-yue mw-list-item"><a href="https://yue.wiktionary.org/wiki/%E6%A8%A1%E7%B5%84:table" title="模組:table – Cantonese" lang="yue" hreflang="yue" data-title="模組:table" data-language-autonym="粵語" data-language-local-name="Cantonese" class="interlanguage-link-target">粵語</a></li><li class="interlanguage-link interwiki-zh mw-list-item"><a href="https://zh.wiktionary.org/wiki/Module:Table" title="Module:Table – Chinese" lang="zh" hreflang="zh" data-title="Module:Table" data-language-autonym="中文" data-language-local-name="Chinese" class="interlanguage-link-target">中文</a></li> </ul> <div class="after-portlet after-portlet-lang"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q15727765#sitelinks-wiktionary" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></div> </div> </nav> </div> </div> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 22 November 2024, at 14:56.</li> <li id="footer-info-copyright">Definitions and other text are available under the <a rel="nofollow" class="external text" href="//creativecommons.org/licenses/by-sa/4.0/">Creative Commons Attribution-ShareAlike License</a>; additional terms may apply. By using this site, you agree to the <a class="external text" href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use">Terms of Use</a> and <a class="external text" href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy Policy.</a></li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Wiktionary:About">About Wiktionary</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wiktionary:General_disclaimer">Disclaimers</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Code of Conduct</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Developers</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/en.wiktionary.org">Statistics</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie statement</a></li> <li id="footer-places-mobileview"><a href="//en.m.wiktionary.org/w/index.php?title=Module:table&curid=5122966&diff=82733053&oldid=82709639&mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> <script>(RLQ=window.RLQ||[]).push(function(){mw.log.warn("This page is using the deprecated ResourceLoader module \"codex-search-styles\".\n[1.43] Use a CodexModule with codexComponents to set your specific components used: https://www.mediawiki.org/wiki/Codex#Using_a_limited_subset_of_components");mw.config.set({"wgHostname":"mw-web.codfw.main-6b7f745dd4-6tcrp","wgBackendResponseTime":670,"wgPageParseReport":{"limitreport":{"cputime":"0.270","walltime":"0.339","ppvisitednodes":{"value":429,"limit":1000000},"postexpandincludesize":{"value":98472,"limit":2097152},"templateargumentsize":{"value":34,"limit":2097152},"expansiondepth":{"value":7,"limit":100},"expensivefunctioncount":{"value":88,"limit":500},"unstrip-depth":{"value":0,"limit":20},"unstrip-size":{"value":22410,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 284.991 1 -total","100.00% 284.991 1 Template:documentation"," 60.35% 172.002 1 Template:module_documentation"," 2.75% 7.833 1 Template:module_cat"," 2.39% 6.809 1 Template:code"," 2.00% 5.688 1 Template:lua"," 0.85% 2.429 1 Template:w"]},"scribunto":{"limitreport-timeusage":{"value":"0.205","limit":"10.000"},"limitreport-memusage":{"value":2977024,"limit":104857600}},"cachereport":{"origin":"mw-web.codfw.main-6b7f745dd4-6tcrp","timestamp":"20241125112649","ttl":2592000,"transientcontent":false}}});});</script> </body> </html>