Wikipedia nds_nlwiki https://nds-nl.wikipedia.org/wiki/V%C3%B6%C3%A4rblad MediaWiki 1.47.0-wmf.18 first-letter Media Spesiaal Overleg Gebruker Overleg gebruker Wikipedia Overleg Wikipedia Bestaand Overleg bestaand MediaWiki Overleg MediaWiki Mal Overleg mal Hulpe Overleg hulpe Kategorie Overleg kategorie TimedText TimedText talk Module Overleg module Event Event talk 0 4563 333365 312073 2026-09-04T00:57:25Z InternetArchiveBot 23048 Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 333365 wikitext text/x-wiki [[Bestaand:Cacao-pod-k4636-14.jpg|thumb|250px|Vrizze kakoubonen in huur zoaddeus]] [[Bestaand:Chocolate.jpg|250px|thumb|Drij soorten sokkeloa]] '''Sokkeloa''' (ook wol: ''sokkeloat'') is n lekkernij, moakt van [[kakoupouder|kakou]] dij wonnen wordt oet [[kakouboon|kakoubonen]], de stain van de vrucht van de [[tropen|tropische]] boom ''Theobroma cacao''. Sokkeloa is ien de hiele wereld bie veulen liefd. Ien [[Nederlaand|Nedderlaand]] en [[België|Belgie]] is sokkeloa veur koop as flitter, moar t is ook verwaarkt ien produkten as [[bonbon]]s en [[koekien (eten)|koeksken]]. Ook is t lözze [[kakoupouder]] veur koop. Sokkeloa is ook een populair ingredient van veul soorten [[slik]]. == De smoak en effekten van sokkeloa == Sokkeloa vienden de meeste minsken huul lekker smoaken. De fiene woarworden bie t kaauwen van sokkeloa komt deurdat t [[smeltpunt|smìltimp]] wat leger ligt as de lieftìmpratuur, woardeur t ien revel smìlt. Sokkeloa is n vouernsmiddel dat bepaarkte hoeveulheden [[theobromine]], [[cafeïne|kafiine]] en [[tryptofaan]] bevat, stovven dij n effekt op de hazzens hebben kinnen. t Is anders n misverstaand dat sokkeloa versloavend wezen kin. De houveulheden van dizze stovven binnen noamelk zo leeg dat n gemiddeld persoon meer as 30 kilogram pure sokkeloa op ain dag zol mouten eten om ook moar t lichtste effekt te ondergoan. Onderzuik noar de populariteit van milksokkeloa, pure sokkeloa, witte sokkeloa en kakoupouder wees eer oet dat milksokkeloa t meest populaire soort sokkeloa is. Op boases van de versloavende waarken dij van kakou, dij de deur n aantel wetenskoppers verondersteld wuir, zol ter anders verwaacht worden dat pure sokkeloa t meest populair is, omdat doar n hogere hoeveulhaid kakou ien zit. Toch is de pure sokkeloa meesttieds t minst populair. n Overzichtsartikel over de ienvloed van de effekten van sokkeloa is ien maai [[2000]] publizeerd deur onderzuikers van de akademie van [[Bristol (stad)|Bristol]] ien t wetenskoppelke tiedschrift ''Pharmacology, Biochemistry and Behaviour''. == Leegsaksisch == * [[Drèents]]: ** ''sukelao'' ([[ZOZ]], [[Zuudwest-Drèents|ZWD]], [[Midden-Drèents|MD]], [[Veenkelonioals|VK]]) ** ''sukkelao'' (Noord-Drenthe, [[ZO]]) ** ''sukela'' (ZO, [[ZWZ]]) ** ''sukkela'' (ZO) ** ''sukerlao'' (ZW) * [[Graafschopper Platt]]: ''soekkelaa'' (Platduutse schriefwieze ''Sukkelaa'') * [[Grunnegs]]: ''sokkeloa(t)'', ''sukkeloa(t)'' * [[Veluws]]: ''sukelao'' *[[Sallaands]]: ''sukelao'' * [[Stellingwarfs]]: ''sukelao'' * [[Tweants]]: ''sokkelaa'' == Boetende hìnwiezen == * [https://web.archive.org/web/20061012174058/http://www.nutritionandmetabolism.com/content/pdf/1743-7075-3-2.pdf Sokkeloa en t tegengoan van kardiovaskulaire ziektes: een systematisch overzicht (Engels)] {{commons|Chocolate}} {{dia|Schreven ien t [[Westerkertaaiers]]}} [[Kategorie:Grunnegs artikel]] [[Kategorie:Slik]] a28i71dz3yaozvy9q5jubj8bqkefxqe 0 13089 333364 330488 2026-09-03T23:56:36Z InternetArchiveBot 23048 Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 333364 wikitext text/x-wiki [[Bestaand:President_Barack_Obama.jpg|thumb|200px|Barack Obama]] '''Barack Hussein Obama II''' ([[Honolulu]], [[Hawaii]], [[4 augustus]] [[1961]]) was n 44sten en eerstn [[Afrikaans-Amerikaans|Zwartn]] presideant van [[Verienigde Staoten van Amerika|Amerika]]. Tusken [[3 januwoari]] [[2005]] en [[16 november]] [[2008]] was hee lid van t Amerikaanse Senoat as ofveardiging van de stoat [[Illinois]]. Doarvuur was hee stoatssenator in de wetgeewnde vergaderige van denzelfdn stoat. Op [[20 jannewaori|20 januwoari]] [[2009]] wör hee offisjeel an enömn as presideant. Töt 2017 hef hee presideant ewest (met twee ambtstermienen), woarnoa hum [[Donald Trump]] opvolgde. == Leawnsloop == === Jeugd === Obama's vaar, Barack Obama Senior, was nen [[Luo (stamme)|Luo]] oet [[Kenia]]. Zien moo, Anne Dunham, köm oet de stoat [[Kansas]]. Disse beaide gungn oet mekoar in [[1964]] toen as Barack junior twee joar oold was. Zin moo hertrouwdn met nen [[Indonesië]]r den as in Hawaii studeerdn. In [[1967]] verhuusdn t gezin noar [[Jakarta]]. Hee gung dr noar ne [[Rooms-Katholieke Karke|Roomske]] skole, mear steund in eskreewn as [[Islam|Moslim]]. Toew at'e tiene was, gung hee wierumme noar Hawaii, en bie zinne grootooldn van zin moders kaante wonn. Töt [[1979]] gung hee hier noar de middelboare skole. Noa de middelboare skole verhuusdn hee noar [[Los Angeles]], woer as hee twee joar an t [[Occidental College]] studeerdn. Noa twee joar gung hee noar [[Niej-York]], woer as hee verdan studeerdn an de [[Columbia Universiteit]]. Hee studeerdn of in [[1983]] op [[politikologie]] en Boetnlaandse Betrekkingn. Noa zinne studie deed hee oonderzeukn bie de New York Public Interest Group. In [[1985]] verhuusdn hee noar [[Chicago]] woer as hee projektn deed in oarmere buurtn. In [[1988]] leut hee zik deupn in de [[United Church of Christ]] en gung hee hen rechtn studeerdn an de [[Harvard Universiteit]]. Hee haaldn t niejs toew as hee as eerstn zwartn ekeuzn wör as presideant van de Harvard Law Review. Zienen vicepresident was [[Joe Biden]]. Hee studeerdn in [[1991]] of [[met lof]], woernoa as hee wierumme köm noar [[Chicago]] en as [[advekoat|advokoat]] gung woarkn. Hee hef tusken 1993 en [[2004]] les egeewn an de universiteit van Chicago, terwiel as hee oonderwiel ook nog zelf advokoat was van 1992 töt 2002. In [[1989]] leardn hee [[Michelle Robinson]] kenn, woermet as hee trouwdn in [[1992]]. Ze kreegn twee dochters: ''Malia Ann'' (1998) en ''Natasha "Sasha" (2001).'' == Oetgoande verbeending == * [http://www.barackobama.com/ Barack Obama '08] * [https://web.archive.org/web/20080907154055/http://obama.senate.gov/ VS Senaat - Barack Obama] {{DEFAULTSORT:Obama, Barack}} [[Kategorie:Tweants artikel]] [[Kategorie:Verenigde Stoatn van Amerika]] [[Kategorie:Presideant]] o6zrrzqyefst5sn7gp1k12svgtiqx8b 828 21975 333361 302255 2026-09-03T13:03:06Z Hamish 20664 Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]] 333361 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 0 29818 333366 322474 2026-09-04T09:55:27Z Dousaer 17808 333366 wikitext text/x-wiki [[Bestaand:Villa de Bank with work by Melle Nieling (MoMA).jpg|alt=Kisten in ne künstruumte|duum|Eksposity in Villa de Bank (2018)]] '''Melle Nieling''' is een neaderlandske künstener, up-ewasken in [[Reurle|Röörle]] in de Achterhook. In 2017 is hee gelyk med syn bröör cum laude af-estudeerd van de [[AKI Artez]] in [[Eanske|Enske]].<ref>De Jong, M. (29 juni 2017). Broederliefde als experiement. Tubantia: Enschede.</ref> Hee wordden bekend döärdat hee by [[Villa de Bank]] in Enske har eksposeerd in samenwerking med ''the Museum of Modern Art'' in [[Niej-York|Ny-York]].<ref>[https://web.archive.org/web/20180826113614/https://artreview.eu/news/news_16_aug_2018_moma_to_start_new_collaborative_exhibition_project/ Art Review. (2018). MoMA to start new collaborative exhibition project.]</ref><ref>[https://villadebank.nl/exhibition/melle-june-nieling/ Villa de Bank. (2018). MoMA at the Bank Presents.]</ref> == Uutgoande verwiezingen == *[https://mellenieling.com Webstea van Melle Nieling] == Referensies == <references /> {{Dialekt|act}} [[Kategorie:Bieldend keunstenaor]] 9b6uxzj1bfa1r7jn12w7afx6yyrhmn6 0 35637 333362 333049 2026-09-03T15:18:33Z Amherst99 4723 /* */ 333362 wikitext text/x-wiki [[Bestaand:2017 Land Rover Range Rover Velar First Edition D3 3.0 Front.jpg|duum|[[Range Rover Velar]] Midsize SUV]] Een '''sport utility vehicle (SUV)''' is een soort [[auto]]. Kenmarken van SUV's bint daj der vaok wat hoger in zit, daj hoger op de weg staot en vaok [[vierwielaandrieving]] hebt. De traditionele SUV's weren vaok bouwd op 't onderstel van een [[pick-up]], maor een hoop moderne SUV’s maakt gebruuk van een personenauto-platform. SUV’s die niet op een pick-uponderstel bouwd bint, worden vaok ''crossovers'' neumd. De term "jeep" wör ook vaok gebruukt as term veur SUV. == Varianten == === Terreinwagens === Terreinwagens bint SUV's mit [[vierwielaandrieving]] specifiek veur [[off-road]]. === Mini SUV === Mini Suv's bint [[stadsauto]]'s die alleen uiterlijk SUV uut-ziet, veur relatief veel ruimte veur een kleine auto. Ze bint niet moakt veur off-road. Ze bint ook niet op 't onderstel van een [[pick-up]] bouwd. === Compact SUV === Compact SUV's bint relatief kleine SUV's die iets minder goed presteren off-road, ze bint veural geschikt om veel bagage te vervoeren. === Midsize SUV === Midsize SUV's presteren vaok iets beter off-road dan Compact SUV's, maar bint iets kleiner dan Fullsize SUV's === Fullsize SUV === Fullsize SUV's bint vaok zeer grote luxe SUV's die presteren vaok goed off-road presteren as op de weg. Ze hebben vaok krachtige motor's een zeer groot laadvermogen. === Crossover === Crossovers bint vaok Midsize SUV's die niet op 't onderstel van een [[pick-up]] bint bouwd, ze bint ook niet op off-road bouwd. 't bint vaok verhoogde auto's bouwd op 't onderstel as 't [[Volkswagen Group MLB Evo]] platform. [[Kategorie:Auto]] ayrlv84q41vboqegiezwcj1tyz367k9 828 35673 333363 2026-09-03T22:02:30Z Hamish 20664 [IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]] 333363 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