CINXE.COM

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-disabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available" 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 vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-disabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available";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":"ef65b253-2112-4d0b-a9bd-26e56babd1b5","wgCanonicalNamespace":"Module","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":828,"wgPageName":"Module:table","wgTitle":"table","wgCurRevisionId":82780099,"wgRevisionId":82752375,"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":82750632,"wgDiffNewId":82752375,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"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.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"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.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.interface","wikibase.client.vector-2022","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=ext.RevisionSlider.lazyCss%7Cext.pygments%2CwikimediaBadges%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.visualEditor.diffPage.init.styles%7Cext.wikimediamessages.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.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.gadget.LanguagesAndScripts%2CPalette%2CSite&only=styles&skin=vector-2022"> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.5"> <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--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-828 ns-subject page-Module_table rootpage-Module_table skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Main menu </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigation </div> <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-contact" class="mw-list-item"><a href="/wiki/Wiktionary:Contact_us">Contact us</a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Wiktionary:Main_Page" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/enwiktionary.svg" alt="" aria-hidden="true" height="50" width="50"> <img class="mw-logo-wordmark" alt="Wiktionary" src="/static/images/mobile/copyright/wiktionary-wordmark-en.svg" style="width: 6.6875em; height: 1.1875em;"> <img class="mw-logo-tagline" alt="The Free Dictionary" src="/static/images/mobile/copyright/wiktionary-tagline-en.svg" width="110" height="15" style="width: 6.875em; height: 0.9375em;"> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Wiktionary [f]" accesskey="f"> Search </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Wiktionary" aria-label="Search Wiktionary" autocapitalize="none" title="Search Wiktionary [f]" accesskey="f" id="searchInput" > </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Appearance </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="//donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wiktionary.org&uselang=en" class="">Donations</a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:CreateAccount&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82752375%26oldid%3D82750632" title="You are encouraged to create an account and log in; however, it is not mandatory" class="">Create account</a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:UserLogin&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82752375%26oldid%3D82750632" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o" class="">Log in</a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="More options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Personal tools </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item 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">Donations</a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82752375%26oldid%3D82750632" 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="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=Module%3Atable&returntoquery=curid%3D5122966%26diff%3D82752375%26oldid%3D82750632" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o"> Log in</a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing">learn more</a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <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-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n">Talk</a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">Beginning</div> </a> </li> <li id="toc-Detailed_documentation" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Detailed_documentation"> <div class="vector-toc-text"> 1 Detailed documentation </div> </a> <button aria-controls="toc-Detailed_documentation-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Detailed documentation subsection </button> <ul id="toc-Detailed_documentation-sublist" class="vector-toc-list"> <li id="toc-export.isPositiveInteger" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.isPositiveInteger"> <div class="vector-toc-text"> 1.1 export.isPositiveInteger </div> </a> <ul id="toc-export.isPositiveInteger-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.shallowcopy" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.shallowcopy"> <div class="vector-toc-text"> 1.2 export.shallowcopy </div> </a> <ul id="toc-export.shallowcopy-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.deepcopy" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.deepcopy"> <div class="vector-toc-text"> 1.3 export.deepcopy </div> </a> <ul id="toc-export.deepcopy-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.append" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.append"> <div class="vector-toc-text"> 1.4 export.append </div> </a> <ul id="toc-export.append-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.extendList" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.extendList"> <div class="vector-toc-text"> 1.5 export.extendList </div> </a> <ul id="toc-export.extendList-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.removeDuplicates" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.removeDuplicates"> <div class="vector-toc-text"> 1.6 export.removeDuplicates </div> </a> <ul id="toc-export.removeDuplicates-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.numKeys" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.numKeys"> <div class="vector-toc-text"> 1.7 export.numKeys </div> </a> <ul id="toc-export.numKeys-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.maxIndex" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.maxIndex"> <div class="vector-toc-text"> 1.8 export.maxIndex </div> </a> <ul id="toc-export.maxIndex-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.compressSparseArray" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.compressSparseArray"> <div class="vector-toc-text"> 1.9 export.compressSparseArray </div> </a> <ul id="toc-export.compressSparseArray-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.indexPairs" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.indexPairs"> <div class="vector-toc-text"> 1.10 export.indexPairs </div> </a> <ul id="toc-export.indexPairs-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.indexIpairs" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.indexIpairs"> <div class="vector-toc-text"> 1.11 export.indexIpairs </div> </a> <ul id="toc-export.indexIpairs-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.sparseIpairs" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.sparseIpairs"> <div class="vector-toc-text"> 1.12 export.sparseIpairs </div> </a> <ul id="toc-export.sparseIpairs-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.size" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.size"> <div class="vector-toc-text"> 1.13 export.size </div> </a> <ul id="toc-export.size-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.length" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.length"> <div class="vector-toc-text"> 1.14 export.length </div> </a> <ul id="toc-export.length-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.deepEquals" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.deepEquals"> <div class="vector-toc-text"> 1.15 export.deepEquals </div> </a> <ul id="toc-export.deepEquals-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.getNested" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.getNested"> <div class="vector-toc-text"> 1.16 export.getNested </div> </a> <ul id="toc-export.getNested-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.setNested" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.setNested"> <div class="vector-toc-text"> 1.17 export.setNested </div> </a> <ul id="toc-export.setNested-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.contains" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.contains"> <div class="vector-toc-text"> 1.18 export.contains </div> </a> <ul id="toc-export.contains-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.tableContains" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.tableContains"> <div class="vector-toc-text"> 1.19 export.tableContains </div> </a> <ul id="toc-export.tableContains-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.insertIfNot" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.insertIfNot"> <div class="vector-toc-text"> 1.20 export.insertIfNot </div> </a> <ul id="toc-export.insertIfNot-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.keyFor" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.keyFor"> <div class="vector-toc-text"> 1.21 export.keyFor </div> </a> <ul id="toc-export.keyFor-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.keysToList" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.keysToList"> <div class="vector-toc-text"> 1.22 export.keysToList </div> </a> <ul id="toc-export.keysToList-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.sortedPairs" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.sortedPairs"> <div class="vector-toc-text"> 1.23 export.sortedPairs </div> </a> <ul id="toc-export.sortedPairs-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.reverseIpairs" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.reverseIpairs"> <div class="vector-toc-text"> 1.24 export.reverseIpairs </div> </a> <ul id="toc-export.reverseIpairs-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.reduce" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.reduce"> <div class="vector-toc-text"> 1.25 export.reduce </div> </a> <ul id="toc-export.reduce-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.apply" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.apply"> <div class="vector-toc-text"> 1.26 export.apply </div> </a> <ul id="toc-export.apply-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.all" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.all"> <div class="vector-toc-text"> 1.27 export.all </div> </a> <ul id="toc-export.all-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.any" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.any"> <div class="vector-toc-text"> 1.28 export.any </div> </a> <ul id="toc-export.any-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.serialCommaJoin" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.serialCommaJoin"> <div class="vector-toc-text"> 1.29 export.serialCommaJoin </div> </a> <ul id="toc-export.serialCommaJoin-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.sparseConcat" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.sparseConcat"> <div class="vector-toc-text"> 1.30 export.sparseConcat </div> </a> <ul id="toc-export.sparseConcat-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.reverse" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.reverse"> <div class="vector-toc-text"> 1.31 export.reverse </div> </a> <ul id="toc-export.reverse-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.reverseConcat" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.reverseConcat"> <div class="vector-toc-text"> 1.32 export.reverseConcat </div> </a> <ul id="toc-export.reverseConcat-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.invert" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.invert"> <div class="vector-toc-text"> 1.33 export.invert </div> </a> <ul id="toc-export.invert-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.listToSet" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.listToSet"> <div class="vector-toc-text"> 1.34 export.listToSet </div> </a> <ul id="toc-export.listToSet-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.isArray" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.isArray"> <div class="vector-toc-text"> 1.35 export.isArray </div> </a> <ul id="toc-export.isArray-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-export.alias" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#export.alias"> <div class="vector-toc-text"> 1.36 export.alias </div> </a> <ul id="toc-export.alias-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Toggle the table of contents </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading">Module:table: difference between revisions</h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Go to an article in another language. Available in 49 languages" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-49" aria-hidden="true" > 49 languages </label> <div class="vector-dropdown-content"> <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> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-module" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Module:table" title="View the module page [c]" accesskey="c">Module</a></li><li id="ca-talk" class="vector-tab-noicon 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> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >English </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Module:table">Read</a></li><li id="ca-viewsource" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Module:table&action=edit&oldid=82752375" title="This page is protected.
You can view its source [e]" accesskey="e">View source</a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Module:table&action=history" title="Past revisions of this page [h]" accesskey="h">View history</a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >Tools </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Module:table">Read</a></li><li id="ca-more-viewsource" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Module:table&action=edit&oldid=82752375">View source</a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Module:table&action=history">View history</a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <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=82752375" 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%3D82752375%26oldid%3D82750632">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%3D82752375%26oldid%3D82750632">Download QR code</a></li> </ul> </div> </div> <div id="p-electronpdfservice-sidebar-portlet-heading" class="vector-menu mw-portlet mw-portlet-electronpdfservice-sidebar-portlet-heading" > <div class="vector-menu-heading"> Print/export </div> <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> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> In other projects </div> <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> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <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> <div id="siteSub" class="noprint">From Wiktionary, the free dictionary</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <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=82750632" 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=82752375" 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=82752375&oldid=82750632&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=82752375&oldid=82750632&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=82750632" title="Module:table">Revision as of 20:02, 24 November 2024</a> <a href="/w/index.php?title=Module:table&action=edit&oldid=82750632" 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="82750632"><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,839 edits</div></div></div><div id="mw-diff-otitle3">No edit summary</div><div id="mw-diff-otitle5"></div><div id="mw-diff-otitle4"><a href="/w/index.php?title=Module:table&diff=prev&oldid=82750632" 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=82752375" title="Module:table">Revision as of 01:26, 25 November 2024</a> <a href="/w/index.php?title=Module:table&action=edit&oldid=82752375" 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="82752375"><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,839 edits</div></div></div><div id="mw-diff-ntitle3"> Fix bug in maxIndex.</div><div id="mw-diff-ntitle5"></div><div id="mw-diff-ntitle4"><a href="/w/index.php?title=Module:table&diff=next&oldid=82752375" title="Module:table" id="differences-nextlink">Go to next edit →</a></div></td> </tr><tr> <td colspan="2" class="diff-lineno">Line 257:</td> <td colspan="2" class="diff-lineno">Line 257:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> local max = 0</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> local max = 0</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> for k in index_pairs(t) do</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> for k in index_pairs(t) do</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> if k > max then</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> if<ins class="diffchange diffchange-inline"> is_positive_integer(k) and</ins> k > max then</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div> max = k</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div> max = k</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> return <del class="diffchange diffchange-inline">is_positive_integer(</del>max<del class="diffchange diffchange-inline">) and max or 0</del></div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> return max</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"> </td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"> </td> </tr> <tr> <td colspan="2" class="diff-lineno">Line 717:</td> <td colspan="2" class="diff-lineno">Line 717:</td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div>Finds key for specified value in a given table. Roughly equivalent to reversing the key-value pairs in the table:</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div>Finds key for specified value in a given table. Roughly equivalent to reversing the key-value pairs in the table:</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div>* {reversed_table = { [value1] = key1, [value2] = key2, ... }}</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div>* {reversed_table = { [value1] = key1, [value2] = key2, ... }}</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div>and then returning {reversed_table[<del class="diffchange diffchange-inline">valueToFind</del>]}.</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div>and then returning {reversed_table[<ins class="diffchange diffchange-inline">value</ins>]}<ins class="diffchange diffchange-inline">. `__eq` metamethods are respected</ins>.</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"> </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>The value can only be a string or a number (not nil, a boolean, a table, or a function).</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"> </td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"> </td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div>Only reliable if there is just one key with the specified value. Otherwise, the function returns the first key found,</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div>Only reliable if there is just one key with the specified value. Otherwise, the function returns the first key found,</div></td> </tr> <tr> <td class="diff-marker"></td> <td class="diff-context diff-side-deleted"><div>and the output is unpredictable.]==]</div></td> <td class="diff-marker"></td> <td class="diff-context diff-side-added"><div>and the output is unpredictable.]==]</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div>function export.keyFor(t, <del class="diffchange diffchange-inline">valueToFind</del>)</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div>function export.keyFor(t, <ins class="diffchange diffchange-inline">value</ins>)</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> for <del class="diffchange diffchange-inline">key</del>, <del class="diffchange diffchange-inline">value</del> in index_pairs(t) do</div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> for <ins class="diffchange diffchange-inline">k</ins>, <ins class="diffchange diffchange-inline">v</ins> in index_pairs(t) do</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> if <del class="diffchange diffchange-inline">value</del> == <del class="diffchange diffchange-inline">valueToFind</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">v</ins> == <ins class="diffchange diffchange-inline">value</ins> then</div></td> </tr> <tr> <td class="diff-marker" data-marker="−"></td> <td class="diff-deletedline diff-side-deleted"><div> return <del class="diffchange diffchange-inline">key</del></div></td> <td class="diff-marker" data-marker="+"></td> <td class="diff-addedline diff-side-added"><div> return <ins class="diffchange diffchange-inline">k</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 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 01:26, 25 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. <meta property="mw:PageProp/toc" /> <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, raw)</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 unless the <code>raw</code> flag is set, 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, raw)</code> This returns the size of a key/value pair table. If <code>raw</code> is set, then metamethods will be ignored, giving the true table size. For arrays, it is faster 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 <code>#</code>, which can become unpredictable under certain circumstances due to the implementation of tables under the hood in Lua, and therefore should not be used when dealing with arbitrary tables. <code>#</code> also does not use metamethods, so will return the wrong value in cases where it is desirable to take these into account (e.g. data loaded via <code>mw.loadData</code>). If <code>raw</code> is set, then metamethods will be ignored, giving the true table length. For arrays, this function is faster than <code>export.size</code>. <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, raw)</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. If <code>raw</code> is true, then metamethods are not used during the comparison. <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(t, 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, value)</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[value]</code>. <code>__eq</code> metamethods are respected.</li></ul> 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, <code>export.numKeys</code> is probably faster. <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, <code>export.sparseIpairs</code> is probably faster. <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 it is called as an iterator, with the list index as the first argument, the item as the second (which will be used as the key), plus any additional arguments passed to <code class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr">listToSet</code>; the returned value is used as the value for that list item. If <code>value</code> 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>local export = {} <a href="#L-12"></a> <a href="#L-13"></a>local collation_module = "Module:collation" <a href="#L-14"></a>local debug_track_module = "Module:debug/track" <a href="#L-15"></a>local function_module = "Module:fun" <a href="#L-16"></a> <a href="#L-17"></a>local table = table <a href="#L-18"></a> <a href="#L-19"></a>local concat = table.concat <a href="#L-20"></a>local contains -- defined as export.contains <a href="#L-21"></a>local deep_copy -- defined as export.deepcopy <a href="#L-22"></a>local deep_equals -- defined as export.deepEquals <a href="#L-23"></a>local format = string.format <a href="#L-24"></a>local getmetatable = getmetatable <a href="#L-25"></a>local index_pairs -- defined as export.indexPairs <a href="#L-26"></a>local insert = table.insert <a href="#L-27"></a>local insert_if_not -- defined as export.insertIfNot <a href="#L-28"></a>local invert -- -- defined as export.invert <a href="#L-29"></a>local ipairs = ipairs <a href="#L-30"></a>local ipairs_default_iter = ipairs{export} <a href="#L-31"></a>local is_positive_integer -- defined as export.isPositiveInteger <a href="#L-32"></a>local keys_to_list -- defined as export.keysToList <a href="#L-33"></a>local next = next <a href="#L-34"></a>local num_keys -- defined as export.numKeys <a href="#L-35"></a>local pairs = pairs <a href="#L-36"></a>local pcall = pcall <a href="#L-37"></a>local rawequal = rawequal <a href="#L-38"></a>local rawget = rawget <a href="#L-39"></a>local require = require <a href="#L-40"></a>local select = select <a href="#L-41"></a>local setmetatable = setmetatable <a href="#L-42"></a>local sort = table.sort <a href="#L-43"></a>local sparse_ipairs -- defined as export.sparseIpairs <a href="#L-44"></a>local table_len -- defined as export.length <a href="#L-45"></a>local table_reverse -- defined as export.reverse <a href="#L-46"></a>local type = type <a href="#L-47"></a> <a href="#L-48"></a>local infinity = math.huge <a href="#L-49"></a> <a href="#L-50"></a>--[==[ <a href="#L-51"></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-52"></a> local function debug_track(...) <a href="#L-53"></a> debug_track = require(debug_track_module) <a href="#L-54"></a> return debug_track(...) <a href="#L-55"></a> end <a href="#L-56"></a> <a href="#L-57"></a> local function is_callable(...) <a href="#L-58"></a> is_callable = require(function_module).is_callable <a href="#L-59"></a> return is_callable(...) <a href="#L-60"></a> end <a href="#L-61"></a> <a href="#L-62"></a> local function string_sort(...) <a href="#L-63"></a> string_sort = require(collation_module).string_sort <a href="#L-64"></a> return string_sort(...) <a href="#L-65"></a> end <a href="#L-66"></a> <a href="#L-67"></a>--[==[ <a href="#L-68"></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-69"></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-70"></a>table.]==] <a href="#L-71"></a>function export.isPositiveInteger(v) <a href="#L-72"></a> return type(v) == "number" and v >= 1 and v % 1 == 0 and v < infinity <a href="#L-73"></a>end <a href="#L-74"></a>is_positive_integer = export.isPositiveInteger <a href="#L-75"></a> <a href="#L-76"></a>--[==[ <a href="#L-77"></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 unless the `raw` flag is set, but the returned table will have no metatable of its own.]==] <a href="#L-78"></a>function export.shallowcopy(orig, raw) <a href="#L-79"></a> if type(orig) ~= "table" then <a href="#L-80"></a> return orig <a href="#L-81"></a> end <a href="#L-82"></a> local copy, iter, state, init = {} <a href="#L-83"></a> if raw then <a href="#L-84"></a> iter, state = next, orig <a href="#L-85"></a> else <a href="#L-86"></a> iter, state, init = index_pairs(orig) <a href="#L-87"></a> -- Track instances of data loaded via mw.loadData being copied, which is very inefficient and usually unnecessary. <a href="#L-88"></a> local mt = getmetatable(orig) <a href="#L-89"></a> if mt and type(mt) == "table" and rawget(mt, "mw_loadData") == true then <a href="#L-90"></a> debug_track("table/shallowcopy/loaded data") <a href="#L-91"></a> end <a href="#L-92"></a> end <a href="#L-93"></a> for k, v in iter, state, init do <a href="#L-94"></a> copy[k] = v <a href="#L-95"></a> end <a href="#L-96"></a> return copy <a href="#L-97"></a>end <a href="#L-98"></a> <a href="#L-99"></a>do <a href="#L-100"></a> local function make_copy(orig, memo, mt_flag, keep_loaded_data, tracked) <a href="#L-101"></a> if type(orig) ~= "table" then <a href="#L-102"></a> return orig <a href="#L-103"></a> end <a href="#L-104"></a> local memoized = memo[orig] <a href="#L-105"></a> if memoized ~= nil then <a href="#L-106"></a> return memoized <a href="#L-107"></a> end <a href="#L-108"></a> local mt, iter, state, init = getmetatable(orig) <a href="#L-109"></a> -- `mt` could be a non-table if `__metatable` has been used, but discard it in such cases. <a href="#L-110"></a> if not (mt and type(mt) == "table") then <a href="#L-111"></a> mt, iter, state, init = nil, next, orig, nil <a href="#L-112"></a> -- Data loaded via `mw.loadData`. <a href="#L-113"></a> elseif rawget(mt, "mw_loadData") == true then <a href="#L-114"></a> if keep_loaded_data then <a href="#L-115"></a> memo[orig] = orig <a href="#L-116"></a> return orig <a href="#L-117"></a> -- Track instances of such data being copied, which is very inefficient and usually unnecessary. <a href="#L-118"></a> elseif not tracked then <a href="#L-119"></a> debug_track("table/deepcopy/loaded data") <a href="#L-120"></a> tracked = true <a href="#L-121"></a> end <a href="#L-122"></a> -- Discard the metatable, and use the `__pairs` metamethod. <a href="#L-123"></a> mt, iter, state, init = nil, pairs(orig) <a href="#L-124"></a> -- Otherwise, use `mt`. <a href="#L-125"></a> else <a href="#L-126"></a> iter, state, init = next, orig, nil <a href="#L-127"></a> end <a href="#L-128"></a> local copy = {} <a href="#L-129"></a> memo[orig] = copy <a href="#L-130"></a> for k, v in iter, state, init do <a href="#L-131"></a> copy[make_copy(k, memo, mt_flag, keep_loaded_data, tracked)] = make_copy(v, memo, mt_flag, keep_loaded_data, tracked) <a href="#L-132"></a> end <a href="#L-133"></a> if mt == nil or mt_flag == "none" then <a href="#L-134"></a> return copy <a href="#L-135"></a> elseif mt_flag ~= "keep" then <a href="#L-136"></a> mt = make_copy(mt, memo, mt_flag, keep_loaded_data, tracked) <a href="#L-137"></a> end <a href="#L-138"></a> return setmetatable(copy, mt) <a href="#L-139"></a> end <a href="#L-140"></a> <a href="#L-141"></a> --[==[ <a href="#L-142"></a> Recursive deep copy function. Preserves copied identities of subtables. <a href="#L-143"></a> A more powerful version of {mw.clone}, with customizable options. <a href="#L-144"></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-145"></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-146"></a> * Notes: <a href="#L-147"></a> *# Protected metatables will not be copied (i.e. those hidden behind a __metatable metamethod), as they are not <a href="#L-148"></a> accessible by Lua's design. Instead, the output of the __metatable method will be used instead. <a href="#L-149"></a> *# When iterating over the table, the __pairs metamethod is ignored, since this can prevent the table from being properly cloned. <a href="#L-150"></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-151"></a> function export.deepcopy(orig, metatableFlag, keepLoadedData) <a href="#L-152"></a> return make_copy(orig, {}, metatableFlag, keepLoadedData) <a href="#L-153"></a> end <a href="#L-154"></a> deep_copy = export.deepcopy <a href="#L-155"></a>end <a href="#L-156"></a> <a href="#L-157"></a>--[==[ <a href="#L-158"></a>Append any number of tables together and returns the result. Compare the Lisp expression {(append list1 list2 ...)}.]==] <a href="#L-159"></a>function export.append(...) <a href="#L-160"></a> local args, list, n = {...}, {}, 0 <a href="#L-161"></a> for i = 1, select("#", ...) do <a href="#L-162"></a> local t, j = args[i], 0 <a href="#L-163"></a> while true do <a href="#L-164"></a> j = j + 1 <a href="#L-165"></a> local v = t[j] <a href="#L-166"></a> if v == nil then <a href="#L-167"></a> break <a href="#L-168"></a> end <a href="#L-169"></a> n = n + 1 <a href="#L-170"></a> list[n] = v <a href="#L-171"></a> end <a href="#L-172"></a> end <a href="#L-173"></a> return list <a href="#L-174"></a>end <a href="#L-175"></a> <a href="#L-176"></a>--[==[ <a href="#L-177"></a>Extend an existing list by a new list, modifying the existing list in-place. Compare the Python expression <a href="#L-178"></a>{list.extend(new_items)}. <a href="#L-179"></a> <a href="#L-180"></a>`options` is an optional table of additional options to control the behavior of the operation. The following options are <a href="#L-181"></a>recognized: <a href="#L-182"></a>* `insertIfNot`: Use {export.insertIfNot()} instead of {table.insert()}, which ensures that duplicate items do not get <a href="#L-183"></a> inserted (at the cost of an O((M+N)*N) operation, where M = #list and N = #new_items). <a href="#L-184"></a>* `key`: As in {insertIfNot()}. Ignored otherwise. <a href="#L-185"></a>* `pos`: As in {insertIfNot()}. Ignored otherwise.]==] <a href="#L-186"></a>function export.extendList(list, new_items, options) <a href="#L-187"></a> local i, insert_if_not_option = 0, options and options.insertIfNot <a href="#L-188"></a> while true do <a href="#L-189"></a> i = i + 1 <a href="#L-190"></a> local item = new_items[i] <a href="#L-191"></a> if item == nil then <a href="#L-192"></a> return <a href="#L-193"></a> elseif insert_if_not_option then <a href="#L-194"></a> insert_if_not(list, item, options) <a href="#L-195"></a> else <a href="#L-196"></a> insert(list, item) <a href="#L-197"></a> end <a href="#L-198"></a> end <a href="#L-199"></a>end <a href="#L-200"></a> <a href="#L-201"></a>do <a href="#L-202"></a> local pos_nan, neg_nan <a href="#L-203"></a> <a href="#L-204"></a> --[==[ <a href="#L-205"></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-206"></a> function export.removeDuplicates(t) <a href="#L-207"></a> local list, seen, i, n = {}, {}, 0, 0 <a href="#L-208"></a> while true do <a href="#L-209"></a> i = i + 1 <a href="#L-210"></a> local v = t[i] <a href="#L-211"></a> if v == nil then <a href="#L-212"></a> return list <a href="#L-213"></a> end <a href="#L-214"></a> local memo_key <a href="#L-215"></a> if v == v then <a href="#L-216"></a> memo_key = v <a href="#L-217"></a> -- NaN <a href="#L-218"></a> elseif format("%f", v) == "nan" then <a href="#L-219"></a> if not pos_nan then <a href="#L-220"></a> pos_nan = {} <a href="#L-221"></a> end <a href="#L-222"></a> memo_key = pos_nan <a href="#L-223"></a> -- -NaN <a href="#L-224"></a> else <a href="#L-225"></a> if not neg_nan then <a href="#L-226"></a> neg_nan = {} <a href="#L-227"></a> end <a href="#L-228"></a> memo_key = neg_nan <a href="#L-229"></a> end <a href="#L-230"></a> if not seen[memo_key] then <a href="#L-231"></a> n = n + 1 <a href="#L-232"></a> list[n], seen[memo_key] = v, true <a href="#L-233"></a> end <a href="#L-234"></a> end <a href="#L-235"></a> return list <a href="#L-236"></a> end <a href="#L-237"></a>end <a href="#L-238"></a> <a href="#L-239"></a>--[==[ <a href="#L-240"></a>Given a table, return an array containing all positive integer keys, sorted in numerical order.]==] <a href="#L-241"></a>function export.numKeys(t) <a href="#L-242"></a> local nums, i = {}, 0 <a href="#L-243"></a> for k in index_pairs(t) do <a href="#L-244"></a> if is_positive_integer(k) then <a href="#L-245"></a> i = i + 1 <a href="#L-246"></a> nums[i] = k <a href="#L-247"></a> end <a href="#L-248"></a> end <a href="#L-249"></a> sort(nums) <a href="#L-250"></a> return nums <a href="#L-251"></a>end <a href="#L-252"></a>num_keys = export.numKeys <a href="#L-253"></a> <a href="#L-254"></a>--[==[ <a href="#L-255"></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-256"></a>function export.maxIndex(t) <a href="#L-257"></a> local max = 0 <a href="#L-258"></a> for k in index_pairs(t) do <a href="#L-259"></a> if is_positive_integer(k) and k > max then <a href="#L-260"></a> max = k <a href="#L-261"></a> end <a href="#L-262"></a> end <a href="#L-263"></a> return max <a href="#L-264"></a>end <a href="#L-265"></a> <a href="#L-266"></a>--[==[ <a href="#L-267"></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-268"></a>function export.compressSparseArray(t) <a href="#L-269"></a> local list, keys, i = {}, num_keys(t), 0 <a href="#L-270"></a> while true do <a href="#L-271"></a> i = i + 1 <a href="#L-272"></a> local k = keys[i] <a href="#L-273"></a> if k == nil then <a href="#L-274"></a> return list <a href="#L-275"></a> end <a href="#L-276"></a> list[i] = t[k] <a href="#L-277"></a> end <a href="#L-278"></a>end <a href="#L-279"></a> <a href="#L-280"></a>do <a href="#L-281"></a> local current <a href="#L-282"></a> --[==[ <a href="#L-283"></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-284"></a> <a href="#L-285"></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-286"></a> <a href="#L-287"></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-288"></a> function export.indexPairs(t, raw) <a href="#L-289"></a> -- If there's no metatable, result is identical to `pairs`. <a href="#L-290"></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-291"></a> if current and current[t] or getmetatable(t) == nil then <a href="#L-292"></a> return next, t, nil <a href="#L-293"></a> end <a href="#L-294"></a> <a href="#L-295"></a> -- `seen_k` memoizes keys, as they should never repeat; `seen_t` memoizes tables iterated over. <a href="#L-296"></a> local seen_k, seen_t, iterate, iter, state = {}, {} <a href="#L-297"></a> <a href="#L-298"></a> local function catch_values(k, ...) <a href="#L-299"></a> if k ~= nil then <a href="#L-300"></a> -- If a repeated key is found, skip and iterate again. <a href="#L-301"></a> if seen_k[k] then <a href="#L-302"></a> return catch_values(iter(state, k)) <a href="#L-303"></a> end <a href="#L-304"></a> seen_k[k] = true <a href="#L-305"></a> return k, ... <a href="#L-306"></a> end <a href="#L-307"></a> -- If there's an __index metamethod, iterate over it iff it's a table not already seen before. Otherwise, return. <a href="#L-308"></a> local mt = getmetatable(t) <a href="#L-309"></a> -- `mt` might not be a table if __metatable is used. <a href="#L-310"></a> if mt == nil or type(mt) ~= "table" then <a href="#L-311"></a> return nil <a href="#L-312"></a> end <a href="#L-313"></a> t = rawget(mt, "__index") <a href="#L-314"></a> if t == nil or type(t) ~= "table" or seen_t[t] then <a href="#L-315"></a> return nil <a href="#L-316"></a> end <a href="#L-317"></a> seen_t[t], iter = true, nil <a href="#L-318"></a> return iterate() <a href="#L-319"></a> end <a href="#L-320"></a> <a href="#L-321"></a> function iterate(_, k) <a href="#L-322"></a> if iter ~= nil then <a href="#L-323"></a> -- Metamethods can return an arbitrary number of values, so catch them to avoid creating a table. <a href="#L-324"></a> return catch_values(iter(state, k)) <a href="#L-325"></a> end <a href="#L-326"></a> -- If `raw` is set, use `next`. <a href="#L-327"></a> if raw then <a href="#L-328"></a> iter, state, k = next, t, nil <a href="#L-329"></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-330"></a> else <a href="#L-331"></a> if not current then <a href="#L-332"></a> current = {} <a href="#L-333"></a> end <a href="#L-334"></a> current[t] = true <a href="#L-335"></a> -- Use `pcall`, so that `t` can always be unset from `current`. <a href="#L-336"></a> local success <a href="#L-337"></a> success, iter, state, k = pcall(pairs, t) <a href="#L-338"></a> current[t] = nil <a href="#L-339"></a> -- If there was an error, raise it. <a href="#L-340"></a> if not success then <a href="#L-341"></a> error(iter) <a href="#L-342"></a> end <a href="#L-343"></a> end <a href="#L-344"></a> return catch_values(iter(state, k)) <a href="#L-345"></a> end <a href="#L-346"></a> <a href="#L-347"></a> return iterate <a href="#L-348"></a> end <a href="#L-349"></a> index_pairs = export.indexPairs <a href="#L-350"></a>end <a href="#L-351"></a> <a href="#L-352"></a>do <a href="#L-353"></a> local current <a href="#L-354"></a> <a href="#L-355"></a> local function ipairs_func(t, i) <a href="#L-356"></a> i = i + 1 <a href="#L-357"></a> local v = t[i] <a href="#L-358"></a> if v ~= nil then <a href="#L-359"></a> return i, v <a href="#L-360"></a> end <a href="#L-361"></a> end <a href="#L-362"></a> <a href="#L-363"></a> --[==[ <a href="#L-364"></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-365"></a> <a href="#L-366"></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-367"></a> <a href="#L-368"></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-369"></a> function export.indexIpairs(t, raw) <a href="#L-370"></a> -- If there's no metatable, result is identical to `ipairs`. <a href="#L-371"></a> if getmetatable(t) == nil then <a href="#L-372"></a> if not current then <a href="#L-373"></a> current = {} <a href="#L-374"></a> end <a href="#L-375"></a> return ipairs_default_iter, t, 0 <a href="#L-376"></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-377"></a> elseif raw or current and current[t] then <a href="#L-378"></a> return ipairs_func, t, 0 <a href="#L-379"></a> elseif not current then <a href="#L-380"></a> current = {} <a href="#L-381"></a> end <a href="#L-382"></a> current[t] = true <a href="#L-383"></a> -- Use `pcall`, so that `t` can always be unset from `current`. <a href="#L-384"></a> local success, iter, state, init = pcall(ipairs, t) <a href="#L-385"></a> current[t] = nil <a href="#L-386"></a> -- If there was an error, raise it. <a href="#L-387"></a> if not success then <a href="#L-388"></a> error(iter) <a href="#L-389"></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 `init` values were returned. <a href="#L-390"></a> elseif iter == ipairs_default_iter then <a href="#L-391"></a> iter = ipairs_func <a href="#L-392"></a> end <a href="#L-393"></a> return iter, state, init <a href="#L-394"></a> end <a href="#L-395"></a>end <a href="#L-396"></a> <a href="#L-397"></a>--[==[ <a href="#L-398"></a>This is an iterator for sparse arrays. It can be used like ipairs, but can handle nil values.]==] <a href="#L-399"></a>function export.sparseIpairs(t) <a href="#L-400"></a> local keys, i = num_keys(t), 0 <a href="#L-401"></a> return function() <a href="#L-402"></a> i = i + 1 <a href="#L-403"></a> local k = keys[i] <a href="#L-404"></a> if k then <a href="#L-405"></a> return k, t[k] <a href="#L-406"></a> end <a href="#L-407"></a> end <a href="#L-408"></a>end <a href="#L-409"></a>sparse_ipairs = export.sparseIpairs <a href="#L-410"></a> <a href="#L-411"></a>--[==[ <a href="#L-412"></a>This returns the size of a key/value pair table. If `raw` is set, then metamethods will be ignored, giving the true table size. <a href="#L-413"></a> <a href="#L-414"></a>For arrays, it is faster to use `export.length`.]==] <a href="#L-415"></a>function export.size(t, raw) <a href="#L-416"></a> local i, iter, state, init = 0 <a href="#L-417"></a> if raw then <a href="#L-418"></a> iter, state, init = next, t, nil <a href="#L-419"></a> else <a href="#L-420"></a> iter, state, init = index_pairs(t) <a href="#L-421"></a> end <a href="#L-422"></a> for _ in iter, state, init do <a href="#L-423"></a> i = i + 1 <a href="#L-424"></a> end <a href="#L-425"></a> return i <a href="#L-426"></a>end <a href="#L-427"></a> <a href="#L-428"></a>--[==[ <a href="#L-429"></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 due to the implementation of tables under the hood in Lua, and therefore should not be used when dealing with arbitrary tables. `#` also does not use metamethods, so will return the wrong value in cases where it is desirable to take these into account (e.g. data loaded via `mw.loadData`). If `raw` is set, then metamethods will be ignored, giving the true table length. <a href="#L-430"></a> <a href="#L-431"></a>For arrays, this function is faster than `export.size`.]==] <a href="#L-432"></a>function export.length(t, raw) <a href="#L-433"></a> local n = 0 <a href="#L-434"></a> if raw then <a href="#L-435"></a> for i in ipairs_default_iter, t, 0 do <a href="#L-436"></a> n = i <a href="#L-437"></a> end <a href="#L-438"></a> return n <a href="#L-439"></a> end <a href="#L-440"></a> repeat <a href="#L-441"></a> n = n + 1 <a href="#L-442"></a> until t[n] == nil <a href="#L-443"></a> return n - 1 <a href="#L-444"></a>end <a href="#L-445"></a>table_len = export.length <a href="#L-446"></a> <a href="#L-447"></a>do <a href="#L-448"></a> local function raw_pairs(t) <a href="#L-449"></a> return next, t <a href="#L-450"></a> end <a href="#L-451"></a> <a href="#L-452"></a> local function is_equivalent(a, b, memo, include_mt, pairs_func) <a href="#L-453"></a> -- Raw equality check. <a href="#L-454"></a> if rawequal(a, b) then <a href="#L-455"></a> return true <a href="#L-456"></a> -- If not equal, a and b can only be equivalent if they're both tables. <a href="#L-457"></a> elseif not (type(a) == "table" and type(b) == "table") then <a href="#L-458"></a> return false <a href="#L-459"></a> end <a href="#L-460"></a> -- If `a` and `b` have been compared before, return the memoized result. This will usually be true, since failures normally fail the whole check outright, but match failures can occur during the laborious check without this happening, so it could be false. <a href="#L-461"></a> local memo_a = memo[a] <a href="#L-462"></a> if memo_a then <a href="#L-463"></a> local result = memo_a[b] <a href="#L-464"></a> if result ~= nil then <a href="#L-465"></a> return result <a href="#L-466"></a> end <a href="#L-467"></a> -- To avoid recursive references causing infinite loops, assume the tables currently being compared are equivalent by memoizing them as true; this will be corrected to false if there's a match failure. <a href="#L-468"></a> memo_a[b] = true <a href="#L-469"></a> else <a href="#L-470"></a> memo_a = {[b] = true} <a href="#L-471"></a> memo[a] = memo_a <a href="#L-472"></a> end <a href="#L-473"></a> -- Don't bother checking `memo_b` for `a`, since if `a` and `b` had been compared before, then `b` would be in `memo_a`. <a href="#L-474"></a> local memo_b = memo[b] <a href="#L-475"></a> if memo_b then <a href="#L-476"></a> memo_b[a] = true <a href="#L-477"></a> else <a href="#L-478"></a> memo_b = {[a] = true} <a href="#L-479"></a> memo[b] = memo_b <a href="#L-480"></a> end <a href="#L-481"></a> -- If `include_mt` is set, check the metatables are equivalent. <a href="#L-482"></a> if include_mt and not is_equivalent(getmetatable(a), getmetatable(b), memo, true, pairs_func) then <a href="#L-483"></a> memo_a[b], memo_b[a] = false, false <a href="#L-484"></a> return false <a href="#L-485"></a> end <a href="#L-486"></a> -- Copy all key/values pairs in `b` to `remaining_b`, and count the size: this uses `pairs_func`, which will also be used to iterate over `a`, ensuring that `a` and `b` are iterated over in the same way. This is necessary to ensure that `export.deepEquals(a, b)` and `export.deepEquals(b, a)` always give the same result. Simply iterating over `a` while accessing keys in `b` for comparison would ignore any `__pairs` metamethod that `b` has, which could cause non-symmetrical outputs if `__pairs` returns more or less than the complete set of key/value pairs accessible via `__index`, so using `pairs_func` for both `a` and `b` prevents this. <a href="#L-487"></a> -- TODO: handle exotic `__pairs` methods which return the same key multiple times with different values. <a href="#L-488"></a> local remaining_b, size_b = {}, 0 <a href="#L-489"></a> for k_b, v_b in pairs_func(b) do <a href="#L-490"></a> remaining_b[k_b], size_b = v_b, size_b + 1 <a href="#L-491"></a> end <a href="#L-492"></a> -- Fast check: iterate over the keys in `a`, checking if an equivalent value exists at the same key in `remaining_b`. As matches are found, key/value pairs are removed from `remaining_b`. If any keys in `a` or `remaining_b` are tables, the fast check will only work if the exact same object exists as a key in the other table. Any others from `a` that don't match anything in `remaining_b` are added to `remaining_a`, while those in `remaining_b` that weren't found will still remain once the loop ends. `remaining_a` and `remaining_b` are then compared at the end with the laborious check. <a href="#L-493"></a> local size_a, remaining_a = 0 <a href="#L-494"></a> for k, v_a in pairs_func(a) do <a href="#L-495"></a> local v_b = remaining_b[k] <a href="#L-496"></a> -- If `k` isn't in `remaining_b`, `a` and `b` can't be equivalent unless it's a table. <a href="#L-497"></a> if v_b == nil then <a href="#L-498"></a> if type(k) ~= "table" then <a href="#L-499"></a> memo_a[b], memo_b[a] = false, false <a href="#L-500"></a> return false <a href="#L-501"></a> -- Otherwise, add the `k`/`v_a` pair to `remaining_a` for the laborious check. <a href="#L-502"></a> elseif not remaining_a then <a href="#L-503"></a> remaining_a = {} <a href="#L-504"></a> end <a href="#L-505"></a> remaining_a[k], size_a = v_a, size_a + 1 <a href="#L-506"></a> -- Otherwise, if `k` exists in `a` and `remaining_b`, `v_a` and `v_b` must be equivalent for there to be a match. <a href="#L-507"></a> elseif is_equivalent(v_a, v_b, memo, include_mt, pairs_func) then <a href="#L-508"></a> remaining_b[k], size_b = nil, size_b - 1 <a href="#L-509"></a> else <a href="#L-510"></a> memo_a[b], memo_b[a] = false, false <a href="#L-511"></a> return false <a href="#L-512"></a> end <a href="#L-513"></a> end <a href="#L-514"></a> -- Must be the same number of remaining keys in each table. <a href="#L-515"></a> if size_a ~= size_b then <a href="#L-516"></a> memo_a[b], memo_b[a] = false, false <a href="#L-517"></a> return false <a href="#L-518"></a> -- If the size is 0, there's nothing left to check. <a href="#L-519"></a> elseif size_a == 0 then <a href="#L-520"></a> return true <a href="#L-521"></a> end <a href="#L-522"></a> -- Laborious check: since it's not possible to use table lookups, check each key/value pair in `remaining_a` against every key/value pair in `remaining_b` until a match is found, removing the matching key/value pair from `remaining_b` each time, to ensure one-to-one correspondence. <a href="#L-523"></a> for k_a, v_a in next, remaining_a do <a href="#L-524"></a> local success <a href="#L-525"></a> for k_b, v_b in next, remaining_b do <a href="#L-526"></a> -- Keys/value pairs must be equivalent in order to match. <a href="#L-527"></a> if ( <a href="#L-528"></a> -- Check values first for speed, since they might not be tables. <a href="#L-529"></a> is_equivalent(v_a, v_b, memo, include_mt, pairs_func) and <a href="#L-530"></a> is_equivalent(k_a, k_b, memo, include_mt, pairs_func) <a href="#L-531"></a> ) then <a href="#L-532"></a> -- Remove matched key from `remaining_b`, and break the inner loop. <a href="#L-533"></a> success, remaining_b[k_b] = true, nil <a href="#L-534"></a> break <a href="#L-535"></a> end <a href="#L-536"></a> end <a href="#L-537"></a> -- Fail if `remaining_b` runs out of keys, as the `k_a`/`v_a` pair still hasn't matched. <a href="#L-538"></a> if not success then <a href="#L-539"></a> memo_a[b], memo_b[a] = false, false <a href="#L-540"></a> return false <a href="#L-541"></a> end <a href="#L-542"></a> end <a href="#L-543"></a> -- If every key/value pair in `remaining_a` matched with one in `remaining_b`, `a` and `b` must be equivalent. Note that `remaining_b` will now be empty, since the laborious check only starts if `remaining_a` and `remaining_b` are the same size. <a href="#L-544"></a> return true <a href="#L-545"></a> end <a href="#L-546"></a> <a href="#L-547"></a> --[==[ <a href="#L-548"></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-549"></a> <a href="#L-550"></a> If `include_mt` is true, then metatables are also compared. If `raw` is true, then metamethods are not used during the comparison.]==] <a href="#L-551"></a> function export.deepEquals(a, b, include_mt, raw) <a href="#L-552"></a> return is_equivalent(a, b, {}, include_mt, raw and raw_pairs or index_pairs) <a href="#L-553"></a> end <a href="#L-554"></a> deep_equals = export.deepEquals <a href="#L-555"></a>end <a href="#L-556"></a> <a href="#L-557"></a>do <a href="#L-558"></a> local function get_nested(t, k, ...) <a href="#L-559"></a> if t == nil then <a href="#L-560"></a> return nil <a href="#L-561"></a> elseif select("#", ...) ~= 0 then <a href="#L-562"></a> return get_nested(t[k], ...) <a href="#L-563"></a> end <a href="#L-564"></a> return t[k] <a href="#L-565"></a> end <a href="#L-566"></a> <a href="#L-567"></a> --[==[ <a href="#L-568"></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-569"></a> <a href="#L-570"></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-571"></a> function export.getNested(t, ...) <a href="#L-572"></a> if t == nil or select("#", ...) == 0 then <a href="#L-573"></a> error("Must provide a table and at least one key.") <a href="#L-574"></a> end <a href="#L-575"></a> return get_nested(t, ...) <a href="#L-576"></a> end <a href="#L-577"></a>end <a href="#L-578"></a> <a href="#L-579"></a>do <a href="#L-580"></a> local function set_nested(t, v, k, ...) <a href="#L-581"></a> if select("#", ...) == 0 then <a href="#L-582"></a> t[k] = v <a href="#L-583"></a> return <a href="#L-584"></a> end <a href="#L-585"></a> local next_t = t[k] <a href="#L-586"></a> if next_t == nil then <a href="#L-587"></a> -- If there's no next table while setting nil, there's nothing more to do. <a href="#L-588"></a> if v == nil then <a href="#L-589"></a> return <a href="#L-590"></a> end <a href="#L-591"></a> next_t = {} <a href="#L-592"></a> t[k] = next_t <a href="#L-593"></a> end <a href="#L-594"></a> return set_nested(next_t, v, ...) <a href="#L-595"></a> end <a href="#L-596"></a> <a href="#L-597"></a> --[==[ <a href="#L-598"></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-599"></a> <a href="#L-600"></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-601"></a> <a href="#L-602"></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-603"></a> function export.setNested(t, ...) <a href="#L-604"></a> if t == nil or select("#", ...) < 2 then <a href="#L-605"></a> error("Must provide a table and at least one key.") <a href="#L-606"></a> end <a href="#L-607"></a> return set_nested(t, ...) <a href="#L-608"></a> end <a href="#L-609"></a>end <a href="#L-610"></a> <a href="#L-611"></a>--[==[ <a href="#L-612"></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-613"></a>function export.contains(list, x, options) <a href="#L-614"></a> if options and options.key then <a href="#L-615"></a> x = options.key(x) <a href="#L-616"></a> end <a href="#L-617"></a> local i = 0 <a href="#L-618"></a> while true do <a href="#L-619"></a> i = i + 1 <a href="#L-620"></a> local v = list[i] <a href="#L-621"></a> if v == nil then <a href="#L-622"></a> return false <a href="#L-623"></a> elseif options and options.key then <a href="#L-624"></a> v = options.key(v) <a href="#L-625"></a> end <a href="#L-626"></a> if deep_equals(v, x) then <a href="#L-627"></a> return true <a href="#L-628"></a> end <a href="#L-629"></a> end <a href="#L-630"></a>end <a href="#L-631"></a>contains = export.contains <a href="#L-632"></a> <a href="#L-633"></a>--[==[ <a href="#L-634"></a>Given a general table and a value to be found, return true if the value is in <a href="#L-635"></a>either the array or hashmap portion of the table. Comparison is by value, using <a href="#L-636"></a>`deepEquals`. <a href="#L-637"></a> <a href="#L-638"></a>NOTE: This used to do shallow comparison by default and accepted a third <a href="#L-639"></a>"deepCompare" param to do deep comparison. This param is still accepted but now <a href="#L-640"></a>ignored.]==] <a href="#L-641"></a>function export.tableContains(t, x) <a href="#L-642"></a> for _, v in index_pairs(t) do <a href="#L-643"></a> if deep_equals(v, x) then <a href="#L-644"></a> return true <a href="#L-645"></a> end <a href="#L-646"></a> end <a href="#L-647"></a> return false <a href="#L-648"></a>end <a href="#L-649"></a> <a href="#L-650"></a>--[==[ <a href="#L-651"></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-652"></a>(or insert at an arbitrary position, if `options.pos` is given; see below). Comparison is by value, using {deepEquals}. <a href="#L-653"></a> <a href="#L-654"></a>`options` is an optional table of additional options to control the behavior of the operation. The following options are <a href="#L-655"></a>recognized: <a href="#L-656"></a>* `pos`: Position at which insertion happens (i.e. before the existing item at position `pos`). <a href="#L-657"></a>* `key`: Function of one argument to return a comparison key, as with {deepEquals}. The key function is applied to both <a href="#L-658"></a> `item` and the existing item in `list` to compare against, and the comparison is done against the results. <a href="#L-659"></a> This is useful when inserting a complex structure into an existing list while avoiding duplicates. <a href="#L-660"></a>* `combine`: Function of three arguments (the existing item, the new item and the position, respectively) to combine an <a href="#L-661"></a> existing item with `new_item`, when `new_item` is found in `list`. If unspecified, the existing item is <a href="#L-662"></a> left alone. <a href="#L-663"></a> <a href="#L-664"></a>Return {false} if entry already found, {true} if inserted. <a href="#L-665"></a> <a href="#L-666"></a>For compatibility, `pos` can be specified directly as the third argument in place of `options`, but this is not <a href="#L-667"></a>recommended for new code. <a href="#L-668"></a> <a href="#L-669"></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-670"></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-671"></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-672"></a>checking for duplicates, and use {removeDuplicates()} at the end.)]==] <a href="#L-673"></a>function export.insertIfNot(list, new_item, options) <a href="#L-674"></a> if type(options) == "number" then <a href="#L-675"></a> options = {pos = options} <a href="#L-676"></a> end <a href="#L-677"></a> if options and options.combine then <a href="#L-678"></a> local new_key <a href="#L-679"></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-680"></a> if options.key then <a href="#L-681"></a> new_key = options.key(new_item) <a href="#L-682"></a> else <a href="#L-683"></a> new_key = new_item <a href="#L-684"></a> end <a href="#L-685"></a> local i = 0 <a href="#L-686"></a> while true do <a href="#L-687"></a> i = i + 1 <a href="#L-688"></a> local item, key = list[i] <a href="#L-689"></a> if item == nil then <a href="#L-690"></a> break <a href="#L-691"></a> elseif options.key then <a href="#L-692"></a> key = options.key(item) <a href="#L-693"></a> else <a href="#L-694"></a> key = item <a href="#L-695"></a> end <a href="#L-696"></a> if deep_equals(key, new_key) then <a href="#L-697"></a> local retval = options.combine(item, new_item, i) <a href="#L-698"></a> if retval ~= nil then <a href="#L-699"></a> list[i] = retval <a href="#L-700"></a> end <a href="#L-701"></a> return false <a href="#L-702"></a> end <a href="#L-703"></a> end <a href="#L-704"></a> elseif contains(list, new_item, options) then <a href="#L-705"></a> return false <a href="#L-706"></a> end <a href="#L-707"></a> local pos = options and options.pos <a href="#L-708"></a> if pos then <a href="#L-709"></a> insert(list, pos, new_item) <a href="#L-710"></a> else <a href="#L-711"></a> insert(list, new_item) <a href="#L-712"></a> end <a href="#L-713"></a>end <a href="#L-714"></a>insert_if_not = export.insertIfNot <a href="#L-715"></a> <a href="#L-716"></a>--[==[ <a href="#L-717"></a>Finds key for specified value in a given table. Roughly equivalent to reversing the key-value pairs in the table: <a href="#L-718"></a>* {reversed_table = { [value1] = key1, [value2] = key2, ... }} <a href="#L-719"></a>and then returning {reversed_table[value]}. `__eq` metamethods are respected. <a href="#L-720"></a> <a href="#L-721"></a>Only reliable if there is just one key with the specified value. Otherwise, the function returns the first key found, <a href="#L-722"></a>and the output is unpredictable.]==] <a href="#L-723"></a>function export.keyFor(t, value) <a href="#L-724"></a> for k, v in index_pairs(t) do <a href="#L-725"></a> if v == value then <a href="#L-726"></a> return k <a href="#L-727"></a> end <a href="#L-728"></a> end <a href="#L-729"></a> return nil <a href="#L-730"></a>end <a href="#L-731"></a> <a href="#L-732"></a>do <a href="#L-733"></a> local types <a href="#L-734"></a> local function get_types() <a href="#L-735"></a> types = invert{ <a href="#L-736"></a> "number", <a href="#L-737"></a> "boolean", <a href="#L-738"></a> "string", <a href="#L-739"></a> "table", <a href="#L-740"></a> "function", <a href="#L-741"></a> "thread", <a href="#L-742"></a> "userdata" <a href="#L-743"></a> } <a href="#L-744"></a> get_types = nil <a href="#L-745"></a> return types <a href="#L-746"></a> end <a href="#L-747"></a> <a href="#L-748"></a> local function compare(key1, key2) <a href="#L-749"></a> return key1 < key2 <a href="#L-750"></a> end <a href="#L-751"></a> <a href="#L-752"></a> -- The default sorting function used in export.keysToList if `keySort` is not given. <a href="#L-753"></a> local function default_compare(key1, key2) <a href="#L-754"></a> local type1, type2 = type(key1), type(key2) <a href="#L-755"></a> if type1 ~= type2 then <a href="#L-756"></a> -- If the types are different, sort numbers first, functions last, and all other types alphabetically. <a href="#L-757"></a> return (types or get_types())[type1] < types[type2] <a href="#L-758"></a> -- `string_sort` fixes a bug in < which causes all codepoints above U+FFFF to be treated as equal. <a href="#L-759"></a> elseif type1 == "string" then <a href="#L-760"></a> return string_sort(key1, key2) <a href="#L-761"></a> elseif type1 == "number" then <a href="#L-762"></a> return key1 < key2 <a href="#L-763"></a> -- Attempt to compare tables, in case there's a metamethod. <a href="#L-764"></a> elseif type1 == "table" then <a href="#L-765"></a> local success, result = pcall(compare, key1, key2) <a href="#L-766"></a> if success then <a href="#L-767"></a> return result <a href="#L-768"></a> end <a href="#L-769"></a> -- Sort true before false. <a href="#L-770"></a> elseif type1 == "boolean" then <a href="#L-771"></a> return key1 <a href="#L-772"></a> end <a href="#L-773"></a> return false <a href="#L-774"></a> end <a href="#L-775"></a> <a href="#L-776"></a> --[==[ <a href="#L-777"></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-778"></a> <a href="#L-779"></a> If there are only numerical keys, `export.numKeys` is probably faster.]==] <a href="#L-780"></a> function export.keysToList(t, keySort) <a href="#L-781"></a> local list, i = {}, 0 <a href="#L-782"></a> for key in index_pairs(t) do <a href="#L-783"></a> i = i + 1 <a href="#L-784"></a> list[i] = key <a href="#L-785"></a> end <a href="#L-786"></a> -- Use specified sort function, or otherwise `default_compare`. <a href="#L-787"></a> sort(list, keySort or default_compare) <a href="#L-788"></a> return list <a href="#L-789"></a> end <a href="#L-790"></a> keys_to_list = export.keysToList <a href="#L-791"></a>end <a href="#L-792"></a> <a href="#L-793"></a>--[==[ <a href="#L-794"></a>Iterates through a table, with the keys sorted using the keysToList function. <a href="#L-795"></a> <a href="#L-796"></a>If there are only numerical keys, `export.sparseIpairs` is probably faster.]==] <a href="#L-797"></a>function export.sortedPairs(t, keySort) <a href="#L-798"></a> local list, i = keys_to_list(t, keySort), 0 <a href="#L-799"></a> return function() <a href="#L-800"></a> i = i + 1 <a href="#L-801"></a> local key = list[i] <a href="#L-802"></a> if key ~= nil then <a href="#L-803"></a> return key, t[key] <a href="#L-804"></a> end <a href="#L-805"></a> end <a href="#L-806"></a>end <a href="#L-807"></a> <a href="#L-808"></a>do <a href="#L-809"></a> -- Loader. <a href="#L-810"></a> local function really_reverse_ipairs(...) <a href="#L-811"></a> really_reverse_ipairs = require(function_module).reverseIter(ipairs) <a href="#L-812"></a> return really_reverse_ipairs(...) <a href="#L-813"></a> end <a href="#L-814"></a> <a href="#L-815"></a> local function reverse_ipairs_func(t, i) <a href="#L-816"></a> if i > 1 then <a href="#L-817"></a> i = i - 1 <a href="#L-818"></a> -- Use rawget and check `v` is not nil, in case `t` has been modified during the loop. <a href="#L-819"></a> local v = rawget(t, i) <a href="#L-820"></a> if v ~= nil then <a href="#L-821"></a> return i, v <a href="#L-822"></a> end <a href="#L-823"></a> end <a href="#L-824"></a> end <a href="#L-825"></a> <a href="#L-826"></a> function export.reverseIpairs(t) <a href="#L-827"></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-828"></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-829"></a> if getmetatable(t) == nil then <a href="#L-830"></a> return reverse_ipairs_func, t, table_len(t, true) + 1 <a href="#L-831"></a> end <a href="#L-832"></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-833"></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-834"></a> return really_reverse_ipairs(t) <a href="#L-835"></a> end <a href="#L-836"></a>end <a href="#L-837"></a> <a href="#L-838"></a>local function getIteratorValues(i, j , step, t_len) <a href="#L-839"></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-840"></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-841"></a> step = step or (j < i and -1) or 1 <a href="#L-842"></a> if ( <a href="#L-843"></a> i == 0 or i % 1 ~= 0 or <a href="#L-844"></a> j == 0 or j % 1 ~= 0 or <a href="#L-845"></a> step == 0 or step % 1 ~= 0 <a href="#L-846"></a> ) then <a href="#L-847"></a> error("Arguments i, j and step must be non-zero integers.") <a href="#L-848"></a> end <a href="#L-849"></a> return i, j, step <a href="#L-850"></a>end <a href="#L-851"></a> <a href="#L-852"></a>--[==[ <a href="#L-853"></a>Given an array `list` and function `func`, iterate through the array applying {func(r, k, v)}, and returning the result, <a href="#L-854"></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-855"></a>{reduce(array, function(a, b) return a + b end)} will return the sum of `array`. <a href="#L-856"></a> <a href="#L-857"></a>Optional arguments: <a href="#L-858"></a>* `i`: start index; negative values count from the end of the array <a href="#L-859"></a>* `j`: end index; negative values count from the end of the array <a href="#L-860"></a>* `step`: step increment <a href="#L-861"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-862"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-863"></a> <a href="#L-864"></a>Examples: <a href="#L-865"></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-866"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-867"></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-868"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-869"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index. <a href="#L-870"></a>Note: directionality generally only matters for `reduce`, but values of step > 1 (or step < -1) still affect the return value <a href="#L-871"></a>of `apply`.]==] <a href="#L-872"></a>function export.reduce(t, func, i, j, step) <a href="#L-873"></a> local t_len = table_len(t) <a href="#L-874"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-875"></a> local ret = t[i] <a href="#L-876"></a> for k = i + step, j, step do <a href="#L-877"></a> ret = func(ret, k, t[k]) <a href="#L-878"></a> end <a href="#L-879"></a> return ret <a href="#L-880"></a>end <a href="#L-881"></a> <a href="#L-882"></a>--[==[ <a href="#L-883"></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-884"></a>`v` is the value at index `k`), and return an array of the resulting values. For example, <a href="#L-885"></a>{apply(array, function(a) return 2*a end)} will return an array where each member of `array` has been doubled. <a href="#L-886"></a> <a href="#L-887"></a>Optional arguments: <a href="#L-888"></a>* `i`: start index; negative values count from the end of the array <a href="#L-889"></a>* `j`: end index; negative values count from the end of the array <a href="#L-890"></a>* `step`: step increment <a href="#L-891"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-892"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-893"></a> <a href="#L-894"></a>Examples: <a href="#L-895"></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-896"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-897"></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-898"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-899"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index. <a href="#L-900"></a>Note: directionality makes the most difference for `reduce`, but values of step > 1 (or step < -1) still affect the return <a href="#L-901"></a>value of `apply`.]==] <a href="#L-902"></a>function export.apply(t, func, i, j, step) <a href="#L-903"></a> local t_new = deep_copy(t) <a href="#L-904"></a> local t_new_len = table_len(t_new) <a href="#L-905"></a> i, j, step = getIteratorValues(i, j , step, t_new_len) <a href="#L-906"></a> for k = i, j, step do <a href="#L-907"></a> t_new[k] = func(k, t_new[k]) <a href="#L-908"></a> end <a href="#L-909"></a> return t_new <a href="#L-910"></a>end <a href="#L-911"></a> <a href="#L-912"></a>--[==[ <a href="#L-913"></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-914"></a>`v` is the value at index `k`), and returning whether the function is true for all iterations. <a href="#L-915"></a> <a href="#L-916"></a>Optional arguments: <a href="#L-917"></a>* `i`: start index; negative values count from the end of the array <a href="#L-918"></a>* `j`: end index; negative values count from the end of the array <a href="#L-919"></a>* `step`: step increment <a href="#L-920"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-921"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-922"></a> <a href="#L-923"></a>Examples: <a href="#L-924"></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-925"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-926"></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-927"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-928"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index.]==] <a href="#L-929"></a>function export.all(t, func, i, j, step) <a href="#L-930"></a> local t_len = table_len(t) <a href="#L-931"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-932"></a> for k = i, j, step do <a href="#L-933"></a> if not func(k, t[k]) then <a href="#L-934"></a> return false <a href="#L-935"></a> end <a href="#L-936"></a> end <a href="#L-937"></a> return true <a href="#L-938"></a>end <a href="#L-939"></a> <a href="#L-940"></a>--[==[ <a href="#L-941"></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-942"></a>`v` is the value at index `k`), and returning whether the function is true for at least one iteration. <a href="#L-943"></a> <a href="#L-944"></a>Optional arguments: <a href="#L-945"></a>* `i`: start index; negative values count from the end of the array <a href="#L-946"></a>* `j`: end index; negative values count from the end of the array <a href="#L-947"></a>* `step`: step increment <a href="#L-948"></a>These must be non-zero integers. The function will determine where to iterate from, whether to iterate forwards or <a href="#L-949"></a>backwards and by how much, based on these inputs (see examples below for default behaviours). <a href="#L-950"></a> <a href="#L-951"></a>Examples: <a href="#L-952"></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-953"></a># step=-1 results in backward iteration from the end to the start in steps of 1. <a href="#L-954"></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-955"></a># j=-3 results in forward iteration from the start to the 3rd last index. <a href="#L-956"></a># j=-3, step=-1 results in backward iteration from the end to the 3rd last index.]==] <a href="#L-957"></a>function export.any(t, func, i, j, step) <a href="#L-958"></a> local t_len = table_len(t) <a href="#L-959"></a> i, j, step = getIteratorValues(i, j , step, t_len) <a href="#L-960"></a> for k = i, j, step do <a href="#L-961"></a> if not not (func(k, t[k])) then <a href="#L-962"></a> return true <a href="#L-963"></a> end <a href="#L-964"></a> end <a href="#L-965"></a> return false <a href="#L-966"></a>end <a href="#L-967"></a> <a href="#L-968"></a>--[==[ <a href="#L-969"></a>Joins an array with serial comma and serial conjunction, normally {"and"}. An improvement on {mw.text.listToText}, <a href="#L-970"></a>which doesn't properly handle serial commas. <a href="#L-971"></a> <a href="#L-972"></a>Options: <a href="#L-973"></a>* `conj`: Conjunction to use; defaults to {"and"}. <a href="#L-974"></a>* `punc`: Punctuation to use; default to {","}. <a href="#L-975"></a>* `dontTag`: Don't tag the serial comma and serial {"and"}. For error messages, in which HTML cannot be used.]==] <a href="#L-976"></a>function export.serialCommaJoin(seq, options) <a href="#L-977"></a> local length = table_len(seq) <a href="#L-978"></a> if length == 0 then <a href="#L-979"></a> return "" <a href="#L-980"></a> elseif length == 1 then <a href="#L-981"></a> return seq[1] <a href="#L-982"></a> end <a href="#L-983"></a> <a href="#L-984"></a> if length == 2 then <a href="#L-985"></a> return seq[1] .. " " .. (options and options.conj or "and") .. " " .. seq[2] <a href="#L-986"></a> end <a href="#L-987"></a> <a href="#L-988"></a> local conj, punc, dont_tag <a href="#L-989"></a> if options then <a href="#L-990"></a> conj = options.conj or "and" <a href="#L-991"></a> punc = options.punc or "," <a href="#L-992"></a> dont_tag = options.dontTag <a href="#L-993"></a> else <a href="#L-994"></a> conj, punc = "and", "," <a href="#L-995"></a> end <a href="#L-996"></a> <a href="#L-997"></a> local comma <a href="#L-998"></a> if dont_tag then <a href="#L-999"></a> comma = punc <a href="#L-1000"></a> conj = " " .. conj .. " " <a href="#L-1001"></a> else <a href="#L-1002"></a> comma = "\"serial-comma\">" .. punc .. "" <a href="#L-1003"></a> conj = "\"serial-and\"> " .. conj .. " " <a href="#L-1004"></a> end <a href="#L-1005"></a> <a href="#L-1006"></a> return concat(seq, punc .. " ", 1, length - 1) .. comma .. conj .. seq[length] <a href="#L-1007"></a>end <a href="#L-1008"></a> <a href="#L-1009"></a>--[==[ <a href="#L-1010"></a>Concatenate all values in the table that are indexed by a number, in order. <a href="#L-1011"></a>* {sparseConcat{ a, nil, c, d }} => {"acd"} <a href="#L-1012"></a>* {sparseConcat{ nil, b, c, d }} => {"bcd"}]==] <a href="#L-1013"></a>function export.sparseConcat(t, sep, i, j) <a href="#L-1014"></a> local list, list_i = {}, 0 <a href="#L-1015"></a> for _, v in sparse_ipairs(t) do <a href="#L-1016"></a> list_i = list_i + 1 <a href="#L-1017"></a> list[list_i] = v <a href="#L-1018"></a> end <a href="#L-1019"></a> return concat(list, sep, i, j) <a href="#L-1020"></a>end <a href="#L-1021"></a> <a href="#L-1022"></a>--[==[ <a href="#L-1023"></a>Values of numeric keys in array portion of table are reversed: { { "a", "b", "c" }} -> { { "c", "b", "a" }}]==] <a href="#L-1024"></a>function export.reverse(t) <a href="#L-1025"></a> local list, t_len = {}, table_len(t) <a href="#L-1026"></a> for i = t_len, 1, -1 do <a href="#L-1027"></a> list[t_len - i + 1] = t[i] <a href="#L-1028"></a> end <a href="#L-1029"></a> return list <a href="#L-1030"></a>end <a href="#L-1031"></a>table_reverse = export.reverse <a href="#L-1032"></a> <a href="#L-1033"></a>function export.reverseConcat(t, sep, i, j) <a href="#L-1034"></a> return concat(table_reverse(t), sep, i, j) <a href="#L-1035"></a>end <a href="#L-1036"></a> <a href="#L-1037"></a>--[==[ <a href="#L-1038"></a>Invert a list. For example, {invert({ "a", "b", "c" })} -> { { a = 1, b = 2, c = 3 }}]==] <a href="#L-1039"></a>function export.invert(list) <a href="#L-1040"></a> local map, i = {}, 0 <a href="#L-1041"></a> while true do <a href="#L-1042"></a> i = i + 1 <a href="#L-1043"></a> local v = list[i] <a href="#L-1044"></a> if v == nil then <a href="#L-1045"></a> return map <a href="#L-1046"></a> end <a href="#L-1047"></a> map[v] = i <a href="#L-1048"></a> end <a href="#L-1049"></a>end <a href="#L-1050"></a>invert = export.invert <a href="#L-1051"></a> <a href="#L-1052"></a>--[==[ <a href="#L-1053"></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-1054"></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-1055"></a>to see if it contains a given value. <a href="#L-1056"></a> <a href="#L-1057"></a>By default, each item is given the value true. If the optional parameter `value` is a function or functor, then it is called <a href="#L-1058"></a>as an iterator, with the list index as the first argument, the item as the second (which will be used as the key), plus any <a href="#L-1059"></a>additional arguments passed to {listToSet}; the returned value is used as the value for that list item. If `value` is anything <a href="#L-1060"></a>else, then it is used as the fixed value for every item.]==] <a href="#L-1061"></a>function export.listToSet(list, value, ...) <a href="#L-1062"></a> local set, i, callable = {}, 0 <a href="#L-1063"></a> if value == nil then <a href="#L-1064"></a> value = true <a href="#L-1065"></a> else <a href="#L-1066"></a> callable = is_callable(value) <a href="#L-1067"></a> end <a href="#L-1068"></a> while true do <a href="#L-1069"></a> i = i + 1 <a href="#L-1070"></a> local item = list[i] <a href="#L-1071"></a> if item == nil then <a href="#L-1072"></a> return set <a href="#L-1073"></a> end <a href="#L-1074"></a> if callable then <a href="#L-1075"></a> set[item] = value(i, item, ...) <a href="#L-1076"></a> else <a href="#L-1077"></a> set[item] = value <a href="#L-1078"></a> end <a href="#L-1079"></a> end <a href="#L-1080"></a>end <a href="#L-1081"></a> <a href="#L-1082"></a>--[==[ <a href="#L-1083"></a>Return true if all keys in the table are consecutive integers starting at 1.]==] <a href="#L-1084"></a>function export.isArray(t) <a href="#L-1085"></a> local i = 0 <a href="#L-1086"></a> for _ in index_pairs(t) do <a href="#L-1087"></a> i = i + 1 <a href="#L-1088"></a> if t[i] == nil then <a href="#L-1089"></a> return false <a href="#L-1090"></a> end <a href="#L-1091"></a> end <a href="#L-1092"></a> return true <a href="#L-1093"></a>end <a href="#L-1094"></a> <a href="#L-1095"></a>--[==[ <a href="#L-1096"></a>Add a list of aliases for a given key to a table. The aliases must be given as a table.]==] <a href="#L-1097"></a>function export.alias(t, k, aliases) <a href="#L-1098"></a> for _, alias in index_pairs(aliases) do <a href="#L-1099"></a> t[alias] = t[k] <a href="#L-1100"></a> end <a href="#L-1101"></a>end <a href="#L-1102"></a> <a href="#L-1103"></a>return export </pre></div></div><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1&useformat=desktop" 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=82752375">https://en.wiktionary.org/w/index.php?title=Module:table&oldid=82752375</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> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 25 November 2024, at 01:26.</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=82752375&oldid=82750632&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> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-7fc47fc68d-fnmng","wgBackendResponseTime":692,"wgPageParseReport":{"limitreport":{"cputime":"0.231","walltime":"0.417","ppvisitednodes":{"value":429,"limit":1000000},"postexpandincludesize":{"value":99564,"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":22549,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 374.310 1 -total","100.00% 374.310 1 Template:documentation"," 76.66% 286.951 1 Template:module_documentation"," 1.67% 6.248 1 Template:code"," 1.66% 6.221 1 Template:module_cat"," 1.09% 4.067 1 Template:lua"," 0.45% 1.683 1 Template:w"]},"scribunto":{"limitreport-timeusage":{"value":"0.179","limit":"10.000"},"limitreport-memusage":{"value":3046129,"limit":104857600}},"cachereport":{"origin":"mw-web.codfw.main-7fc47fc68d-fnmng","timestamp":"20241128193018","ttl":2592000,"transientcontent":false}}});});</script> </body> </html>