Wikipedia
diqwiki
https://diq.wikipedia.org/wiki/Pela_Seri
MediaWiki 1.47.0-wmf.18
first-letter
Medya
Xısusi
Werênayış
Karber
Werênayışê karberi
Wikipediya
Werênayışê Wikipediya
Dosya
Werênayışê dosya
MedyaWiki
Werênayışê MedyaWikiyi
Şablon
Werênayışê şabloni
Peşti
Werênayışê peşti
Kategoriye
Werênayışê kategoriye
Portal
Werênayışê portali
TimedText
TimedText talk
Modul
Werênayışê moduli
Event
Event talk
Catalão
0
6245
556553
452438
2026-09-04T00:27:31Z
InternetArchiveBot
21954
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5
556553
wikitext
text/x-wiki
{{Infobox sûke}}
'''Catalão''' sûkê da eyaletê [[Brezilya]] [[Goiás]]ia.
== Sûkê wayiye ==
{{Sûkê Wayiye}}
== Nıfus ==
Grafikê diagrami sero gorey serran ra nıfusê Catalão;
{{Nıfus}}
== Fotogaleriya Katalani ==
<gallery>
Image:Museu Catalão 2.jpg
Image:Patio Mitsubishi.jpg
Image:Catalão2.JPG
Image:Represa Monsenhor Souza 1.jpg
Image:Lazer em Catalão.jpg
Image:Igreja Dom Bosco.jpg
Image:Lazer em Catalão.jpg
Image:Catalão cidade das flores.JPG
</gallery>
== Çımey ==
* [http://www.guiacatalao.com.br Portalê Katalani] {{Webarchive|url=https://web.archive.org/web/20210414012440/https://guiacatalao.com.br/ |date=2021-04-14 }}
* [http://www.catalao.go.gov.br Sitey Katalanio resmi]
[[Dosya:Goias Municip Catalao.svg|200px|thumb|left|Mıntıqa Katalani - [[Brezilya]]]]
{{Commonscat}}
{{Portal|Brezilya}}
{{Authority_control}}
{{Sûkê Brezilya}}
[[Kategoriye:Sûkê Brezilya]]
czuhx25y7btt1362xfx6ybl8742qszv
Modul:TableTools
828
42849
556543
384716
2026-09-03T12:49:13Z
Hamish
18462
Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]]
556543
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
Ahmet Davutoğlu
0
44585
556547
523288
2026-09-03T18:55:29Z
Mirzali
16
556547
wikitext
text/x-wiki
{{Merdumi}}
'''Ahmet Davutoğlu''' (b. 26 Şubat 1959, Konya), yew siyasetkar u akademisyeno [[Tırk]]o ke serra 1959ıne de sûka [[Qonya]] de marda cı ra biyo. Ey sûka Estanboli de lisa de wendo. Ey serranê 1983–84 miyan de Universıta Boğaziçi de ekonomiye, siyaset u gıreyê enternasyonali de musnayış diyo. Politika u Gıreyê Enternasyonali ser doktora kerda. Serra 2003yıne de elçi biyo. 28 Ağustos 2014 de weçınitış ra pey cayê [[Recep Tayyip Erdoğan]]i rê vêrdo u biyo serekwezir. Ey be Sare Davutoğlu ra zeweciyao u hirê domanê cı estê. Ey, 12 Kanune 2019ıne de ''Partiya Vereroce'' kerda a u biyo serdarê ena partiye.
== Gıreyê teberi ==
* [https://web.archive.org/web/20180706043724/https://www.basbakanlik.gov.tr/Forms/_Global/_PrimeMinister/pg_PrimeMinister.aspx Ahmet Davutoğlu]
* {{twitter|Ahmet_Davutoglu}}
* {{facebook|A.Davutoglu}}
{{Serdarê Tırkiya}}
[[Kategoriye:Siyasetkari]]
[[Kategoriye:Şarê Qonya]]
imle6k6lb2mhv008mr612t5ro6ve0xk
.read
0
69849
556544
504257
2026-09-03T18:51:40Z
Mirzali
16
556544
wikitext
text/x-wiki
'''.read''', [[İnternet|internet]] de nameyê bandıra jeneriko (be zıwanê [[İngılızki]]: ''[[Bandıra sewiyaya serêna jenerike|Generic top-level domains]]'') ke yew kodê interneti rê bırriyayo a.
== Bıvênên ==
* [[Domain]]
* [[Komputer]]
* [[Website]]
{{Generic top-level domain}}
{{ccTLD}}
[[Kategoriye:Bandıra sewiyaya serêna jenerike]]
58cv5utn0pnkjzv3mymkqe2ao20kjbw
.realestate
0
70102
556554
504754
2026-09-04T10:01:41Z
Mirzali
16
556554
wikitext
text/x-wiki
'''.realestate''', [[İnternet|internet]] de nameyê bandıra jeneriko (be zıwanê [[İngılızki]]: ''[[Bandıra sewiyaya serêna jenerike|Generic top-level domains]]'') ke yew kodê interneti rê bırriyayo a.
== Bıvênên ==
* [[Domain]]
* [[Komputer]]
* [[Website]]
{{Generic top-level domain}}
{{ccTLD}}
[[Kategoriye:Bandıra sewiyaya serêna jenerike]]
0d8sptwjo4ct5qz39ju5atk1g9kwpa1
NGC 5704
0
76084
556555
489428
2026-09-04T10:02:33Z
Mirzali
16
[[Katalogo Pêroyiyo Newe]]
556555
wikitext
text/x-wiki
{{Galaksiye}}
'''NGC 5704''', yew cısmê [[Asmên|asmên]]iyo. No cısım [[Katalogo Pêroyiyo Newe|Katalogê Pêroyiyê Neweyi]] de komê estareyanê {{Wikidata|P59}} miyan de ca gêno. {{Wikidata|P575}} de terefê {{Wikidata|P61}}i ra keşıf biyo.
== Bıvênên ==
* [[Asmên]]
* [[Galaksiye]]
* [[Estare]]
* [[Pulsar]]
* [[Nebula]]
* [[Lista cısmanê NGC]]
== Gıreyê teberi ==
* {{NASANED}}
* {{Simbad}}
* {{Leda}}
* {{Seds}}
* {{WikiSky}}
{{NGC|5704}}
[[Kategoriye:Asmênşınasiye]]
6quhwi8fculbqrfz4siv4o9hwvfp8cy
NGC 5731
0
76344
556545
538051
2026-09-03T18:52:56Z
Mirzali
16
[[Katalogo Pêroyiyo Newe]]
556545
wikitext
text/x-wiki
{{Galaksiye}}
'''NGC 5731''', yew cısımê [[Asmên|asmên]]iyo.<ref>http://www.ngcic.org/</ref><ref>https://academic.oup.com/mnras/article-pdf/399/4/2146/17323628/mnras0399-2146.pdf</ref><ref>http://aladin.u-strasbg.fr</ref><ref>{{Cite web |title=Archive copy |url=http://skyview.gsfc.nasa.gov/ |access-date=2021-08-08 |archivedate=2014-01-08 |archiveurl=https://web.archive.org/web/20140108211809/http://skyview.gsfc.nasa.gov/ }}</ref> No cısım [[Katalogo Pêroyiyo Newe|Katalogê Pêroyiyê Neweyi]] de komê estareyanê [[Boötes|Şıwane]] miyan de ca gêno. 9 Nisane 1787 de terefê [[Wilhelm Herschel|Wilhelm Herschel]]i ra keşıf biyo.<ref>https://cseligman.com/text/atlas/ngc0.htm</ref>
== Bıwane ==
* [[Komê estareyan]]
* [[Galaksiye]]
* [[Estare]]
* [[Pulsar]]
* [[Nebula]]
== Gıreyê teberi ==
* {{NASANED}}
* {{Simbad}}
* {{Leda}}
* {{Seds}}
* {{WikiSky}}
== Bıvênên ==
* [[Lista cısımanê NGC]]
* [[Lista astronoman]]
== Çımeyi ==
{{Çıme}}
{{Commonscat}}
{{Portal|Asmên|Astronomiye}}
{{NGC|5731}}
{{Kontrolê otoriteyi}}
[[Kategoriye:Cısımê Asmêni]]
[[Kategoriye:Asmênşınasiye]]
ki9m4m71ovhdwxag6ppli5cbf7hdzqu
Audrey Hepburn
0
89376
556546
507846
2026-09-03T18:54:16Z
Mirzali
16
556546
wikitext
text/x-wiki
{{Merdumi}}
'''Audrey Hepburn''' (b. 4 Gulane 1929 – m. 20 Çele 1993) jû kayker û aktrisa [[Hollywood]]iya namdare biya. Mayê aye [[Hollanda]]yıca. Piyê aye [[İngılız]]o. A çehar dolımi namzeda Xelata Oskari biya, yew dolım serra 1953ıne de gırewta. Serra 1993ıne de merda. Mezela aye [[İswiçre]] dera.
[[File:Audrey Hepburn Tiffany's 3.jpg|thumb|300px|Hepburn, filme ''Breakfast at Tiffany's'' de (1961)]]
== Filmografiye ==
* ''Always (Para siempre)'' (1989).
* ''They All Laughed'' (1981).
* ''Lazos de sangre'' (1979).
* ''Robin y Marian'' (1976).
* ''Wait Until Dark'' — 1967).
* ''Dos en la carretera'' (1967).
* ''How to Steal a Million'' (1966).
* ''My Fair Lady'' (1964) - Eliza Doolittle
* ''Paris When It Sizzles'' (1964).
* ''Charade'' — 1963).
* ''La calumnia'' (1961).
* ''Breakfast at Tiffany's'' (1961) - Holly Golightly
* ''The Unforgiven'' - (1960)
* ''The Nun's Story'' — (1959)
* ''Mansiones verdes'' (1959).
* ''Love in the Afternoon'' (1957).
* ''Funny Face'' (1957).
* ''Mayerling (1957)''
* ''''War and Peace'' — (1956).
* ''Sabrina'' (1954) - Sabrina
* ''''Roman Holiday'' — (1953)
* ''Americanos en Montecarlo'' (1952).
* ''The Secret People'' (1952).
* ''Monte Carlo Baby'' (1951).
* ''One Wild Oat'' (1951).
* ''Young Wives' Tale'' (1951).
* ''Laughter in Paradise'' (1951).
* ''The Lavender Hill Mob'' (1951).
* ''Dutch in Seven Lessons'' (1948) (documental).
== Gıreyê teberi ==
* {{IMDb name|0000030}}
{{Commons}}
{{Kontrolê otoriteyi}}
[[Kategoriye:Merdumê ke 1929 de biyê]]
[[Kategoriye:Merdumê ke 1993 de merdê]]
[[Kategoriye:Merdumê weşi]]
[[Kategoriye:Sinemawanê Dewletanê Amerikayê Yewbiyayeyan]]
ge8izhlqksjd9loracb7bat8qiij3mg
Anatoli Karpov
0
98877
556556
531892
2026-09-04T11:09:51Z
Juan carlos perez rodriguez
34736
556556
wikitext
text/x-wiki
{{Merdumi}}
'''Anatoli Yevgenyeviç Karpov''' (be [[Ruski]]: Анато́лий Евге́ньевич Ка́рпов), 23yê [[Gulane]] serra [[1951]]ıne de, Zlatoust de ameyo riyê dınya. Serranê 1975 u 1985 miyan de biyo sampiyonê [[Setrenc|setrenc]]i <ref>[https://www.chessgames.com/perl/chess.pl?tid=54487 Fischer-Karpov 1975]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=54461 Karpov-Korchnoi 1978]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=55014 Karpov-Korchnoi 1981]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=55015 Karpov-Kasparov 1984/5]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=55016 Karpov-Kasparov 1985]</ref>.
Serranê 1993 u 1999 miyan de biyo sampiyonê [[Setrenc|setrenc]]i <ref>[https://www.chessgames.com/perl/chess.pl?tid=55303 Karpov-Timman 1993]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=55432 Karpov-Kamsky 1996]</ref><ref>[https://www.chessgames.com/perl/chess.pl?tid=55521 Karpov-Anand 1998]</ref>.
== Çıme ==
* [https://web.archive.org/web/20071225093227/http://fide.com/ratings/card.phtml?event=4100026 FIDE de Karpov]
[[Kategoriye:Şarê Rusya]]
[[Kategoriye:Setrenc]]
[[Kategoriye:Merdumê ke 1951 de biyê]]
40fp4pg60qv7ieft6e36ny6l3cnwlur
Modul:Exponential search
828
100461
556552
2026-09-03T22:19:58Z
Hamish
18462
[IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]]
556552
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