-- This has been bugging me since first I tried CTP2, the game picks a random civilization, and takes about 10x times the actual time other civilizations do to complete their turn... 
) ) once I get back ill report it 
-- This has been bugging me since first I tried CTP2, the game picks a random civilization, and takes about 10x times the actual time other civilizations do to complete their turn...
) )
Tweet
//----------------------------------------------------------------------------
//
// Name : sci_advancescreen_loadList
//
// Description: Generate the list of advances that may be researched next.
//
// Parameters : -
//
// Globals : g_player : list of players
// g_selected_item : determines currently active player
// g_theAdvanceDB : advance database
// g_theStringDB : language dependent text to display
// s_scienceGoalTree : list of advances that lead to the goal
//
// Returns : s_advanceList : filled with the generated list
// s_goaltext : set from current research goal
// s_sci_advanceScreen : redrawn
// s_scienceGoalTree : created (empty) when not existing yet
//
// Remark(s) : -
//
//----------------------------------------------------------------------------
sint32 sci_advancescreen_loadList( void )
{
Player *p = g_player[g_selected_item->GetVisiblePlayer()];
MBCHAR str[_MAX_PATH];
if(!s_scienceGoalTree)
{
s_scienceGoalTree = new bool[g_theAdvanceDB->NumRecords()];
}
memset(s_scienceGoalTree,0,sizeof(bool)*g_theAdvanceDB->NumRecords());
if(p->m_researchGoal >= 0)
{
sci_advancescreen_fillgoalarray(p->m_researchGoal);
sprintf(str,"%s %s",g_theStringDB->GetNameStr("str_ldl_ResearchGoal"),
g_theAdvanceDB->Get(p->m_researchGoal)->GetNameText());
}
else
{
sprintf(str,"%s",g_theStringDB->GetNameStr("str_ldl_ResearchGoal"));
}
s_goaltext->SetText(str);
if (!s_advanceList) return 0;
ctp2_ListItem *item = NULL;
ctp2_Static *child = NULL;
s_advanceList->Clear();
uint8 * advances = p->m_advances->CanResearch();
sint32 const advanceCount = g_theAdvanceDB->NumRecords();
sint32 curItemIndex = 0;
for (sint32 i = 0; i < advanceCount; ++i)
{
if( advances[i] ) {
if(s_scienceGoalTree[i])
{
sprintf( str, "%s*", g_theStringDB->GetNameStr(g_theAdvanceDB->Get(i)->m_name) );
}
else
{
sprintf( str, "%s", g_theStringDB->GetNameStr(g_theAdvanceDB->Get(i)->m_name) );
}
item = (ctp2_ListItem *)aui_Ldl::BuildHierarchyFromRoot("SciListItem");
child = (ctp2_Static *)item->GetChildByIndex(0);
if(child)
{
child->SetText(str);
}
item->SetUserData((void*)i);
item->SetCompareCallback(ScienceSortCallback);
s_advanceList->AddItem( item );
curItemIndex++;
}
}
delete advances;
s_advanceList->SortByColumn(0,TRUE);
// Find the current research in the sorted list.
// If not found, index 0 (the cheapest) will be selected.
sint32 const research = p->m_advances->GetResearching();
bool isIndexOk = false;
for (sint32 index = curItemIndex - 1; (index >= 0) && !isIndexOk; --index)
{
s_advanceList->SelectItem(index);
ctp2_ListItem * item =
reinterpret_cast(s_advanceList->GetSelectedItem());
isIndexOk = (research == reinterpret_cast(item->GetUserData()));
}
s_sci_advanceScreen->ShouldDraw(TRUE);
return 0;
}
) ) once I get back ill report it
ADVANCE_CHOICES_MIN 4 ADVANCE_CHOICES_MAX 6
void Advances::ResetCanResearch(sint32 justGot)
[i]...some code...[/i]
if(num > g_theConstDB->AdvanceChoicesMin()) {
sint32 howMany = g_rand->Next(g_theConstDB->AdvanceChoicesMax() -
g_theConstDB->AdvanceChoicesMin()) +
g_theConstDB->AdvanceChoicesMin();
while(num > howMany) {
sint32 origNum = num;
sint32 which = g_rand->Next(num);
sint32 found = 0;
for(i = 0; i < m_size; i++) {
if(m_canResearch[i]) {
if(found == which) {
m_canResearch[i] = FALSE;
num--;
break;
}
found++;
}
}
Assert(num != origNum);
if(num == origNum)
break;
}
}
if(m_theLastAdvanceEnabledThisManyAdvances <= 4) {
for(i = 0; i < m_size; i++) {
if(!m_hasAdvance[i] && !m_canResearch[i]) {
if(g_theAdvanceDB->RequiresProbeRecovery(i) &&
!g_player[m_owner]->m_hasRecoveredProbe) {
continue;
}
const AdvanceRecord *rec = g_theAdvanceDB->Get(i);
BOOL justEnabled = FALSE;
BOOL canResearch = TRUE;
for(sint32 prereq = 0; prereq < rec->m_nPrereq; prereq++) {
if(!m_hasAdvance[rec->m_prereq[prereq]]) {
canResearch = FALSE;
break;
}
if(rec->m_prereq[prereq] == justGot) {
justEnabled = TRUE;
}
}
void Advances::ResetCanResearch(sint32 justGot) [i]...some code...[/i] if(m_theLastAdvanceEnabledThisManyAdvances <= 4)
Comment