diff options
Diffstat (limited to 'challenge-307/roger-bell-west/lua/ch-1.lua')
| -rwxr-xr-x | challenge-307/roger-bell-west/lua/ch-1.lua | 64 |
1 files changed, 64 insertions, 0 deletions
diff --git a/challenge-307/roger-bell-west/lua/ch-1.lua b/challenge-307/roger-bell-west/lua/ch-1.lua new file mode 100755 index 0000000000..69a8f1f295 --- /dev/null +++ b/challenge-307/roger-bell-west/lua/ch-1.lua @@ -0,0 +1,64 @@ +#! /usr/bin/lua + +-- by Michael Anderson at +-- https://stackoverflow.com/questions/8722620/comparing-two-index-tables-by-index-value-in-lua +-- modified by Roger +function recursive_compare(t1,t2) + -- Use usual comparison first. + if t1==t2 then return true end + -- We only support non-default behavior for tables + if (type(t1)~="table") then return false end + -- They better have the same metatables + local mt1 = getmetatable(t1) + local mt2 = getmetatable(t2) + if( not recursive_compare(mt1,mt2) ) then return false end + -- Build list of all keys + local kk = {} + for k1, _ in pairs(t1) do + kk[k1] = true + end + for k2, _ in pairs(t2) do + kk[k2] = true + end + -- Check each key that exists in at least one table + for _, k in ipairs(kk) do + if (not recursive_compare(t1[k], t2[k])) then + return false + end + end + return true +end + +function checkorder(a) + local b = a + table.sort(b, function (i, j) return i < j end) + local out = {} + for i = 1, #a do + if a[i] ~= b[i] then + table.insert(out, i) + end + end + return out +end + +if recursive_compare(checkorder({5, 2, 4, 3, 1}), {0, 2, 3, 4}) then + io.write("Pass") +else + io.write("FAIL") +end +io.write(" ") + +if recursive_compare(checkorder({1, 2, 1, 1, 3}), {1, 3}) then + io.write("Pass") +else + io.write("FAIL") +end +io.write(" ") + +if recursive_compare(checkorder({3, 1, 3, 2, 3}), {0, 1, 3}) then + io.write("Pass") +else + io.write("FAIL") +end +print("") + |
