Containers.h

Go to the documentation of this file.

/*
* This file is part of Project SkyFire https://www.projectskyfire.org.
* See LICENSE.md file for Copyright information
*/
 
#ifndef SKYFIRE_CONTAINERS_H
#define SKYFIRE_CONTAINERS_H
 
#include "Define.h"
 
#include <cstdlib>
#include <list>
 
namespace Skyfire
{
    namespace Containers
    {
        template<class T>
        void RandomResizeList(std::list<T>& list, uint32 size)
        {
            size_t list_size = list.size();
 
            while (list_size > size)
            {
                typename std::list<T>::iterator itr = list.begin();
                std::advance(itr, std::rand() % list_size);
                list.erase(itr);
                --list_size;
            }
        }
 
        template<class T, class Predicate>
        void RandomResizeList(std::list<T>& list, Predicate& predicate, uint32 size)
        {
            std::list<T> listCopy;
            for (typename std::list<T>::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 <class C> typename C::value_type const& SelectRandomContainerElement(C const& container)
        {
            typename C::const_iterator it = container.begin();
            std::advance(it, std::rand() % container.size());
            return *it;
        }
 
        template<class Iterator1, class Iterator2>
        bool Intersects(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2)
        {
            while (first1 != last1 && first2 != last2)
            {
                if (*first1 < *first2)
                    ++first1;
                else if (*first2 < *first1)
                    ++first2;
                else
                    return true;
            }
 
            return false;
        }
    }

}
 
#endif