Files
itgmania212121/src/SubscriptionManager.h
T

77 lines
2.7 KiB
C++
Raw Normal View History

2011-03-17 01:47:30 -04:00
/* SubscriptionManager - Object that accepts subscriptions. */
#ifndef SubscriptionManager_H
#define SubscriptionManager_H
#include <set>
2013-04-27 00:05:14 -04:00
// Since this class has only POD types and no constructor, there's no
// initialize order problem.
2011-03-17 01:47:30 -04:00
template<class T>
class SubscriptionManager
{
public:
2013-04-27 00:05:14 -04:00
// TRICKY: If we make this a global instead of a global pointer,
// then we'd have to be careful that the static constructors of all
// subscribers are called before the collection constructor. It's
// impossible to enfore that in C++. Instead, we'll allocate the
// collection ourself on first use. SubscriptionHandler itself is
// a POD type, so a static SubscriptionHandler will always have
2013-05-03 23:11:42 -04:00
// m_pSubscribers == nullptr (before any static constructors are called).
2013-04-27 00:05:14 -04:00
set<T*>* m_pSubscribers;
// Use this to access m_pSubscribers, so you don't have to worry about
2019-06-22 12:35:38 -07:00
// it being nullptr.
2013-04-27 00:05:14 -04:00
set<T*> &Get()
{
2013-05-03 23:11:42 -04:00
if( m_pSubscribers == nullptr )
2013-04-27 00:05:14 -04:00
m_pSubscribers = new set<T*>;
return *m_pSubscribers;
}
2011-03-17 01:47:30 -04:00
void Subscribe( T* p )
{
2013-05-03 23:11:42 -04:00
if( m_pSubscribers == nullptr )
2013-04-27 00:05:14 -04:00
m_pSubscribers = new set<T*>;
2011-03-17 01:47:30 -04:00
#ifdef DEBUG
2013-04-27 00:05:14 -04:00
typename set<T*>::iterator iter = m_pSubscribers->find( p );
ASSERT_M( iter == m_pSubscribers->end(), "already subscribed" );
2011-03-17 01:47:30 -04:00
#endif
2013-04-27 00:05:14 -04:00
m_pSubscribers->insert( p );
2011-03-17 01:47:30 -04:00
}
void Unsubscribe( T* p )
{
2013-04-27 00:05:14 -04:00
typename set<T*>::iterator iter = m_pSubscribers->find( p );
ASSERT( iter != m_pSubscribers->end() );
m_pSubscribers->erase( iter );
2011-03-17 01:47:30 -04:00
}
};
#endif
/*
* (c) 2004-2005 Chris Danford
* All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, and/or sell copies of the Software, and to permit persons to
* whom the Software is furnished to do so, provided that the above
* copyright notice(s) and this permission notice appear in all copies of
* the Software and that both the above copyright notice(s) and this
* permission notice appear in supporting documentation.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/