How would I sort a table numerically while keeping a string value attached to it?
I am making a highscore board that will display your ranking. The current code creates a table of all the scores(which are stored in a group filled with int values, the value being the score, and the name of the value being the already defined player name) , and then sorts the scores from greatest to least. However, I also need the name of the player to go along with the scores.
Basically, how would I sort the table while keeping the names defined so I can put it next to their score? The actual player name is stored in v.Name (Which I put a comment in there for) I just need to figure out how to take that name and display it with the rest of them.
01 | local values = {} |
02 | for _, v in pairs(PlayerNames:GetChildren()) do |
03 | --v.Name is where the string is stored! |
04 | table.insert(values, v.Value) |
05 | end |
06 | table.sort(values, function(a, b)--Sort the numbers |
07 | return (a > b) |
08 | end) |
09 | place=0 |
10 | for index, value in ipairs(values) do--Creates a new frame that contains the player score |
11 | place=place+1 |
12 | local FrameC=HighscoreScr.Frame1:clone() |
13 | FrameC.Parent=HSFrame |
14 | --FrameC.ImageLabel.PlayerText=PLAYERNAME I NEED TO FIND! |
15 | FrameC.Damage.Text=value |
16 | FrameC.Visible=true |
17 | FrameC.Place.Text=place |
18 | end |
19 | print("Number of Scores: "..(#values)) |
20 | HSFrame.Visible=true |
2 answers
table.sort can compare arbitrary things with the comparator function. You simply want to be comparing based on .Value:
1 | local values = PlayerNames:GetChildren() |
2 | table.sort(values, function(a, b) |
3 | return a.Value > b.Value |
4 | end) |
You now have values the list of NumberValues, in descending order of their .Value.
You can get their scores as simply value.Value and their names as value.Name.
I would approach this problem differently I would completely ignore the use of table.sort and do something like
01 | local values = {} |
02 | for _, v in pairs(PlayerNames:GetChildren()) do |
03 | local index = #values+1 |
04 | for i = 1, #values do |
05 | if v.Value < values[i].Value then |
06 | index = i |
07 | break; |
08 | end |
09 | end |
10 | table.insert(values, index, {Name=v.Name, Value=v.Value}) |
11 | end |
12 | --[[Now to access the value, do |
13 | for i, v in ipairs(values) |
14 | v.Name is the name |
15 | v.Value is the value/score |
16 | ]] |
I'll just assume PlayerNames:GetChildren() is small (around 15 max), because this method of sorting is quite inefficient
0