<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="pt-BR">
	<id>https://dicionario.advogadocompleto.com/index.php?action=history&amp;feed=atom&amp;title=M%C3%B3dulo%3AExponential_search</id>
	<title>Módulo:Exponential search - Histórico de revisão</title>
	<link rel="self" type="application/atom+xml" href="https://dicionario.advogadocompleto.com/index.php?action=history&amp;feed=atom&amp;title=M%C3%B3dulo%3AExponential_search"/>
	<link rel="alternate" type="text/html" href="https://dicionario.advogadocompleto.com/index.php?title=M%C3%B3dulo:Exponential_search&amp;action=history"/>
	<updated>2026-05-15T17:07:54Z</updated>
	<subtitle>Histórico de revisões para esta página neste wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://dicionario.advogadocompleto.com/index.php?title=M%C3%B3dulo:Exponential_search&amp;diff=273&amp;oldid=prev</id>
		<title>Itaymbere: Criou página com &#039;-- Este módulo fornece um algoritmo de pesquisa exponencial genérico. requirestrict  local checkType = require(&#039;libraryUtil&#039;).checkType local floor = math.floor  local function midPoint(lower, upper) 	return floor(lower + (upper - lower) / 2) end  local function search(testFunc, i, lower, upper) 	if testFunc(i) then 		if i + 1 == upper then 			return i 		end 		lower = i 		if upper then 			i = midPoint(lower, upper) 		else 			i = i * 2 		end 		return search(testFunc...&#039;</title>
		<link rel="alternate" type="text/html" href="https://dicionario.advogadocompleto.com/index.php?title=M%C3%B3dulo:Exponential_search&amp;diff=273&amp;oldid=prev"/>
		<updated>2026-03-29T21:05:45Z</updated>

		<summary type="html">&lt;p&gt;Criou página com &amp;#039;-- Este módulo fornece um algoritmo de pesquisa exponencial genérico. require&lt;a href=&quot;/index.php?title=Strict&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Strict (página inexistente)&quot;&gt;strict&lt;/a&gt;  local checkType = require(&amp;#039;libraryUtil&amp;#039;).checkType local floor = math.floor  local function midPoint(lower, upper) 	return floor(lower + (upper - lower) / 2) end  local function search(testFunc, i, lower, upper) 	if testFunc(i) then 		if i + 1 == upper then 			return i 		end 		lower = i 		if upper then 			i = midPoint(lower, upper) 		else 			i = i * 2 		end 		return search(testFunc...&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Página nova&lt;/b&gt;&lt;/p&gt;&lt;div&gt;-- Este módulo fornece um algoritmo de pesquisa exponencial genérico.&lt;br /&gt;
require[[strict]]&lt;br /&gt;
&lt;br /&gt;
local checkType = require(&amp;#039;libraryUtil&amp;#039;).checkType&lt;br /&gt;
local floor = math.floor&lt;br /&gt;
&lt;br /&gt;
local function midPoint(lower, upper)&lt;br /&gt;
	return floor(lower + (upper - lower) / 2)&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
local function search(testFunc, i, lower, upper)&lt;br /&gt;
	if testFunc(i) then&lt;br /&gt;
		if i + 1 == upper then&lt;br /&gt;
			return i&lt;br /&gt;
		end&lt;br /&gt;
		lower = i&lt;br /&gt;
		if upper then&lt;br /&gt;
			i = midPoint(lower, upper)&lt;br /&gt;
		else&lt;br /&gt;
			i = i * 2&lt;br /&gt;
		end&lt;br /&gt;
		return search(testFunc, i, lower, upper)&lt;br /&gt;
	else&lt;br /&gt;
		upper = i&lt;br /&gt;
		i = midPoint(lower, upper)&lt;br /&gt;
		return search(testFunc, i, lower, upper)&lt;br /&gt;
	end&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
return function (testFunc, init)&lt;br /&gt;
	checkType(&amp;#039;Exponential search&amp;#039;, 1, testFunc, &amp;#039;function&amp;#039;) -- Falta confirmar se &amp;#039;Exponential search&amp;#039; pode ser traduzido. Acho que sim, mas ainda não tenho certeza.&lt;br /&gt;
	checkType(&amp;#039;Exponential search&amp;#039;, 2, init, &amp;#039;number&amp;#039;, true) -- Falta confirmar se &amp;#039;Exponential search&amp;#039; pode ser traduzido. Acho que sim, mas ainda não tenho certeza.&lt;br /&gt;
	if init and (init &amp;lt; 1 or init ~= floor(init) or init == math.huge) then&lt;br /&gt;
		error(string.format(&lt;br /&gt;
			&amp;quot;valor de inicialização (&amp;#039;init&amp;#039;) &amp;#039;%s&amp;#039; inválido detectado no argumento #2 para &amp;quot; ..&lt;br /&gt;
			&amp;quot;&amp;#039;Exponential search&amp;#039; (o valor inicial (&amp;#039;init&amp;#039;) deve ser um número inteiro positivo)&amp;quot;, -- Falta confirmar se &amp;#039;Exponential search&amp;#039; pode ser traduzido. Acho que sim, mas ainda não tenho certeza.&lt;br /&gt;
			tostring(init)&lt;br /&gt;
		), 2)&lt;br /&gt;
	end&lt;br /&gt;
	init = init or 2&lt;br /&gt;
	if not testFunc(1) then&lt;br /&gt;
		return nil&lt;br /&gt;
	end&lt;br /&gt;
	return search(testFunc, init, 1, nil)&lt;br /&gt;
end&lt;/div&gt;</summary>
		<author><name>Itaymbere</name></author>
	</entry>
</feed>