Wikipedia
vewiki
https://ve.wikipedia.org/wiki/Hayani
MediaWiki 1.47.0-wmf.18
first-letter
Media
Special
Talk
User
User talk
Wikipedia
Wikipedia talk
File
File talk
MediaWiki
MediaWiki talk
Template
Template talk
Help
Help talk
Category
Category talk
TimedText
TimedText talk
Module
Module talk
Event
Event talk
Module:TableTools
828
3714
23083
16941
2026-09-03T13:16:31Z
Hamish
5262
Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]]
23083
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
User:Rencila/Mvetmveto 7
2
6068
23082
23080
2026-09-03T12:15:05Z
Rencila
9395
23082
wikitext
text/x-wiki
'''BUFHO.'''
'''Bufho''' (tshine tsha dovha tsha ḓivhiwa sa tshiendedzi tsha muyani) ndi bufho ndi tshiendedzi tshi re na maanḓa, tshi re na phapha dzo khwaṱhaho tshine tsha ṱuṱuwedzwa phanḓa nga u ṱuṱuwedzwa nga nḓila ya jet, propeller, kana rocket. Mabufho ndi zwiṅwe zwa zwithu zwa ndeme vhukuma zwo tumbulwaho nga thekinolodzhi zwa ḓana ḽa vhu-20 ḽa miṅwaha, zwo shandulaho vhuendi, zwa vhubindudzi, na vhuṱumani ha shango ḽoṱhe.
'''Vhubvo ha Ḓivhazwakale.'''
Mihumbulo ya u thoma: U takadzwa ha vhathu nga u fhufha zwi thoma kha ngano dza kale na zwifanyiso zwa Leonardo da Vinci zwa mitshini ine ya fhufha.
U Fhufha ha u Thoma hu re na Maanḓa: Vhahashu vha Wright vho swikelela u fhufha ho langwaho, ho bvelaho phanḓa nga 1903 ngei Kitty Hawk, North Carolina.
Mvelaphanḓa: Nndwa ya Shango ya u Thoma na ya Vhuvhili yo ṱavhanyedza thekinolodzhi ya zwiendedzi, zwa ita uri hu vhe na zwiendedzi zwi ṱavhanyaho, zwi konḓelelaho, na zwo khetheaho.
Tshifhinga tsha Musalauno: Vhuendelamashango ha zwa vhubindudzi ho ṱanḓavhuwa nga u ṱavhanya nga murahu ha vho 1950, nga dzinzhini dza jet dzine dza ita uri hu kone u tshimbila tshikhala tshilapfu.
'''Tshaka dza Mabufho.'''
Zwiendedzi zwa Vhubindudzi: Zwiendedzi zwihulwane zwo itelwaho u hwala vhanameli na mihwalo (tsumbo, Boeing 747, Airbus A380).
Zwiendedzi zwa Maswole: Zwi katela zwiendedzi zwa nndwa, zwiendedzi zwa bomo, na zwiendedzi zwa u ṱola.
Zwiendedzi zwa Phuraivethe na zwa Vhuḓimvumvusi: Zwiendedzi zwiṱuku zwine zwa shumiswa u itela u tshimbila, u gudisa, kana mitambo.
Cargo Planes: Zwo khetheaho zwa u hwala thundu.
Zwiendedzi zwa u Linga: Zwi shumiswa u linga thekinolodzhi ntswa na zwivhumbeo.
Tshivhumbeo na Zwipiḓa
Fuselage: Muvhili muhulwane une wa vha na vhanameli, vhashumi, na mihwalo.
Phapha: I ṋea u takusa nga kha u ḓivhadza ha aerodynamic.
Empennage (Mutshila): I dzikisa tshiendedzi.
Dzinzhini: Dzi bveledza ṱhuṱhuwedzo.
Landing Gear: I tikedza u fhufha, u tsa, na u thekhisa.
Cockpit: I na zwishumiswa zwa u langa tshiendedzi na zwishumiswa zwa u livhisa.
Tshumiso na Ndeme
Vhuendedzi: U tshimbila nga u ṱavhanya, nga nḓila yavhuḓi ha vhathu na thundu u mona na dzikhonthinathe.
Vhuswole: Vhupileli, u linda, na mishumo ya nndwa.
Tsedzuluso ya Saintsi: U ṱola mutsho, u ita tsedzuluso dza ṱaḓulu, na thikhedzo ya u ṱola tshikhala.
Tshumelo dza Tshihaḓu: U bviswa ha vhathu nga lwa ngalafho, u dzima mulilo, na u thusa musi hu na khombo.
'''Masiandoitwa a Mupo.'''
Mabufho a shela mulenzhe kha u bvisa gese dza dzingamufhe, tshikafhadzo ya phosho, na tshanduko ya kilima. Tsedzuluso dza musalauno dzo sedza kha zwivhaswa zwa vhuendedzi zwi bveledzaho, zwiendedzi zwa muḓagasi, na u khwiniswa ha aerodynamics u itela u fhungudza zwithu zwine zwa nga tshinyadza mupo.
=== '''BUGU TSHUMISWA.''' ===
# Anderson, J.D. (2017). ''Introduction to Flight''. McGraw‑Hill Education.
# Crouch, T.D. (2003). ''The Bishop’s Boys: A Life of Wilbur and Orville Wright''. W.W. Norton & Company.
# Gunston, B. (2009). ''The Development of Jet and Turbine Aero Engines''. Haynes Publishing.
# International Civil Aviation Organization (ICAO). (2025). ''Environmental Report on Aviation Emissions''.
# Smithsonian National Air and Space Museum. (2026). ''History of Flight''.
q3slx18e02xpkutmb7ojb9fqex6ais2
User:Rencila/Mvetomveto 8
2
6070
23084
2026-09-03T14:00:36Z
Rencila
9395
Created page with "Baisigira Marangaphanḓa Baisigira ndi goloi ine ya shumiswa nga vhathu, ine ya tshimbidzwa nga pedal ine ya vha na mavili mavhili o nambatedzwaho kha fureme, ḽiṅwe ḽi murahu ha ḽiṅwe. Ndi iṅwe ya nḓila dza vhuendi dzine dza shumiswa vhukuma shangoni ḽoṱhe, i dzhielwa nṱha nga ṅwambo wa u ḓura hayo, u shuma zwavhuḓi, na mbuelo dzayo kha mupo. Vhubvo ha Ḓivhazwakale Zwivhumbeo zwa u thoma: Prototype ya u thoma ya baisigira ine ya ḓivhea yo..."
23084
wikitext
text/x-wiki
Baisigira
Marangaphanḓa
Baisigira ndi goloi ine ya shumiswa nga vhathu, ine ya tshimbidzwa nga pedal ine ya vha na mavili mavhili o nambatedzwaho kha fureme, ḽiṅwe ḽi murahu ha ḽiṅwe. Ndi iṅwe ya nḓila dza vhuendi dzine dza shumiswa vhukuma shangoni ḽoṱhe, i dzhielwa nṱha nga ṅwambo wa u ḓura hayo, u shuma zwavhuḓi, na mbuelo dzayo kha mupo.
Vhubvo ha Ḓivhazwakale
Zwivhumbeo zwa u thoma: Prototype ya u thoma ya baisigira ine ya ḓivhea yo vha i Draisine (1817) nga Karl Drais, fureme ya thanda ine ya vha na mavili mavhili fhedzi i si na dzi pedal.
Baisigira ya Pedal: Nga vho 1860, ho mbo ḓi engedzwa dzi pedal ngei France, zwa sika “velocipede.”
Baisigira ya Tsireledzo: Nga vho 1880, ho mbo ḓi bvelela nḓila ya musalauno ine ya vha na mavili a vhuhulwane vhu linganaho, chain drive, na mathaela a pneumatic.
U Ṱanganedzwa nga Vhanzhi: Baisigira dzo mbo ḓi takalelwa vhukuma kha u ya mushumoni, u ḓimvumvusa, na mitambo, zwa ṱuṱuwedza u tshimbila ha vhathu na u pulana ḓorobo.
Tshivhumbeo na Zwipiḓa
Fureme: I ṋea thikhedzo na u dzika.
Mavili: Mavili mavhili ane avha na zwipoko ane avha na mathaela a raba.
Drivetrain: Pedal, tsheini, na dzi gere zwi fhirisela maanḓa.
Maburiki: Rim kana disc ya u ima.
Handlebars: I shuma kha u langa.
Saddle: Tshidulo tsha muṋameli.
Tshaka dza Baisigira
Road Bikes: A dzi lemeli, dzo itelwa u tshimbila nga luvhilo kha bada dzo ṱaniwaho.
Baisigira dza Thavhani: Dzo fhaṱelwa fhethu hune ha vha nnḓa ha bada dzi re na tshiṱepisi.
Baisigira dza Ṱhanganyelo: U ṱanganya zwithu zwa baisigira dza badani na dza thavhani.
Baisigira dza Cargo: Dzo itelwa u hwala mihwalo i lemelaho.
Baisigira dza Muḓagasi (E‐bikes): Dzi na moṱoḽa u itela u thusa u reila.
Tshumiso na Ndeme
Vhuendedzi: U tshimbila ha ḓoroboni hu sa ḓuriho na hu shumaho zwavhuḓi.
Mutambo: U reila baisigira ndi mutambo wa Oḽimpiki nahone ndi mutambo wa muṱaṱisano wa shango ḽoṱhe.
Vhuḓimvumvusi: Vhu takalelwa nga u ḓimvumvusa na vhuendelamashango.
Mutakalo: I ṱuṱuwedza u khwaṱha ha mbilu na u fhungudza u nona.
Mupo: Zero emissions, zwine zwa shela mulenzhe kha vhuendi vhu bveledzaho.
Mvelele na Matshilisano
Baisigira dzo vha na mushumo kha tshanduko ya matshilisano, nga maanḓa kha u vhofhololwa ha vhafumakadzi mafheloni a ḓana ḽa vhu 19 ḽa miṅwaha, zwi tshi ṋetshedza vhuḓilangi na u tshimbila. Ṋamusi, baisigira ndi dza ndeme kha u pulana ha ḓorobo hu bveledzaho na vhukando ha u ṱhogomela mupo.
eofp02am5lkgs4ww8tzlxfujtybdzk9
Module:Exponential search
828
6072
23086
2026-09-03T21:48:22Z
Hamish
5262
[IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]]
23086
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