Wikipedya htwiki https://ht.wikipedia.org/wiki/Paj_Prensipal MediaWiki 1.47.0-wmf.18 first-letter Medya Espesyal Diskite Itilizatè Diskisyon Itilizatè Wikipedya Diskisyon Wikipedya Fichye Diskisyon Fichye MedyaWiki Diskisyon MedyaWiki Modèl Diskisyon Modèl Èd Diskisyon Èd Kategori Diskisyon Kategori TimedText TimedText talk Module Discussion module Event Event talk 0 21328 888277 651362 2026-09-03T17:33:25Z Dostojewskij 12489 + Kategori:Nesans nan lane 1869 + Kategori:Lanmò 1931 888277 wikitext text/x-wiki {{ebòch}} '''Dmitri Egorov''' se yon [[matematisyen]] [[ris]], nan peyi [[Risi]]. {{moun |non=Dmitri Egorov |foto= |tèks= |fonksyon=matematisyen |dat nesans= |lye nesans= |peyi nesans=[[Risi]] |dat lanmò= |lye lanmò= |peyi lanmò= |nasyonalite=ris |zèv= |nòt= }} == Byografi == *Dat enpòtan yo == Zèv li yo == *Sa li fè, piblikasyon li nan domèn konesans matematik li == Referans == *Referans pou konnen plis anlè moun sa a {{Souliye-Matematisyen}} {{DEFAULTSORT:Egorov, Dmitri}} [[Kategori:Matematisyen]] [[Kategori:Matematisyen ris]] [[Kategori:Nesans nan lane 1869]] [[Kategori:Lanmò 1931]] jkjxi37octch3lk9t8v6i36uhpy2iep 828 63575 888276 728513 2026-09-03T12:54:42Z Hamish 22687 Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]] 888276 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 2 77436 888279 881633 2026-09-03T17:42:32Z Dostojewskij 12489 3 septanm 2026 ➹ Kategori:Lanmò 1931 888279 wikitext text/x-wiki * Identifiant de l’utilisateur: 12489 * Date d’inscription: 2014-09-14 05:24 [[Fichye:LocationHaiti.png|thumb|right|200px]] [[Fichye:Idioma haitiano.png|thumb|right|200px]] [[Fichye:Flag of Haiti.svg|thumb|right|200px]] [[Fichye:Wikipedia-logo-v2-ht.svg|thumb|right|200px|[[Wikipedya kreyòl ayisyen]]]] {| class="wikitable" |- ! Date !! Modifications en direct !! <small>Modifications supprimées</small> !! Total des modifications !! Principal !! Pages modifiées (total) |- | 17 novanm 2014 || 1 || 0 || 1 || 0 || 1 |- | 26 janvye 2021 || 58 || 0 || 58 || 53 || 54 |- | 27 janvye 2021 || 96 || 0 || 96 || 91 || 85 |- | 30 janvye 2021 || '''100''' || 0 || '''100''' || 94 || 89 |- | 30 janvye 2021 || 111 || 0 || 111 || '''102''' || 97 |- | 2 fevriye 2021 || 120 || 0 || 120 || 111 || '''106''' |- | 4 fevriye 2021 || '''203''' || 0 || '''203''' || 150 || 186 |- | 8 fevriye 2021 || 259 || 1 || 260 || '''203''' || '''237''' |- | 11 fevriye 2021 || '''300''' || 1 || '''301''' || 239 || 272 |- | 17 fevriye 2021 || 332 || 1 || <span style="color:#0000FF">333</span> || 269 || '''302''' |- | 3 mas 2021 || 373 || 1 || 374 || '''309''' || 341 |- | 6 mas 2021 || '''401''' || 1 || '''402''' || 336 || 368 |- | 26 mas 2021 || 436 || 1 || 437 || 370 || '''401''' |- | 5 mas 2022 || 452 || 1 || 453 || 385 || 415 |- | 15 janvye 2023 || 464 || 1 || 465 || 396 || 426 |- | 23 avril 2023 || 471 || 1 || 472 || '''402''' || 432 |- | 13 janvye 2024 || 486 || 1 || 487 || 414 || 445 |- | 17 fevriye 2025 || 492 || 1 || 493 || 419 || 450 |- | 8 jen 2025 || '''502''' || 1 || '''503''' || 428 || 458 |- | 19 jiyè 2025 || 505 || 1 || 506 || 429 || 460 |- | 8 janvye 2026 || 534 || 1 || 535 || 457 || 488 |- ! Date !! Modifications en direct !! <small>Modifications supprimées</small> !! Total des modifications !! Principal !! Pages modifiées (total) |- | 29 avril 2026 || 545 || 1 || 546 || 466 || 498 |- | 4 jen 2026 || 554 || 1 || <span style="color:#0000FF">555</span> || 474 || '''505''' |- | 3 septanm 2026 || 567 || 1 || 568 || 485 || 517 |- |} == Compteurs annuels == [[Fichye:W mark.svg|thumb|]] {| class="wikitable" |- ! Year !! Live edits !! Deleted edits !! Total edits !! Namespace Main !! 🎖 |- | 2014 || 9 || 0 || 9 || 7 || <big>⑦</big> |- | 2015 || 3 || 0 || 3 || 3 |- | 2016 || 0 || 0 || 0 || 0 |- | 2017 || 1 || 0 || 1 || 0 |- | 2018 || 2 || 0 || 2 || 2 |- | 2019 || 3 || 0 || 3 || 1 |- | 2020 || 24 || 0 || 24 || 24 || <big>④</big> |-style='background:#FFEE77' | 2021 || '''409''' || 1 || '''410''' || '''347''' || <big>①</big> |- | 2022 || 12 || 0 || 12 || 11 || <big>⑥</big> |- | 2023 || 20 || 0 || 20 || 18 || <big>⑤</big> |- | 2024 || 8 || 0 || 8 || 5 || <big>⑧</big> |-style='background:#C0C0C0' | 2025 || 42 || 0 || 42 || 38 || <big>②</big> |-style='background:#DDAA77' | 2026<br/><small><small>(03.09.2026)</small></small> || 34 || 0 || 34 || 29 || <big>③</big> |- |} * [https://xtools.wmflabs.org/ec/ht.wikipedia.org/Dostojewskij xtools.wmflabs] * [https://ht.wikiscan.org/?menu=userstats&user=Dostojewskij ht.wikiscan] <div style="border: 3px solid green; margin: 2px; background-color: white;"><div style="margin: 10px;"> * [[Fichye:Wikidata-logo.svg|20px]] [[wikidata:User:Dostojewskij/Contributions]] * [[Fichye:Commons-logo.svg|20px]] [[commons:User:Dostojewskij/Contributions]] </div></div> == Kategori == * 🖫 [[:Kategori:Lanmò 1927]] (4 fevriye 2021) * 🖫 [[:Kategori:1927]] (4 fevriye 2021) * 🖫 [[:Kategori:1931]] (4 fevriye 2021) * 🖫 [[:Kategori:1918]] (6 fevriye 2021) * 🖫 [[:Kategori:Lanmò 2024]] (13 janvye 2024) * 🖫 [[:Kategori:2024]] (13 janvye 2024) * 🖫 [[:Kategori:Lanmò 2025]] (19 jiyè 2025) * 🖫 [[:Kategori:Lanmò 2026]] (29 avril 2026) * 🖫 [[:Kategori:Lanmò 1931]] (3 septanm 2026) == Principal == * 🖫 [[Heather Doerksen]] (16 fevriye 2021) [[de:Benutzer:Dostojewskij/Bearbeitungen]] [[ca:Usuari:Dostojewskij/Contribucions]] [[oc:Utilizaire:Dostojewskij/Contribucions]] [[ru:Участник:Dostojewskij/Мои правки]] [[pl:Wikipedysta:Dostojewskij/Wkład]] [[nl:Gebruiker:Dostojewskij/Gebruikersbijdragen]] [[fr:Utilisateur:Dostojewskij/Contributions]] [[scn:Utenti:Dostojewskij/Cuntribbuti]] [[pt:Usuário(a):Dostojewskij/Contribuições]] [[en:User:Dostojewskij/Contributions]] [[es:Usuario:Dostojewskij/Contribuciones]] [[uk:Користувач:Dostojewskij/Внесок]] [[no:Bruker:Dostojewskij/Bidrag]] [[wuu:User:Dostojewskij/我个贡献]] [[sv:Användare:Dostojewskij/Bidrag]] [[zh-min-nan:Iōng-chiá:Dostojewskij/Kòng-hiàn]] [[cs:Wikipedista:Dostojewskij/Příspěvky]] [[ro:Utilizator:Dostojewskij/Contribuții]] [[bg:Потребител:Dostojewskij/Приноси]] [[ast:Usuariu:Dostojewskij/Collaboraciones]] [[tr:Kullanıcı:Dostojewskij/Katkılarım]] [[lv:Dalībnieks:Dostojewskij/Devums]] [[mai:प्रयोगकर्ता:Dostojewskij/योगदान]] [[id:Pengguna:Dostojewskij/Kontribusi]] [[mg:Mpikambana:Dostojewskij/Fandraisan'anjara]] [[da:Bruger:Dostojewskij/Bidrag]] [[ml:ഉപയോക്താവ്:Dostojewskij/സംഭാവനകൾ]] [[bn:ব্যবহারকারী:Dostojewskij/অবদান]] [[lmo:Utent:Dostojewskij/Contribuzzion]] [[szl:Używacz:Dostojewskij/Edycyje]] [[kn:ಸದಸ್ಯ:Dostojewskij/ನನ್ನ ಕಾಣಿಕೆಗಳು]] [[crh:Qullanıcı:Dostojewskij/İsseler]] [[mk:Корисник:Dostojewskij/Придонеси]] [[ky:Колдонуучу:Dostojewskij/Салымдарым]] [[sk:Redaktor:Dostojewskij/Príspevky]] [[ne:प्रयोगकर्ता:Dostojewskij/मेरो योगदानहरू]] [[ko:사용자:Dostojewskij/기여]] [[zh:User:Dostojewskij/贡献]] [[ja:利用者:Dostojewskij/投稿記録]] [[kk:Қатысушы:Dostojewskij/Үлесім]] [[it:Utente:Dostojewskij/Contributi]] [[be:Удзельнік:Dostojewskij/Уклад]] [[mn:Хэрэглэгч:Dostojewskij/Хэрэглэгчийн хувь нэмэр]] [[pa:ਵਰਤੋਂਕਾਰ:Dostojewskij/ਯੋਗਦਾਨ]] [[ceb:Gumagamit:Dostojewskij/Mga tampo]] [[hi:सदस्य:Dostojewskij/योगदान]] [[fi:Käyttäjä:Dostojewskij/Muokkaukset]] [[uz:Foydalanuvchi:Dostojewskij/Hissam]] [[ms:Pengguna:Dostojewskij/Sumbangan]] [[bcl:Paragamit:Dostojewskij/Mga ambag]] [[pam:User:Dostojewskij/Deng ambag]] [[la:Usor:Dostojewskij/Conlationes]] [[sat:ᱵᱮᱵᱷᱟᱨᱤᱭᱟᱹ:Dostojewskij/ᱮᱱᱮᱢᱠᱩ]] [[nn:Brukar:Dostojewskij/Bidrag]] [[fa:کاربر:Dostojewskij/مشارکت‌ها]] [[sh:Korisnik:Dostojewskij/Doprinos]] [[bs:Korisnik:Dostojewskij/Doprinosi]] [[vi:Thành viên:Dostojewskij/Đóng góp]] [[tg:Корбар:Dostojewskij/Ҳисса]] [[sq:Përdoruesi:Dostojewskij/Kontributet]] [[cv:Хутшăнакан:Dostojewskij/Хывнӑ тӳпе]] [[tl:Tagagamit:Dostojewskij/Mga ambag ko]] [[te:వాడుకరి:Dostojewskij/నా మార్పులు]] [[simple:User:Dostojewskij/My changes]] [[mr:सदस्य:Dostojewskij/माझे योगदान]] [[af:Gebruiker:Dostojewskij/Bydraes]] [[so:User:Dostojewskij/Ku darsashooyinka]] [[yo:Oníṣe:Dostojewskij/Àwọn àfikún]] [[et:Kasutaja:Dostojewskij/Kaastöö]] [[war:Gumaramit:Dostojewskij/Akon mga ámot]] [[nds:Bruker:Dostojewskij/Mien Arbeid]] [[az:İstifadəçi:Dostojewskij/Töhfələrim]] [[sco:Uiser:Dostojewskij/Contreibutions]] [[sl:Uporabnik:Dostojewskij/Prispevki]] [[bar:Nutza:Dostojewskij/Mei Gschriebnas]] [[se:Geavaheaddji:Dostojewskij/Mu rievdadusat]] [[vec:Utensa:Dostojewskij/Contribusion]] [[eu:Lankide:Dostojewskij/Nire ekarpenak]] [[dty:प्रयोगकर्ता:Dostojewskij/मेरो योगदानहरू]] [[th:ผู้ใช้:Dostojewskij/ส่วนร่วม]] [[be-tarask:Удзельнік:Dostojewskij/Унёсак]] [[gl:Usuario:Dostojewskij/Contribucións]] [[hr:Suradnik:Dostojewskij/Doprinosi]] [[jv:Naraguna:Dostojewskij/Pasumbang]] [[ka:მომხმარებელი:Dostojewskij/წვლილი]] [[sc:Usuàriu:Dostojewskij/Contributos mios]] [[sah:Кыттааччы:Dostojewskij/Суруйуу тиһилигэ]] [[si:පරිශීලක:Dostojewskij/මගේ දායකත්වය]] [[kw:Devnydhyer:Dostojewskij/Kevrohow]] [[ln:Utilisateur:Dostojewskij/Nkásá nakomí]] [[ku:Bikarhêner:Dostojewskij/Beşdariyên min]] [[sw:Mtumiaji:Dostojewskij/Michango]] [[eo:Uzanto:Dostojewskij/Kontribuoj]] [[kaa:Paydalanıwshı:Dostojewskij/Úlesim]] [[ta:பயனர்:Dostojewskij/பங்களிப்புக்கள்]] [[sr:Корисник:Dostojewskij/Доприноси]] [[cy:Defnyddiwr:Dostojewskij/Fy nghyfraniadau]] [[lt:Naudotojas:Dostojewskij/Mano indėlis]] [[ga:Úsáideoir:Dostojewskij/Iarrachtaí]] [[el:Χρήστης:Dostojewskij/Η συνεισφορά μου]] [[hy:Մասնակից:Dostojewskij/Ներդրում]] [[hu:Szerkesztő:Dostojewskij/Közreműködések]] [[li:Gebroeker:Dostojewskij/Mien biedrages]] [[rue:Хоснователь:Dostojewskij/Приспівкы]] [[mhr:Пайдаланыше:Dostojewskij/Мыйын надырем]] [[an:Usuario:Dostojewskij/Contribucions]] [[co:Utente:Dostojewskij/E mo cuntribuzioni]] [[qu:Ruraq:Dostojewskij/Llamk'apusqaykuna]] [[vep:Kävutai:Dostojewskij/Tehtud rad]] [[lo:ຜູ້ໃຊ້:Dostojewskij/ປະກອບສ່ວນ]] [[lb:Benotzer:Dostojewskij/Kontributiounen]] [[olo:Käyttäi:Dostojewskij/Kohendukset]] [[gan:用戶:Dostojewskij/貢獻]] [[bh:प्रयोगकर्ता:Dostojewskij/योगदान]] [[ha:User:Dostojewskij/Gudummawa]] [[is:Notandi:Dostojewskij/Framlög]] [[io:Uzanto:Dostojewskij/Mea adportado]] [[os:Архайæг:Dostojewskij/Бавæрд]] [[su:Pamaké:Dostojewskij/Kontribusi kuring]] [[or:ବ୍ୟବହାରକାରୀ:Dostojewskij/ଅବଦାନ]] [[pdc:Yuuser:Dostojewskij/Mei Ardickele]] [[haw:Mea hoʻohana:Dostojewskij/He aha ka'u i lūlū ai]] [[hsb:Wužiwar:Dostojewskij/Přinoški]] [[km:អ្នកប្រើប្រាស់:Dostojewskij/ការរួមចំណែក]] 52uxa4e09ydvxsme9fp7qqe38y0g5d4 0 81269 888280 854139 2026-09-03T17:46:07Z Dostojewskij 12489 Kategori:Lanmò 2022 888280 wikitext text/x-wiki {{moun |non=Graziella Galvani |foto=Graziella_Galvani.png |tèks=Graziella Galvani |fonksyon=aktris |domèn=sinema |diplòm= |etid= |dat nesans=[[27 jen]] [[1931]] |lye nesans=[[Milan]] |peyi nesans=[[Itali]] |dat lanmò= |lye lanmò= |peyi lanmò= |nasyonalite=italyen |relijyon= |rezidans= |kontak= |Biyografi= |zèv= |omaj= |rekonpans= |remak= |fim= }} '''Graziella Galvani''', ki fèt [[27 jen]] [[1931]] nan [[Milan]] ([[Itali]]), se yon [[aktè|aktris]] [[Itali|italyèn]]. == Biyografi == == Zèv li yo (seleksyon) == * [[1960]] : ''[[Kapò]]'' * [[1961]] : ''[[Les Joyeux Fantômes]]'' * [[1964]] : ''[[Frénésie d'été]]'' de [[Luigi Zampa]] * [[1965]] : ''[[Pierrot le Fou]]'' de [[ Jean-Luc Godard]] * 1965 : ''[[Nick Carter et le trèfle rouge]]'' de [[ Jean-Paul Savignac]] * [[1969]] : ''[[Senza sapere niente di lei]]'' de [[ Luigi Comencini]] * [[1970]] : ''[[Lettera aperta a un giornale della sera]]'' de [[Francesco Maselli]] * [[1972]] : ''Fiorina la vacca'' * [[1973]] : ''[[Séduction (fim)|Séduction]]'' (''La seduzione'') de [[Fernando Di Leo]] * [[1974]] : ''[[I miracoli accadono ancora]]'' de [[Giuseppe Maria Scotese]] * [[1980]] : ''[[La Terrasse (fim, 1980)|La Terrasse]]'' * [[1990]] : ''Tre colonne in cronaca'' == Referans == {{referans}} == Lyen deyò == * [https://www.imdb.com/name/nm0303413 Graziella Galvani] sou IMDb * https://www.cinefil.com/star/graziella-galvani * https://www.themoviedb.org/person/12773-graziella-galvani?language=fr {{DEFAULTSORT:Galvani, Graziella}} [[Kategori:Moun]] [[Kategori:Fanm]] [[Kategori:Aktè]] [[Kategori:Aktè sinema]] [[Kategori:Aktè televizyon]] [[Kategori:Aktè italyen]] [[Kategori:Nesans nan lane 1931]] [[Kategori:Lanmò 2022]] o2atu540eoq6ekkf43rd8a8drfscqd8 0 94170 888281 868251 2026-09-03T17:52:17Z Dostojewskij 12489 + Kategori:Nesans nan lane 1855 + Kategori:Lanmò 1937 888281 wikitext text/x-wiki {{Infobox Biographie2|charte=}} '''Andrew William Mellon''', fèt 24 mas 1855 nan [[Pittsburgh, Pennsilvani|Pittsburgh]] ([[Pènsilvani|Pennsilvani]] ) e li te mouri 27 out 1937 nan [[Southampton, New York|Southampton]] ([[Nou Yòk (eta)|New York]]), se te yon [[Labank|bankye]] [[Etazini|ameriken]], [[Endistri|endistriyalis]], [[Filantwopi|filantwòp]], [[Koleksyonè zèv atizay|pèseptè atizay]] ak [[politisyen]]. Yon manb [[Pati repibliken (Etazini)|Pati Repibliken]] an, li te sèvi kòm Sekretè Trezò a ant [[1921 (almanak gregoryen)|1921]] ak [[1932 (almanak gregoryen)|1932]] nan administrasyon Prezidan Warren G. Harding, Calvin Coolidge ak Herbert Hoover, lè sa a Anbasadè Etazini nan Wayòm Ini a ant [[1932 (almanak gregoryen)|1932]] ak [[1933 (almanak gregoryen)|1933]]. == Biyografi == == Zèv == * Andre W. Mellon, ''Taksasyon : Biznis Pèp la'', Ayer Company, 1924 ( ISBN 978-0-405-05101-2 ) == Bibliyografi == * Romain Huret, Les millions de monsieur Mellon, Paris, La Découverte, 2023, 268 p. (ISBN 978-2-348-07594-0). == Gade tou == === Lyen ekstèn === {{Liens}} * [https://web.archive.org/web/20061127035203/http://www.mellon.org/about_foundation/history/andrew-w-mellon The Andrew W. Mellon - Mellon Foundation Biography by David Cannadine] * [http://www.mellon.org/ The Andrew W. Mellon Foundation] * [https://web.archive.org/web/20201223040533/http://www.taxhistory.org/thp/readings.nsf/0/1d6628f544d4a43c85256ee0004d414d?OpenDocument taxhistory.org] - an essay on Mellon's tax policies * [http://www.cato.org/pubs/tbb/tbb-0302-13.pdf Overview of Mellon Tax Cut Plans] {{pdf}} * [http://www.post-gazette.com/pg/07182/798280-28.stm Pittsburgh Post-Gazette article on history of the Mellons and Mellon Financial] * [http://www.post-gazette.com/businessnews/20030316mideast2.asp Pittsburgh Post-Gazette series on Mellon's involvement in the oil industry and mid-east oil] {{DEFAULTSORT:Mellon, Andrew}} [[Kategori:Atik Wikipedya avèk dosye otorite]] [[Kategori:Bankye ameriken]] [[Kategori:National Gallery of Art]] [[Kategori:Nesans nan lane 1855]] [[Kategori:Lanmò 1937]] fekarjdzc2gsa82dakfh81333cgfqc2 888282 888281 2026-09-03T17:54:59Z Dostojewskij 12489 Fichye:Secretary of the Treasury Mellon, seated at his desk, June 14, 1929.jpg 888282 wikitext text/x-wiki {{Infobox Biographie2|charte=}} [[Fichye:Secretary of the Treasury Mellon, seated at his desk, June 14, 1929.jpg|thumb|Andrew Mellon (1929)]] '''Andrew William Mellon''', fèt 24 mas 1855 nan [[Pittsburgh, Pennsilvani|Pittsburgh]] ([[Pènsilvani|Pennsilvani]] ) e li te mouri 27 out 1937 nan [[Southampton, New York|Southampton]] ([[Nou Yòk (eta)|New York]]), se te yon [[Labank|bankye]] [[Etazini|ameriken]], [[Endistri|endistriyalis]], [[Filantwopi|filantwòp]], [[Koleksyonè zèv atizay|pèseptè atizay]] ak [[politisyen]]. Yon manb [[Pati repibliken (Etazini)|Pati Repibliken]] an, li te sèvi kòm Sekretè Trezò a ant [[1921 (almanak gregoryen)|1921]] ak [[1932 (almanak gregoryen)|1932]] nan administrasyon Prezidan Warren G. Harding, Calvin Coolidge ak Herbert Hoover, lè sa a Anbasadè Etazini nan Wayòm Ini a ant [[1932 (almanak gregoryen)|1932]] ak [[1933 (almanak gregoryen)|1933]]. == Biyografi == == Zèv == * Andre W. Mellon, ''Taksasyon : Biznis Pèp la'', Ayer Company, 1924 ( ISBN 978-0-405-05101-2 ) == Bibliyografi == * Romain Huret, Les millions de monsieur Mellon, Paris, La Découverte, 2023, 268 p. (ISBN 978-2-348-07594-0). == Gade tou == === Lyen ekstèn === {{Liens}} * [https://web.archive.org/web/20061127035203/http://www.mellon.org/about_foundation/history/andrew-w-mellon The Andrew W. Mellon - Mellon Foundation Biography by David Cannadine] * [http://www.mellon.org/ The Andrew W. Mellon Foundation] * [https://web.archive.org/web/20201223040533/http://www.taxhistory.org/thp/readings.nsf/0/1d6628f544d4a43c85256ee0004d414d?OpenDocument taxhistory.org] - an essay on Mellon's tax policies * [http://www.cato.org/pubs/tbb/tbb-0302-13.pdf Overview of Mellon Tax Cut Plans] {{pdf}} * [http://www.post-gazette.com/pg/07182/798280-28.stm Pittsburgh Post-Gazette article on history of the Mellons and Mellon Financial] * [http://www.post-gazette.com/businessnews/20030316mideast2.asp Pittsburgh Post-Gazette series on Mellon's involvement in the oil industry and mid-east oil] {{DEFAULTSORT:Mellon, Andrew}} [[Kategori:Atik Wikipedya avèk dosye otorite]] [[Kategori:Bankye ameriken]] [[Kategori:National Gallery of Art]] [[Kategori:Nesans nan lane 1855]] [[Kategori:Lanmò 1937]] jehsrw6lyoead0m0nr5pdps8x5vopj7 14 97827 888278 2026-09-03T17:33:32Z Dostojewskij 12489 Kreyasyon Kategori:Lanmò 1931 888278 wikitext text/x-wiki [[Kategori:1931]] p9avibnyg8z6fcmpcwmtghqspe0geex 828 97828 888283 2026-09-03T22:13:33Z Hamish 22687 [IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]] 888283 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