Wikipidia
bjnwiki
https://bjn.wikipedia.org/wiki/Laman_Tatambaian
MediaWiki 1.47.0-wmf.18
first-letter
Media
Istimiwa
Pamandiran
Pamakai
Pamandiran Pamakai
Wikipidia
Pamandiran Wikipidia
Barakas
Pamandiran Barakas
MediaWiki
Pamandiran MediaWiki
Citakan
Pamandiran Citakan
Patulung
Pamandiran Patulung
Tumbung
Pamandiran Tumbung
Lawang
Pamandiran Lawang
TimedText
TimedText talk
Modul
Pembicaraan Modul
Acara
Pembicaraan Acara
Modul:TableTools
828
11137
113660
77276
2026-09-03T12:45:59Z
Hamish
10004
Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]]
113660
Scribunto
text/plain
------------------------------------------------------------------------------------
-- TableTools --
-- --
-- This module includes a number of functions for dealing with Lua tables. --
-- It is a meta-module, meant to be called from other Lua modules, and should not --
-- be called directly from #invoke. --
------------------------------------------------------------------------------------
local libraryUtil = require('libraryUtil')
local p = {}
-- Define often-used variables and functions.
local floor = math.floor
local infinity = math.huge
local checkType = libraryUtil.checkType
local checkTypeMulti = libraryUtil.checkTypeMulti
------------------------------------------------------------------------------------
-- isPositiveInteger
--
-- This function returns 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.
------------------------------------------------------------------------------------
function p.isPositiveInteger(v)
return type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity
end
------------------------------------------------------------------------------------
-- isNan
--
-- This function returns true if the given number is a NaN value, and false if
-- not. Although it doesn't operate on tables, it is included here as it is useful
-- for determining whether a value can be a valid table key. Lua will generate an
-- error if a NaN is used as a table key.
------------------------------------------------------------------------------------
function p.isNan(v)
return type(v) == 'number' and v ~= v
end
------------------------------------------------------------------------------------
-- shallowClone
--
-- This returns a clone of a table. The value returned is a new table, but all
-- subtables and functions are shared. Metamethods are respected, but the returned
-- table will have no metatable of its own.
------------------------------------------------------------------------------------
function p.shallowClone(t)
checkType('shallowClone', 1, t, 'table')
local ret = {}
for k, v in pairs(t) do
ret[k] = v
end
return ret
end
------------------------------------------------------------------------------------
-- removeDuplicates
--
-- This removes 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.
------------------------------------------------------------------------------------
function p.removeDuplicates(arr)
checkType('removeDuplicates', 1, arr, 'table')
local isNan = p.isNan
local ret, exists = {}, {}
for _, v in ipairs(arr) do
if isNan(v) then
-- NaNs can't be table keys, and they are also unique, so we don't need to check existence.
ret[#ret + 1] = v
elseif not exists[v] then
ret[#ret + 1] = v
exists[v] = true
end
end
return ret
end
------------------------------------------------------------------------------------
-- numKeys
--
-- This takes a table and returns an array containing the numbers of any numerical
-- keys that have non-nil values, sorted in numerical order.
------------------------------------------------------------------------------------
function p.numKeys(t)
checkType('numKeys', 1, t, 'table')
local isPositiveInteger = p.isPositiveInteger
local nums = {}
for k in pairs(t) do
if isPositiveInteger(k) then
nums[#nums + 1] = k
end
end
table.sort(nums)
return nums
end
------------------------------------------------------------------------------------
-- affixNums
--
-- This takes a table and returns an array containing the numbers of keys with the
-- specified prefix and suffix. For example, for the table
-- {a1 = 'foo', a3 = 'bar', a6 = 'baz'} and the prefix "a", affixNums will return
-- {1, 3, 6}.
------------------------------------------------------------------------------------
function p.affixNums(t, prefix, suffix)
checkType('affixNums', 1, t, 'table')
checkType('affixNums', 2, prefix, 'string', true)
checkType('affixNums', 3, suffix, 'string', true)
local function cleanPattern(s)
-- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally.
return s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1')
end
prefix = prefix or ''
suffix = suffix or ''
prefix = cleanPattern(prefix)
suffix = cleanPattern(suffix)
local pattern = '^' .. prefix .. '([1-9]%d*)' .. suffix .. '$'
local nums = {}
for k in pairs(t) do
if type(k) == 'string' then
local num = mw.ustring.match(k, pattern)
if num then
nums[#nums + 1] = tonumber(num)
end
end
end
table.sort(nums)
return nums
end
------------------------------------------------------------------------------------
-- numData
--
-- Given a table with keys like {"foo1", "bar1", "foo2", "baz2"}, returns a table
-- of subtables in the format
-- {[1] = {foo = 'text', bar = 'text'}, [2] = {foo = 'text', baz = 'text'}}.
-- Keys that don't end with an integer are stored in a subtable named "other". The
-- compress option compresses the table so that it can be iterated over with
-- ipairs.
------------------------------------------------------------------------------------
function p.numData(t, compress)
checkType('numData', 1, t, 'table')
checkType('numData', 2, compress, 'boolean', true)
local ret = {}
for k, v in pairs(t) do
local prefix, num = mw.ustring.match(tostring(k), '^([^0-9]*)([1-9][0-9]*)$')
if num then
num = tonumber(num)
local subtable = ret[num] or {}
if prefix == '' then
-- Positional parameters match the blank string; put them at the start of the subtable instead.
prefix = 1
end
subtable[prefix] = v
ret[num] = subtable
else
local subtable = ret.other or {}
subtable[k] = v
ret.other = subtable
end
end
if compress then
local other = ret.other
ret = p.compressSparseArray(ret)
ret.other = other
end
return ret
end
------------------------------------------------------------------------------------
-- compressSparseArray
--
-- This takes an array with one or more nil values, and removes the nil values
-- while preserving the order, so that the array can be safely traversed with
-- ipairs.
------------------------------------------------------------------------------------
function p.compressSparseArray(t)
checkType('compressSparseArray', 1, t, 'table')
local ret = {}
local nums = p.numKeys(t)
for _, num in ipairs(nums) do
ret[#ret + 1] = t[num]
end
return ret
end
------------------------------------------------------------------------------------
-- sparseIpairs
--
-- This is an iterator for sparse arrays. It can be used like ipairs, but can
-- handle nil values.
------------------------------------------------------------------------------------
function p.sparseIpairs(t)
checkType('sparseIpairs', 1, t, 'table')
local nums = p.numKeys(t)
local i = 0
local lim = #nums
return function ()
i = i + 1
if i <= lim then
local key = nums[i]
return key, t[key]
else
return nil, nil
end
end
end
------------------------------------------------------------------------------------
-- size
--
-- This returns the size of a key/value pair table. It will also work on arrays,
-- but for arrays it is more efficient to use the # operator.
------------------------------------------------------------------------------------
function p.size(t)
checkType('size', 1, t, 'table')
local i = 0
for _ in pairs(t) do
i = i + 1
end
return i
end
local function defaultKeySort(item1, item2)
-- "number" < "string", so numbers will be sorted before strings.
local type1, type2 = type(item1), type(item2)
if type1 ~= type2 then
return type1 < type2
elseif type1 == 'table' or type1 == 'boolean' or type1 == 'function' then
return tostring(item1) < tostring(item2)
else
return item1 < item2
end
end
------------------------------------------------------------------------------------
-- keysToList
--
-- Returns an array of the keys in a table, sorted using either a default
-- comparison function or a custom keySort function.
------------------------------------------------------------------------------------
function p.keysToList(t, keySort, checked)
if not checked then
checkType('keysToList', 1, t, 'table')
checkTypeMulti('keysToList', 2, keySort, {'function', 'boolean', 'nil'})
end
local arr = {}
local index = 1
for k in pairs(t) do
arr[index] = k
index = index + 1
end
if keySort ~= false then
keySort = type(keySort) == 'function' and keySort or defaultKeySort
table.sort(arr, keySort)
end
return arr
end
------------------------------------------------------------------------------------
-- sortedPairs
--
-- Iterates through a table, with the keys sorted using the keysToList function.
-- If there are only numerical keys, sparseIpairs is probably more efficient.
------------------------------------------------------------------------------------
function p.sortedPairs(t, keySort)
checkType('sortedPairs', 1, t, 'table')
checkType('sortedPairs', 2, keySort, 'function', true)
local arr = p.keysToList(t, keySort, true)
local i = 0
return function ()
i = i + 1
local key = arr[i]
if key ~= nil then
return key, t[key]
else
return nil, nil
end
end
end
------------------------------------------------------------------------------------
-- isArray
--
-- Returns true if the given value is a table and all keys are consecutive
-- integers starting at 1.
------------------------------------------------------------------------------------
function p.isArray(v)
if type(v) ~= 'table' then
return false
end
local i = 0
for _ in pairs(v) do
i = i + 1
if v[i] == nil then
return false
end
end
return true
end
------------------------------------------------------------------------------------
-- isArrayLike
--
-- Returns true if the given value is iterable and all keys are consecutive
-- integers starting at 1.
------------------------------------------------------------------------------------
function p.isArrayLike(v)
if not pcall(pairs, v) then
return false
end
local i = 0
for _ in pairs(v) do
i = i + 1
if v[i] == nil then
return false
end
end
return true
end
------------------------------------------------------------------------------------
-- invert
--
-- Transposes the keys and values in an array. For example, {"a", "b", "c"} ->
-- {a = 1, b = 2, c = 3}. Duplicates are not supported (result values refer to
-- the index of the last duplicate) and NaN values are ignored.
------------------------------------------------------------------------------------
function p.invert(arr)
checkType("invert", 1, arr, "table")
local isNan = p.isNan
local map = {}
for i, v in ipairs(arr) do
if not isNan(v) then
map[v] = i
end
end
return map
end
------------------------------------------------------------------------------------
-- listToSet
--
-- Creates a set from the array part of the table. Indexing the set by any of the
-- values of the array returns true. For example, {"a", "b", "c"} ->
-- {a = true, b = true, c = true}. NaN values are ignored as Lua considers them
-- never equal to any value (including other NaNs or even themselves).
------------------------------------------------------------------------------------
function p.listToSet(arr)
checkType("listToSet", 1, arr, "table")
local isNan = p.isNan
local set = {}
for _, v in ipairs(arr) do
if not isNan(v) then
set[v] = true
end
end
return set
end
------------------------------------------------------------------------------------
-- deepCopy
--
-- Recursive deep copy function. Preserves identities of subtables.
------------------------------------------------------------------------------------
local function _deepCopy(orig, includeMetatable, already_seen)
if type(orig) ~= "table" then
return orig
end
-- already_seen stores copies of tables indexed by the original table.
local copy = already_seen[orig]
if copy ~= nil then
return copy
end
copy = {}
already_seen[orig] = copy -- memoize before any recursion, to avoid infinite loops
for orig_key, orig_value in pairs(orig) do
copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen)
end
if includeMetatable then
local mt = getmetatable(orig)
if mt ~= nil then
setmetatable(copy, _deepCopy(mt, true, already_seen))
end
end
return copy
end
function p.deepCopy(orig, noMetatable, already_seen)
checkType("deepCopy", 3, already_seen, "table", true)
return _deepCopy(orig, not noMetatable, already_seen or {})
end
------------------------------------------------------------------------------------
-- sparseConcat
--
-- Concatenates all values in the table that are indexed by a number, in order.
-- sparseConcat{a, nil, c, d} => "acd"
-- sparseConcat{nil, b, c, d} => "bcd"
------------------------------------------------------------------------------------
function p.sparseConcat(t, sep, i, j)
local arr = {}
local arr_i = 0
for _, v in p.sparseIpairs(t) do
arr_i = arr_i + 1
arr[arr_i] = v
end
return table.concat(arr, sep, i, j)
end
------------------------------------------------------------------------------------
-- length
--
-- Finds the length of an array, or of a quasi-array with keys such as "data1",
-- "data2", etc., using an exponential search algorithm. It is similar to the
-- operator #, but may return a different value when there are gaps in the array
-- portion of the table. Intended to be used on data loaded with mw.loadData. For
-- other tables, use #.
-- Note: #frame.args in frame object always be set to 0, regardless of the number
-- of unnamed template parameters, so use this function for frame.args.
------------------------------------------------------------------------------------
function p.length(t, prefix)
-- requiring module inline so that [[Module:Exponential search]] which is
-- only needed by this one function doesn't get millions of transclusions
local expSearch = require("Module:Exponential search")
checkType('length', 1, t, 'table')
checkType('length', 2, prefix, 'string', true)
return expSearch(function (i)
local key
if prefix then
key = prefix .. tostring(i)
else
key = i
end
return t[key] ~= nil
end) or 0
end
------------------------------------------------------------------------------------
-- inArray
--
-- Returns true if searchElement is a member of the array, and false otherwise.
-- Equivalent to JavaScript array.includes(searchElement) or
-- array.includes(searchElement, fromIndex), except fromIndex is 1 indexed
------------------------------------------------------------------------------------
function p.inArray(array, searchElement, fromIndex)
checkType("inArray", 1, array, "table")
-- if searchElement is nil, error?
fromIndex = tonumber(fromIndex)
if fromIndex then
if (fromIndex < 0) then
fromIndex = #array + fromIndex + 1
end
if fromIndex < 1 then fromIndex = 1 end
for _, v in ipairs({unpack(array, fromIndex)}) do
if v == searchElement then
return true
end
end
else
for _, v in pairs(array) do
if v == searchElement then
return true
end
end
end
return false
end
------------------------------------------------------------------------------------
-- merge
--
-- Given the arrays, returns an array containing the elements of each input array
-- in sequence.
------------------------------------------------------------------------------------
function p.merge(...)
local arrays = {...}
local ret = {}
for i, arr in ipairs(arrays) do
checkType('merge', i, arr, 'table')
for _, v in ipairs(arr) do
ret[#ret + 1] = v
end
end
return ret
end
------------------------------------------------------------------------------------
-- extend
--
-- Extends the first array in place by appending all elements from the second
-- array.
------------------------------------------------------------------------------------
function p.extend(arr1, arr2)
checkType('extend', 1, arr1, 'table')
checkType('extend', 2, arr2, 'table')
for _, v in ipairs(arr2) do
arr1[#arr1 + 1] = v
end
end
return p
4n03zk6kcoeg4gz82mieeh94c1szcjy
Muhuran, Kota Bangun, Kutai Kartanegara
0
26867
113665
80185
2026-09-04T00:52:51Z
Ezagren
143
+gambar
113665
wikitext
text/x-wiki
{{Kampung
|kar =
|gambar =[[Barakas:Kantor Desa Muhuran, Kutai Kartanegara.JPG|300px|Kantur pambakal Muhuran]]
|panjalasan =Kantur pambakal Muhuran
|ngaran =Muhuran
|prupinsi =Kalimantan Timur
|dati2 =Kabupatin
|ngaran dati2 =Kutai Kartanegara
|kacamatan =Kota Bangun
|kode pos =75561
|luas =... km²
|warga =... urang
|karacapan =... urang/km²
}}
'''Muhuran''' yaitu sabuting [[kampung]] di Kacamatan [[Kota Bangun, Kutai Kartanegara|Kota Bangun]], [[Kabupatin Kutai Kartanegara]], Prupinsi [[Kalimantan Timur]], [[Indunisia]].
{{Kota Bangun, Kutai Kartanegara}}
{{Authority control}}
{{Kampung-stub}}
nxusbl2aycduir3v4nxwun5nzrgkv56
Muara Wis, Muara Wis, Kutai Kartanegara
0
26974
113664
80316
2026-09-04T00:52:47Z
Ezagren
143
+gambar
113664
wikitext
text/x-wiki
{{Kampung
|kar =
|gambar =[[Barakas:Kantor Desa Muara Wis, Kutai Kartanegara.jpg|300px|Kantur pambakal Muara Wis]]
|panjalasan =Kantur pambakal Muara Wis
|ngaran =Muara Wis
|prupinsi =Kalimantan Timur
|dati2 =Kabupatin
|ngaran dati2 =Kutai Kartanegara
|kacamatan =Muara Wis
|kode pos =75559
|luas =... km²
|warga =... urang
|karacapan =... urang/km²
}}
'''Muara Wis''' yaitu sabuting [[kampung]] di Kacamatan [[Muara Wis, Kutai Kartanegara|Muara Wis]], [[Kabupatin Kutai Kartanegara]], Prupinsi [[Kalimantan Timur]], [[Indunisia]].
{{Muara Wis, Kutai Kartanegara}}
{{Authority control}}
{{Kampung-stub}}
dp5mrz4vuandsduxs2o6qoy62iw4ygc
Muara Tiq, Tabang, Kutai Kartanegara
0
27029
113662
80392
2026-09-04T00:52:40Z
Ezagren
143
+gambar
113662
wikitext
text/x-wiki
{{Kampung
|kar =
|gambar =[[Barakas:Kantor Desa Muara Tiq, Kutai Kartanegara.jpg|300px|Kantur pambakal Muara Tiq]]
|panjalasan =Kantur pambakal Muara Tiq
|ngaran =Muara Tiq
|prupinsi =Kalimantan Timur
|dati2 =Kabupatin
|ngaran dati2 =Kutai Kartanegara
|kacamatan =Tabang
|kode pos =75558
|luas =... km²
|warga =... urang
|karacapan =... urang/km²
}}
'''Muara Tiq''' yaitu sabuting [[kampung]] di Kacamatan [[Tabang, Kutai Kartanegara|Tabang]], [[Kabupatin Kutai Kartanegara]], Prupinsi [[Kalimantan Timur]], [[Indunisia]].
{{Tabang, Kutai Kartanegara}}
{{Authority control}}
{{Kampung-stub}}
2vw76yph68q52uf6qhfo13jetsro5yr
Muara Tuboq, Tabang, Kutai Kartanegara
0
27030
113663
80393
2026-09-04T00:52:43Z
Ezagren
143
+gambar
113663
wikitext
text/x-wiki
{{Kampung
|kar =
|gambar =[[Barakas:Kantor Desa Muara Tuboq, Kutai Kartanegara.jpg|300px|Kantur pambakal Muara Tuboq]]
|panjalasan =Kantur pambakal Muara Tuboq
|ngaran =Muara Tuboq
|prupinsi =Kalimantan Timur
|dati2 =Kabupatin
|ngaran dati2 =Kutai Kartanegara
|kacamatan =Tabang
|kode pos =75558
|luas =... km²
|warga =... urang
|karacapan =... urang/km²
}}
'''Muara Tuboq''' yaitu sabuting [[kampung]] di Kacamatan [[Tabang, Kutai Kartanegara|Tabang]], [[Kabupatin Kutai Kartanegara]], Prupinsi [[Kalimantan Timur]], [[Indunisia]].
{{Tabang, Kutai Kartanegara}}
{{Authority control}}
{{Kampung-stub}}
5dqkgyqcz6krho5bwpfa6egrmhryqsf
Mulawarman, Tenggarong Seberang, Kutai Kartanegara
0
27050
113666
80413
2026-09-04T00:52:55Z
Ezagren
143
+gambar
113666
wikitext
text/x-wiki
{{Kampung
|kar =
|gambar =[[Barakas:Kantor Desa Mulawarman, Kutai Kartanegara.JPG|300px|Kantur pambakal Mulawarman]]
|panjalasan =Kantur pambakal Mulawarman
|ngaran =Mulawarman
|prupinsi =Kalimantan Timur
|dati2 =Kabupatin
|ngaran dati2 =Kutai Kartanegara
|kacamatan =Tenggarong Seberang
|kode pos =75572
|luas =... km²
|warga =... urang
|karacapan =... urang/km²
}}
'''Mulawarman''' yaitu sabuting [[kampung]] di Kacamatan [[Tenggarong Seberang, Kutai Kartanegara|Tenggarong Seberang]], [[Kabupatin Kutai Kartanegara]], Prupinsi [[Kalimantan Timur]], [[Indunisia]].
{{Tenggarong Seberang, Kutai Kartanegara}}
{{Authority control}}
{{Kampung-stub}}
n75b2lxb8eje0nm3k70t4qro86kfu0t
Inna lillahi wa inna ilaihi raji'un
0
31961
113667
112487
2026-09-04T02:27:46Z
Atcovi
4420
([[c:GR|GR]]) [[c:COM:FR|File renamed]]: [[File:إِنَّا ِلِلَّٰهِ وَإِنَّا إِلَيْهِ رَاجِعُونَ.mp3]] → [[File:Al-Baqarah verse 156.mp3]] Making the file more specific
113667
wikitext
text/x-wiki
[[Berkas:Lafadz_Inna_lillahi_wa_Inna_Ilayhi_Rajiun.png|pra=https://id.wikipedia.org/wiki/Berkas:Lafadz_Inna_lillahi_wa_Inna_Ilayhi_Rajiun.png|jmpl|330x330px|''Istirja dalam aksara Arab.'']]
'''''{{PAGENAME}}''''' ({{lang-ar|إِنَّا لِلَّٰهِ وَإِنَّا إِلَيْهِ رَاجِعُونَ}}, ''{{transl|ar|ʾinnā li-llāhi wa-ʾinna ʾilayhi rājiʿūn{{smallsup|a}}}}'') ngitu potongan matan ayat [[Al-Qur'an]], dari [[Surah]] [[Al-Baqarah]], ayat 156. Isi hibak ayat ngitu
الَّذِينَ إِذَا أَصَابَتْهُمْ مُصِيبَةٌ قَالُوا إِنَّا لِلَّهِ وَإِنَّا إِلَيْهِ رَاجِعُونَ
{{Cquote|(yaitu) urang -urang nang apabila ditimpa musibah, mereka mengucapkan: ''Inna lillaahi wa innaa ilaihi raaji'uun" (Sesungguhnya kami adalah kepunyaan Allah dan kepada Allah jugalah kami kembali). (Al-Baqarah 2:156)}}
[[Berkas:Al-Baqarah verse 156.mp3|ka|jmpl|Cara maucap إِنَّا ِلِلَّٰهِ وَإِنَّا إِلَيْهِ رَاجِعُونَ di Al-Qur'an 2:156.]]
Bacaan ini jua disambat '''istirja'''' atawa '''tarji'''.
== Pamakaian ==
Dalam [[:id:Islam|Islam]], istirja' disambat pabila urang takana mushibah wan jua disambat pas dapat habar duka.
Oleh karna itu, umat Islam manyarahkan diri kapada [[:id:Tuhan|Tuhan]] atas barataan nang inya terima. Di waktu nang sama, buhannya sabar dan manyabut bacaan ini pas dapat cubaan atawa musibah. Lalu, pabila urang Msulim dapat musibah, inya harus sabar wan meucapkan bacaan istirja maka [[:id:Allah|Allah]] mambarinya [[:id:Pahala|pahala]].<ref>Diriwayatkan oleh ‘Ali bin Al Husain, matan kainya rasulullah SAW, sidin bersabda, ما من مسلم يصاب بمصيبة فيتذكرها وإن تقادم عهدها فيحدث لها استرجاعا إلا أعطاه الله من الأجر مثل يوم أصيب بها "Kadalah seurang muslim tertimpa musibah, bistu inya mengganangnya wan maucapkan kalimat istirja (''inna lillahi wa inna ilaihi rooji'un'') melainkan Allah bakal membarinya pahala semisal hari inya tertimpa musibah" (Hadis riwayat oleh Ahmad wan Ibnu Majah. ''Kitab Al Bidayah wan Nihayah'', 8:221 oleh Ibnu Katsir).</ref>
== Jujuhutan ==
<references />
[[Tumbung:Islam]]
mqvfqdzzdktcgnnfbite2gotnza6usa
Modul:Exponential search
828
39564
113661
2026-09-03T22:24:03Z
Hamish
10004
[IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]]
113661
Scribunto
text/plain
-- This module provides a generic exponential search algorithm.
require[[strict]]
local checkType = require('libraryUtil').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, i, lower, upper)
else
upper = i
i = midPoint(lower, upper)
return search(testFunc, i, lower, upper)
end
end
return function (testFunc, init)
checkType('Exponential search', 1, testFunc, 'function')
checkType('Exponential search', 2, init, 'number', true)
if init and (init < 1 or init ~= floor(init) or init == math.huge) then
error(string.format(
"invalid init value '%s' detected in argument #2 to " ..
"'Exponential search' (init value must be a positive integer)",
tostring(init)
), 2)
end
init = init or 2
if not testFunc(1) then
return nil
end
return search(testFunc, init, 1, nil)
end
jqqi8l27tb73lglksbukg2g3bzt3fmv