Changes
better median handling
function wrap.median(args)
return p._median(unpackNumberArgs(args))
end
function p._median(args...) local vals = {} local count = 0 for k,v in pairsmakeArgArray(args) do if v == string.match(v,'(%d+)') then table.insert(vals,v.) local count = count+1 end end#vals table.sort(vals,function(a,b) return tonumber(a) < tonumber(b) end) -- force number sort if count/2 == mathp.ceil_mod(count/, 2) == 0 then
return (vals[count/2] + vals[count/2+1])/2
else
return vals[math.ceil(count/2)+1];
end
end