Wikipedia frrwiki https://frr.wikipedia.org/wiki/Wikipedia:Hoodsid MediaWiki 1.47.0-wmf.18 first-letter Medium Spezial Diskussion Benutzer Benutzer Diskussion Wikipedia Wikipedia Diskussion Datei Datei Diskussion MediaWiki MediaWiki Diskussion Vorlage Vorlage Diskussion Hilfe Hilfe Diskussion Kategorie Kategorie Diskussion Seite Seite Diskussion Index Index Diskussion Text Text Diskussion TimedText TimedText talk Modul Modul Diskussion Veranstaltung Veranstaltung Diskussion Vorlage:Wechselkursdaten/EZB 10 4596 282679 282677 2026-09-03T18:07:40Z LkhBot 19237 Bot: Aktualisierung 282679 wikitext text/x-wiki <includeonly>{{#switch: {{{1|}}} |STAND=2026-09-03 |USD = 1.1615 |JPY = 181.21 |BGN = 1.9558 |CZK = 24.221 |DKK = 7.4746 |GBP = 0.86055 |HUF = 367.43 |PLN = 4.3265 |RON = 5.2534 |SEK = 11.1245 |CHF = 0.939 |ISK = 140.6 |NOK = 10.8063 |HRK = 7.5365 |RUB = 117.2010 |TRY = 56.1177 |AUD = 1.6147 |BRL = 5.8935 |CAD = 1.6019 |CNY = 7.8042 |HKD = 9.1078 |IDR = 20496.93 |ILS = 3.5069 |INR = 109.75 |KRW = 1576.49 |MXN = 19.7593 |MYR = 4.6942 |NZD = 1.978 |PHP = 72.605 |SGD = 1.4725 |THB = 38.312 |ZAR = 18.6273 |QUELLE=[http://www.ecb.europa.eu/stats/eurofxref/eurofxref-daily.xml EZB Euro foreign exchange reference rates] }}</includeonly><noinclude> Liefert den Gegenwert von 1 EUR in einer Fremdwährung. Datenquelle: http://www.ecb.int/stats/exchange/eurofxref/html/index.en.html [[Kategorie:Vorlage:Metadaten|Wechselkursdaten/EZB]] </noinclude> 3ant1c00spjouxjnjdu8sxuo10bhuxv Modul:TableTools 828 16283 282678 166515 2026-09-03T12:51:27Z Hamish 13785 Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]] 282678 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 E.GO Life 0 25139 282681 282669 2026-09-03T23:56:10Z InternetArchiveBot 15792 Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 282681 wikitext text/x-wiki {{sölring}} {{SEITENTITEL:e.GO Life}} {{Infobox PKW-Modell sölring | Marke = [[e.GO mobile]] | Modell = e.GO Life | Bild = E.Go Life Genf 2019 1Y7A5161.jpg | Bild zeigt = E.Go Life ön Genf, 2019 | von = Marts 2019 (fuarsen) | ab = ??? | bis = | Klasse = M1 (Mal Litj Wain) | Versionen = [[Kombi]] | Motoren = [[Elektromaskiin]]:<br />20–60&nbsp;kW | Länge = 3348 | Breite = 1700 | Höhe = 1567 | Radstand = 2200 | Leergewicht = 880 (e.Go Life 20) | Zulässiges Gewicht = 1.300 | Vorgänger = -- | Nachfolger = -- }} Di '''e.GO Life''' es en mal litj Elektroauto fan di [[E.GO_Mobile|e.GO Mobile AG]] ön [[Aachen]]. Di Wain ken sent di Maimuun fan 2017 fuarbistelt uur, fan 2019 ön skel em di uk fo.<ref>{{Internetquelle | url=https://www.youtube.com/watch?v=AALGlQcqCbQ&t=4m10s | titel=nextnews #23 - BMW i3 Akku Upgrade, e-Go Life Verzögerung, Tesla News | hrsg=nextmove | datum=2018-10-05 | zugriff=2018-10-06}}</ref> Dit Auto uur me trii Maskiinen önböören. Di litjest Versioon me 20 kW skel 15.900 € kosti, en diarfan giar tö Tiren jit di Preemie fan 4.000 € of, wat em fan di Regiaring fair, wan em en Elektroauto koopet.<ref name="AutoStraßenverkehr">{{Literatur| Autor=Axel Mörer-Funk | Titel=Angriff aufs Establishment | Sammelwerk=Auto Straßenverkehr | Band=19 | Nummer=2017 | Datum=2017-08-23 | Seiten=44–47}}</ref> == Histoorie == Kontoorsföörer es Günther Schuh, en Profesor bi di RWTH Aachen, diart al bi Streetscooter me grünjet en aarbert her. Di e.Go Life uur ön dit Campus fan di RWTH konstruiaret, en diar es Schuh Profesor fuar Produktsjoonssystematik. Jerst skul dit Auto bluat en lecht wain fuar senerlig kuurt Waien wiis, man da waar diar dach muar en Auto fan (Autoklas M1). Ön di Marts 2017 waar dit Auto bi di CeBiT ön Hannover üs klaar weeget.<ref name=":0">{{Literatur |Titel=Vorhang auf für das elektromobile Stadtauto „e.GO Life“ aus Aachen |Sammelwerk=Aachener Zeitung |Datum=2017-03-20 |Online=http://www.aachener-zeitung.de/news/wirtschaft/vorhang-auf-fuer-das-elektromobile-stadtauto-ego-life-aus-aachen-1.1582905 |Abruf=2017-04-14}}</ref><br> Ön di Aprilmuun fan 2017 waar bikeent, dat di Fabrik diar becht uur skel, hur Philips wesen wiar, en dit es ön di Uasten fan Aachen.<ref>{{Literatur |Autor=Alexander Barth |Titel=e.GO-Elektromobil wird künftig auf altem Philips-Gelände gebaut |Sammelwerk=Aachener Nachrichten |Datum=2017-04-25 |Online=http://www.aachener-nachrichten.de/lokales/region/ego-elektromobil-wird-kuenftig-auf-altem-philips-gelaende-gebaut-1.1609671 |Abruf=2017-04-27}}</ref> <br> Ön di Septembermuun waar sair, dat al 1.200 Mensken en e.Go Lifer bistelt her en di Wain me trii forskeligi Maskiinen ön di Somer fan 2018 kum skul.<br> Ön di juulimuun 2017 waar di jest Fabriik iipenmaaket.<ref>{{Internetquelle | url=https://ecomento.de/2018/07/13/e-go-mobile-eroeffnet-erste-elektroauto-fabrik-in-aachen-life-mover/ | titel=e.GO Mobile eröffnet erste Elektroauto-Fabrik | hrsg=ecomento.de | datum=2018-07-13 | zugriff=2018-07-13}}</ref> == Biskriiwing == Di e.GO Life es üs en Auto fuar di Stat of Taust Auto taacht. Öndrewen uur dit aur di Achterweelen, en diarbenen sen 2 plus 2 Seetplaatsen. Di e.Go Life 20 wecht lerig 880 kg. <gallery widths="200"> E.GO Life e.Mobility Day 2.jpg E.GO Life e.Mobility Day 6.jpg E.GO Life e.Mobility Day 7.jpg E.Go Life Prototyp Armaturenbrett.jpg|Klokenbuurt E.GO Life Concept Sport Genf 2019 1Y7A5868.jpg|e.GO Life Concept Sport </gallery> == Technik == Di e.GO Life skul me en 48-Volt-Öndreft fan Bosch laap, man nü uur dit üp Hoogvolt omprekelt, aurdat di Kunden dit hol wil.<ref>{{Literatur|Titel=Drei Modelle vorgestellt: Elektrokleinwagen e.Go erhöht die Spannung - Golem.de|Online=https://www.golem.de/news/drei-modelle-vorgestellt-elektrokleinwagen-e-go-erhoeht-die-spannung-1709-130141.html|Abruf=2017-10-02}}</ref><ref>{{Internetquelle|url=http://www.cleanelectric.de/ego/|titel=Podcast Episode 40: Exklusiv-Interview mit Prof. Dr. Schuh/CEO von e.GO - cleanelectric|zugriff=2017-10-02}} {{Webarchiv|url=http://www.cleanelectric.de/ego/ |wayback=20180814234055 |text=Archive copy |archiv-bot=2026-09-03 23:56:09 InternetArchiveBot }}</ref>. Fan Bosch kum di Elektromootor, di Baterii en di Stjüüring sa üs dit Display. Bosch wel uk di After-Sales-Service önber. Öngaawen fan e.Go mobile, Stant: 16. September 2017 bzw. Juni 2018: {| class="wikitable" style="text-align:center" ! !e.GO Life 20 !e.GO Life 40 !e.GO Life 60 |- ! style="text-align:left" |Becht fan: | colspan="3" |geplant ab März 2019 |- ! style="text-align:left" |Maskiinenaart: | colspan="3" |[[Elektromootor]] |- ! style="text-align:left" |Maskiinenkraft: | 20 kW (27 PS) | 40 kW (54 PS) | 60 kW (82 PS) |- ! style="text-align:left" |Gauer uur, 0–50 km/h: | 7,7 s | 4,7 s | 3,4 s |- ! style="text-align:left" |Gauer uur, 0–100 km/h: | 35,0 s | 12,0 s | 8,6 s |- ! style="text-align:left" |Hoogst Gauhair: | 116 km/h | 130 km/h | 152 km/h |- ! style="text-align:left" |Stroomkonsuum fuar 100 km<br>(eeđer WLTP) kombiniaret: | 9,9 kWh | 10,9 kWh | 11,1 kWh |- ! style="text-align:left" |Kapatsiteet Batterii: | 14,9&nbsp;kWh | 17,9&nbsp;kWh | 23,9&nbsp;kWh |- ! style="text-align:left" |Laapwai (NEFZ): | 121&nbsp;km | 142&nbsp;km | 184&nbsp;km |- ! style="text-align:left" |Laapwai Statforkiir: | 104&nbsp;km | 124&nbsp;km | 158&nbsp;km |- ! style="text-align:left" |Āpleeren waaret AC 2,3 kW 100 % (Schuko) |6,0&nbsp;h |7,5&nbsp;h |9,8&nbsp;h |- ! style="text-align:left" |Āpleeren waaret AC 3,6 kW 100 % (IEC 62196 / Typ 2) |3,1&nbsp;h |3,6&nbsp;h |4,6&nbsp;h |- ! style="text-align:left" |Āpleeren waaret DC bi 80 % (Combined Charging System, CCS) | -- | -- | -- |- ! style="text-align:left" |Wecht lerig: | 880 kg | 900 kg | 950 kg |} == Luki uk jir == {{Commonscat sölring}} * [https://web.archive.org/web/20180719060457/http://www.e-go-mobile.com/de/modelle/e.go-life e.GO Life] auf der Website der e.GO Mobile AG == Futnooten == <references /> [[Kategorie:Forkiir]] [[Kategorie:Straatenforkiir]] [[Kategorie:Elektroauto (Baterii)]] [[Kategorie:Projekt (RWTH)]] dscabl32xmzxbs3g5he3y9dhtp0trin Sono Sion 0 25145 282682 282672 2026-09-04T00:54:00Z InternetArchiveBot 15792 Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 282682 wikitext text/x-wiki {{sölring}} {{Infobox PKW-Modell sölring | Marke = Sono | Modell = Sion | Bild = Sono Sion 2017-08-18 1213.JPG|mini|Di Sono Sion iin ön dit Olympiastadion fan München | Bild zeigt = Di wit Proototyp fan di Sion uur weeget | Bezeichnung = | von = 2019 ön | bis = | Klasse = Kompaktklas | Versionen = Kombiwain | Motoren = Elektromaskiin:<br>80 kW / ~ 109 PS | Länge = 4110 | Breite = 1790 | Höhe = 1680 | Radstand = 2450 | Gewicht = 1400 | Vorgänger = -- | Nachfolger = Seerienvarianti }} Di '''Sono Sion''' es en [[Elektroauto]], wat [[Sono Motors]] forsprakt. Di Wain ken fan't Stroomnat sa üs uk fan ain Solaarpaneeli ön di Karoserii āpleeren uur. == Histoorie == Sent 2012 aarberi di Grünjliiers fan ön jaar Sion. Ön di Jaaren 2016 en 2017 kür aur Crowdfunding-Kampagnen muar üs 2 Milljoonen Euro fuar dit Omseeten en Proototypen saamlet uur.<ref>{{Internetquelle |autor=Indiegogo |url=https://www.indiegogo.com/projects/sion-a-solarcar-for-everyone-car-solar#/updates/all |titel=Sion. A Solarcar for everyone |zugriff=2017-10-17 |sprache=en}}</ref><ref>{{Internetquelle |autor=Seedrs |url=https://www.seedrs.com/sono-motors |titel=Develop, build & market an electric vehicle with novel drive, mobility and charging technologies |zugriff=2017-10-17 |sprache=en}}</ref> Ön di Juuli 2016 waar di Reekner-Skeltern fan di SION weeget. Sent August 2017 jeft et tau Proototypen fan di SION, wat bi Roding Automobile becht uuren sen. Ja skel sa temelk sa wiis üs di SION achterön becht uur.<ref>https://web.archive.org/web/20171017151113/http://www.roding-automobile.de/service/news/newsmeldung/article/sono-motors-praesentiert-funktionsprototypen-des-sion.html</ref> Dit Auto skel man jit forbeetert uur, bit dat dit becht uur. Di SION uur ön twelef Staten ön Euroopa tö Proof köört, en diarbi wel em di Failen ütfinj en eeđer di Kritiik fan di Liren hiir. Ön di Hārefst fan 2017 heer di Seerienaarber bigent. Di Crashtest skel 2019 maaket uur, en diarbi wel em hol fjuur Stiaren eeđer di NCAP Standard haa wel.<ref name=":3">{{Internetquelle |titel=Produkt-Update durch Sono Motors |url=https://m.facebook.com/sonomotors/photos/a.306946649502287.1073741828.306536122876673/667928873404061|werk=facebook.com|datum=2017-11-10|zugriff=2017-11-19|autor=goingelectric}}</ref> Seerienproduktsjoon en dit Forkoopin skel uk 2019 ön Gang kum.<ref>https://web.archive.org/web/20171017150858/https://ingenieurversteher.de/2017/09/15/sono-motors-definiert-mit-dem-sion-die-urbane-mobilitaet-neu-interview-2/</ref> 2017 sen hok Investooren tö Sono Motors kemen, sa üs di Grünjliier fan di ''Energiitiinstler Juwi'' en di ''Böllinger Gruppe''.<ref>{{Internetquelle |autor=gruenderszene.de |url=http://www.gruenderszene.de/allgemein/sion-sono-motors-testfahrt |titel=So fährt sich das Solarauto von Sono Motors |datum=2017-10-17 |zugriff=2017-10-18 }}</ref> Di 9.&nbsp;Mai 2018 waar bikeent dönen, dat di Bateriien fan ''Elring Klinger'' üt Dütsklön kum skel. Des Firma es bikeent fuar Dechtingen en jit hok Saaken, wat iin ön ark Auto set, en heer al Taachten fuar di Wanel tö't Elektroauto. Dit Voluumen fan di Kontrakt giar aur muar hönert Miljoonen Euro en lapt aur aacht Jaaren.<ref>{{Literatur |Titel=Sono Sion: Batterie-Großauftrag geht an ElringKlinger – ecomento.de |Sammelwerk=ecomento.de |Datum=2018-05-09 |Online=https://ecomento.de/2018/05/09/sono-motors-vergibt-batterie-grossauftrag-an-elringklinger/ |Abruf=2018-05-09}}</ref> Di 6.&nbsp;Juni 2018 jaav't Biskiir, dat di SION LED-Leechtern fo skel, wat bi des Klas fan Auto ek olter aaft fuarkumt. Uk des Lampen kum fan Dütsklön (Automotive Solutions Germany GmbH (ASG))<ref>{{Literatur |Titel=Sono Motors setzt beim Solarauto Sion auf neue LED-Scheinwerfer-Technologie |Sammelwerk=elektroauto-news.net |Datum=2018-06-06 |Online=https://www.elektroauto-news.net/2018/sono-motors-solarauto-sion-neue-led-scheinwerfer-technologie |Abruf=2018-06-06}}</ref> Di 14. Juni 2018 kām di 5.000. Reserviaring iin, en diarfan waar "green Leecht" fuar di Produktsjoon dönen.<ref>{{Literatur |Titel=Über ein Jahr vor Produktionsstart verbucht Sono Motors bereits mehr als 5.000 Reservierungen |Sammelwerk=presseportal.de |Datum=2018-06-14 |Online=https://www.presseportal.de/pm/127439/3970318 |Abruf=2018-06-14}}</ref> ==Model== Di SION es en Elektroauto, wat aur Steekdoos, Typ2, CCS en solaar aur ain Moduuli āpleeren uur ken. Di Stroom ken ek bluat iin ön di Baterii, di ken diar uk me bit tö 3,6 kW Giraatenkraft ütnomen uur (Bidirekstsjonaal). ==Öndreft== Di Maskiin es en Triiphāsen-Asynchroonmaskiin me 80 kW. Di Aarbers-Spaning es 400 V. Bi di Proototyp giar di Kraft ön di Achterweelen, üs em jert, skel di ön dit Seerienauto ön di Fuarderweelen gung. Di Gauhair skel ek aur 140&nbsp;km/h gung. ==Solaarmoduuli (''viSono'') == [[Datei:Sono Sion schwarz.jpg|mini|Di suurt Proototyp (13.&nbsp;Oktober 2017)]] Aural ön di Karoserii heer em mal efistienti Solaarmoduuli me monokristaliini Siliziumselen önbecht (Senerlig efitsient bi difuusi Leecht, ja skel bi Straalwinkeln bit dial tö 70<math>\mathrm{^\circ}</math> jit 100 % fan jaar Stroom maaki). Boowen ön di Moduuli es en Sküül fan [[Polycarbonāt]]. Di Moduuli deek 7,5&nbsp;m² fan dit Auto en skel 24 % Aarbersefekt haa (Dit es aur di Maaten gur). Di Kraft fan di Moduuli giar bit tö 1208&nbsp;Watt Peak (W<sub>p</sub>).<br> Bi Senskiin ön Mereleuroopa skel diarfan ön en gur Dai bit tö 30 km uur, ön't Merel aur't Jaar skel dit ark Dai ombi 10 km wiis. ==Ütstafiaring== SonoMotors wel bluat jen Produkt bech, en suurt Wain, wat fuar ark jen lik es. Plaats es diarbenen fuar 5 Mensken, di Seetplaatsen ber 45 cm Lucht fuar di Skolern, en ark giar omtöklapi. Bi di Plaats fuar di Köörer ken uk di Hoogdi forstellt uur.<br> Di Leerrüm heer 650 Liitern en ken üp 1.250 Liitern kum, wan di Achterseeten omliar uur. Di Airbag fuarn rochts (Of ön Engelön fuarn lefts) let höm ütmaaki, dat em diar en Dütjiseet haa ken. En Önhingerkupling bit 750 kg skel tö bistel wiis. [[Datei:Sono Sion - Probefahrt in Nürnberg (36857121392).jpg|mini|Proototyp fan benen (26. August 2017)]] ===Moos fuar gur Lucht (''breSono'')=== Di Lucht tö uuremi uur döör en Filter fan Moos blöögen. ===Dit Auto üs en Stroomlaager (''biSono'')=== Me di Änslüten skel em ek bluat di Bateriien āpleer, em ken diarme uk Stroom üt dit Auto fo, bit tö 230 Volt/16A = 3,6 kW Giraatenkraft.<ref name=":2" /> Me Typ2-Kaabel skel dit bit tö 11 kW Giraatenkraft of Stroom fuar en Elektroauto wiis.<br> Dir Leergiraat es diarfuar taacht, dat et uk Stroom iin ön't Stroomnat dö ken (Vehicle to Grid). === Werkstair (''reSono'') === Dit Hunbok fuar Werkstairen sa üs uk CAD-Daaten fuar 3D-Prenters en sok Maskiinen skel em me sin SION lizenzfrii fo. Sa ken em dit Auto fuar't olermiist salev ön Gang hual. <br> SonoMotors wel uk Videos produtsiari, wat forklaari, hur'ling em dit en des repariari ken, en sa skel em salev di Möögelkhair haa en becht wat iin, wan em dit ek tö en Werkstair dö wel. Des ken da uk diareeđer luki en Help fo.<ref>{{Internetquelle |autor=Sono Motors |url=https://sonomotors.com/de/sion.html#st-sono-repair |titel=Repair |zugriff=2017-10-17}}</ref> === Sharing (''goSono'') === Hoken en SION heer, di ken aur en App Stroom önber (Power sharing) of dat jen me langs köör ken (Ride sharing). Hi ken sin Wain uk forhüüri, wan hi salev ek diarme önerwai es (Car sharing). Diarfuar es bi di SION en Program iinprogramiaret.<ref>{{Internetquelle |autor=Sono Motors |url=https://sonomotors.com/de/gosono.html/ |titel=goSono |zugriff=2017-10-17 }}</ref> == Akku en Laapwai == Di Li-Ion-Akku (LiMn<sub>2</sub>O<sub>4</sub>) skel me Weeter köölet uur en en Kapatsiteet fan 35 bit 45&nbsp;kWh sa üs en Wecht fan ombi 250&nbsp;kg haa.<ref name=":2">{{Internetquelle |autor=Sono Motors |url=http://sonomotors.com/de/frequently-asked-questions.html/ |titel=Häufige Fragen (FAQ) zum Sion|zugriff=2017-10-17}}</ref> Der Sono Sion skel me sin Baterii 320&nbsp;km (NEFZ) laap, dit sen ombi 250&nbsp;km üp Straat. <br> Me dit Leergiraat iin ön dit Auto skel twesken 306 en 22 kW Leerkraft iin ön di Bateriien to fo wiis. == Luki uk jir == * [https://sonomotors.com/de/sion.html Webseite von Sono Motors] * [https://www.mdr.de/einfach-genial/video-143056_zc-ea06cead_zs-0170df17.html MDR-Doku über den Sion] * [https://www.goingelectric.de/wiki/Sono_Sion_Informationen_und_Presseberichte Sammlung von Veröffentlichungen über den Sion bei goingelectric] ==Futnooten== [[Kategorie:Straatenforkiir]] [[Kategorie:Elektroauto (Baterii)]] 3nkqpl1xawqz3mr4tbytzhdz3wvgiy2 Modul:Exponential search 828 55830 282680 2026-09-03T22:19:36Z Hamish 13785 [IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]] 282680 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