Need help with a math function

[Mayron]

Hi,

I need to compare a number with a list of numbers and work out which one of the numbers in the list is closest to the one I want to compare. If there are two numbers that have the same amount of difference then pick the higher number. All numbers in this list will be unique.

Is there a function that can help me? I need recommendations on what to use or some help as I'm not brilliant with programming.

Basically I have this:
currentIndex = GetCurrentResolution()

and I need to compare the currentIndex with a list of numbers {7, 11, 12, 13, 15, 16}

Thank you for reading!

[Resike]

Why do you exactly need this?

[Malsomnus]

Looks pretty straightforward algorithm to me... go over the list, compare the numbers, save the best fit

[Mayron]

Originally Posted by Malsomnus Looks pretty straightforward algorithm to me... go over the list, compare the numbers, save the best fit

Is there some sort of function I could use to see if one number is closer to a number than another number?
Probably does not help that I have a massive head ache at the moment lol

EDIT: Thank you Resike! I will try using that

EDIT2: No that does not work Resike. Will look into another solution

[Seerah]

If this were me, I would just put the resolutions in a dropdown menu.

[Mayron]

Originally Posted by Seerah If this were me, I would just put the resolutions in a dropdown menu.

Well sadly I'm not you. I'm not that advanced with Lua yet haha. Otherwise yes that would solve everything but the way my addon works. Not sure how I would add a drop down box onto the artwork.

[Mayron]

Originally Posted by Resike Why do you exactly need this?

So that it finds your current resolution and sees whether it is in the list of resolutions that the UI supports and if not then it picks the closest resolution to yours and sets the UI up accordingly. So that it may only need slightly adjusting.

[Resike]

local math = math
 
local x = 14
local y = {7, 11, 12, 13, 15, 16}
 
function ReturnStuff(n, t)
    local closest = t[#t]
    local closestId
    for i = 1, #t do
        if closest >= math.abs(t[i] - n) then
            closest = math.abs(t[i] - n)
            closestId = i
        end
    end
    return t[closestId]
end
 
print(ReturnStuff(x, y))

Edit: Try this.

[Mayron]

Originally Posted by Resike --Code Edit: Try this.

Thank you very much for your work! That works perfectly Really appreciate your help!

[Vrul]

Originally Posted by Mayron Thank you very much for your work! That works perfectly Really appreciate your help!

Actually that code has errors in it. Other than the obvious, it assumes that the array you are passing in is sorted which was never a stated condition. This will fix the errors as well as that assumption:

local math_abs = math.abs

local resArray = { 7, 11, 12, 13, 15, 16 }
local resIndex = GetCurrentResolution()

local function GetClosestNumber(num, array)
    local id = 1
    local closest = math_abs(array[id] - num)
    for index = 2, #array do
        local delta = math_abs(array[index] - num)
        if delta < closest or (closest == delta and array[index] > array[id]) then
            closest, id = delta, index
        end
    end
    return array[id]
end

print(GetClosestNumber(resIndex, resArray))

If the array will always be pre-sorted then this is what you want:

local function GetClosestMatch(num, array)
    local id = 1
    local closest = math_abs(array[id] - num)
    for index = 2, #array do
        local delta = math_abs(array[index] - num)
        if delta < closest then
            closest, id = delta, index
        elseif delta == 0 or closest == delta then
            id = index
            break
        else
            break
        end
    end
    return array[id]
end

[Lombra]

I meant the bit about the assumption that the array is sorted. I don't see anything here that the sorting of the array would have any impact on:

local math = math
 
local x = 14
local y = {7, 11, 12, 13, 15, 16}
 
function ReturnStuff(n, t)
    local closest = t[#t]
    local closestId
    for i = 1, #t do
        if closest >= math.abs(t[i] - n) then
            closest = math.abs(t[i] - n)
            closestId = i
        end
    end
    return t[closestId]
end
 
print(ReturnStuff(x, y))

This is the snippet you were commenting, yes? Pretty sure that's how it looked when I first posted bar the table -> t.

[Vrul]

Originally Posted by Lombra I meant the bit about the assumption that the array is sorted. I don't see anything here that the sorting of the array would have any impact on:

Reverse the sample array and you will get 13 instead of 15, which is not the desired stated behavior.

Originally Posted by Lombra This is the snippet you were commenting, yes? Pretty sure that's how it looked when I first posted bar the table -> t.

The n was instead the variable x from outside the function, making the passed value to search for be ignored. Sure the code as posted worked but taking the function, the whole point of this thread, and pasting it into another addon would not work as intended.