https://mindpowe.red/wiki/index.php?action=history&feed=atom&title=Module%3AExponential_search 2026-04-06T14:23:18Z Revision history for this page on the wiki MediaWiki 1.34.2 https://mindpowe.red/wiki/index.php?title=Module:Exponential_search&diff=1084&oldid=prev 2020-08-25T19:07:01Z

<p>1 revision imported</p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr class="diff-title" lang="en"> <td colspan="1" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="1" style="background-color: #fff; color: #222; text-align: center;">Revision as of 19:07, 25 August 2020</td> </tr><tr><td colspan="2" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

WikiSysop https://mindpowe.red/wiki/index.php?title=Module:Exponential_search&diff=1083&oldid=prev 2019-10-08T16:14:11Z

<p>Protected &quot;<a href="/wiki/index.php/Module:Exponential_search" title="Module:Exponential search">Module:Exponential search</a>&quot;: <a href="/wiki/index.php?title=WP:High-risk_templates&amp;action=edit&amp;redlink=1" class="new" title="WP:High-risk templates (page does not exist)">High-risk Lua module</a>: used in <a href="/wiki/index.php?title=Module:Highest_archive_number&amp;action=edit&amp;redlink=1" class="new" title="Module:Highest archive number (page does not exist)">Module:Highest archive number</a> ([Edit=Require template editor access] (indefinite) [Move=Require template editor access] (indefinite))</p> <p><b>New page</b></p><div>-- This module provides a generic exponential search algorithm.<br /> <br /> local checkType = require('libraryUtil').checkType<br /> local floor = math.floor<br /> <br /> local function midPoint(lower, upper)<br /> return floor(lower + (upper - lower) / 2)<br /> end<br /> <br /> local function search(testFunc, i, lower, upper)<br /> if testFunc(i) then<br /> if i + 1 == upper then<br /> return i<br /> end<br /> lower = i<br /> if upper then<br /> i = midPoint(lower, upper)<br /> else<br /> i = i * 2<br /> end<br /> return search(testFunc, i, lower, upper)<br /> else<br /> upper = i<br /> i = midPoint(lower, upper)<br /> return search(testFunc, i, lower, upper)<br /> end<br /> end<br /> <br /> return function (testFunc, init)<br /> checkType('Exponential search', 1, testFunc, 'function')<br /> checkType('Exponential search', 2, init, 'number', true)<br /> if init and (init &lt; 1 or init ~= floor(init) or init == math.huge) then<br /> error(string.format(<br /> &quot;invalid init value '%s' detected in argument #2 to &quot; ..<br /> &quot;'Exponential search' (init value must be a positive integer)&quot;,<br /> tostring(init)<br /> ), 2)<br /> end<br /> init = init or 2<br /> if not testFunc(1) then<br /> return nil<br /> end<br /> return search(testFunc, init, 1, nil)<br /> end</div>

en>Mr. Stradivarius