mirrors/hyperrogue
1
0
Fork 0
mirror of https://github.com/zenorogue/hyperrogue.git synced 2024-12-20 15:40:26 +00:00
Code Issues Releases Wiki Activity

expansion_analyzer::reduce_grouping now keeps the IDs even when new types arrive, and so that low numbers are in the center

Browse Source
This commit is contained in:
Zeno Rogue 2018-09-28 03:11:16 +02:00
parent acae962b13
commit e494fc4c10
1 changed files with 16 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
expansion.cpp
View File

@ -180,8 +180,23 @@ void expansion_analyzer::reduce_grouping() {
nogroups = newgroups; nogroups = newgroups;
} }
vector<int> groupsample(nogroups); vector<int> groupsample(nogroups, -1);
for(int i=0; i<N; i++) {
int& g = groupsample[grouping[i]];
if(g == -1) g = i;
}
vector<int> reorder(nogroups);
for(int i=0; i<nogroups; i++) reorder[i] = i;
sort(reorder.begin(), reorder.end(), [&] (int i, int j) { return groupsample[i] < groupsample[j]; });
vector<int> inv_reorder(nogroups);
for(int i=0; i<nogroups; i++) inv_reorder[reorder[i]] = i;
for(int i=0; i<N; i++) grouping[i] = inv_reorder[grouping[i]];
for(int i=0; i<N; i++) groupsample[grouping[i]] = i; for(int i=0; i<N; i++) groupsample[grouping[i]] = i;
vector<vector<int>> newchildren(nogroups); vector<vector<int>> newchildren(nogroups);
for(int i=0; i<nogroups; i++) for(int i=0; i<nogroups; i++)
for(int j: children[groupsample[i]]) for(int j: children[groupsample[i]])