/*
* Copyright (C) 2008-2013 TrinityCore
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see .
*/
#ifndef TRINITY_CONTAINERS_H
#define TRINITY_CONTAINERS_H
#include "Define.h"
#include
//! Because circular includes are bad
extern uint32 urand(uint32 min, uint32 max);
namespace Trinity
{
namespace Containers
{
template
void RandomResizeList(std::list &list, uint32 size)
{
size_t list_size = list.size();
while (list_size > size)
{
typename std::list::iterator itr = list.begin();
std::advance(itr, urand(0, list_size - 1));
list.erase(itr);
--list_size;
}
}
template
void RandomResizeList(std::list &list, Predicate& predicate, uint32 size)
{
//! First use predicate filter
std::list listCopy;
for (typename std::list::iterator itr = list.begin(); itr != list.end(); ++itr)
if (predicate(*itr))
listCopy.push_back(*itr);
if (size)
RandomResizeList(listCopy, size);
list = listCopy;
}
/* Select a random element from a container. Note: make sure you explicitly empty check the container */
template typename C::value_type const& SelectRandomContainerElement(C const& container)
{
typename C::const_iterator it = container.begin();
std::advance(it, urand(0, container.size() - 1));
return *it;
}
}
//! namespace Containers
}
//! namespace Trinity
#endif //! #ifdef TRINITY_CONTAINERS_H