SummonList Class Reference

#include <ScriptedCreature.h>

Public Types
typedef GuidList	StorageType
typedef StorageType::iterator	iterator
typedef StorageType::const_iterator	const_iterator
typedef StorageType::size_type	size_type
typedef StorageType::value_type	value_type

Public Member Functions
	SummonList (Creature *creature)
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
iterator	erase (iterator i)
bool	empty () const
size_type	size () const
void	Summon (Creature const *summon)
void	Despawn (Creature const *summon)
void	DespawnEntry (uint32 entry)
void	DespawnAll ()
template<typename T >
void	DespawnIf (T const &predicate)
template<class Predicate >
void	DoAction (int32 info, Predicate &predicate, uint16 max=0)
void	DoZoneInCombat (uint32 entry=0)
void	RemoveNotExisting ()
bool	HasEntry (uint32 entry) const

Private Attributes
Creature *	me
StorageType	storage_

Member Typedef Documentation

typedef StorageType::const_iterator SummonList::const_iterator

typedef StorageType::iterator SummonList::iterator

typedef StorageType::size_type SummonList::size_type

typedef GuidList SummonList::StorageType

typedef StorageType::value_type SummonList::value_type

Constructor & Destructor Documentation

SummonList::SummonList ( Creature *  creature )

inlineexplicit

 : me(creature)
 { }

Member Function Documentation

iterator SummonList::begin ( )

inline

 {
 return storage_.begin();
 }

Here is the caller graph for this function:

const_iterator SummonList::begin ( ) const

inline

 {
 return storage_.begin();
 }

void SummonList::Despawn ( Creature const *  summon )

inline

{ storage_.remove(summon->GetGUID()); }

Here is the call graph for this function:

Here is the caller graph for this function:

void SummonList::DespawnAll

(

)

{
 while (!storage_.empty())
 {
 Creature* summon = ObjectAccessor::GetCreature(*me, storage_.front());
 storage_.pop_front();
 if (summon)
 summon->DespawnOrUnsummon();
 }
}

Here is the call graph for this function:

void SummonList::DespawnEntry

(

uint32

entry

)

{
 for (StorageType::iterator i = storage_.begin(); i != storage_.end();)
 {
 Creature* summon = ObjectAccessor::GetCreature(*me, *i);
 if (!summon)
 i = storage_.erase(i);
 else if (summon->GetEntry() == entry)
 {
 i = storage_.erase(i);
 summon->DespawnOrUnsummon();
 }
 else
 ++i;
 }
}

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename T >

void SummonList::DespawnIf ( T const &  predicate )

inline

 {
 storage_.remove_if(predicate);
 }

Here is the caller graph for this function:

template<class Predicate >

void SummonList::DoAction ( int32  info, Predicate &  predicate, uint16  max = 0  )

inline

 {
 // We need to use a copy of SummonList here, otherwise original SummonList would be modified
 StorageType listCopy = storage_;
 Trinity::Containers::RandomResizeList<ObjectGuid, Predicate>(listCopy, predicate, max);
 for (StorageType::iterator i = listCopy.begin(); i != listCopy.end(); )
 {
 Creature* summon = ObjectAccessor::GetCreature(*me, *i++);
 if (summon && summon->IsAIEnabled)
 summon->AI()->DoAction(info);
 }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void SummonList::DoZoneInCombat

(

uint32

entry = 0

)

{
 for (StorageType::iterator i = storage_.begin(); i != storage_.end();)
 {
 Creature* summon = ObjectAccessor::GetCreature(*me, *i);
 ++i;
 if (summon && summon->IsAIEnabled
 && (!entry || summon->GetEntry() == entry))
 {
 summon->AI()->DoZoneInCombat();
 }
 }
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool SummonList::empty ( ) const

inline

 {
 return storage_.empty();
 }

Here is the caller graph for this function:

iterator SummonList::end ( )

inline

 {
 return storage_.end();
 }

Here is the caller graph for this function:

const_iterator SummonList::end ( ) const

inline

 {
 return storage_.end();
 }

iterator SummonList::erase ( iterator  i )

inline

 {
 return storage_.erase(i);
 }

Here is the caller graph for this function:

bool SummonList::HasEntry

(

uint32

entry

)

const

{
 for (StorageType::const_iterator i = storage_.begin(); i != storage_.end(); ++i)
 {
 Creature* summon = ObjectAccessor::GetCreature(*me, *i);
 if (summon && summon->GetEntry() == entry)
 return true;
 }

 return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void SummonList::RemoveNotExisting

(

)

{
 for (StorageType::iterator i = storage_.begin(); i != storage_.end();)
 {
 if (ObjectAccessor::GetCreature(*me, *i))
 ++i;
 else
 i = storage_.erase(i);
 }
}

Here is the call graph for this function:

size_type SummonList::size ( ) const

inline

 {
 return storage_.size();
 }

Here is the caller graph for this function:

void SummonList::Summon ( Creature const *  summon )

inline

{ storage_.push_back(summon->GetGUID()); }

Here is the call graph for this function:

Member Data Documentation

Creature* SummonList::me

private

StorageType SummonList::storage_

private

---

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

• src/server/game/AI/ScriptedAI/ScriptedCreature.h
• src/server/game/AI/ScriptedAI/ScriptedCreature.cpp