Wikipedia
kwwiki
https://kw.wikipedia.org/wiki/Folen_dre
MediaWiki 1.47.0-wmf.18
first-letter
Media
Arbennek
Keskows
Devnydhyer
Keskows Devnydhyer
Wikipedia
Keskows Wikipedia
Restren
Keskows Restren
MediaWiki
Keskows MediaWiki
Skantlyn
Keskows Skantlyn
Gweres
Keskows Gweres
Klass
Keskows Klass
Porth
Keskows Porth
TimedText
TimedText talk
Module
Module talk
Event
Event talk
Don Rickles
0
9624
229177
223858
2026-09-04T09:45:48Z
Aqchampion
8099
klass
229177
wikitext
text/x-wiki
[[Restren:Don Rickles 1.jpg|thumb|Rickles, [[2010]]]]
'''Donald Jay''' "'''Don'''" '''Rickles''' ([[1926]] – [[2017]]) o gwarier [[Pobel Statys Unys|amerikan]] geryes da.
{{stock-tus-sua}}
{{DEFAULTSORT:Rickles, Don}}
[[Klass:Demokratyon]]
[[Klass:Enys Hir]]
[[Klass:Gesyoryon]]
[[Klass:Gwarioryon bellwolok amerikanek]]
[[Klass:Gwarioryon fylm amerikanek]]
[[Klass:Gwarioryon lev amerikanek]]
[[Klass:Istorioryon]]
[[Klass:Mernansow 2017]]
[[Klass:Skriforyon amerikanek]]
[[Klass:Vali an Prasow]]
[[Klass:Ynkleudhyansow yn Konteth an Eledh]]
lfxokyzesqmasymdd988bv08vxnhk3c
Module:TableTools
828
9776
229169
182169
2026-09-03T12:58:53Z
Hamish
11398
Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]]
229169
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
Carl Friedrich Gauss
0
14193
229178
222986
2026-09-04T09:54:57Z
Aqchampion
8099
klass
229178
wikitext
text/x-wiki
{{Den|fetchwikidata=ALL|onlysourced=yes|suppressfields=ymgynghorydd y doethor}}
'''Carl Friedrich Gauss''' (30 Ebrel 1777 – 23 Hwevrer 1855) o [[Awgrym|kalkor]] a vri a Göttingen yn [[Almayn]]. Gauss a wrug kevri dhe lies rann a studhya. An brassa rann a'y ober o war dybieth niverow ha [[steronieth]]. Genys veu ev yn Braunschweig.
Pan o ev tri bloodh, ev a ewnhas ober y das war y rol gweythysi komplek. Ev a omdhyskas fatel wra redya. Pan o Gauss 23 bloodh, [[Godhonieth|godhonydhyon]] a welas planetten [[Ceres (planet còr)|Ceres]], mes na rag termyn hir lowr dhe wodhvos hy resekva. Gauss a wrug reknansow a'ga gasas dh'y throvya.
Gauss a skrifas [[lyver]] henwys ''Disquisitiones Arithmeticae'' a-dro the tybieth niverow. Y'n lyver ma ev a brovas an lagha kesparthekter pedrek. Ynwedh ev o an kynsa kalkor dhe styrya arsmetryk modular yn gans meur a vanylyon. Gauss a wrug diskudhansow posek yn tybieth hevelepter. Pan o ev koth, Gauss a hedhas oberi war awgrym pur ha dalleth [[fysegieth]]. Ev a wrug ober yn [[elektrodennvenieth]] ha gwruthyl pellskrifer tredanek a-varr.
{{unn k}}
{{Posek 1,000}}
[[Klass:Almanyon]]
[[Klass:Awgrymoryon]]
[[Klass:Dinethyansow 1777]]
[[Klass:Fysegydhyon]]
[[Klass:Mernansow 1855]]
86ouzrslkxpsqok8vg189v54vg310x1
Golowji Entenin
0
14880
229173
199860
2026-09-03T21:12:01Z
Aqchampion
8099
klass
229173
wikitext
text/x-wiki
[[Restren:Phare-pte-Saint-Antony-a-Fa.jpg|skeusennik|Golowji Entenin]]
Golowji yn [[Kernow]] yw '''Golowji Entenin''', yn [[Pluw Erens]]. Yma an golowji yn [[Penn Entenin]] y'[[An Ros|n Ros]], war denewen est a [[Dowr Karrek|Dhowr Karrek]]. Drehevys veu yn 1835.
{{Stokk-kernow}}
[[Klass:Drehevyansow yn Europa]]
[[Klass:Pluw Erens]]
cmqlmn5faxg4iu4o24hq2uwbc05dduy
Giorgia Meloni
0
15444
229176
220216
2026-09-04T09:26:19Z
Aqchampion
8099
klass
229176
wikitext
text/x-wiki
{{Den | fetchwikidata=ALL | onlysourced=yes | suppressfields= }}
'''Giorgia Meloni''' (leveryans italek: [ˈdʒordʒa meˈloːni]; genys 15 mis Genver [[1977]]) yw politegores italek.
[[Klass:Dinethyansow 1977]]
[[Klass:Gweythresoryon]]
[[Klass:Italianesow]]
[[Klass:Kenedhlogoryon]]
[[Klass:Pennvenystresow]]
[[Klass:Rom]]
sh4ebog4wl7iijw9zdmbtq1sahq237s
Bauhaus
0
15649
229174
215270
2026-09-03T21:20:30Z
Aqchampion
8099
klass
229174
wikitext
text/x-wiki
{{Databox}}
An '''Bauhaus''' o skol dhesinya o gweythresek ynter [[1919]] ha [[1933]] yn [[Almayn]]. Konsidrys yw yn efan dhe vos an skol art moyha delanwasek y’n 20ns kansvledhen. Hi a skoodhas arnowydhieth. Yth yw moyha aswonnys rag dyski lymna, skeusenna, argemynna, gwia, pensernieth, desin mebel hag askorrasow chi. An ober askorrys ha’y methodys dyski re’s teva delanwes ollvysel war art, desin, skeusenieth, pensernieth hag adhysk art.
Hy hanow formel o an "Staatliches Bauhaus" a-dhia 1919 dhe 1932 drefen hy bos arghasys gans an wlas y’n termyn na. A-dhia 1919 dhe 1925, hy thyller o yn Weimar, yn rannvro Thuringia, hag ynter 1926 ha 1932 esa yn Dessau, yn rannvro Sachsen-Anhalt. Hy a oberas avel skol arghasys yn privedh yn [[Berlin]] a-dhia diwedh 1932 bys dhe mis Ebrel 1933.
Hy mayni a gomprehendas nebes a’n artydhyon ha pennseri moyha a vri y’n 20ves kansvledhen, ow komprehendya: Walter Gropius, a fondyas an skol, Ludwig Mies van der Rohe, [[Wassily Kandinsky]], Lyonel Feininge], Paul Klee, László Moholy-Nagy, Marcel Breuer, Josef Albers, Anni Albers, Oskar Schlemmer ha Hannes Meyer.
Hy drehevyansow kyns yn Weimar ha Dessau a veu gwrys avel [[Ertachva an Bys UNESCO]] yn [[1996]].
[[Klass:Almayn]]
[[Klass:Drehevyansow yn Europa]]
[[Klass:Ertachva an Bys UNESCO]]
[[Klass:Pennserneth arnowedhieth]]
f40mfuh7sh1p1xjqumd26afhct47cd8
Park Hill, Sheffield
0
19209
229172
224689
2026-09-03T21:07:20Z
Aqchampion
8099
klass
229172
wikitext
text/x-wiki
{{Tyller|fetchwikidata=ALL | onlysourced=yes| suppressfields= }}
'''Park Hill''' yw trevbark yn [[Sheffield]], [[Konteth Evrek]] Soth, [[Pow Sows]]. Byldys yntra 1957 ha 1960 hag ygerys gans [[Hugh Gaitskell]] yn 1961, yth esa 995 rannji dhe'n trevbark.<ref name=HE>[https://historicengland.org.uk/listing/the-list/list-entry/1246881?section=official-list-entry PARK HILL, DUKE STREET], ''Historic England'' (yn [[Sowsnek]]), kyrghys 3 mis Hwevrer 2026</ref> Ensampel a [[pennserneth milusiethel]] yw hag o awenys gans ''{{ill|Unite d'habitation|en}}'' gans [[Le Corbusier]].<ref>Lucy Townsend (16 mis Gwynngala 2013), [https://www.bbc.co.uk/news/magazine-24054185 Stirling Prize: Park Hill Phase 1], ''[[BBC|BBC News]]'', kyrghys 3 mis Hwevrer 2026</ref><ref>[http://news.bbc.co.uk/local/sheffield/hi/people_and_places/history/newsid_8207000/8207206.stm Park Hill Flats renovation], ''[[BBC|BBC News]]'' (yn [[Sowsnek]]), 18 mis Est 2009, kyrghys 3 mis Hwevrer 2026</ref> An trevbark o henwys drehevyans rolys gradh II yn mis Kevardhu 1998.<ref name=HE /> Wosa termyn a dhifygyans, an nowedhyans an trevbark a dhallathas yn 2007.<ref>[https://www.bbc.co.uk/news/uk-england-south-yorkshire-51092385 Sheffield Park Hill: £500,000 awarded for repair work], ''[[BBC|BBC News]]'' (yn [[Sowsnek]]), 13 mis Genver 2020, kyrghys 3 mis Hwevrer 2026</ref>
An gwari ilow ''[[Standing at the Sky's Edge]]'' yw settys yn Park Hill.<ref>[https://www.bbc.co.uk/news/uk-england-south-yorkshire-65165566 Standing at the Sky's Edge musical moves to London's West End], ''[[BBC|BBC News]]'' (yn [[Sowsnek]]), 4 mis Ebrel 2023, kyrghys 3 mis Hwevrer 2026</ref>
==Devynnow==
{{reflist}}
[[Klass:Drehevyansow yn Europa]]
[[Klass:Pennserneth arnowedhieth]]
[[Klass:Sheffield]]
9vq1dw5pk30qzzbgss6f7bku4gi6x28
Klass:Drehevyansow yn Loundres
14
19431
229171
226776
2026-09-03T21:00:42Z
Aqchampion
8099
klass
229171
wikitext
text/x-wiki
[[Klass:Drehevyansow yn Europa]]
[[Klass:Loundres]]
72mr7d2b50tl8swlx10ugip77yy95n6
Klass:Drehevyansow yn Europa
14
19604
229170
2026-09-03T20:57:41Z
Aqchampion
8099
Folen gwruthys gans: '[[Klass:Drehevyansow]] [[Klass:Europa]]'
229170
wikitext
text/x-wiki
[[Klass:Drehevyansow]]
[[Klass:Europa]]
i13s8bejpo525w2zf3adpxwm5s6yddr
Module:Exponential search
828
19605
229175
2026-09-03T22:10:22Z
Hamish
11398
[IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]]
229175
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