eTeam Class Reference

#include <eTeam.h>

Inheritance diagram for eTeam:

[legend]

Collaboration diagram for eTeam:

[legend]

List of all members.

Public Member Functions
void	UpdateProperties ()
void	UpdateAppearance ()
void	Update ()
void	SetLocked (bool locked)
bool	IsLocked () const
void	Invite (ePlayerNetID *player)
void	UnInvite (ePlayerNetID *player)
bool	IsInvited (ePlayerNetID const *player) const
bool	NameTeamAfterColor (bool wish)
void	AddPlayer (ePlayerNetID *player)
void	AddPlayerDirty (ePlayerNetID *player)
void	RemovePlayer (ePlayerNetID *player)
virtual bool	PlayerMayJoin (const ePlayerNetID *player) const
void	Shuffle (int startID, int stopID)
	shuffles the player at team postion startID to stopID
virtual bool	BalanceThisTeam () const
virtual bool	IsHuman () const
int	TeamID (void) const
int	Score () const
void	AddScore (int s)
void	ResetScore ()
void	SetScore (int s)
void	AddScore (int points, const tOutput &reasonwin, const tOutput &reasonlose)
int	NumPlayers () const
ePlayerNetID *	Player (int i) const
std::vector< ePlayerNetID * >	GetAllMembers () const
int	NumHumanPlayers () const
int	NumAIPlayers () const
int	AlivePlayers () const
ePlayerNetID *	OldestPlayer () const
ePlayerNetID *	OldestHumanPlayer () const
ePlayerNetID *	OldestAIPlayer () const
ePlayerNetID *	YoungestPlayer () const
ePlayerNetID *	YoungestHumanPlayer () const
ePlayerNetID *	YoungestAIPlayer () const
bool	Alive () const
unsigned short	R () const
unsigned short	G () const
unsigned short	B () const
const tString &	Name () const
virtual void	PrintName (tString &s) const
virtual bool	ClearToTransmit (int user) const
virtual void	WriteSync (nMessage &m)
virtual void	ReadSync (nMessage &m)
virtual bool	SyncIsNew (nMessage &m)
virtual nDescriptor &	CreatorDescriptor () const
virtual void	WriteCreate (nMessage &m)
virtual void	ReceiveControlNet (nMessage &m)
virtual bool	AcceptClientSync () const
	eTeam ()
	eTeam (nMessage &m)
	~eTeam ()
Static Public Member Functions
static bool	Enemies (eTeam const *team, ePlayerNetID const *player)
	determines whether the player is an enemy of the team
static bool	Enemies (eTeam const *team1, eTeam const *team2)
	determines whether two teams are enemies
static void	Enforce (int minTeams, int maxTeams, int maxImbalance)
static void	EnforceConstraints ()
static void	SortByScore ()
static void	SwapTeamsNo (int a, int b)
static tString	Ranking (int MAX=6, bool cut=true)
static float	RankingGraph (float y, int MAX=6)
static bool	NewTeamAllowed ()
static void	SwapPlayers (ePlayerNetID *player1, ePlayerNetID *player2)
	swaps the team positions of the two players (same team or not)
Static Public Attributes
static int	minTeams = 0
static int	maxTeams = 30
static int	maxPlayers = 3
static int	minPlayers = 0
static int	maxImbalance = 2
static bool	balanceWithAIs = true
static bool	enforceRulesOnQuit = false
static tList< eTeam >	teams
Static Protected Member Functions
static void	UpdateStaticFlags ()
Protected Attributes
int	colorID
int	listID
int	score
int	numHumans
int	numAIs
tList< ePlayerNetID >	players
int	maxPlayersLocal
int	maxImbalanceLocal
unsigned short	r
unsigned short	g
unsigned short	b
tString	name
bool	locked_
	if set, only invited players may join
Private Member Functions
void	RemovePlayerDirty (ePlayerNetID *player)

---

Detailed Description

Definition at line 40 of file eTeam.h.

---

Constructor & Destructor Documentation

eTeam::eTeam

(

)

Definition at line 1329 of file eTeam.cpp.

References b, g, locked_, maxImbalance, maxImbalanceLocal, maxPlayers, maxPlayersLocal, r, score, and Update().

        :colorID(-1),listID(-1)
{
    score = 0;
    locked_ = false;
    maxPlayersLocal = maxPlayers;
    maxImbalanceLocal = maxImbalance;
    r = g = b = 32; // initialize color so it will be updated, guaranteed
    Update();
}

Here is the call graph for this function:

eTeam::eTeam

(

nMessage &

m

)

Definition at line 1342 of file eTeam.cpp.

References b, g, locked_, maxImbalance, maxImbalanceLocal, maxPlayers, maxPlayersLocal, r, score, and Update().

        :nNetObject( m ),
        colorID(-1),listID(-1)
{
    score = 0;
    locked_ = false;
    maxPlayersLocal = maxPlayers;
    maxImbalanceLocal = maxImbalance;
    r = g = b = 32; // initialize color so it will be updated, guaranteed
    Update();
}

Here is the call graph for this function:

eTeam::~eTeam

(

)

Definition at line 1355 of file eTeam.cpp.

References colorID, GrowingArrayBase::Len(), listID, tList< T, MALLOC, REFERENCE >::Remove(), se_PlayerNetIDs, and teams.

{
    if ( listID >= 0 )
        teams.Remove( this, listID );

    if ( colorID >= 0 )
    {
        se_ColoredTeams[ colorID ] = 0;
        colorID = -1;
    }

    // revoke all invitations
    for ( int i = se_PlayerNetIDs.Len()-1; i >= 0; --i )
    {
        se_PlayerNetIDs(i)->invitations_.erase( this );
    }
}

Here is the call graph for this function:

---

Member Function Documentation

void eTeam::UpdateStaticFlags

(

)

[static, protected]

Definition at line 128 of file eTeam.cpp.

References GrowingArrayBase::Len(), maxTeams, newTeamAllowed, se_newTeamAllowed, and teams.

{
    bool newTeamAllowedCurrent = teams.Len() >= maxTeams;

    if ( newTeamAllowedCurrent != newTeamAllowed )
    {
        se_newTeamAllowed.Set( newTeamAllowedCurrent );

        for (int i = teams.Len() - 1; i>=0; --i)
            teams(i)->Update();
    }
}

Here is the call graph for this function:

void eTeam::UpdateProperties

(

)

Definition at line 142 of file eTeam.cpp.

References GrowingArrayBase::Len(), maxImbalance, maxImbalanceLocal, maxPlayers, maxPlayersLocal, nCLIENT, nSERVER, numAIs, numHumans, players, nNetObject::RequestSync(), and sn_GetNetState().

Referenced by AddPlayer(), gAITeam::BalanceWithAIs(), Enforce(), RemovePlayer(), and Update().

{
    //  bool change = false;
    if ( nCLIENT != sn_GetNetState() )
    {
        //if ( maxPlayersLocal != maxPlayers )
        //{
        maxPlayersLocal = maxPlayers;
        //                      change = true;
        //}

        //if ( maxImbalanceLocal != maxImbalance )
        //{
        maxImbalanceLocal = maxImbalance;
        //                      change = true;
        //}

        //              if ( change )
        //              {
        //              }
    }

    numHumans = 0;
    numAIs = 0;
    int i;
    for ( i = players.Len()-1; i>=0; --i )
    {
        if ( players(i)->IsHuman() )
        {
            if ( players(i)->IsActive() )
                ++numHumans;
        }
        else
            ++numAIs;
    }

    if ( nSERVER == sn_GetNetState() )
        RequestSync();
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::UpdateAppearance

(

)

Definition at line 183 of file eTeam.cpp.

References ePlayerNetID::b, b, colorID, tColoredString::ColorString(), ePlayerNetID::g, g, ePlayerNetID::GetName(), ePlayerNetID::GetUserName(), ePlayerNetID::IsHuman(), tString::Len(), GrowingArrayBase::Len(), name, NameTeamAfterColor(), ePlayerNetID::nameTeamAfterMe, nCLIENT, nSERVER, OldestAIPlayer(), OldestHumanPlayer(), players, ePlayerNetID::r, r, nNetObject::RequestSync(), se_allowTeamNameColor, se_allowTeamNameLeader, se_allowTeamNamePlayer, se_team_rgb, tOutput::SetTemplateParameter(), sn_ConsoleOut(), sn_GetNetState(), and ePlayerNetID::teamname.

Referenced by AddPlayer(), and Update().

{
    unsigned short oldr = r, oldg = g, oldb = b;

    ePlayerNetID* oldest = OldestHumanPlayer();
    if ( !oldest )
    {
        oldest = OldestAIPlayer();
    }
    /* Logic:
          No more voting about teamnames.
          The teamname of the player who has been on the team for the longest time
          is used for a team!

          Color Teamname:
                -more than 1 player in the current team
                        -oldest player's custom teamname is empty
                        -if "Player Settings->Player 1->Name Team After Player" is off
          Custom Teamname:
                -oldest player's custom teamname is NOT empty
          Non-Color Teamname (e.g. "Player 1's Team"):
                -more than 1 player in the current team
                        -oldest/first player's custom teamname is empty
                        -if "Player Settings->Player 1->Name Team After Player" is on
    */
    bool nameTeamColor = players.Len() > 1 && (!oldest || oldest->teamname.Len()<=1 || !oldest->nameTeamAfterMe);

    //  if ( !IsHuman() )
    //          nameTeamColor = false;
    if ( !se_allowTeamNameColor )
        nameTeamColor = false;
    if ( !se_allowTeamNamePlayer )
        nameTeamColor = true;

    nameTeamColor = NameTeamAfterColor ( nameTeamColor );

    tString updateName;
    if ( oldest )
    {
        if ( nameTeamColor )
        {
            // team name determined by color
            tOutput newname;
            newname << &se_team_name[ colorID ][0];

            updateName = newname;

            r = se_team_rgb[colorID][0];
            g = se_team_rgb[colorID][1];
            b = se_team_rgb[colorID][2];
        }
        else
        {
            // let oldest own the team
            if ( players.Len() > 1 )
            {
                if ( oldest->IsHuman() )
                {
                    // did the player set a custom teamname ?
                    if (se_allowTeamNameLeader && oldest->teamname.Len()>1)
                    {
                        // Use player's custom teamname
                        updateName = oldest->teamname;
                    }
                    else
                    {
                        // name team after first/oldest player
                        tOutput newname;
                        newname.SetTemplateParameter( 1, oldest->GetName() );
                        newname << "$team_owned_by";
                        updateName = newname;
                    }
                }
                else
                {
                    // name team after oldest bot
                    tOutput newname;
                    newname.SetTemplateParameter( 1, oldest->GetName() );
                    newname << "$team_ai";
                    updateName = newname;
                }
            }
            else
            {
                // did the player set a custom teamname ?
                if (oldest->teamname.Len()>1)
                    // use custom teamname
                    updateName = oldest->teamname;
                else
                    // use player name as teamname
                    updateName = oldest->GetUserName();
            }

            r = oldest->r;
            g = oldest->g;
            b = oldest->b;

            // update colored player names
            if ( sn_GetNetState() != nSERVER )
            {
                for ( int i = players.Len()-1; i>=0; --i )
                {
                    players(i)->UpdateName();
                }
            }
        }
    }
    else
    {
        // empty team
        updateName = tOutput("$team_empty");
        r = g = b = 7;
    }

    // if the name has been changed then update it
    if (name!=updateName)
    {
        // only display a message if
        // the oldest player changed the name of the team
        // the server also sets the teamname sometimes
        if(sn_GetNetState()!=nCLIENT && oldest)
        {
            tOutput message;
            tColoredString name;
            name << *oldest;
            name << tColoredString::ColorString(1,1,1);
            message.SetTemplateParameter(1, name);

            tColoredString resetColor;
            resetColor << tColoredString::ColorString(r,g,b);
            resetColor << updateName;
            resetColor << tColoredString::ColorString(1,1,1);
            message.SetTemplateParameter(2, resetColor);
            message << "$team_renamed";
            sn_ConsoleOut(message);
        }
        name = updateName;
    }

    if ( nSERVER == sn_GetNetState() )
        RequestSync();

    // update team members if the color changed
    if ( oldr != r || oldg != g || oldb != b )
    {
        for ( int i = players.Len() - 1; i >= 0; --i )
        {
            players(i)->UpdateName();
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::Update

(

)

Definition at line 336 of file eTeam.cpp.

References UpdateAppearance(), and UpdateProperties().

Referenced by eTeam(), and init_game_objects().

{
    UpdateProperties();
    UpdateAppearance();
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::SetLocked

(

bool

locked

)

Definition at line 343 of file eTeam.cpp.

References locked_, Name(), and sn_ConsoleOut().

{
    if ( locked && !locked_ )
    {
        sn_ConsoleOut( tOutput( "$invite_team_locked", Name() ) );
    }
    if ( !locked && locked_ )
    {
        sn_ConsoleOut( tOutput( "$invite_team_unlocked", Name() ) );
    }

    locked_ = locked;
}

Here is the call graph for this function:

bool eTeam::IsLocked

(

)

const

Definition at line 358 of file eTeam.cpp.

References locked_.

Referenced by Enforce(), PlayerMayJoin(), se_ListTeam(), and se_ListTeams().

{
    return locked_;
}

Here is the caller graph for this function:

void eTeam::Invite

(

ePlayerNetID *

player

)

Definition at line 364 of file eTeam.cpp.

References ePlayerNetID::GetColoredName(), ePlayerNetID::invitations_, IsInvited(), Name(), sn_ConsoleOut(), and tASSERT.

{
    tASSERT( player );
    if ( !IsInvited( player ) )
    {
        sn_ConsoleOut( tOutput( "$invite_team_invite", player->GetColoredName(), Name() ) );
    }
    player->invitations_.insert( this );
}

Here is the call graph for this function:

void eTeam::UnInvite

(

ePlayerNetID *

player

)

Definition at line 375 of file eTeam.cpp.

References ePlayerNetID::CurrentTeam(), ePlayerNetID::GetColoredName(), ePlayerNetID::invitations_, Name(), ePlayerNetID::SetTeam(), sn_ConsoleOut(), and tASSERT.

{
    tASSERT( player );
    if ( player->CurrentTeam() == this )
    {
        sn_ConsoleOut( tOutput( "$invite_team_kick", player->GetColoredName(), Name() ) );
        player->SetTeam(0);
    }
    else
    {
        sn_ConsoleOut( tOutput( "$invite_team_uninvite", player->GetColoredName(), Name() ) );
    }
    player->invitations_.erase( this );
}

Here is the call graph for this function:

bool eTeam::IsInvited

(

ePlayerNetID const *

player

)

const

Definition at line 391 of file eTeam.cpp.

References ePlayerNetID::invitations_.

Referenced by Invite(), PlayerMayJoin(), and se_ChatTeam().

{
    return player->invitations_.find( const_cast< eTeam * >( this ) ) != player->invitations_.end();
}

Here is the caller graph for this function:

bool eTeam::Enemies	(	eTeam const *	team,
		ePlayerNetID const *	player
	)			[static]

determines whether the player is an enemy of the team

Parameters:

	team	the team to check
	player	the player to check

Returns:

true if the player has an enemy in the team

Definition at line 1384 of file eTeam.cpp.

References ePlayerNetID::CurrentTeam(), ePlayerNetID::Enemies(), GrowingArrayBase::Len(), and players.

Referenced by Enemies(), and sg_EnemyExists().

{
    // nonexistant parties can't be enemies
    if (!player || !team)
        return false;

    // check if the player is a team member
    if ( player->CurrentTeam() == team )
        return false;

    // check if the player has a team
    if ( !player->currentTeam )
        return false;

    // go through player list; the player is an enemy if he is at least enemy with one of the menbers
    for (int i = team->players.Len()-1; i>=0; --i)
        if ( ePlayerNetID::Enemies( team->players(i), player ) )
            return true;

    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool eTeam::Enemies	(	eTeam const *	team1,
		eTeam const *	team2
	)			[static]

determines whether two teams are enemies

Parameters:

	team1
	team2

Returns:

Definition at line 1418 of file eTeam.cpp.

References Enemies(), GrowingArrayBase::Len(), and players.

{
    // nonexistant parties can't be enemies
    if (!team1 || !team2 || team1 == team2)
        return false;

    // go through player list; if one is an enemy, so is the team
    for (int i = team2->players.Len()-1; i>=0; --i)
        if ( Enemies( team1, team2->players(i) ) )
            return true;

    return false;
}

Here is the call graph for this function:

void eTeam::Enforce	(	int	minTeams,
		int	maxTeams,
		int	maxImbalance
	)			[static]

Definition at line 630 of file eTeam.cpp.

References tList< T, MALLOC, REFERENCE >::Add(), ai, BalanceThisTeam(), IsLocked(), GrowingArrayBase::Len(), listID, max(), maxImbalanceLocal, maxPlayers, minPlayers, nCLIENT, NULL, NumHumanPlayers(), NumPlayers(), ePlayerNetID::SetTeamForce(), sn_GetNetState(), teams, tNEW, UpdateProperties(), ePlayerNetID::UpdateTeamForce(), and YoungestHumanPlayer().

Referenced by EnforceConstraints().

{
    if ( maxTeams < 1 )
        maxTeams = 1;

    /*
    // z-man: disabled for new "respect maxTeams and maxPlayers setting" logic
    if ( maxPlayers * maxTeams < se_PlayerNetIDs.Len() )
    {
        maxPlayers = ( se_PlayerNetIDs.Len()/maxTeams ) + 1;
    }
    */

    // nothing to be done on the clients
    if ( nCLIENT == sn_GetNetState() )
        return;

    if ( maxImbalance < 1 )
        maxImbalance = 1;

    if ( minTeams > maxTeams )
        minTeams = maxTeams;

    if ( minPlayers > maxPlayers )
        minPlayers = maxPlayers;

    bool balance = false;

    int giveUp = 10;
    while ( !balance && giveUp-- > 0 )
    {
        balance = true;

        // find the max and min number of players per team and the
        eTeam *max = NULL, *min = NULL, *ai = NULL;
        int    maxP = minPlayers, minP = 100000;
        bool minLocked = false;

        int numTeams = 0;
        int numHumanTeams = 0;

        int i;
        for ( i = teams.Len()-1; i>=0; --i )
        {
            eTeam *t = teams(i);

            if ( t->BalanceThisTeam() )
            {
                int humans = t->NumHumanPlayers();

                numTeams++;

                if ( humans > 0 )
                    numHumanTeams++;
                else
                    ai = t;

                if ( humans > maxP )
                {
                    maxP = humans;
                    max  = t;
                }

                // prefer unlocked teams as elimination victims, and of course smaller teams
                if ( ( humans > 0 || t->NumPlayers() == 0 ) && humans < minP && ( minLocked || !t->IsLocked() ) )
                {
                    minP = humans;
                    min  = t;
                    minLocked = t->IsLocked();
                }
            }
        }

        if ( ( numTeams > maxTeams && min ) || ( numTeams > minTeams && ai ) )
        {
            // too many teams. Destroy the smallest team.
            // better: destroy the AI team
            if ( ai )
                min = ai;

            for ( i = min->NumPlayers()-1; i>=0; --i )
            {
                // one player from the dismantled team.
                tJUST_CONTROLLED_PTR< ePlayerNetID > pni = min->Player(i);

                // just ignore AIs, they get removed later by the "balance with AIs" code once it notices all humans are gone from this team
                if ( !pni->IsHuman() )
                {
                    continue;
                }

                // find the second smallest team:
                eTeam* second = NULL;
                int secondMinP = maxPlayers; // the number of humans on that team
                for ( int j = teams.Len()-1; j>=0; --j )
                {
                    eTeam *t = teams(j);

                    if ( t->BalanceThisTeam() )
                    {
                        int humans = t->NumHumanPlayers();

                        if ( humans < secondMinP && t != min )
                        {
                            secondMinP = humans;
                            second = t;
                        }
                    }
                }

                if ( second )
                {
                    // put the player into the second smallest team, overriding balancing settings (they're likely to be in the way )
                    int imbBackup = second->maxImbalanceLocal;
                    second->maxImbalanceLocal = 99999;
                    pni->SetTeamForce( 0 );
                    pni->UpdateTeamForce();
                    pni->SetTeamForce( second );
                    pni->UpdateTeamForce();
                    second->maxImbalanceLocal = imbBackup;

                    balance = false;
                }
                else
                {
                    // no room, kick the player out
                    pni->SetTeamForce( NULL );
                    pni->UpdateTeamForce();

                    balance = false;
                }
            }
        }
        else if ( numTeams < minTeams )
        {
            // too few teams. Create a new one
            eTeam *newTeam = tNEW( eTeam );
            teams.Add( newTeam, newTeam->listID );
            newTeam->UpdateProperties();

            balance = false;
        }
        else if ( ( ( maxP - maxImbalance > minP || maxP > maxPlayers ) && minP < maxPlayers ) || ( minP == 0 && maxP > 1 ) )
        {
            // teams are unbalanced; move one player from the strongest team to the weakest
            if ( max )
            {
                ePlayerNetID* unluckyOne = max->YoungestHumanPlayer();
                unluckyOne->SetTeamForce( min );
                unluckyOne->UpdateTeamForce();
                balance = false;
            }
        }
        else if ( maxP > maxPlayers )
        {
            // teams too large. create a new team and put the last joiner of the strongest team in
            eTeam* newTeam = tNEW( eTeam );
            if ( max )
            {
                ePlayerNetID* unluckyOne = max->YoungestHumanPlayer();
                unluckyOne->SetTeamForce( newTeam );
                unluckyOne->UpdateTeamForce();

                balance = false;
            }
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::EnforceConstraints

(

)

[static]

Definition at line 614 of file eTeam.cpp.

References Enforce(), imbalance, maxImbalance, maxTeams, and minTeams.

Referenced by gAITeam::BalanceWithAIs().

{
    if ( maxImbalance < 1 )
        maxImbalance = 1;

    if ( minTeams > maxTeams )
        minTeams = maxTeams;

    Enforce( minTeams, maxTeams, maxImbalance );

    // reset imbalance count so players may try to switch teams in the next round
    if ( imbalance <= 0 )
        imbalance=0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::SortByScore

(

)

[static]

Definition at line 478 of file eTeam.cpp.

References GrowingArrayBase::Len(), SwapTeamsNo(), and teams.

Referenced by gGame::Analysis(), Ranking(), and RankingGraph().

                       {
    // bubble sort (AAARRGGH! but good for lists that change not much)

    bool inorder=false;
    while (!inorder){
        inorder=true;
        int i;
        for (i=teams.Len()-2;i>=0;i--)
            if (teams(i)->score < teams(i+1)->score){
                SwapTeamsNo(i,i+1);
                inorder=false;
            }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::SwapTeamsNo	(	int	a,
		int	b
	)			[static]

Definition at line 461 of file eTeam.cpp.

References GrowingArrayBase::Len(), listID, and teams.

Referenced by SortByScore().

                                  {
    if (0>a || teams.Len()<=a)
        return;
    if (0>b || teams.Len()<=b)
        return;
    if (a==b)
        return;

    eTeam *A=teams(a);
    eTeam *B=teams(b);

    teams(b)=A;
    teams(a)=B;
    A->listID=b;
    B->listID=a;
}

Here is the call graph for this function:

Here is the caller graph for this function:

tString eTeam::Ranking	(	int	MAX = 6,
		bool	cut = true
	)			[static]

Definition at line 493 of file eTeam.cpp.

References AlivePlayers(), ColorString(), GrowingArrayBase::Len(), max(), Name(), name, NumPlayers(), score, tColoredString::SetPos(), tString::SetPos(), SortByScore(), and teams.

Referenced by gGame::Analysis().

                                         {
    SortByScore();

    tString ret;

    if (teams.Len()>0){
        ret.SetPos(2, cut );
        ret << tOutput("$team_scoretable_name");
        ret.SetPos(25, cut );
        ret << tOutput("$team_scoretable_score");
        ret.SetPos(32, cut );
        ret << tOutput("$team_scoretable_members");
        ret.SetPos(41, cut );
        ret << tOutput("$team_scoretable_alive");
        ret << "\n";

        int max = teams.Len();
        if ( max > MAX && MAX > 0 )
        {
            max = MAX ;
        }
        for (int i=0;i<max;i++){
            tColoredString line;
            eTeam *t = teams(i);
            line << ColorString(t);
            tString name = t->Name();
            //name.RemoveHex();
            name.SetPos( 24, cut );

            line.SetPos(2, false );
            line << name;
            line.SetPos(25, false );
            line << t->score;
            line.SetPos(32, false );
            line << t->NumPlayers();
            line.SetPos(41, false);
            int alive=t->AlivePlayers();
            line << alive;
            ret << line << "\n";
        }
        if ( max < teams.Len() )
        {
            ret << " ...\n";
        }
    }
    // else
    //    ret << tOutput("$team_scoretable_nobody");
    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

float eTeam::RankingGraph	(	float	y,
		int	MAX = 6
	)			[static]

Definition at line 542 of file eTeam.cpp.

References AlivePlayers(), ColorString(), tColoredString::ColorString(), DisplayText(), GrowingArrayBase::Len(), max(), Name(), name, NumPlayers(), score, SortByScore(), sr_fontScoretable, and teams.

                                           {
    SortByScore();

    tColoredString ret;

    if (teams.Len()>0){
        tColoredString name;
        name << tColoredString::ColorString(1.,.5,.5)
        << tOutput("$team_scoretable_name");
        DisplayText(-.7, y, .06, name.c_str(), sr_fontScoretable, -1);
        tColoredString score;
        score << tOutput("$team_scoretable_score");
        DisplayText(-.3, y, .06, score.c_str(), sr_fontScoretable, -1);
        tColoredString members;
        members << tOutput("$team_scoretable_members");
        DisplayText(-.1, y, .06, members.c_str(), sr_fontScoretable, -1);
        tColoredString alive;
        alive << tOutput("$team_scoretable_alive");
        DisplayText(.3, y, .06, alive.c_str(), sr_fontScoretable, -1);
        y-=.06;

        int max = teams.Len();
        if ( max > MAX && MAX > 0 )
        {
            max = MAX ;
        }
        for(int i=0;i<max;i++){
            eTeam *t = teams(i);
            tColoredString name;
            name << ColorString(t) << t->Name();
            DisplayText(-.7, y, .06, name.c_str(), sr_fontScoretable, -1);
            tColoredString score;
            score << t->score;
            DisplayText(-.3, y, .06, score.c_str(), sr_fontScoretable, -1);
            tColoredString members;
            members << t->NumPlayers();
            DisplayText(-.1, y, .06, members.c_str(), sr_fontScoretable, -1);
            tColoredString alive;
            int alivep=t->AlivePlayers();
            if(alivep)
                alive << tColoredString::ColorString(0,1,0);
            else
                alive << tColoredString::ColorString(1,0,0);
            alive << alivep;
            DisplayText(.3, y, .06, alive.c_str(), sr_fontScoretable, -1);
            y-=.06;
        }
        if ( max < teams.Len() )
        {
            DisplayText(-.7, y, .06, "...", sr_fontScoretable, -1);
            y-=.06;
        }
    }
    return y;
}

Here is the call graph for this function:

bool eTeam::NameTeamAfterColor

(

bool

wish

)

Definition at line 804 of file eTeam.cpp.

References colorID, and TEAMCOLORS.

Referenced by UpdateAppearance().

{
    if ( wish && colorID < 0 )
    {
        for ( int i = 0; i < TEAMCOLORS; ++i )
        {
            if ( !se_ColoredTeams[i] )
            {
                se_ColoredTeams[i] = this;
                colorID = i;
                return true;
            }
        }
    }

    if ( !wish && colorID >= 0 )
    {
        se_ColoredTeams[ colorID ] = 0;
        colorID = -1;
    }

    return colorID >= 0;
}

Here is the caller graph for this function:

void eTeam::AddPlayer

(

ePlayerNetID *

player

)

Definition at line 829 of file eTeam.cpp.

References tList< T, MALLOC, REFERENCE >::Add(), colorID, tColoredString::ColorString(), IsHuman(), GrowingArrayBase::Len(), listID, Name(), nCLIENT, PlayerMayJoin(), players, sn_ConsoleOut(), sn_GetNetState(), tASSERT, ePlayerNetID::teamListID, teams, ePlayerNetID::timeJoinedTeam, tSysTimeFloat(), UpdateAppearance(), ePlayerNetID::UpdateName(), and UpdateProperties().

{
    tASSERT( player );

    tJUST_CONTROLLED_PTR< eTeam > keepalive( this );

    if ( ! PlayerMayJoin( player ) )
        return;

    tJUST_CONTROLLED_PTR< eTeam > oldTeam( player->currentTeam );
    tString oldTeamName("Old Team (BUG)");
    if ( player->currentTeam )
    {
        oldTeamName = oldTeam->Name();
        player->currentTeam->RemovePlayerDirty( player );
        oldTeam->UpdateProperties();
        oldTeam->UpdateAppearance();
    }

    players.Add( player, player->teamListID );
    // bool teamChange = player->currentTeam;
    player->currentTeam = this;
    player->timeJoinedTeam = tSysTimeFloat();

    UpdateProperties();

    // print the new entry
    if ( players.Len() <= 1 )
    {
        UpdateAppearance();

        /*
        // print creation message
        tOutput message;
        message.SetTemplateParameter(1, player->GetName() );
        message.SetTemplateParameter(2, Name() );
        message << "$player_creates_team";

        sn_ConsoleOut( message );
        */
    }

    // anounce joining if there are is more than one member now or if the team is color-named
    if ( sn_GetNetState() != nCLIENT )
    {
        // get colored player name
        tColoredString playerName;
        playerName << *player << tColoredString::ColorString(.5,1,.5);

        // tString playerNameNoColor = tColoredString::RemoveColors( player->GetName() );

        if ( ( players.Len() > 1 || colorID >= 0 ) && IsHuman() )
        {
            if ( oldTeam && oldTeam->players.Len() >= 1 )
            {
                sn_ConsoleOut( tOutput( "$player_changes_team",
                                        playerName,
                                        Name(),
                                        oldTeamName ) );
            }
            else
            {
                // print join message
                sn_ConsoleOut( tOutput( "$player_joins_team_start",
                                        playerName,
                                        Name() ) );
            }
        }
        else if ( oldTeam )
        {
            // or at least the leaving of the old team
            if ( oldTeam->players.Len() > 0 )
                sn_ConsoleOut( tOutput( "$player_leaves_team",
                                        playerName,
                                        oldTeamName ) );
        }
        else
        {
            // announce a generic join
            sn_ConsoleOut( tOutput( "$player_entered_game", playerName ) );
        }
    }

    if ( listID < 0 )
    {
        teams.Add ( this, listID );
    }

    player->UpdateName();
}

Here is the call graph for this function:

void eTeam::AddPlayerDirty

(

ePlayerNetID *

player

)

Definition at line 921 of file eTeam.cpp.

References tList< T, MALLOC, REFERENCE >::Add(), listID, players, tASSERT, ePlayerNetID::teamListID, teams, ePlayerNetID::timeJoinedTeam, tSysTimeFloat(), and ePlayerNetID::UpdateName().

{
    tASSERT( player );

    if ( player->currentTeam )
    {
        player->currentTeam->RemovePlayerDirty ( player );
    }

    players.Add( player, player->teamListID );
    player->currentTeam = player->nextTeam = this;
    player->timeJoinedTeam = tSysTimeFloat();

    if ( listID < 0 )
    {
        teams.Add ( this, listID );
    }

    player->UpdateName();
}

Here is the call graph for this function:

void eTeam::RemovePlayer

(

ePlayerNetID *

player

)

Definition at line 977 of file eTeam.cpp.

References colorID, tColoredString::ColorString(), enforceRulesOnQuit, imbalance, GrowingArrayBase::Len(), Name(), nCLIENT, players, RemovePlayerDirty(), sn_ConsoleOut(), sn_GetNetState(), nNetObject::tCONTROLLED_PTR(), ePlayerNetID::UpdateName(), and UpdateProperties().

{
    tCONTROLLED_PTR( eTeam ) safety;
    safety = this;                                              // avoid premature destruction of this team

    RemovePlayerDirty( player );

    player->UpdateName();

    // get colored player name
    tColoredString playerName;
    playerName << *player << tColoredString::ColorString(1,.5,.5);

    if ( sn_GetNetState() != nCLIENT )
    {
        if ( players.Len() > 0 || colorID >= 0  )
        {
            sn_ConsoleOut( tOutput( "$player_leaves_team",
                                    playerName,
                                    Name() ) );
        }
        else
        {
            // announce a generic leave
            sn_ConsoleOut( tOutput( "$player_leaving_game", playerName ) );
        }
    }

    UpdateProperties();

    // trigger enforcement of strong constraints on next balancing if the player is quitting
    if ( enforceRulesOnQuit && 0 == player->nextTeam && nCLIENT != sn_GetNetState() )
        imbalance = -10;
}

Here is the call graph for this function:

bool eTeam::PlayerMayJoin

(

const ePlayerNetID *

player

)

const [virtual]

Reimplemented in gAITeam.

Definition at line 1014 of file eTeam.cpp.

References BalanceThisTeam(), ePlayerNetID::CurrentTeam(), ePlayerNetID::GetSuspended(), ePlayerNetID::IsHuman(), IsInvited(), IsLocked(), GrowingArrayBase::Len(), maxImbalanceLocal, maxPlayers, maxPlayersLocal, minTeams, ePlayerNetID::NextTeam(), nSERVER, NumHumanPlayers(), numHumans, players, sn_GetNetState(), and teams.

Referenced by AddPlayer(), gMenuItemPlayer::Enter(), ePlayerNetID::FindDefaultTeam(), PrepareTeamText(), ePlayerNetID::SetTeam(), and ePlayerNetID::Update().

{
    // a player who is already on the team can "join" the team
    if (player->currentTeam==this)
        return true;

    // AI players are always allowed to join, the logic that tries to put the AI into
    // this team is responsible for checking
    if ( !player->IsHuman() )
        return true;

    // suspended players cannot join
    if ( player->GetSuspended() > 0 )
        return false;

    // check for invitations. Not with those shoes!
    if ( IsLocked() && !IsInvited( player ) )
    {
        return false;
    }

    int maxInb = maxImbalanceLocal;

    int minP = 10000; // minimum number of humans in a team after the player left
    if ( bool(player) && bool(player->currentTeam) )
    {
        minP = player->currentTeam->NumHumanPlayers() - 1;

        // allow leaving a team if it vanishes and the number of teams does not shrink below the minimum team count
        if ( minP == 0 && teams.Len() > minTeams )
            minP = 10000;
    }

    for ( int i = teams.Len()-1; i>=0; --i )
    {
        eTeam *t = teams(i);

        if ( t->BalanceThisTeam() )
        {
            int humans = t->NumHumanPlayers();

            if ( humans < minP )
            {
                minP = humans;
            }
        }
    }

    int maxPlayers = maxPlayersLocal;

    // we must have room           and the joining must not cause huge imbalance
    if ( numHumans < maxPlayers && ( sn_GetNetState() != nSERVER || minP + maxInb > numHumans ) )
        return true;

    // always allow circular swapping of players
    {
        std::set< eTeam const * > swapTargets; // teams players from this team want to swap into (recursively, if someone wants to swap to B and someone else from B wants to swap to C, C is on the list, too)
        swapTargets.insert( this );

        bool goon = true;
        while ( goon )
        {
            goon = false;
            for ( std::set< eTeam const * >::iterator iter = swapTargets.begin(); iter != swapTargets.end(); ++iter )
            {
                eTeam const * team = *iter;
                for ( int i = team->players.Len()-1; i>=0; --i )
                {
                    ePlayerNetID * otherPlayer = team->players(i);
                    eTeam * swapTeam = otherPlayer->NextTeam();
                    if ( swapTeam && swapTeam != otherPlayer->CurrentTeam() && swapTargets.find( swapTeam ) == swapTargets.end() )
                    {
                        goon = true;
                        swapTargets.insert( swapTeam );

                        // early return if we find a closed swap chain
                        if ( swapTeam == player->CurrentTeam() )
                            return true;
                    }
                }
            }
        }
    }

    // sorry, no way
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool eTeam::NewTeamAllowed

(

)

[static]

Definition at line 1104 of file eTeam.cpp.

References GrowingArrayBase::Len(), maxTeams, and teams.

Referenced by ePlayerNetID::CreateNewTeam(), ePlayerNetID::FindDefaultTeam(), and ePlayerNetID::SetDefaultTeam().

{
    return teams.Len() < maxTeams;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::SwapPlayers	(	ePlayerNetID *	player1,
		ePlayerNetID *	player2
	)			[static]

swaps the team positions of the two players (same team or not)

Parameters:

	player1	first player to swap positions
	player2	second player to swap positions

Definition at line 1443 of file eTeam.cpp.

References ePlayerNetID::CurrentTeam(), ePlayerNetID::NextTeam(), players, tASSERT, and ePlayerNetID::teamListID.

Referenced by Shuffle().

{
    tASSERT( player1 );
    tASSERT( player2 );

    // swap IDs
    int id3 = player1->teamListID;
    player1->teamListID = player2->teamListID;
    player2->teamListID = id3;

    // adjust pointers from teams
    eTeam * team2 = player1->CurrentTeam();
    eTeam * team1 = player2->CurrentTeam();

    if ( team2 )
        team2->players[player2->teamListID] = player2;
    if ( team1 )
        team1->players[player1->teamListID] = player1;

    // swap teams
    player1->currentTeam = team1;
    player2->currentTeam = team2;

    // swap next teams (if current teams differ)
    team1 = player2->NextTeam();
    team2 = player1->NextTeam();
    if ( player1->currentTeam != player2->currentTeam )
    {
        player1->nextTeam = team1;
        player2->nextTeam = team2;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void eTeam::Shuffle	(	int	startID,
		int	stopID
	)

shuffles the player at team postion startID to stopID

Parameters:

	startID	player ID to move around
	stopID	player ID to move it to

Definition at line 1487 of file eTeam.cpp.

References GrowingArrayBase::Len(), players, sn_ConsoleOut(), SwapPlayers(), and tASSERT.

Referenced by se_ChatShuffle().

{
    tASSERT( 0 <= startID && startID < players.Len() );
    tASSERT( 0 <= stopID && stopID < players.Len() );

    if ( startID == stopID )
        return;

    tOutput message( "$team_shuffle", players[startID]->GetName(), startID+1, stopID+1 );
    sn_ConsoleOut( message );

    // simply swap the one player over all the players in between.
    while ( startID < stopID )
    {
        SwapPlayers( players[startID], players[startID+1] );
        startID++;
    }
    while ( startID > stopID )
    {
        SwapPlayers( players[startID], players[startID-1] );
        startID--;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

virtual bool eTeam::BalanceThisTeam

(

)

const [inline, virtual]

Reimplemented in gAITeam.

Definition at line 109 of file eTeam.h.

Referenced by gAITeam::BalanceWithAIs(), Enforce(), and PlayerMayJoin().

                                         {
        return true;    // care about this team when balancing teams
    }

Here is the caller graph for this function:

virtual bool eTeam::IsHuman

(

)

const [inline, virtual]

Reimplemented in gAITeam.

Definition at line 112 of file eTeam.h.

Referenced by AddPlayer(), ePlayerNetID::FindDefaultTeam(), and init_game_objects().

                                 {
        return true;    // does this team consist of humans?
    }

Here is the caller graph for this function:

int eTeam::TeamID

(

void

)

const [inline]

Definition at line 116 of file eTeam.h.

References listID.

Referenced by sg_DeclareWinner().

                                                                        {
        return listID;
    }

Here is the caller graph for this function:

int eTeam::Score

(

)

const [inline]

Definition at line 120 of file eTeam.h.

References score.

Referenced by cCockpit::cb_CurrentScoreTeam().

                                                                                {
        return score;
    }

Here is the caller graph for this function:

void eTeam::AddScore

(

int

s

)

Definition at line 396 of file eTeam.cpp.

References nSERVER, nNetObject::RequestSync(), score, and sn_GetNetState().

{
    score += s;

    if ( nSERVER == sn_GetNetState() )
        RequestSync();
}

Here is the call graph for this function:

void eTeam::ResetScore

(

)

Definition at line 404 of file eTeam.cpp.

References nSERVER, nNetObject::RequestSync(), score, and sn_GetNetState().

{
    score = 0;

    if ( nSERVER == sn_GetNetState() )
        RequestSync();
}

Here is the call graph for this function:

void eTeam::SetScore

(

int

s

)

Definition at line 412 of file eTeam.cpp.

References nSERVER, nNetObject::RequestSync(), score, and sn_GetNetState().

{
    score = s;

    if ( nSERVER == sn_GetNetState() )
        RequestSync();
}

Here is the call graph for this function:

void eTeam::AddScore	(	int	points,
		const tOutput &	reasonwin,
		const tOutput &	reasonlose
	)

Definition at line 420 of file eTeam.cpp.

References tOutput::Append(), tOutput::IsEmpty(), GrowingArrayBase::Len(), maxPlayersLocal, name, players, nNetObject::RequestSync(), score, se_SaveToScoreFile(), tOutput::SetTemplateParameter(), and sn_ConsoleOut().

{
    if (points==0)
        return;

    // delegate to player if this is a one-player team
    if ( players.Len() == 1 && maxPlayersLocal == 1 )
    {
        players[0]->AddScore( points, reasonwin, reasonlose );
        return;
    }

    score += points;

    tOutput message;
    message.SetTemplateParameter(1, tColoredString::RemoveColors(name));
    message.SetTemplateParameter(2, points > 0 ? points : -points);

    if (points>0)
    {
        if (reasonwin.IsEmpty())
            message << "$player_win_default";
        else
            message.Append(reasonwin);
    }
    else
    {
        if (reasonlose.IsEmpty())
            message << "$player_lose_default";
        else
            message.Append(reasonlose);
    }

    sn_ConsoleOut(message);
    RequestSync(true);

    se_SaveToScoreFile(message);
}

Here is the call graph for this function:

int eTeam::NumPlayers

(

)

const [inline]

Definition at line 132 of file eTeam.h.

References GrowingArrayBase::Len(), and players.

Referenced by gGame::Analysis(), gAITeam::BalanceWithAIs(), Enforce(), init_game_objects(), PrepareTeamText(), Ranking(), RankingGraph(), se_ChatShuffle(), se_ChatTeam(), se_ChatTeamLeave(), se_ListTeam(), se_ListTeams(), and ePlayerNetID::SetTeamWish().

                                                                                {
        return players.Len();    // total number of players
    }

Here is the call graph for this function:

Here is the caller graph for this function:

ePlayerNetID* eTeam::Player

(

int

i

)

const [inline]

Definition at line 135 of file eTeam.h.

References players.

Referenced by gGame::Analysis(), gAITeam::BalanceWithAIs(), init_game_objects(), se_ChatTeam(), and se_ListTeam().

                                                                {
        return players(i);         // player of index i
    }

Here is the caller graph for this function:

std::vector< ePlayerNetID * > eTeam::GetAllMembers

(

)

const [inline]

Definition at line 139 of file eTeam.h.

References GrowingArrayBase::Len(), and players.

Referenced by zSelectorAnotherNotTeammateDead::select(), zSelectorAnotherTeammateDead::select(), zSelectorOwnerTeamTeammate::select(), zSelectorOwnerTeam::select(), zSelectorTeam::select(), and zSelectorTeammate::select().

                                                               {
        std::vector <ePlayerNetID *> tmp;
        for (int i=0; i<players.Len(); i++) {
            tmp.push_back( players(i) );
        }
        return tmp;
    }

Here is the call graph for this function:

Here is the caller graph for this function:

int eTeam::NumHumanPlayers

(

)

const

Definition at line 600 of file eTeam.cpp.

References numHumans.

Referenced by gGame::Analysis(), gAITeam::BalanceWithAIs(), Enforce(), gMenuItemPlayer::Enter(), ePlayerNetID::FindDefaultTeam(), and PlayerMayJoin().

{
    return numHumans;
}

Here is the caller graph for this function:

int eTeam::NumAIPlayers

(

)

const

Definition at line 608 of file eTeam.cpp.

References numAIs.

Referenced by gGame::Analysis(), and gAITeam::BalanceWithAIs().

{
    return numAIs;
}

Here is the caller graph for this function:

int eTeam::AlivePlayers

(

)

const

Definition at line 1232 of file eTeam.cpp.

References eGameObject::Alive(), GrowingArrayBase::Len(), ePlayerNetID::Object(), and players.

Referenced by Ranking(), and RankingGraph().

{
    int ret = 0;
    for (int i= players.Len()-1; i>=0; --i)
    {
        ePlayerNetID* p = players(i);
        if ( p->Object() && p->Object()->Alive() )
        {
            ret++;
        }
    }

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ePlayerNetID * eTeam::OldestPlayer

(

)

const

Definition at line 1115 of file eTeam.cpp.

References GrowingArrayBase::Len(), NULL, players, se_centerPlayerIsBoss, and ePlayerNetID::timeJoinedTeam.

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len(); i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if (!ret || ret->timeJoinedTeam > p->timeJoinedTeam || se_centerPlayerIsBoss )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

ePlayerNetID * eTeam::OldestHumanPlayer

(

)

const

Definition at line 1132 of file eTeam.cpp.

References ePlayerNetID::IsHuman(), GrowingArrayBase::Len(), NULL, players, se_centerPlayerIsBoss, and ePlayerNetID::timeJoinedTeam.

Referenced by UpdateAppearance(), and ePlayerNetID::WaitToLeaveChat().

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len()-1; i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if ( p->IsHuman() && ( !ret || ret->timeJoinedTeam > p->timeJoinedTeam || se_centerPlayerIsBoss ) )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ePlayerNetID * eTeam::OldestAIPlayer

(

)

const

Definition at line 1149 of file eTeam.cpp.

References ePlayerNetID::IsHuman(), GrowingArrayBase::Len(), NULL, players, se_centerPlayerIsBoss, and ePlayerNetID::timeJoinedTeam.

Referenced by UpdateAppearance().

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len()-1; i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if ( ( !p->IsHuman() ) && ( !ret || ret->timeJoinedTeam > p->timeJoinedTeam || se_centerPlayerIsBoss ) )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ePlayerNetID * eTeam::YoungestPlayer

(

)

const

Definition at line 1166 of file eTeam.cpp.

References GrowingArrayBase::Len(), NULL, players, and ePlayerNetID::timeJoinedTeam.

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len(); i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if (!ret || ret->timeJoinedTeam < p->timeJoinedTeam )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

ePlayerNetID * eTeam::YoungestHumanPlayer

(

)

const

Definition at line 1183 of file eTeam.cpp.

References ePlayerNetID::IsHuman(), GrowingArrayBase::Len(), NULL, players, and ePlayerNetID::timeJoinedTeam.

Referenced by Enforce().

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len()-1; i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if ( p->IsHuman() && ( !ret || ret->timeJoinedTeam < p->timeJoinedTeam ) )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ePlayerNetID * eTeam::YoungestAIPlayer

(

)

const

Definition at line 1200 of file eTeam.cpp.

References ePlayerNetID::IsHuman(), GrowingArrayBase::Len(), NULL, players, and ePlayerNetID::timeJoinedTeam.

{
    ePlayerNetID* ret = NULL;

    for (int i= players.Len()-1; i>=0; i--)
    {
        ePlayerNetID* p = players(i);
        if ( ( !p->IsHuman() ) && ( !ret || ret->timeJoinedTeam < p->timeJoinedTeam ) )
        {
            ret = p;
        }
    }

    return ret;
}

Here is the call graph for this function:

bool eTeam::Alive

(

)

const

Definition at line 1217 of file eTeam.cpp.

References eGameObject::Alive(), GrowingArrayBase::Len(), ePlayerNetID::Object(), and players.

Referenced by gGame::Analysis(), and gBaseZoneHack::OnConquest().

{
    for (int i= players.Len()-1; i>=0; --i)
    {
        ePlayerNetID* p = players(i);
        if ( p->Object() && p->Object()->Alive() )
        {
            return true;
        }
    }

    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

unsigned short eTeam::R

(

)

const [inline]

Definition at line 160 of file eTeam.h.

References r.

Referenced by ColorString(), se_BuildChatString(), se_ListTeam(), and se_SendTeamMessage().

                                      {
        return r;
    }

Here is the caller graph for this function:

unsigned short eTeam::G

(

)

const [inline]

Definition at line 163 of file eTeam.h.

References g.

Referenced by ColorString(), se_BuildChatString(), se_ListTeam(), and se_SendTeamMessage().

                                      {
        return g;
    }

Here is the caller graph for this function:

unsigned short eTeam::B

(

)

const [inline]

Definition at line 166 of file eTeam.h.

References b.

Referenced by ColorString(), se_BuildChatString(), se_ListTeam(), and se_SendTeamMessage().

                                      {
        return b;
    }

Here is the caller graph for this function:

const tString& eTeam::Name

(

)

const [inline]

Definition at line 169 of file eTeam.h.

References name.

Referenced by AddPlayer(), Invite(), PrepareTeamText(), Ranking(), RankingGraph(), RemovePlayer(), se_BuildChatString(), se_ChatTeamLeave(), se_ListTeam(), se_SendTeamMessage(), SetLocked(), ePlayerNetID::SetTeam(), ePlayerNetID::SetTeamForce(), ePlayerNetID::SetTeamWish(), UnInvite(), and ePlayerNetID::Update().

                                      {
        return name;
    }

Here is the caller graph for this function:

void eTeam::PrintName

(

tString &

s

)

const [virtual]

Reimplemented from nNetObject.

Definition at line 1249 of file eTeam.cpp.

References name.

{
    s << "Team " << name;
}

bool eTeam::ClearToTransmit

(

int

user

)

const [virtual]

Reimplemented from nNetObject.

Definition at line 1258 of file eTeam.cpp.

{
    return true;
}

void eTeam::WriteSync

(

nMessage &

m

)

[virtual]

Reimplemented from nNetObject.

Definition at line 1267 of file eTeam.cpp.

References b, g, maxImbalanceLocal, maxPlayersLocal, name, r, and score.

{
    m << r;
    m << g;
    m << b;
    m << name;
    m << maxPlayersLocal;
    m << maxImbalanceLocal;
    m << score;
}

void eTeam::ReadSync

(

nMessage &

m

)

[virtual]

Reimplemented from nNetObject.

Definition at line 1280 of file eTeam.cpp.

References b, g, GrowingArrayBase::Len(), maxImbalanceLocal, maxPlayersLocal, name, nSERVER, players, r, score, and sn_GetNetState().

{
    m >> r;
    m >> g;
    m >> b;
    m >> name;
    m >> maxPlayersLocal;
    m >> maxImbalanceLocal;
    m >> score;

    // update colored player names
    if ( sn_GetNetState() != nSERVER )
    {
        for ( int i = players.Len()-1; i>=0; --i )
        {
            players(i)->UpdateName();
        }
    }
}

Here is the call graph for this function:

bool eTeam::SyncIsNew

(

nMessage &

m

)

[virtual]

Reimplemented from nNetObject.

Definition at line 1302 of file eTeam.cpp.

{
    return true;
}

nDescriptor & eTeam::CreatorDescriptor

(

void

)

const [virtual]

Implements nNetObject.

Reimplemented in gAITeam.

Definition at line 101 of file eTeam.cpp.

References eTeam_init.

                                           {
    return eTeam_init;
}

void eTeam::WriteCreate

(

nMessage &

m

)

[virtual]

Reimplemented from nNetObject.

Definition at line 1312 of file eTeam.cpp.

References nNetObject::WriteCreate().

{
    nNetObject::WriteCreate(m);
}

Here is the call graph for this function:

void eTeam::ReceiveControlNet

(

nMessage &

m

)

[virtual]

Reimplemented from nNetObject.

Definition at line 1321 of file eTeam.cpp.

{
}

virtual bool eTeam::AcceptClientSync

(

)

const [inline, virtual]

Reimplemented from nNetObject.

Definition at line 195 of file eTeam.h.

                                                {
        return false;
    }

void eTeam::RemovePlayerDirty

(

ePlayerNetID *

player

)

[private]

Definition at line 943 of file eTeam.cpp.

References tList< T, MALLOC, REFERENCE >::Add(), colorID, GrowingArrayBase::Len(), listID, NULL, players, tList< T, MALLOC, REFERENCE >::Remove(), tASSERT, ePlayerNetID::teamListID, and teams.

Referenced by RemovePlayer().

{
    tASSERT( player );
    tASSERT( player->currentTeam == this );

    // remove player without shuffling the list
    for ( int i = players.Len()-2; i >= player->teamListID; --i )
    {
        ePlayerNetID * shuffle = players(i);
        players.Remove( shuffle, shuffle->teamListID );
        players.Add   ( shuffle, shuffle->teamListID );
    }
    tASSERT ( player->teamListID == players.Len()-1 );

    // now player has been shuffled to the back of the list without disturbing
    // the order of the other players and can be removed
    players.Remove ( player, player->teamListID );
    player->currentTeam = NULL;

    // remove team from list
    if ( listID >= 0 && players.Len() == 0 )
    {
        teams.Remove( this, listID );

        // don't forget the colored team list
        if ( colorID >= 0 )
        {
            se_ColoredTeams[ colorID ] = 0;
            colorID = -1;
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

Member Data Documentation

int eTeam::colorID [protected]

Definition at line 42 of file eTeam.h.

Referenced by AddPlayer(), NameTeamAfterColor(), RemovePlayer(), RemovePlayerDirty(), UpdateAppearance(), and ~eTeam().

int eTeam::listID [protected]

Definition at line 43 of file eTeam.h.

Referenced by AddPlayer(), AddPlayerDirty(), Enforce(), RemovePlayerDirty(), SwapTeamsNo(), TeamID(), and ~eTeam().

int eTeam::score [protected]

Definition at line 44 of file eTeam.h.

Referenced by AddScore(), eTeam(), Ranking(), RankingGraph(), ReadSync(), ResetScore(), Score(), SetScore(), and WriteSync().

int eTeam::numHumans [protected]

Definition at line 46 of file eTeam.h.

Referenced by NumHumanPlayers(), PlayerMayJoin(), and UpdateProperties().

int eTeam::numAIs [protected]

Definition at line 47 of file eTeam.h.

Referenced by NumAIPlayers(), and UpdateProperties().

tList<ePlayerNetID> eTeam::players [protected]

Definition at line 49 of file eTeam.h.

Referenced by AddPlayer(), AddPlayerDirty(), AddScore(), Alive(), AlivePlayers(), Enemies(), GetAllMembers(), NumPlayers(), OldestAIPlayer(), OldestHumanPlayer(), OldestPlayer(), Player(), PlayerMayJoin(), ReadSync(), RemovePlayer(), RemovePlayerDirty(), Shuffle(), SwapPlayers(), UpdateAppearance(), UpdateProperties(), YoungestAIPlayer(), YoungestHumanPlayer(), and YoungestPlayer().

int eTeam::maxPlayersLocal [protected]

Definition at line 51 of file eTeam.h.

Referenced by AddScore(), eTeam(), PlayerMayJoin(), ReadSync(), UpdateProperties(), and WriteSync().

int eTeam::maxImbalanceLocal [protected]

Definition at line 52 of file eTeam.h.

Referenced by Enforce(), eTeam(), PlayerMayJoin(), ReadSync(), UpdateProperties(), and WriteSync().

unsigned short eTeam::r [protected]

Definition at line 54 of file eTeam.h.

Referenced by eTeam(), R(), ReadSync(), UpdateAppearance(), and WriteSync().

unsigned short eTeam::g [protected]

Definition at line 54 of file eTeam.h.

Referenced by eTeam(), G(), ReadSync(), UpdateAppearance(), and WriteSync().

unsigned short eTeam::b [protected]

Definition at line 54 of file eTeam.h.

Referenced by B(), eTeam(), ReadSync(), UpdateAppearance(), and WriteSync().

tString eTeam::name [protected]

Definition at line 55 of file eTeam.h.

Referenced by AddScore(), Name(), PrintName(), Ranking(), RankingGraph(), ReadSync(), UpdateAppearance(), and WriteSync().

bool eTeam::locked_ [protected]

if set, only invited players may join

Definition at line 57 of file eTeam.h.

Referenced by eTeam(), IsLocked(), and SetLocked().

int eTeam::minTeams = 0 [static]

Definition at line 62 of file eTeam.h.

Referenced by gAITeam::BalanceWithAIs(), EnforceConstraints(), ePlayerNetID::FindDefaultTeam(), PlayerMayJoin(), and sg_copySettings().

int eTeam::maxTeams = 30 [static]

Definition at line 63 of file eTeam.h.

Referenced by EnforceConstraints(), NewTeamAllowed(), sg_copySettings(), and UpdateStaticFlags().

int eTeam::maxPlayers = 3 [static]

Definition at line 64 of file eTeam.h.

Referenced by Enforce(), eTeam(), PlayerMayJoin(), sg_copySettings(), ePlayerNetID::Update(), and UpdateProperties().

int eTeam::minPlayers = 0 [static]

Definition at line 65 of file eTeam.h.

Referenced by gAITeam::BalanceWithAIs(), Enforce(), and sg_copySettings().

int eTeam::maxImbalance = 2 [static]

Definition at line 66 of file eTeam.h.

Referenced by EnforceConstraints(), eTeam(), sg_copySettings(), and UpdateProperties().

bool eTeam::balanceWithAIs = true [static]

Definition at line 67 of file eTeam.h.

Referenced by sg_copySettings().

bool eTeam::enforceRulesOnQuit = false [static]

Definition at line 68 of file eTeam.h.

Referenced by RemovePlayer(), and sg_copySettings().

tList< eTeam > eTeam::teams [static]

Definition at line 70 of file eTeam.h.

Referenced by AddPlayer(), AddPlayerDirty(), gGame::Analysis(), gAITeam::BalanceWithAIs(), Enforce(), gMenuItemPlayer::Enter(), ePlayerNetID::FindDefaultTeam(), init_game_objects(), NewTeamAllowed(), PlayerMayJoin(), Ranking(), RankingGraph(), RemovePlayerDirty(), se_ListTeams(), sg_EnemyExists(), SortByScore(), SwapTeamsNo(), gBaseZoneHack::Timestep(), ePlayerNetID::Update(), update_settings(), UpdateStaticFlags(), and ~eTeam().

---

The documentation for this class was generated from the following files:

• src/engine/eTeam.h
• src/engine/eTeam.cpp

---