local export = {numbers = {}} local numbers = export.numbers numbers[1] = { cardinal = "ceddi", } numbers[2] = { cardinal = "dua", } numbers[8] = {...
for other purposes "ja", "th", } data.notranslit = <span class="searchmatch">list</span>_to_set{ "ams", "az", "bbc", "<span class="searchmatch">bug</span>", "cdo", "cia", "cjm", "cjy", "cmn", "cnp", "cpi"...
nil -- table.insert(args, 1, "he") -- shift manually to avoid strange <span class="searchmatch">bugs</span>: args[4] = args[3] args[3] = args[2] args[2] = args[1] args[1] = "he"...
other purposes "ja", "th", } data.notranslit = { "ams", "az", "bbc", "<span class="searchmatch">bug</span>", "cia", "cjm", "cmn", "hak", "ja", "kzg", "lad", "lzh", "ms", ...
Thanks to [[User:JeffDoozan]] for this <span class="searchmatch">bug</span> fix. if base.refl then for _, persnum in ipairs(person_<span class="searchmatch">number</span>_<span class="searchmatch">list</span>_basic) do addit("gerund_" .. persnum...
purposes "ja", "th", } data.notranslit = set{ "ams", "az", "bbc", "<span class="searchmatch">bug</span>", "cia", "cjm", "cmn", "cpi", "hak", "ja", "kzg", "lad", "lzh",...
are tracked by [[Wiktionary:Tracking/languages/module_override]]. '''Known <span class="searchmatch">bugs</span>''': * This function assumes {tr(s1) .. tr(s2) == tr(s1 .. s2)}. When this...
string_sort fixes a <span class="searchmatch">bug</span> in < whereby all codepoints above U+FFFF are treated as equal. return string_sort(key1, key2) end --[==[ Return a <span class="searchmatch">list</span> of the keys...
Thanks to [[User:JeffDoozan]] for this <span class="searchmatch">bug</span> fix. if base.refl then for _, persnum in ipairs(person_<span class="searchmatch">number</span>_<span class="searchmatch">list</span>) do addit("gerund_" .. persnum, stems...
both (<span class="searchmatch">listing</span> animate first in the headword), ia = both (<span class="searchmatch">listing</span> inanimate first in the headword), otherwise inanimate) n: <span class="searchmatch">number</span> restriction...