# Adds a map to the specified rotation group. If the group does not exist, it will be automatically created.
add_maprotation s[group] r[map]
# Activates the specified map rotation group. If the group does not exist, an error message is returned.
active_maprotation_group s[group]
Remove this:
sv_maprotation
Implementation Notes:
A hash table is required in the base system to efficiently manage map rotatio...auto &pRequest = *apNewRequests.begin();
auto &pRequest = *apNewRequests.begin();
std::deque<std::shared_ptr<CHttpRequest>> m_PendingRequests
which clearly describes what it is and handles the memory management for you.std::vector<CSomeListItem>
is definitely better than writing the same abstraction yourself. array<CHttpRequest *> apNewRequests;
apNewRequests.clear();
m_pLock->take();
apNewRequests = std::move(m_PendingRequests);
m_PendingRequests.clear();
m_pLock->release();
// Process pending requests
while(apNewRequests.size() > 0)
{
auto &pRequest = *apNewRequests.begin();
m_pLock->release();
array<CHttpRequest *> apNewRequests;
apNewRequests.clear();
m_pLock->take();
apNewRequests = std::move(m_PendingRequests);
m_PendingRequests.clear();
m_pLock->release();
// Process pending requests
while(apNewRequests.size() > 0)
{
auto &pRequest = *apNewRequests.begin();
m_pLock->release();
std::vector
or std::deque
here. I think Teeworlds array
type is the same thing but worse, so it should be phased out. (edited) array<CHttpRequest *> apNewRequests;
apNewRequests.clear();
m_pLock->take();
apNewRequests = std::move(m_PendingRequests);
m_PendingRequests.clear();
m_pLock->release();
// Process pending requests
while(apNewRequests.size() > 0)
{
auto &pRequest = *apNewRequests.begin();
m_pLock->release();
auto
can be avoided if that's not Teeworlds style. Sending code as text is better anyway std::move
correctly, or the m_PendingRequests.clear()
should be unnecessary