How about something like this:
function f(a, b, vararg, kwarg)
{
writefln("a = {}, b = {}", a, b)
for(i: 0 .. #vararg)
writefln("vararg[{}] = {}", i, vararg[i])
foreach(k, v; kwarg)
writefln("kwarg[{}] = {}", k, v)
}
f(1, 2, 3, x: 4, y: 5)
Which would output something like:
a = 1, b = 2
vararg[0] = 3
kwarg[x] = 4
kwarg[y] = 5
?
I like it, and I wonder if it would be possible to somehow "accelerate" the keyword args by putting restrictions on what you can do with it. Like make it not an actual table but a pseudo-table where you can index it, index-assign it, forward it, foreach over it, # it, but it's not a real table object. This way the interpreter could use a faster implementation than creating a new table object upon every call to a kwarg function.
