本文整理匯總了C#中Server.Factions.Faction.UpdateRanks方法的典型用法代碼示例。如果您正苦於以下問題:C# Faction.UpdateRanks方法的具體用法?C# Faction.UpdateRanks怎麽用?C# Faction.UpdateRanks使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類Server.Factions.Faction
的用法示例。
在下文中一共展示了Faction.UpdateRanks方法的1個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的C#代碼示例。
示例1: FactionState
public FactionState( GenericReader reader )
{
int version = reader.ReadEncodedInt();
switch ( version )
{
case 4:
{
int count = reader.ReadEncodedInt();
for ( int i = 0; i < count; ++i )
{
DateTime time = reader.ReadDateTime();
if ( i < m_LastBroadcasts.Length )
m_LastBroadcasts[i] = time;
}
goto case 3;
}
case 3:
case 2:
case 1:
{
m_Election = new Election( reader );
goto case 0;
}
case 0:
{
m_Faction = Faction.ReadReference( reader );
m_Commander = reader.ReadMobile();
if ( version < 4 )
{
DateTime time = reader.ReadDateTime();
if ( m_LastBroadcasts.Length > 0 )
m_LastBroadcasts[0] = time;
}
m_Tithe = reader.ReadEncodedInt();
m_Silver = reader.ReadEncodedInt();
int memberCount = reader.ReadEncodedInt();
m_Members = new PlayerStateCollection();
for ( int i = 0; i < memberCount; ++i )
{
PlayerState pl = new PlayerState( reader, m_Faction, m_Members );
if ( pl.Mobile != null )
m_Members.Add( pl );
}
m_Faction.State = this;
m_Faction.UpdateRanks();
m_FactionItems = new FactionItemCollection();
if ( version >= 2 )
{
int factionItemCount = reader.ReadEncodedInt();
for ( int i = 0; i < factionItemCount; ++i )
{
FactionItem factionItem = new FactionItem( reader, m_Faction );
if ( !factionItem.HasExpired )
factionItem.Attach();
else
Timer.DelayCall( TimeSpan.Zero, new TimerCallback( factionItem.Detach ) ); // sandbox detachment
}
}
m_FactionTraps = new FactionTrapCollection();
if ( version >= 3 )
{
int factionTrapCount = reader.ReadEncodedInt();
for ( int i = 0; i < factionTrapCount; ++i )
{
BaseFactionTrap trap = reader.ReadItem() as BaseFactionTrap;
if ( trap != null && !trap.CheckDecay() )
m_FactionTraps.Add( trap );
}
}
break;
}
}
if ( version < 1 )
m_Election = new Election( m_Faction );
}