ilikecats/stk-code_catmod
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Tweak the algorithm that chooses the number of rows in a ribbon, hopefully gives better results at high resolutions now in kart screen

Browse Source 
git-svn-id: svn+ssh://svn.code.sf.net/p/supertuxkart/code/main/trunk@8689 178a84e3-b1eb-0310-8ba1-8eac791a3b58
This commit is contained in:
auria 2011-05-24 00:41:07 +00:00
parent 8a00579b2a
commit edb21d16ce
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
data/gui/karts.stkgui
View File

@ -15,7 +15,7 @@
<box proportion="2" width="100%" layout="vertical-row">
<ribbon_grid id="karts" proportion="1" square_items="true" width="100%" align="center"
child_width="80" child_height="80" max_rows="3"/>
child_width="90" child_height="90" max_rows="3"/>
</box>
<!-- Groups will be added dynamically at runtime -->

4
src/guiengine/widgets/dynamic_ribbon_widget.cpp
View File

@ -226,9 +226,9 @@ void DynamicRibbonWidget::add()
// get a better score. A number of rows that allows showing very few items
// will be penalized. A configuration that makes items much smaller than
// requested in the XML file will also be penalized.
float ratio = (float)item_height / (float)m_child_height;
const int score = int(log(2.0f*visible_items) *
std::min((float)item_height / (float)m_child_height, 1.0f) *
taken_area);
std::min(ratio, 1.0f) * taken_area);
//std::cout << " " << row_count << " rows : " << visible_items << " visible items; area = "
// << taken_area << "; size penalty = " << std::min((float)item_height / (float)m_child_height, 1.0f)